Abstract
We review two areas of recent research linking proportional fairness with product form networks. The areas concern, respectively, the heavy traffic and the large deviations limiting regimes for the stationary distribution of a flow model, where the flow model is a stochastic process representing the randomly varying number of document transfers present in a network sharing capacity according to the proportional fairness criterion. In these two regimes we postulate the limiting form of the stationary distribution, by comparison with several variants of the fairness criterion. We outline how product form results can help provide insight into the performance consequences of resource pooling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003)
Bonald, T., Massoulié, L.: Impact of fairness on Internet performance. Proc. ACM Sigmetrics 29, 82–91 (2001)
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Syst. 44, 69–100 (2003)
Bonald, T., Proutière, A.: On performance bounds for balanced fairness. Perform. Evaluation 55, 25–50 (2004)
Bonald, T., Massoulié, L., Proutière, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. 53, 65–84 (2006)
Chen, H., Yao, D.D.: Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer, New York (2001)
Cohen, J.W.: The multiple phase service network with generalized processor sharing. Acta Inform. 12, 245–284 (1979)
Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications. Springer, New York (1998)
De Veciana, G., Lee, T.J., Konstantopoulos, T.: Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Netw. 9, 2–14 (2001)
Dukkipati, N., Kobayashi, M., Zhang-Shen, R., McKeown, N.: Processor sharing flows in the Internet. In: Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany (2005)
Han, H., Shakkottai, S., Hollot, C.V., Srikant, R., Towsley, D.: Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity on the Internet. IEEE/ACM Trans. Netw. 14, 1260–1271 (2006)
Kang, W.N., Kelly, F.P., Lee, N.H., Williams, R.J.: State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. To appear in Ann. Appl. Probab. (2009)
Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, Chicester (1979)
Kelly, F.P.: On a class of approximations for closed queueing networks. Queueing Syst. 4, 69–76 (1989)
Kelly, F.P.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8, 33–37 (1997)
Kelly, F.P., Laws, C.N.: Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Syst. 13, 47–86 (1993)
Kelly, F.P., Williams, R.J.: Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14, 1055–1083 (2004)
Key, P., Massoulié, L.: Fluid models of integrated traffic and multipath routing. Queueing Syst. 53, 85–98 (2006)
Kleinrock, L.: Time-shared systems: a theoretical treatment. J. ACM 14, 242–261 (1967)
Le Boudec, J.-Y., Radunovic, B.: Rate performance objectives of multihop wireless networks. IEEE Trans. Mob. Comput. 3, 334–349 (2004)
Massoulié, L.: Structural properties of proportional fairness: stability and insensitivity. Ann. Appl. Probab. 17, 809–839 (2007)
Massoulié, L., Roberts, J.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185–201 (1998)
Massoulié, L., Roberts, J.: Bandwidth sharing: objectives and algorithms. IEEE Infocom. 10(3), 320–328 (1999)
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8, 556–567 (2000)
Pittel, B.: Closed exponential networks of queues with saturation. Math. Oper. Res. 4, 357–378 (1979)
Proutière, A.: Insensitivity and stochastic bounds in queueing networks—Application to flow level traffic modelling in telecommunication networks. Ph.D. thesis, Ecole Doctorale de l’Ecole Polytechnique (2003)
Schweitzer, P.J.: Approximate analysis of multiclass closed networks of queues. In: Proceedings of the International Conference on Stochastic Control and Optimization. Free University, Amsterdam, 1–5 (1979)
Srikant, R.: The Mathematics of Internet Congestion Control. Birkhauser, Boston (2004)
Walton, N.S.: Proportional fairness and its relationship with multi-class queueing networks. To appear in Ann. Appl. Probab. (2009)
Williams, D.: Probability with Martingales. Cambridge University Press, Cambridge (1991)
Wischik, D., Handley, M., Bagnulo Braun, M.: The resource pooling principle. Comput. Commun. Rev. 38(5), 47–52 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kelly, F.P., Massoulié, L. & Walton, N.S. Resource pooling in congested networks: proportional fairness and product form. Queueing Syst 63, 165 (2009). https://doi.org/10.1007/s11134-009-9143-8
Received:
Revised:
Published:
DOI: https://doi.org/10.1007/s11134-009-9143-8