Optimization flow control—I: basic algorithm and convergence

We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property.

[1]  W. Rudin.  Principles of mathematical analysis , 1964 .

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

[3]  John N. Tsitsiklis,et al.  Distributed asynchronous optimal routing in data networks , 1986 .

[4]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[5]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

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

[7]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[8]  Semyon M. Meerkov,et al.  Feedback control of congestion in packet switching networks: the case of a single congested node , 1993, TNET.

[9]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[10]  Debasis Mitra,et al.  Adaptive Algorithms for Feedback-Based Flow Control in High Speed, Wide-Area ATM Networks , 1995, IEEE J. Sel. Areas Commun..

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

[12]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1995, CCRV.

[13]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[14]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[15]  George D. Stamoulis,et al.  Integration of pricing and flow control for available bit rate services in ATM networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[16]  F. Kelly.  Charging and Rate Control for Elastic Traac , 1997 .

[17]  Song Chong,et al.  Rate control algorithms for the ATM ABR service , 1997, Eur. Trans. Telecommun..

[18]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[19]  Steven H. Low,et al.  An IP implementation of optimization flow control , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

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

[21]  S. Jamaloddin Golestani,et al.  A class of end-to-end congestion control algorithms for the Internet , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[22]  Steven H. Low,et al.  Equilibrium Allocation and Pricing of Variable Resources Among User-Suppliers , 1998, Perform. Evaluation.

[23]  Steven H. Low,et al.  An optimization approach to ABR control , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[24]  Yung-Terng Wang,et al.  Designing Stable ABR Flow Control with Rate Feedback and Open Loop Control: First-Order Control Case , 1998, Perform. Evaluation.

[25]  Steven H. Low,et al.  Equilibrium allocation of variable resources for elastic traffics , 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.

[26]  Steven H. Low,et al.  Optimization flow control with on-line measurement or multiple paths , 1999 .

[27]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[28]  Steven Low,et al.  Random early marking: an optimisation approach to Internet congestion control , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

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

[30]  D. Lapsley,et al.  Random early marking for Internet congestion control , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[31]  Steven H. Low,et al.  An enhanced random early marking algorithm for Internet flow control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[32]  Steven H. Low,et al.  Random Early Marking , 2000, QofIS.

[33]  Steven H. Low,et al.  Optimization flow control with Newton‐like algorithm , 2000, Telecommun. Syst..

[34]  I. Jktroduction.  Distributed Asynchronous Optimal Routing in Data Networks , 2001 .