Equilibrium of Heterogeneous Congestion Control: Optimality and Stability

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the current theory based on utility maximization fails to predict the network behavior. The pricing signals can be different types of signals such as packet loss, queueing delay, etc, or different values of the same type of signal such as different ECN marking values based on the same actual link congestion level. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, suboptimal and unstable. In Tang et al. (“Equilibrium of heterogeneous congestion control: Existence and uniqueness,” IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 824-837, Aug. 2007), existence and uniqueness of equilibrium of heterogeneous protocols are investigated. This paper extends the study with two objectives: analyzing the optimality and stability of such networks and designing control schemes to improve those properties. First, we demonstrate the intricate behavior of a heterogeneous network through simulations and present a framework to help understand its equilibrium properties. Second, we propose a simple source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns by only updating a linear parameter in the sources' algorithms on a slow timescale. It steers a network to the unique optimal equilibrium. The scheme can be deployed incrementally as the existing protocol needs no change and only new protocols need to adopt the slow timescale adaptation.

[1]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[2]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[3]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[4]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[5]  Qian Zhang,et al.  A Compound TCP Approach for High-Speed and Long Distance Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Lachlan L. H. Andrew,et al.  Game theory for heterogeneous flow control , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[7]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[8]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[9]  Nick McKeown,et al.  Processor Sharing Flows in the Internet , 2005, IWQoS.

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

[11]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[12]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[13]  Asuman Ozdaglar,et al.  On the stability of P-matrices , 2007 .

[14]  R. Srikant,et al.  Rate-based versus queue-based models of congestion control , 2004, IEEE Transactions on Automatic Control.

[15]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[16]  J. Zukas.  Introduction to the Modern Theory of Dynamical Systems , 1998 .

[17]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

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

[19]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[20]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[21]  Ren Wang,et al.  TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks , 2002, Wirel. Networks.

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

[23]  Anurag Kumar,et al.  Stochastic models for throughput analysis of randomly arriving elastic flows in the Internet , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[25]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

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

[27]  Frank Kelly,et al.  Models for a self–managed Internet , 2000, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[28]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[29]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[30]  Ao Tang,et al.  Equilibrium of Heterogeneous Congestion Control: Existence and Uniqueness , 2007, IEEE/ACM Transactions on Networking.

[31]  Sanjay Shakkottai,et al.  TCP performance over end-to-end rate control and stochastic available capacity , 2001, TNET.

[32]  Lachlan L. H. Andrew,et al.  MaxNet: a congestion control architecture for scalable networks , 2003, IEEE Communications Letters.

[33]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[34]  H. Scarf.  Some Examples of Global Instability of the Competitive Equilibrium , 1960 .

[35]  R. Srikant,et al.  Mean FDE models for Internet congestion control under a many-flows regime , 2004, IEEE Transactions on Information Theory.

[36]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[37]  Ao Tang,et al.  Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST , 2005, Telecommun. Syst..

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

[39]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[40]  Jon Crowcroft,et al.  Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm , 1992, CCRV.

[41]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[42]  R. Srikant,et al.  TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks , 2006, valuetools '06.

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

[44]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.