Can shortest-path routing and TCP maximize utility

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 2049-2056

  Wang, Jiantao ^a   Li, Lun ^a   Low, Steven H ^a   Doyle, John C ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION PRICE; GENERAL NETWORKS; LINK COST; NP-HARD; PRIMAL DUAL ALGORITHMS; RING NETWORKS; ROUTING INSTABILITY; SHORTEST PATH ROUTING; SOURCE RATE; TCP-AQM; TIME-SCALES; UTILITY MAXIMIZATIONS;

COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; TRANSMISSION CONTROL PROTOCOL;

NETWORK ROUTING;

EID: 0042474097     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2003.1209226     Document Type: Conference Paper

References (17)

1. D. Bertsekas. Nonlinear Programming. Athena Scientific, 1995.
2. Dimitri P. Bertsekas. Dynamic behavior of shortest path routing algorithms for communication networks. IEEE Transactions on Automatic Control, pages 60-74, February 1982.
3. S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. In Proceedings of the IEEE Conference on Decision and Control, December 2001.
4. R. G. Gallager and S. J. Golestani. Flow control and routing algorithms for data networks. In Proceedings of the 5th International Conf. Comp. Comm., pages 779-784, 1980.
5. Michael Garey and David Johnson. Compueters and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., 1979.
6. Koushik Kar, Saswati Sarkar, and Leandros Tassiulas. Optimization based rate control for multipath sessions. Technical report, Technical Report 2001-1, Institute for Systems Research, University of Maryland, 2001.
7. Koushik Kar, Saswati Sarkar, and Leandros Tassiulas. Optimization based rate control for multirate multicast sessions. In Proceedings of IEEE Infocom, April 2001.
8. Frank P. Kelly, Aman Maulloo, and David Tan. Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of Operations Research Society, 49(3):237-252, March 1998. (Pubitemid 128610018)
9. Srisankar Kunniyur and R. Srikant. End-to-end congestion control schemes: utility functions, random losses and ECN marks. In Proceedings of IEEE Infocom, March 2000. http://www.ieee-infocom.org/2000/papers/401.ps.
10. S. Low and P. Varaiya. Dynamic behavior of a class of adaptive routing protocols (IGRP). In Proceedings of Infocom'93, pages 610-616, March 1993.
11. Steven H. Low. A duality model of TCP and queue management algorithms. In Proceedings of ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management (updated version), September 18-20 2000. http://netlab.caltech.edu.
12. Steven H. Low and David E. Lapsley. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6):861-874, December 1999. http://netlab.caltech.edu. (Pubitemid 30553383)
13. Steven H. Low, Larry Peterson, and Limin Wang. Understanding Vegas: a duality model. J. of ACM, 49(2):207-235, March 2002. http://netlab.caltech.edu.
14. David G. Luenberger. Linear and Nonlinear Programming, 2nd Ed. Addison-Wesley Publishing Company, 1984.
15. L. Massoulie and J. Roberts. Bandwidth sharing: objectives and algorithms. In Infocom'99, March 1999. http://www.dmi.ens.fr/\%7Emistral/ tcpworkshop.html.
16. Jeonghoon Mo and Jean Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5):556-567, October 2000. (Pubitemid 32017921)
17. Waxman B.M. Routing of multipoint connections IEEE J. Select. Areas Commun, 6(9), 1617-1622 1988