A survey of TCP-friendly router-based AQM schemes

Computer Communications

Volumn 27, Issue 15, 2004, Pages 1424-1440

  Chatranon, Gwyn ^a   Labrador, Miguel A ^b   Banerjee, Sujata ^c  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b University of South Florida   (United States)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Active queue management; Congestion control; Fairness; TCP friendly

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); INTERNET; NETWORK PROTOCOLS; ROUTERS; VIDEO CONFERENCING; VIDEO SIGNAL PROCESSING;

ACTIVE QUEUE MANAGEMENT (AQM); FAIRNESS; TCP-FRIENDLY; TRANSMISSION CONTROL PROTOCOLS (TCP);

TELECOMMUNICATION TRAFFIC;

EID: 3943106830     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2004.05.001     Document Type: Short Survey

References (39)

1. Jacobson V. Congestion Avoidance and Control. in: Proceedings of ACM SIGCOMM. 1988;. pp. 314-329.
2. Floyd S., Fall K. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions Networking. 7:(4):1999;458-472.
3. Hong D.P., Albuquerque C., Oliveira C., Suda T. Evaluating the Impact of Emerging Streaming Media Applications on TCP/IP performance. IEEE Communications. 39:(4):2001;76-82.
4. Jacobson V. Berkeley TCP Evolution from 4.3-tahoe to 4.3-reno. in: Proceedings of the 18th Internet Engineering Task Force. 1990;. p. 365.
5. Stevens W. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. IETF RFC 2001. 2001.
6. S. Floyd, T. Henderson, The NewReno Modification to TCP's Fast Recovery Algorithm, RFC 2582.
7. M. Mathis, J. Mahdavi, S. Floyd, A. Romanow, TCP Selective Acknowledgement Options, RFC 2018.
8. Brakmo L., O'Malley S., Peterson L. TCP Vegas: New Techniques for Congestion Detection and Avoidance. in: Proceedings of ACM SIGCOMM. 1994;. pp. 24-35.
9. Mathis M., Semke J., Mahdavi J., Ott T. The Macroscopic Behavior of the Congestion Avoidance Algorithm. Computer Communications Review. 27:(3):1997.
10. Padhye J., Firoiu V., Towsley D., Kurose J. Modeling TCP Throughput: A Simple Model and its Empirical Validation. in: Proceedings of ACM SIGCOMM'98, Vancouver, BC. 1998;. pp. 303-314.
11. Altman E., Avrachenkov K., Barakat C. Model of TCP/IP with Stationary Random Losses. in: Proceedings of SIGCOMM. 2000;. pp. 231-242.
12. Yeom I., Reddy A.L.N. Modeling TCP Behavior in a Differentiated Services Network. IEEE/ACM Transactions on Networking. 9:(1):2001;31-46.
13. Sikdar B., Kalyanaraman S., Vastola K. Analytic Models for the Latency and Steady-state Throughput of TCP Tahoe, Reno and SACK. in: Proceedings IEEE GLOBECOM. 2001.
14. J. Mahdavi, S. Flyod, TCP-friendly Unicast Rate-based Flow Control, Note Sent to End-to-End Mailing List.
15. Floyd S., Handley M., Padhye J., Widmer J. Equation-based Congestion Control for Unicast Applications. in: Proceedings of ACM SIGCOMM, Stockholm, Sweden. 2000;. pp. 43-56.
16. Rejaie R., Handley M., Estrin D. RAP: End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet. in: Proceedings of IEEE INFOCOM. 1999;. pp. 1337-1345.
17. Sisalem D., Wolisz A. LDA+ TCP-Friendly Adaptation: A Measurement and Comparison Study. in: The 10th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV'2000), Chapel Hill, NC, USA. 2000.
18. Rhee I., Ozdemir V., Yi Y. TEAR: TCP Emulation at Receivers - Flow Control for Multimedia Streaming. Tech. rep., NCSU Technical Report. 1999.
19. Bansal D., Balakrishnan H. Binomial Congestion Control Algorithms. in: Proceedings of IEEE INFOCOM. 2001;. pp. 631-640.
20. Yang Y., Lam S. General AIMD Congestion Control. Tech. Rep. TR-200009. 2000;Department of Computer Science, University of Texas at Austin.
21. Widmer J., Denda R., Mauve M. A Survey on TCP-Friendly Congestion Control. IEEE Network. 15:(3):2001;. pp. 28-37.
22. Suter B., Lakshman T., Stiliadis D., Choudhury A. Design Considerations for Supporting TCP with Per-Flow Queuing. in: Proceedings of IEEE INFOCOM. 1998;. pp. 299-306.
23. Lin D., Morris R. Dynamics of Random Early Detection. in: Proceedings of SIGCOMM. 1997;. pp. 127-137.
24. Anjum F., Tassiulas L. Fair Bandwidth Sharing Among Adaptive and Non-Adaptive Flows in the Internet. in: Proceedings of IEEE INFOCOM. 1999;. pp. 1412-1420.
25. Ott T., Lakshman T., Wong L. SRED: Stabilized RED. IEEE INFOCOM. 1999.
26. Pan R., Prabhakar B., Psounis K. CHOKe - A Stateless Active Queue Management Scheme For Approximating Fair Bandwidth Allocation. in: Proceedings of IEEE INFOCOM. 2000;. pp. 942-951.
27. Feng W., Kandlur D., Saha D., Shin K. Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. in: Proceedings of IEEE INFOCOM. 2001;. pp. 1520-1529.
28. Chatranon G., Labrador M.A., Banerjee S. BLACK: Detection and Preferential Dropping of High Bandwidth Unresponsvie Flows. in: Proceedings of IEEE ICC. 2003;. pp. 664-668.
29. M. Chan, M. Hamdi, An Active Queue Management Scheme Based on a Capture-Recaptured Model, IEEE J. Select. Areas Commun. 21 (4), May 2003.
30. Keshav S. An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. 1997;Addison-Wesley, Massachusetts.
31. Lakshman T.V., Neidhardt A., Ott T. The Drop from Front Strategy in TCP and in TCP over ATM. in: Proceedings of IEEE Infocom. 1996;. pp. 1242-1250.
32. Floyd S., Jacobson V. Random Early Detection Gatewas for Congestion Avoidance. IEEE/ACM Trans. Networking. 1:(4):1993;397-413.
33. L. Guo, I. Matta, The War Between Mice and Elephants, Tech. Rep. 2001-005, Computer Science Department, Boston University, May 2001.
34. I. Kim, Analyzing Network Traces To Identify Long-Term High Rate Flows, Master's Thesis, Texas A and M University, May 2001.
35. NS Network Simulator. URL http://www.isi.edu/nsnam/ns.
36. The Network Simulator: Contributed Code. URL http://www.isi.edu/nsnam/ns/ ns-contributed.html.
37. R. Jain, A. Durresi, G. Babic, Throughput Fairness Index: An Explanation, ATM Forum/99-0045.
38. C. Estan, G. Varghese, M. Fisk, Bitmap Algorithms for Counting Active Flows on High Speed Links, Tech. Rep. CS2003-0738, UCSD, Mar. 2003.
39. C. Estan, G. Varghese, M. Fisk, Counting the Number of Active Flows on a High Speed Link, ACM SIGCOMM Computer Communication Review 32.