Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking

Volumn 8, Issue 5, 2000, Pages 556-567

  Mo, Jeonghoon ^a   Walrand, Jean ^b,c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IEEE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); CONVERGENCE OF NUMERICAL METHODS; LYAPUNOV METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION TRAFFIC;

BANDWIDTH SHARING; TRANSMISSION CONTROL PROTOCOL (TCP);

PACKET NETWORKS;

EID: 0034297878     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.879343     Document Type: Article

References (28)

1. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
2. A. Charny, "An algorithm for rate allocation in a packet-switching network with feedback," Master's thesis, Mass. Inst. Technol., Cambridge, MA, 1994.
3. D. Chiu and R. Jain, "Analysis of the increase and decrease algorithms for congestion avoidance in computer networks," Comput. Networks ISDN Syst., vol. 17, pp. 1-14, 1989.
4. S. Floyd and V. Jacobson, "Connection with multiple congested gateways in packet-switched networks, Part 1: One-way traffic," ACM Comput. Commun. Rev., vol. 21, no. 5, pp. 30-47, Aug. 1991.
5. _, "On traffic phase effects in packet switched gateways," Internetworking: Res. and Experience, vol. 3, no. 3, pp. 115-156, Sept. 1993.
6. _, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
7. S. McCanne, S. Floyd, and K. Fall. (1997) ns-LBNL Network Simulator. Lawrence Berkeley National Laboratory Networking Group, Berkeley, CA. [Online]. Available: http://www-nrg.ee.lbl.gov/ns/
8. E. Hahne, "Round-robin scheduling for max-min fairness in data network," IEEE J. Select. Areas Commun., vol 9, pp. 1024-39, Sept. 1991.
9. T. Henderson, E. Sahouria, S. McCanne, and R. Katz, "Improving fairness of TCP congestion avoidance," in Globecom'98, Sydney, Australia, pp. 539-544.
10. P. Hurley, J.-Y. Le Boudec, and P. Thiran, "A note on the fairness of additive increase and multiplicative decrease," in Proc. ITC-16, Edinburgh, Scotland, June 1999, pp. 467-478.
11. V. Istratescu, Fixed Point Theory. Dordrecht, Holland: Reidel, 1981.
12. V. Jacobson, "Congestion avoidance and control," Comput. Commun.n Rev., vol. 18, no. 4, pp. 314-29, Aug. 1988.
13. J. M. Jaffe, "Bottleneck flow control," IEEE Trans. Commun., vol. COM-29, July 1981.
14. _, "Flow control power is nondecentralizable," IEEE Trans. Commun., vol. COM-29, pp. 1301-1306, Sept. 1981.
15. R. Jain, "Myths about congestion management in high-speed networks," Internetworking: Res. and Experience, vol. 3, pp. 101-113, 1992.
16. _, "Congestion control and traffic management in ATM networks: Recent advances and a survey," Comput. Networks ISDN Syst., vol. 28, no. 13, pp. 1723-38, Oct. 1996.
17. F. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, pp. 33-37, Jan./Feb. 1997.
18. F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow price proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
19. R. J. La, J. Walrand, and V. Anantharam. (1998, July) Issues in TCP vegas. [Online]. Available: http://www.path.berkeley.edu/∼hyongla
20. D. Luenberger, Introduction to Dynamic System. New York, NY: Wiley, 1979.
21. C. Boutremans, M. Vojnovic, and J. Y. Le Boudec, "Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times," in IEEE Infocom'00, Tel Aviv, Israel, Mar. 2000, pp. 1303-1312.
22. A. Mankin, "Random drop congestion control," in Proc. SIGCOMM'90, Philadelphia, PA, Sept. 1990, pp. 1-7.
23. L. Massoulie and J. Roberts, "Bandwidth sharing: Objectives and algorithms," in IEEE Infocom'99, vol. 3, New York, NY, Mar. 1999, pp. 1395-1403.
24. M. Avriel, Nonlinear Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
25. A. Mayer, Y. Ofek, and M. Yung, "Approximating max-min fair rates via distributed local scheduling with partial information," in IEEE Infocom'96, San Francisco, CA, USA, Mar. 1996, pp. 926-936.
26. J. Mo, R. J. La, J. Walrand, and V. Anantharam, "Analysis and comparison of Reno and Vegas," in IEEE Infocom'99, vol. 3, New York, NY, Mar. 1999, [Online]. Available: http://www.path.berkeley.edu/∼jhmo, pp. 1556-1563.
27. J. B. Rosen, "Existence and uniqueness of equilibrium points for concave N-person games," Econometrica, vol. 33, no. 3, pp. 520-534, 1965.
28. S. Shenker, "A theoretical analysis of feedback flow control," in ACM SIGCOM'90, Philadelphia, PA, Sept. 24-27, 1990, pp. 156-165.