End-to-end congestion control schemes: Utility functions, random losses and ECN marks

IEEE/ACM Transactions on Networking

Volumn 11, Issue 5, 2003, Pages 689-702

  Kunniyur, Srisankar ^a   Srikant, R ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Explicit congestion notification (ECN) marking; Internet congestion control; TCP; TCP over wireless

Indexed keywords

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; NONLINEAR PROGRAMMING; PROBABILITY; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

DETERMINISTIC FLUID MODELS; EXPLICIT CONGESTION NOTIFICATION; TRANSMISSION CONTROL PROTOCOL; UTILITY FUNCTION;

CONGESTION CONTROL (COMMUNICATION);

EID: 0242302646     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.818183     Document Type: Article

References (28)

1. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
2. L. Breslau and S. Shenker, "Best-effort versus reservations: A simple comparative analysis," Comput. Commun. Rev., vol. 28, pp. 3-16, Sept. 1998.
3. S. Floyd, "TCP and explicit congestion notification," Comput. Commun. Rev., vol. 24, pp. 10-23, Oct. 1994.
4. S. Floyd and K. Fall, "Promoting the use of end-to-end congestion control in the Internet," IEEE/ACM Trans. Networking, vol. 4, pp. 458-472, Aug. 1999.
5. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
6. R. J. Gibbens and F. P. Kelly, "Distributed connection acceptance control for a connectionless network," presented at the 16th Int. Teletraffic Congr., Edinburgh, U.K., June 1999.
7. ____, "Resource pricing and the evolution of congestion control," Automatica, vol. 35, pp. 1969-1985, 1999.
8. S. J. Golestani and S. Bhattacharyya, "A class of end-to-end congestion control algorithms for the Internet," presented at the Int. Conf. Network Protocols, Oct. 1998.
9. P. Hurley, J.-Y. Le Boudec, and P. Thiran, "A note on the fairness of additive increase and multiplicative decrease," presented at the 16th Int. Teletraffic Congr., Edinburgh, U.K., June 1999.
10. V. Jacobson, "Congestion avoidance and control," Comput. Commun. Rev., vol. 18, pp. 314-329, Aug. 1988.
11. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
12. F. P. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, pp. 33-37, 1997.
13. ____, "Mathematical modeling of the Internet," in Mathematics Unlimited-2001 and Beyond, B. Engquist and W. Schmid, Eds. Berlin, Germany: Springer-Verlag, 2001, pp. 685-702.
14. A. Kumar, "Comparative performance analysis of versions of TCP in a local network with a lossy link," IEEE/ACM Trans. Networking, vol. 6, pp. 485-498, Aug. 1998.
15. S. Kunniyur and R. Srikant, "Fairness of congestion avoidance schemes in heterogeneous networks," presented at the 16th Int. Teletraffic Congr., Edinburgh, U.K., June 1999.
16. ____, "Analysis and design of an adaptive virtual queue algorithm for active queue management," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 123-134.
17. ____, "A time-scale decomposition approach to adaptive explicit congestion notification (ECN) marking," IEEE Trans. Automat. Contr., vol. 47, pp. 882-894, June 2002.
18. H. J. Kushner and D. S. Clark, Stochastic Approximations for Constrained and Unconstrained Systems. New York and Berlin, Germany: Springer-Verlag, 1978.
19. T. V. Lakshman and U. Madhow, "The performance of TCP/IP for networks with high bandwidth-delay products and random loss," IEEE/ACM Trans. Networking, vol. 5, pp. 336-350, June 1997.
20. J. R. Li, D. Dwyer, and V. Bharghavan, "A transport protocol for heterogeneous packet flows," presented at the IEEE INFOCOM, New York, Mar. 1999.
21. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Networking, vol. 7, pp. 861-875, Dec. 1999.
22. J. K. MacKie-Mason and H. R. Varian, "Pricing congestible network resources," IEEE J. Select. Areas Commun., vol. 13, pp. 1141-1148, Sept. 1995.
23. L. Massoulie and J. Roberts, "Bandwidth sharing: objectives and algorithms," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 1395-1403.
24. M. Mathis, J. Semke, J. Mahdavi, and T. Ott, "The macroscopic behavior of the TCP congestion avoidance algorithm," Comput. Commun. Rev., vol. 27, 1997.
25. V. Misra, W. Gong, and D. Towsley, "A fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED," in Proc. ACM SIGCOMM, Stockholm, Sweden, Sept. 2000.
26. J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Networking, vol. 8, pp. 556-567, Oct. 1998.
27. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP throughput: a simple model and its empirical validation," in Proc. ACM SIGCOMM, 1998.
28. J. Waldby, U. Madhow, and T. V. Lakshman, "Total acknowledgement: a robust feedback mechanism for end-to-end congestion control," Proc. ACM Sigmetrics, 1998.