• International Journal of Highway Engineering
• /
• v.16 no.5
• /
• pp.165-171
• /
• 2014

PURPOSES : The objective of this study is to find Percentile Speed($V_p$) for Appraisal of Road Section with Recurring Congestion. METHODS : Percentile Speed($V_p$) is determined by correlation analysis of CSI that proposed existing literature. and CSI(Consistency Service Index) is a index that subtract service fail frequency from 100 points, and service fail is defined as traffic situation is driving less than 80kph speed. In this study, We analyzed the highest correlation percentile speed associated with CSI. This speed is chosen as a delay decision speed. In order to verifying reliability, it performed a comparison with the previous method. RESULTS : As a result, 30 percentile speed($V_{30}$) was decided as index speed for judgement of recurring congestion section, and through comparison with existing methods, we demonstrated that 30 percentile speed can be useful for judgement of recurring congestion section. CONCLUSIONS : This method to Determine recurring congestion section using the percentile speed($V_{30}$) was proposed for the first time in this paper. This method can be applicated more quickly and easily than existing method for determining of recurring delay section.

• Journal of Korean Society of Transportation
• /
• v.28 no.2
• /
• pp.45-52
• /
• 2010

The objective of this paper is to develop and apply a method that estimates the amount of traffic congestion (vehicle hours of delay) caused by traffic accidents that occur on freeways in Korea. A key feature of this research is the development of a method to separate the non- recurrent delay from any recurrent delay that is present on the road at the time and place of a reported accident. The main idea to separate these two delays is to use the speed difference between speed under accident condition and speed under normal flow condition. For the case study application, two datasets were combined to accomplish the objective of the study: (1) accident data and (2) traffic flow data. Eventually, the results can be useful for the performance evaluation of accident reduction program, for strategic plans to cope with congestion caused by traffic accidents, and for rectification of the estimation method for traffic congestion costs.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1225-1233
• /
• 2009

ISPs and Enterprises are equipping their networks with sufficiently high speed facilities and provide large bandwidths members. However the high speed enterprise network does not have satisfying end-to-end network performance within the network in spite of under utilization. The root cause of this performance degradation is a micro-congestion, which is a short-live event of traffic congestion. A micro-congestion causes packet loss, delay and packet reodering, and finally results in end-to-end network performance degradation. In this paper, we propose a micro-congestion detection method and find out the characteristics of performance degradation by analyzing traffic archives which is collected from a network link when a micro-congestion occurs.

• International Journal of Highway Engineering
• /
• v.15 no.5
• /
• pp.227-234
• /
• 2013

PURPOSES : In order to do an improving countermeasures for congestion on the highway with a limited budget, it is very important to select a habitual congestion section effectively. This study is develop CSI(Consitency Service Index) which contained the service for drivers on the highway to select a habitual congestion section. METHODS : By applying the concept of service for the users paying a fee, proposed CSI(Consistency Service Index) to determine habitual delay. CSI is mean that users using the highway road must be provided an environment which can driving more than 80kph, anytime, anywhere. RESULTS : The result applying developed method in this study included most of congestion sections selected by conventional method. but, in some section of existing non-congestion section were included by CSI. The annual average speed and CSI correlation analysis result was high correlation. This result proved that CSI was reflecting road traffic condition well. CONCLUSIONS : It was verified practicality from the delay section of gyeonggi-do area highway. we can judge whether or not to be a habitual congestion in the specific highway and do the traffic improving countermeasures accordingly.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.39-46
• /
• 2004

In this paper, we carry out a performance study related to the Broadband Network. For this network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a performance model in order to study the interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.126-131
• /
• 2000

Through many users employ TCP of which the performance has been proved in Internet, but many papers Proposed to improve TCP performance according to varying network architecture. In Particular, BWDP(bandwidth-delay Product) grew larger because of the increasing delay in satellite link and the network's speed-up. To consider these increased bandwidth-delay product, it is suggested that TCP options include Window Scale option. TimeStamp option, and PAWS. Because TCP window size should be commonly high in the network with these increased bandwidth-delay product, the multiple decrease and linear increase scheme of current TCP would cause underflow and instability within network. Then TCP performance is reduced as a result. Thus, to improve TCP congestion control algorithm in the network which has large sized window, this paper proposes the congestion control scheme that controls window size by using TimeStamp option.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1052-1062
• /
• 2004

Recent studies have pointed out that existing high-speed TCP protocols have a severe unfairness and TCP friendliness problem. As the congestion window achieved by a high-speed TCP connection can be quite large, there is a strong possibility that the sender will transmit a large burst of packets. As such, the current congestion control mechanisms of high-speed TCP can lead to bursty traffic flows in hi인 speed networks, with a negative impact on both TCP friendliness and RTT unfairness. The proposed solution to these problems is to evenly space the data sent into the network over an entire round-trip time. Accordingly, the current paper evaluates this approach with a high bandwidth-delay product network and shows that pacing offers better TCP friendliness and fairness without degrading the bandwidth scalability.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.9-12
• /
• 2000

In this paper, we carry out a performance study related to the Advanced Peer-to-Peer Network(APPN). For this particular network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a Perform ance model in order to study the Interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.