• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.294-301
• /
• 2004

This paper presents a combination of optimization concept and congestion control for multicast communications to bring best benefit for the network. For different types of Internet services, there will be different utility functions and so there will be different ways to choose on how to control the congestion, especially for real time multicast traffic. Our proposed algorithm OMCC brings the first implementation experiment of utility-based Multicast Congestion Control. Simulation results show that OMCC brings better network performances in multicast session throughput while it still keeps a certain fairness of unicast and multicast sessions, and thus, provides better benefit for all network participants.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.19-24
• /
• 2010

The number of automobiles are continuously increasing in Korea since 1990's and it causes frustrating commuting traffic and holyday traffic. Meanwhile, the obsolete traffic signal control system is still under static control based on the aggregated traffic statistics thus it is not sufficiently adaptive in real world traffic situation that changes in real time. Thus, in this paper, we propose an adaptive signal control system using fuzzy control technology that can react to real time traffic situations. The method computes the priority of signal phases based on the number of waiting automobiles and occupying time on intersection using fuzzy membership functions. The phase with highest priority obtains "proceed" signal. Also, the duration of this "proceed" signal is determined based on the ratio of number of waiting automobiles of given phase and total number of waiting automobiles on intersection. In experiment, we show that the proposed fuzzy control system is better than the static control system for all sorts of traffic congestion situations by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1480-1489
• /
• 1996

In ATM networks there are two methods in traffic control as schemes advancing the quality of service. One is reactive control after congestion and the other which is generally recommended, is preventive control before congestion, including connection admission control on call leel and usage parameter control, network parameter control, priority control and congestion control on cell level. In particular, usage parameter control is required for restricting the peak cell rate of bursy tracffic to the parameter negotiated at call set-up phase since the peak cell rate significantly influences the network quality of service. The scheme for progressing quality of service by usage parameter control is themethod using VSA(Virtual Scheduling Algorlithm) recommended ITU-T. The method using VSSA(Virtual Scheduling Suggested Algorlithm) in this paper is suggested by considering cell delay variation and token rate of leaky bucket, compared VSA and VSANT(Virtual Scheduling Algolithm with No Tolerance) with VSSA which polices violated cell probability of conformed peak cell rate and intentionally excessive peak cell rate. VSSA method using IPP(Interruped Poisson Process) model of input traffic source showed more quality of service than VSA and VSANT methods as usage parameter control because the suggested method reduced the violated cell probability of contformed peak cell rate and intentionally excessive peak cell rate.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.179-182
• /
• 1991

In this paper, we survey traffic control issues for the B-ISDN based on the ATM. We first investigate traffic descriptors to represent the characteristics of various ATM traffics in a standardized form. Also, we examine key issues related to the connection admission control, usage parameter control, network parameter control, priority control, and congestion control.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3753-3771
• /
• 2016

Increasingly, numerous and various Internet-capable devices are connected in end user networks, such as a home network. Most devices use the combination of TCP and 802.11 DCF as a system platform, but whereas some devices such as a streaming video persistently generate traffic, others such as a motion sensor do so only intermittently with lots of pauses. This study addresses the issue of performance in this heterogeneous traffic wireless LAN environment from the perspective of fairness. First, instantaneous fairness is introduced as a notion to indicate how immediately and how closely a user obtains its fair share, and a new time-based metric is defined as an index. Second, extensive simulation experiments have been made with TCP Reno, Vegas, and Westwood to determine how each TCP congestion control corresponds to the instantaneous fairness. Overall, TCP Vegas yields the best instantaneous fairness because it keeps the queue length shorter than the other TCPs. In the simulations, about 60% of a fair share of the effective user bandwidth is immediately usable in any circumstance. Finally, we introduce two simple strategies for adjusting TCP congestion controls to enhance instantaneous fairness and validate them through simulation experiments.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.129-132
• /
• 1999

In this Paper, new congention control schemes using the adaptive rate control for ATM LANs are presented. If is preferable for hosts in LANs to be able to send bursts at the same speed as the interface link speed in a lightly loaded condition, and as the network load increases, to reduce their traffic rate adaptively in order to avaid network congestion. We propose to apply such a rate control concept for two different traffic classed in the ATM LANs. For the first traffic class requiring no bandwidth reservation, i.e, a best effort service class, a combination of the end-to-end adaptive peak rate control with the link-by-link backpressure control is proposed. For the second traffic class, requiring the bandwidth reservation for the burst transmission, i.e. guaranteed burst service class, a combination of he adaptive peak rate control with the fast bandwidth reservation is proposed.

• The Journal of the Korea Contents Association
• /
• v.18 no.11
• /
• pp.643-654
• /
• 2018

In order to understand and manage traffic flows in urban areas in the past, a variety of traffic engineering theoretical indicators such as intersection lag and highway speed have been applied. However, these theories and indicators have been developed under the constraints of traffic engineering research before the construction of intelligent transportation system. Since the ATIS system currently exists, it is necessary to introduce a separate traffic engineering technology that utilizes the data. In this paper, it is aimed to confirm whether it is applicable to intermittent flow (approach road, intersection, control group, main road axis) by using 'congestion intensity' which is already used in traffic engineering field. The results of this study are as follows: (1) The traffic signal improvement effect of urban road access road, intersection road, control group, Two verification studies were performed to verify the derived congestion intensity index. (1) verification of congestion intensity threshold value analysis and (2) crossing improvement using the congestion intensity. Through verification, it was confirmed that it is possible to apply the congestion intensity in the inter - city intermittent flow using the 5 - minute unit speed data so as to be able to escape from the existing traffic signal operation management which is past passive and manpower limit.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.405-418
• /
• 2016

Recently, many researchers have studied the VSL decision method using traffic information in multiple detector zones. However, this method selects incorrect VSL starting points, leading to the selection of the wrong speed control zone and calculation of the wrong VSL, causing traffic congestion. Eventually, the Unstable VSL system causes more congestion on the freeway. This paper proposes an improved VSL algorithm stably operated in multiple detector zones on the Korea highway. The proposed algorithm selects a preliminary VSL start station (VSS) expected to end the congestion using the acceleration of stations. It also determines the VSS at each congestion area. Finally, it calculates the VSL relative to the determined VSS and controls the vehicles that enters the traffic congestion zone. The developed strategy is compared with Real-time Variable Speed Limits for Urban Freeway (RVSL) to test the stability and efficiency of the proposed algorithm. The results show that the proposed algorithm resolves the problems of the existing algorithm, demonstrated by the correct VSS decision and the reduction of total travel time by 1-2 minutes.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.31-55
• /
• 2007

Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.675-683
• /
• 1996

CAC, UPC, NPC, cell level QoS and congestion control is required to assign efficiently channels's BW and to prevent networks from congestion. In the CAC algorithm, each user defines characteristics of input traffic when channels are set up and network based on this parameters determines the acception or rejection of the required BW. The CAC control mechanism is classified into the centralized BW allocation mechanism and the distributed BW Allocation mechanism according to the function and position of CAC processor allocating BW. In this paper, in contrast with esisted the distributed BW allocation mechanism which assumes the required BW of input traffic as constant, we assume input traffic & serices as bulk probability distribution in order to analyze performance more precisely.