Congestion in large balanced multirate networks

In this paper, we obtain analytical approximations for various performance measures for a large fluid stochastic network that operates under a balanced fair bandwidth allocation policy. Balanced fairness results in the insensitivity of the stationary distribution of the number in the system to the precise distribution of file sizes. Balanced fairness has been shown to coincide with proportional fairness in large systems. The model we consider is that of servers operating under balanced fair rate allocations that are accessed by a large number of independent heterogeneous flows characterized by their arrival rate and general distributions of the file sizes; and a maximum service rate associated with each type of flow. The largeness of the system is parameterized by a scaling parameter that scales the arrival rates and capacity in such a way that the ratio is fixed. By exploiting a connection of the congestion probabilities with multirate Erlang loss systems, we use local limit large deviation methods to obtain accurate approximations as the scaling increases. The paper first discusses the single link case which is then extended to the case of a parking lot model that is a special case of tree networks.

[1]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[2]  Jorma T. Virtamo,et al.  A recursive formula for multirate systems with elastic traffic , 2005, IEEE Communications Letters.

[3]  L. Massouli'e.  Structural properties of proportional fairness: Stability and insensitivity , 2007, 0707.4542.

[4]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[5]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[6]  Neil S. Walton,et al.  Insensitive, maximum stable allocations converge to proportional fairness , 2010, Queueing Syst. Theory Appl..

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

[8]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[9]  Alexandre Proutière,et al.  Insensitive Bandwidth Sharing in Data Networks , 2003, Queueing Syst. Theory Appl..

[10]  Michael Mitzenmacher,et al.  Computational Complexity of Loss Networks , 1994, Theor. Comput. Sci..

[11]  T. V. Lakshman,et al.  A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet , 1997, SIGMETRICS '97.

[12]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[13]  Jorma T. Virtamo,et al.  Calculating the flow level performance of balanced fairness in tree networks , 2004, Perform. Evaluation.

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

[15]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .

[16]  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.

[17]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[18]  V. V. Petrov.  Sums of Independent Random Variables , 1975 .

[19]  R. Mazumdar,et al.  Blocking probabilities for large multirate erlang loss systems , 1993, Advances in Applied Probability.

[20]  Thomas Bonald,et al.  Computational aspects of balanced fairness , 2003 .

[21]  Thomas Bonald,et al.  Congestion in large balanced multirate links , 2011, 2011 23rd International Teletraffic Congress (ITC).

[22]  Laurent Massoulié,et al.  A queueing analysis of max-min fairness, proportional fairness and balanced fairness , 2006, Queueing Syst. Theory Appl..

[23]  Thomas Bonald,et al.  Insensitive Traffic Models for Communication Networks , 2007, Discret. Event Dyn. Syst..