Congestion control with adaptive multipath routing based on optimization

The paper considers a TCP/IP-style network with flow control at end-systems based on congestion feedback, and routing decisions at network nodes on a per-destination basis. The only generalization with respect to standard IP is that routers split their traffic, for each destination, among their outgoing links. We pose two optimization problems, that generalize and combine those used in the congestion control and traffic engineering literature. In contrast to other work in multipath congestion control, we use variables that are available at each node (source or router). We prove that decentralized algorithms built by combining primal or dual congestion control with adaptation of router splits, converge globally to optimal points. Some comments on practical implications of these results are given.

[1]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[2]  Asuman Ozdaglar,et al.  Price Competition in Communication Networks , 2005 .

[3]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[5]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[6]  Thomas Voice.  A global stability result for primal-dual congestion control algorithms with routing , 2004, CCRV.

[7]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[8]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  William H. Sandholm,et al.  Evolutionary Implementation and Congestion Pricing , 2002 .

[10]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[11]  R. Srikant,et al.  Overlay TCP for MultiPath Routing and Congestion Control ∗ , 2004 .

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

[13]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[14]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[15]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[16]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[19]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[20]  G. Vinnicombe,et al.  Combined control of routing and flow: a multipath routing approach , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[21]  Lun Li,et al.  Cross-layer optimization in TCP/IP networks , 2005, IEEE/ACM Transactions on Networking.

[22]  Vivek S. Borkar,et al.  Dynamic Cesaro-Wardrop equilibration in networks , 2003, IEEE Trans. Autom. Control..