Cross-layer optimization in TCP/IP networks

TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes aggregate utility over both source rates and routes, provided congestion prices are used as link costs. An equilibrium exists if and only if this utility maximization problem and its Lagrangian dual have no duality gap. In this case, TCP/IP incurs no penalty in not splitting traffic across multiple paths. Such an equilibrium, however, can be unstable. It can be stabilized by adding a static component to link cost, but at the expense of a reduced utility in equilibrium. If link capacities are optimally provisioned, however, pure static routing, which is necessarily stable, is sufficient to maximize utility. Moreover single-path routing again achieves the same utility as multipath routing at optimality.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Robert G. Gallager,et al.  Flow Control and Routing Algorithms for Data Networks , 1980 .

[3]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[4]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[5]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[6]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[7]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Pravin Varaiya,et al.  Stability of a class of dynamic routing protocols (IGRP) , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  Iraj Saniee,et al.  An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..

[12]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[13]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[14]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[16]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[17]  Leandros Tassiulas,et al.  Optimization based rate control for multirate multicast sessions , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Leandros Tassiulas,et al.  Optimization based rate control for multipath sessions , 2001 .

[19]  Rakesh V. Vohra,et al.  Mathematics of the Internet , 2001 .

[20]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[21]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[22]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[23]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[24]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

[25]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[26]  Lun Li,et al.  Can shortest-path routing and TCP maximize utility , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[27]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[28]  R. Srikant,et al.  Congestion control for fair resource allocation in networks with multicast flows , 2004, IEEE/ACM Transactions on Networking.

[29]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

[30]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.