Fair end-to-end window-based congestion control

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3530, Issue , 1998, Pages 55-63

  Mo, Jeonghoon ^a   Walrand, Jean ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Congestion control; End to end; Fairness; Max min fair; Proportionally fair; Window

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; INTERNET; LYAPUNOV METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET NETWORKS; PACKET SWITCHING; ROUTERS;

CONGESTION CONTROL PROTOCOL; INTERNET PROTOCOL;

CONGESTION CONTROL (COMMUNICATION);

EID: 0032404969     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.325891     Document Type: Conference Paper

References (28)

1. V. Jacobson, "Congestion avoidance and control," Computer Communication Review 18, pp. 314-29, August 1988.
2. S. Floyd and V. Jacobson, "Connection with multiple Congested Gateways in packet-Switched Networks, Part1: One-way Traffic", ACM Computer Communication Review 21, pp. 30-47, August 1991.
3. S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," IEEE/ACM Transactions on Networking 1, pp. 397-413, August 1993.
4. A. Mankin, "Random Drop Congestion Control," in Proc. SIGCOMM'90, pp. 1-7,(Philadelphia,PA),September 1990.
5. S. Floyd and V. Jacobson, "On Traffic Phase Effects in packet Switched Gateways," Internetworking:Research and Experience 3, pp. 115-156, September 1993.
6. T. Henderson, E. Sahouria, S. McCanne, and R. Katz, "Improving Fairness of TCP Congestion Avoidance," in Globecom '98, 1998.
7. J. Jaffe, "Flow Control Power is Nondecentralizable," IEEE Transactions on Communications COM-29, pp. 1301-1306, September 1981.
8. D. Chiu and R. Jain, "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks," Computer Networks and ISDN Systems 17, pp. 1-14, 1989.
9. S. Shenker, "A theoretical analysis of feedback flow control," in ACM SIGCOM '90 Symposium, (Philadelphia, PA), 24-27 Sept 1990.
10. A. Charny, "An algorithm for rate allocation in a packet-switching network with feedback," Master's thesis, MIT, Cambridge, MA, 1994.
11. R. Jain, "Myths about Congestion Management in High Speed Networks," Internetworking:Research and Experience 3, pp. 101-113, 1992.
12. F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: shadow price proportional fairness and stability," Journal of the Operational Research Society 49, pp. 237-252, 1998.
13. D. Mitra, "Asymptotically optimal design of congestion control for high speed data network," IEEE Transaction on Communication 40, pp. 301-311, February 1992.
14. D.Mitra and I.Mitrani, "Efficient window flow control for high speed data networks with small buffers," Annals of Operations Research 49, pp. 1-24, March 1994.
15. K. Fendick, D.Mitra, I. Mitrani, M. Rodrigues, J. Seery, and A. Weiss, "An approach to high-performance, high-speed data networks," IEEE Communications Magazine 29, pp. 74-82, October 1991.
16. J. Mo and J. Walrand, "Fair end to end window-based congestion control," Tech. Rep. M98/46, UCB/ERL, July 1998. available at http://www.path.berkeley.edu/~ jhmo.
17. J. Jaffe, "Bottleneck flow control," IEEE Transaction on Communications COM-29, July 1981.
18. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englwood Cliffs, N.J., 1992.
19. E. Hahne, "Round-robin scheduling for maxmin fairness in data network," IEEE Journal on Selected Areas in Communications 9, pp. 1024-39, September 1991.
20. R. Jain, "Congestion Control and Traffic Management in ATM Networks: Recent Advances and A Survey," Computer Networks and ISDN Systems 28, pp. 1723-38, October 1996.
21. A. Mayer, Y. Ofek, and M. Yung, "Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information," in IEEE Infocom '96, pp. 926-936, (San Francisco, CA, USA), March 1996.
22. F. Kelly, "Charging and rate control for elastic traffic," European Transactions on Telecommunications 8, pp. 33-37, Jan-Feb 1997.
23. R. Mazumdar, L. Mason, and C. Douligeris, "Fairness in network optimal flow control:optimality of product forms," IEEE Transactions on Communications 39, pp. 775-782, May 1991.
24. C. Douligeris and R. Mazumdar, "A Game Theoretic Perspective to Flow Control in Telecommunication Network," Journal of the Franklin Institute 329, pp. 383-402, 1992.
25. Z. Zhang and C. Douligeris, "Convergence of Synchronous and Asynchronous Greedy Algorithms in a Multiclass Telecommunications Environment," IEEE Transactions on Communications 40, pp. 1277-1281, August 1992.
26. M. Avriel, Nonlinear Programming, Prentice-Hall, Englewood Cliffs, N.J. 1976.
27. L. Brakmo and L. Peterson, "Tcp vegas: end to end congestion avoidance on a global internet," IEEE Journal on Selected Areas in Communications 13, pp. 1465-80, October 1995.
28. R.J. La, J. Warland, and V. Anantharam, "Issues in TCP Vegas." available at http://www.path.berkeley.edu/~hyongla, July 1998.