Fair end-to-end window-based congestion control

In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation of the protocols.

[1]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[2]  and Charles K. Taft Reswick,et al.  Introduction to Dynamic Systems , 1967 .

[3]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[4]  Jeffrey M. Jaffe,et al.  Flow Control Power is Nondecentralizable , 1981, IEEE Trans. Commun..

[5]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[6]  K. Deimling.  Fixed Point Theory , 2008 .

[7]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[9]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[10]  Scott Shenker,et al.  A Theoretical Analysis of Feedback Flow Control , 1990, SIGCOMM.

[11]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[12]  Allison Mankin,et al.  Random drop congestion control , 1990, SIGCOMM '90.

[13]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[14]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[15]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[16]  K.W. Fendick,et al.  An approach to high-performance, high-speed data networks , 1991, IEEE Communications Magazine.

[17]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[18]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment , 1992, IEEE Trans. Commun..

[19]  Debasis Mitra.  Asymptotically optimal design of congestion control for high speed data networks , 1992, IEEE Trans. Commun..

[20]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[21]  Christos Douligeris,et al.  A game theoretic perspective to flow control in telecommunication networks , 1992 .

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

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

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

[25]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[26]  Debasis Mitra,et al.  Efficient window flow control for high speed data networks with small buffers , 1994, Ann. Oper. Res..

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

[28]  Raj Jain.  Congestion Control and Traffic Management in ATM Networks: Recent Advances and a Survey , 1996, Comput. Networks ISDN Syst..

[29]  Moti Yung,et al.  Approximating max-min fair rates via distributed local scheduling with partial information , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

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

[32]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[33]  Steven McCanne,et al.  On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

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

[35]  Richard J. La,et al.  Issues in TCP Vegas , 1998 .

[36]  J. Boudec,et al.  The Fairness of Additive Increase and Multiplicative Decrease , 1998 .

[37]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[38]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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