Abstract:
The congestion control mechanisms used in tcp have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, tcp connections still experience alarmingly high loss rates, especially during times of congestion. To alleviate this problem, the ietf is considering active queue management mechanisms, such as red, for deployment in the network. In this paper, we first show that even with red, loss rates can only be reduced marginally in times of congestion. We then show that the solution to this problem lies in decoupling congestion notification from packet loss through the use of explicit congestion notification (ecn) and in understanding the traffic generated by an aggregation of a large number of sources. Given this, we then propose and experiment with more adaptive active queue management algorithms (Adaptive red) and more conservative end-host mechanisms (subtcp) which can significantly reduce loss rates across conges...
Citations
|
1825
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
1738
|
Random Early Detections Gateways for Congestion Avoidance
– Floyd, Jacobson
- 1993
|
|
605
|
End-to-end internet packet dynamics
– Paxson
- 1999
|
|
434
|
TCP and Explicit Congestion Notification
– Floyd
- 1995
|
|
415
|
The macroscopic behavior of the TCP congestion avoidance algorithm
– Mathis, Semke, et al.
- 1997
|
|
400
|
TCP Vegas: New Techniques for Congestion Detection and Avoidance
– Brakmo, O’Malley, et al.
- 1994
|
|
344
|
A Proposal to Add Explicit Congestion Notification (ECN) to IP," RFC 2481
– Ramakrishnan, Floyd
- 1999
|
|
340
|
Dynamics of Random Early Detection
– Lin, Morris
- 1997
|
|
317
|
The performance of TCP/IP for networks with high bandwidth-delayproducts and random loss
– Lakshman, Madhow
- 1997
|
|
297
|
and D.D.Clark, “Observations and Dynamics of a Congestion Control Algorithm
– Zhang
- 1991
|
|
271
|
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks
– Ramakrishnan, Jain
- 1990
|
|
232
|
Connections with multiple congested gateways in packet-switched networks, Part 1: One-way traffic
– Floyd
- 1991
|
|
212
|
A Quantitative Measure of Fairness and Discrimination for Resource Allocation
– Jain, Chiu, et al.
- 1984
|
|
206
|
On traffic phase effects in packet-switched gateways
– Floyd, Jacobson
- 1992
|
|
173
|
Analysis of the increase/decrease algorithms for congestion avoidance in computer networks
– Chiu, Jain
- 1989
|
|
119
|
30). “Modified TCP congestion avoidance algorithm
– Jacobson
- 1990
|
|
99
|
The stationary behavior of ideal TCP congestion avoidance. in preprint. 22
– Ott, Kemperman, et al.
|
|
90
|
TCP Behavior with Many Flows
– Morris
- 1997
|
|
82
|
High Performance TCP in the ANSNET
– Villamizar, Song
- 1994
|
|
43
|
Adaptive Packet Marking for Providing Differentiated
– Feng, Kandlur, et al.
- 1998
|
|
34
|
Eliminating periodic packet losses in 4.3Tahoe BSD TCP congestion control algorithm
– Wang
- 1992
|
|
25
|
Understanding TCP Dynamics in an Integrated Services Internet
– Feng, Kandlur, et al.
- 1997
|
|
22
|
A new congestion control scheme
– Wang
- 1991
|
|
6
|
Increasing TCP's Initial Window. Internet draft "draft-ietf-tsvwg-initwin-00.txt
– Allman, Floyd, et al.
- 2001
|
|
1
|
TCP very slow start and freeway avoidance. end2end-interest mailing list
– Crowcroft
- 1995
|