Flow control in networks with multiple paths

We propose two flow control algorithms for networks with multiple paths between each source-destination pair. Both are distributed algorithms over the network to maximize aggregate source utility. Algorithm 1 is a first order Lagrangian method applied to a modified objective function that has the same optimal solution as the original objective function but has a better convergence property. Algorithm 2 is based on the idea that, at optimality, only paths with the minimum price carry positive flows, and naturally decomposes the overall decision into flow control (determines total transmission rate based on minimum path price) and routing (determines how to split the flow among available paths). Both algorithms can be implemented as simply a source-based mechanism in which no link algorithm nor feedback is needed. We present numerical examples to illustrate their behavior.

[1]  Hao Che,et al.  Decentralized optimal traffic engineering in the internet , 2000, CCRV.

[2]  Steven H. Low,et al.  Optimization Flow Control, II: Implementation , 2000 .

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

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

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

[6]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[7]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[8]  Vadim I. Utkin,et al.  Sliding Modes in Control and Optimization , 1992, Communications and Control Engineering Series.

[9]  JohariRamesh,et al.  End-to-end congestion control for the internet , 2001 .

[10]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Network.

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

[12]  J. J. Garcia-Luna-Aceves,et al.  MPATH: a loop-free multipath routing algorithm , 2000, Microprocess. Microsystems.

[13]  Devika Subramanian,et al.  A Simple, Practical Distributed Multi-Path Routing Algorithm , 1998 .

[14]  Richard J. La,et al.  Charge-sensitive TCP and rate control in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[16]  Devika Subramanian,et al.  An efficient multipath forwarding method , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[17]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[18]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[20]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.