• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.29-40
• /
• 2004

In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.51-60
• /
• 2003

One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1881-1900
• /
• 2014

Since 802.11 wireless LANs are so widely used, it has become common for numerous access points (APs) to overlap in a region, where most of those APs are managed individually without any coordinated control. This pattern of wireless LAN usage is called the private OBSS (Overlapping Basic Service Set) environment in this paper. Due to frame collisions across BSSs, each BSS in the private OBSS environment suffers severe performance degradation. This study approaches the problem from the perspective of congestion control rather than noise or collision resolution. The retry limit, one of the 802.11 attributes, could be used for traffic control in conjunction with TCP. Reducing the retry limit causes early discard of a frame, and it has a similar effect of random early drops at a router, well known in the research area of congestion control. It makes the shared link less crowded with frames, and then the benefit of fewer collisions surpasses the penalty of less strict error recovery. As a result, the network-wide performance improves and so does the performance of each BSS eventually. Reducing the retry limit also has positive effects of merging TCP ACKs and reducing HOL-like blocking time at the AP. Extensive experiments have validated the idea that in the OBSS environment, reducing the retry limit provides better performance, which is contrary to the common wisdom. Since our strategy is basically to sacrifice error recovery for congestion control, it could yield side-effects in an environment where the cost of error recovery is high. Therefore, to be useful in general network and traffic environments, adaptability is required. To prove the feasibility of the adaptive scheme, a simple method to dynamically adjust the value of the retry limit has been proposed. Experiments have shown that this approach could provide comparable performance in unfriendly environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3002-3010
• /
• 2000

ATM forum defined several ATM oriented services such as ABR, VBR, CBR, UBR, and others. Among them, ABR service is considered as one of the most appropriate ones in the LAN environment. ABR controls network traffic by using RM cells according to ATM forum standard. In particular, the point-to-multipoint ABR service in general uses consolidation algorithms to solve feedback implosion at the branch point. Consolidation algorithms alleviate propagation delay and network congestion problem: thus, the efficiency of consolidation algorithm is closely related to the network performance. In this paper, we describe the limitation of existing consolidation algorithms based on thorough analysis, and then propose an algorithm that performs better than the existing algorithms. We show that the proposed algorithm improves network performance through a parametric simulation, In our simulation the performance measure is the cell rate which is controlled by exploiting the congestion depth. We also found that the proposed algorithm not only improves efficiency of network, but also eliminates the consolidation noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.709-717
• /
• 2007

Pricing a network service aims for congestion control of the network as well as economic efficiency. A monopolistic supplier providing users with a network service on a shared link needs a pricing schedule that maximizes revenue under the link's bandwidth constraint and guarantees the bandwidth purchased by the users. In that case, nonlinear pricing is an efficient scheme which meets both requirements. This study reviews how nonlinear pricing can be applied to the network service under the constraint and shows that the nonlinear pricing may result in a fixed unit price of bandwidth as linear pricing when demand characteristics of the users follow a power law. Also, the way how the provider with incomplete information on the demand distribution seeks for the optimal pricing from the degree of the network congestion is introduced and the relationship between the development direction of the Internet and internet pricing is considered based on the results of the study.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.4
• /
• pp.1-11
• /
• 2014

Traffic congestion cost is more likely to occur in the inner city than interregional road, and it accounts for about 63.39% of the whole. Therefore, it is important to mitigate traffic congestion of the inner city. Traffic congestion in the urban could be divided into Recurrent congestion and Non-recurrent congestion. Quick and accurate detection of Non-recurrent congestion is also important in order to relieve traffic congestion. The existing studies about incident detection have been variously conducted, however it was limited to Uninterrupted Traffic Flow Facilities such as freeway. Moreover study of incident detection on the interrupted Traffic Flow Facilities is still inadequate due to complex geometric structure such as traffic signals and intersections. Therefore, in this study, incident detection model was constructed using by Artificial Neural Network to aim at urban arterial road that is interrupted traffic flow facility. In the result of the reliability assessment, the detection rate were 46.15% and false alarm rate were 25.00%. These results have a meaning as a result of the initial study aimed at interrupted traffic flow. Furthermore, it demonstrates the possibility that Non-recurrent congestion can be detected by using car navigation data such as car navigator system device.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.73-84
• /
• 2002

In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.227-231
• /
• 2010

The TFRC is a congestion control mechanism which supports the requirements of video streaming applications and controls its sending rate by using the information such as loss event rate and RTT (round-trip time). However, TFRC has a performance degradation in wireless networks because it performs congestion control by judging all the losses occurred in wireless network as a congestion signal. In this paper, we propose new loss discrimination mechanism which is using ECN in order to solve the performance degradation of TFRC. Through the results of simulation, we proved that the proposed mechanism can improve the performance of TFRC.

• International Journal of Highway Engineering
• /
• v.17 no.6
• /
• pp.97-104
• /
• 2015

PURPOSES : Expressways experience chronic and recurring congestion, especially during weekends and holidays, because of the increased demands for leisure-related travel. The alternatives to solve chronic and recurring congestion may be three-fold: (1) physical expansion of expressway capacities, (2) road pricing, and (3) temporal and spatial distribution of traffic demands. Among these, the third alternative may be the most cost-effective method for the Korea Expressway Corporation (KEC) that can be achieved by using the existing ITS infrastructure. METHODS : KEC initiated a pilot study in which the traffic on congested expressways was managed by providing traffic condition information (i.e., travel times) of neighboring national highways for taking detours via variable message signs (VMS). This study aimed to estimate the detour rate, and the two pilot studies on Seohaean and Yeongdong expressways yielded many benefits. RESULTS : It was revealed that the total length of congestion segments decreased by 7.8 km, and the average travel speed increased by 5.3 km/h. CONCLUSIONS : Based on these findings, it was concluded that the propagation of detour information via VMSs during congestion hours can help reduce congestion on expressways and increase the benefits of the entire network.