Congestion control for real-time traffic in high-speed networks

Author(s):  
H. Schulzrinne ◽  
J.F. Kurose ◽  
D. Towsley
2003 ◽  
Vol 43 (6) ◽  
pp. 761-775
Author(s):  
Tamer Dağ ◽  
Ioannis Stavrakakis

Author(s):  
Qibin Zhou ◽  
Qingang Su ◽  
Dingyu Yang

Real-time traffic estimation focuses on predicting the travel time of one travel path, which is capable of helping drivers selecting an appropriate or favor path. Statistical analysis or neural network approaches have been explored to predict the travel time on a massive volume of traffic data. These methods need to be updated when the traffic varies frequently, which incurs tremendous overhead. We build a system RealTER⁢e⁢a⁢l⁢T⁢E, implemented on a popular and open source streaming system StormS⁢t⁢o⁢r⁢m to quickly deal with high speed trajectory data. In RealTER⁢e⁢a⁢l⁢T⁢E, we propose a locality-sensitive partition and deployment algorithm for a large road network. A histogram estimation approach is adopted to predict the traffic. This approach is general and able to be incremental updated in parallel. Extensive experiments are conducted on six real road networks and the results illustrate RealTE achieves higher throughput and lower prediction error than existing methods. The runtime of a traffic estimation is less than 11 seconds over a large road network and it takes only 619619 microseconds for model updates.


1995 ◽  
pp. 27-42 ◽  
Author(s):  
Hussein F. Salama ◽  
Douglas S. Reeves ◽  
Yannis Viniotis ◽  
Tsang-Ling Sheu

Author(s):  
Nelson Luís Saldanha da Fonseca ◽  
Neila Fernanda Michel

In response to a series of collapses due to congestion on the Internet in the mid-’80s, congestion control was added to the transmission control protocol (TCP) (Jacobson, 1988), thus allowing individual connections to control the amount of traffic they inject into the network. This control involves regulating the size of the congestion window (cwnd) to impose a limit on the size of the transmission window. In the most deployed TCP variant on the Internet, TCP Reno (Allman, Floyd, & Partridge, 2002), changes in congestion window size are driven by the loss of segments. Congestion window size is increased by 1/cwnd for each acknowledgement (ack) received, and reduced to half for the loss of a segment in a pattern known as additive increase multiplicative decrease (AIMD). Although this congestion control mechanism was derived at a time when the line speed was of the order of 56 kbs, it has performed remarkably well given that the speed, size, load, and connectivity of the Internet have increased by approximately six orders of magnitude in the past 15 years. However, the AIMD pattern of window growth seriously limits efficienct operation of TCP-Reno over high-capacity links, so that the transport layer is the network bottleneck. This text explains the major challenges involved in using TCP for high-speed networks and briefly describes some of the variations of TCP designed to overcome these challenges.


Author(s):  
Lavanya Jose ◽  
Lisa Yan ◽  
Mohammad Alizadeh ◽  
George Varghese ◽  
Nick McKeown ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document