Cross-Layer Optimization in TCP/IP Networks

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 582-595

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Congestion control; Routing; TCP AQM IP; Utility maximization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); MATRIX ALGEBRA; NETWORK PROTOCOLS; OPTIMIZATION; POLYNOMIALS; QUEUEING NETWORKS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

ACTIVE QUEUE MANAGEMENT (AQM); IP NETWORKS; ROUTING; TCP-AQM; UTILITY MAXIMIZATION;

INTERNET;

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

References (29)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
2. B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput competitive online routing," in Proc. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 32-40.
3. D. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
4. D. P. Bertsekas, "Dynamic behavior of shortest path routing algorithms for communication networks," IEEE Trans. Automat. Contr., vol. 27, no. 1, pp. 60-74, Feb. 1982.
5. D. P. Bertsekas, Linear Network Optimization: Algorithms and Codes. Cambridge, MA: MIT Press, 1991.
6. S. Cosares and I. Saniee, "An optimization problem related to balancing loads on SONET rings," Telecommun. Syst., vol. 3, pp. 165-181, 1994.
7. S. Deb and R. Srikant, "Congestion control for fair resource allocation in networks with multicast flows," in Proc. IEEE Conf. Decision and Control, Dec. 2001, pp. 1911-1916.
8. R. G. Gallager and S. J. Golestani, "Flow control and routing algorithms for data networks," in Proc. 5th Int Conf. Comp. Comm., 1980, pp. 779-784.
9. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
10. N. Garg and J. Konemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proc. 39th Annu. Symp. Foundations of Computer Science, 1998, pp. 300-309.
11. C. Hedrick. (1988, Jun.) Routing Information Protocol. IETF RFC 1058. [Online]. Available: http://www.faqs.org/rfcs/rfc1058.html
12. K. Kar, S. Sarkar, and L. Tassiulas, "Optimization based rate control for multipath sessions," in Proc. 7th Int. Teletraffic Congress (ITC), Dec. 2001.
13. K. Kar, S. Sarkar, and L. Tassiulas, "Optimization based rate contro1 for multirate multicast sessions," in Proc. IEEE INFOCOM, Apr. 2001, pp. 123-132.
14. F. P. Kelly, "Fairness and stability of end-to-end congestion control," Eur. J. Control, vol. 9, pp. 159-176, 2003.
15. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness, and stability," J. Oper. Res. Soc., vol. 49, no. 3, pp. 237-252, Mar. 1998.
16. S. Kunniyur and R. Srikant, "End-to-end congestion control: Utility functions, random losses, and ECN marks," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 689-702, Oct. 2003.
17. S. H. Low and P. Varaiya, "Dynamic behavior of a class of adaptive routing protocols (IGRP)," in Proc. IEEE INFOCOM, Mar. 1993, pp. 610-616.
18. S. H. Low, "A duality model of TCP and queue management algorithms," IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 525-536, Aug. 2003.
19. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 861-874, Dec. 1999.
20. S. H. Low, F. Paganini, and J. C. Doyle, "Internet congestion control," IEEE Control Syst. Mag., vol. 22, no. 1, pp. 28-43, Feb. 2002.
21. S. H. Low, L. Peterson, and L. Wang. (2002, Mar.) Understanding Vegas: A duality model. J. ACM. [Online], vol (2), pp. 207-235
22. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
23. L. Massoulie and J. Roberts, "Bandwidth sharing: Objectives and algorithms," IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 320-328, Jun. 2002.
24. J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 556-567, Oct. 2000.
25. J. Moy. (1998, Apr.) OSPF Version 2. IETF RFC 2328. [Online]. Available: http://www.faqs.org/rfcs/rfc2328.html
26. S. Plotkin, D. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," Math. Oper. Res., pp. 257-301, 1995.
27. R. Srikant, The Mathematics of Internet Congestion Control. Cambridge, MA: Birkhauser, 2004.
28. J. Wang, L. Li, S. H. Low, and J. C. Doyle, "Can TCP and shortest-path routing maximize utility," in Proc. IEEE INFOCOM, Apr. 2003, pp. 2049-2056.
29. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Sep. 1988.