Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baccelli, F., Brémaud, P.: Elements of Queueing Theory, 2nd edn. Stochastic Modelling and Applied Probability, vol. 47. Springer, Berlin (2003)
Berger, A.W., Kogan, Y.: Dimensioning bandwidth for elastic traffic in high-speed data networks. IEEE/ACM Trans. Netw. 8(5), 643–654 (2000)
Bonald, T.: Insensitive traffic models for communication networks. Discrete Event Dyn. Syst. 17(3), 405–421 (2007)
Bonald, T., Haddad, J.P., Mazumdar, R.R.: Congestion in large balanced multirate links. In: Proceedings of 23rd International Teletraffic Congress (2011)
Bonald, T., Massoulié, L., Proutière, A., Virtamo, J.: A queueing analysis of max–min fairness, proportional fairness and balanced fairness. Queueing Syst. Theory Appl. 53(1–2), 65–84 (2006)
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Syst. Theory Appl. 44(1), 69–100 (2003)
Bonald, T., Proutière, A., Roberts, J., Virtamo, J.: Computational aspects of balanced fairness. In: Proceedings of 18th International Teletraffic Congress, pp. 801–810. Elsevier Science, Amsterdam (2003)
Bonald, T., Virtamo, J.: Calculating the flow level performance of balanced fairness in tree networks. Perform. Eval. 58(1), 1–14 (2004)
Bonald, T., Virtamo, J.: A recursive formula for multirate systems with elastic traffic. IEEE Commun. Lett. 9(8), 753–755 (2005)
Gazdzicki, P., Lambadaris, I., Mazumdar, R.R.: Blocking probabilities for large multirate Erlang loss systems. Adv. Appl. Probab. 25, 997–1009 (1993)
Heyman, D.P., Lakshman, T.V., Neidhardt, A.L.: A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet. In: Proceedings of ACM SIGMETRICS, pp. 24–38 (1997)
Kaufman, J.S.: Blocking in a shared resource environment. IEEE Trans. Commun. 29, 1474–1481 (1981)
Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, Chichester (1979)
Kelly, F.P., Mauloo, A.K., Tan, D.K.H.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3), 237–252 (1998)
Kherani, A.A., Kumar, A.: Stochastic models for throughput analysis of randomly arriving elastic flows in the internet. In: Proceedings of IEEE INFOCOM (2002)
Louth, G., Mitzenmacher, M., Kelly, F.P.: Computational complexity of loss networks. Theor. Comput. Sci. 125(1), 45–59 (1994)
Low, S.H., Peterson, L.L., Wang, L.: Understanding tcp vegas: a duality model. J. ACM 49, 207–235 (2002)
Massoulié, L.: Structural properties of proportional fairness: stability and insensitivity. Ann. Appl. Probab. 17(3), 809–839 (2007)
Petrov, V.V.: Sums of Independent Random Variables. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 82. Springer, New York (1975)
Roberts, J.W., Massoulié, L.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185–201 (2000)
Roberts, J.W.: A service system with heterogeneous user requirement. In: Pujolle, G. (ed.) Performance of Data Communications Systems and Their Applications, pp. 423–431 (1981)
Serfozo, R.: Introduction to Stochastic Networks. Springer, Berlin (2005)
Walton, N.: Insensitive, maximum stable allocations converge to proportional fairness. Queueing Syst. 68, 51–60 (2011)
Whitt, W.: Stochastic-Process Limits. Springer Series in Operations Research. Springer, New York (2002)
Yaiche, H., Mazumdar, R.R., Rosenberg, C.P.: A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans. Netw. 8(5), 667–678 (2000)
Acknowledgements
The authors would like to thank Thomas Bonald for his insight and fruitful discussions. This research was supported in part by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Haddad, JP., Mazumdar, R.R. Congestion in large balanced multirate networks. Queueing Syst 74, 333–368 (2013). https://doi.org/10.1007/s11134-012-9322-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9322-x