Flow-level Convergence and Insensitivity for Multi-class Queueing Networks

References

• Barbour, A. D. (1976). Networks of queues and the method of stages. Advances in Applied Probability, 8 pp. 584–591. URL http://www.jstor.org/stable/1426145. MR0440729Google Scholar
• Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975). Open, closed, and mixed networks of queues with different classes of customers. J. ACM, 22 248–260. MR0365749Google Scholar
• Billingsley, P. (1999). Convergence of Probability Measures. Wiley, New York. MR1700749Google Scholar
• Bonald, T. and Proutière, A. (2004). On performance bounds for balanced fairness. Performance Evaluation, 55 25–50.Google Scholar
• Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer, New York. MR1835969Google Scholar
• Feuillet, M. and Robert, P. (2012). A Scaling Analysis of a Transient Stochastic Network (I). ArXiv e-prints. 1203.6848. MR2977408Google Scholar
• Gromoll, H. and Williams, R. (2009). Fluid limits for networks with bandwidth sharing and general document size distributions. Annals of Applied Probability, 19 243–280. MR2498678Google Scholar
• Kang, W. N., Kelly, F. P., Lee, N. H. and Williams, R. J. (2009). State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab., 19 1719–1780. MR2569806Google Scholar
• Kelly, F. P. (1975). Networks of queues with customers of different types. Journal of Applied Probability, 12 542–554. URL http://www.jstor.org/stable/3212869. MR0388571Google Scholar
• Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, Chicester. MR0554920Google Scholar
• Kelly, F. P. and Williams, R. J. (2004). Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab., 14 1055–1083. MR2071416Google Scholar
• Kleinrock, L. (1967). Time-shared systems: a theoretical treatment. J. ACM, 14 242–261. MR0273994Google Scholar
• M. Frolkova, J. R. and Zwart, B. (2012). Limit theorems for bandwidth sharing networks with rate constraints. Preprint.Google Scholar
• Massoulié, L. and Roberts, J. (1998). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15 185–201. MR1743809Google Scholar
• Massoulié, L. and Roberts, J. (1999). Bandwidth sharing: Objectives and algorithms. IEEE Infocom 1999, 10 320–328.Google Scholar
• Proutière, A. (2003). 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.Google Scholar
• van de Ven, P., Borst, S., van Leeuwaarden, J. and Proutière, A. (2010). Insensitivity and stability of random-access networks. Performance Evaluation, 67 1230–1242. URL http://www.sciencedirect.com/science/article/pii/S0166531610001082.Google Scholar
• Virtamo, J. (2003). Insensitivity of a network of symmetric queues with balanced service rates. Internal Report.Google Scholar
• Walton, N. S. (2009). Proportional fairness and its relationship with multi-class queueing networks. Ann. Appl. Probab., 22 2301–2333. MR2588246Google Scholar
• Zachary, S. (2007). A note on insensitivity in stochastic networks. J. Appl. Probab., 44 238–248. MR2312999Google Scholar