Stochastic Systems

Flow-level convergence and insensitivity for multi-class queueing networks

Neil Stuart Walton

Full-text: Open access

Enhanced PDF (355 KB)

Abstract

We consider a multi-class queueing network as a model of packet transfer in a communication network. We define a second stochastic model as a model of document transfer in a communication network where the documents transferred have a general distribution. We prove the weak convergence of the multi-class queueing process to the document transfer process. Our convergence result allows the comparison of general document size distributions, and consequently, we prove general insensitivity results for the limit queueing process. We discuss how this separation of time-scales method of proving insensitivity may be applied to other insensitive queueing systems.

Article information

Source
Stoch. Syst., Volume 2, Number 1 (2012), 115-148.

Dates
First available in Project Euclid: 24 February 2014

Permanent link to this document
https://projecteuclid.org/euclid.ssy/1393252042

Digital Object Identifier
doi:10.1214/11-SSY025

Mathematical Reviews number (MathSciNet)
MR3352976

Zentralblatt MATH identifier
1298.60094

Subjects
Primary: 60K25: Queueing theory [See also 68M20, 90B22] 60G17: Sample path properties
Secondary: 90B18: Communication networks [See also 68M10, 94A05]

Citation

Walton, Neil Stuart. Flow-level convergence and insensitivity for multi-class queueing networks. Stoch. Syst. 2 (2012), no. 1, 115--148. doi:10.1214/11-SSY025. https://projecteuclid.org/euclid.ssy/1393252042


Export citation

References

  • [1] 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.
    Mathematical Reviews (MathSciNet): MR440729
    Digital Object Identifier: doi:10.2307/1426145
  • [2] 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.
    Mathematical Reviews (MathSciNet): MR365749
    Digital Object Identifier: doi:10.1145/321879.321887
  • [3] Billingsley, P. (1999). Convergence of Probability Measures. Wiley, New York.
    Mathematical Reviews (MathSciNet): MR1700749
  • [4] Bonald, T. and Proutière, A. (2004). On performance bounds for balanced fairness. Performance Evaluation, 55 25–50.
  • [5] Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer, New York.
    Mathematical Reviews (MathSciNet): MR1835969
  • [6] Feuillet, M. and Robert, P. (2012). A Scaling Analysis of a Transient Stochastic Network (I). ArXiv e-prints. 1203.6848.
    Mathematical Reviews (MathSciNet): MR2977408
    Digital Object Identifier: doi:10.1239/aap/1339878724
    Project Euclid: euclid.aap/1339878724
  • [7] 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.
    Mathematical Reviews (MathSciNet): MR2498678
    Digital Object Identifier: doi:10.1214/08-AAP541
    Project Euclid: euclid.aoap/1235140339
  • [8] 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.
    Mathematical Reviews (MathSciNet): MR2569806
    Digital Object Identifier: doi:10.1214/08-AAP591
    Project Euclid: euclid.aoap/1255699542
  • [9] 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.
    Mathematical Reviews (MathSciNet): MR388571
    Digital Object Identifier: doi:10.2307/3212869
  • [10] Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, Chicester.
    Mathematical Reviews (MathSciNet): MR554920
  • [11] 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.
    Mathematical Reviews (MathSciNet): MR2071416
    Digital Object Identifier: doi:10.1214/105051604000000224
    Project Euclid: euclid.aoap/1089736278
  • [12] Kleinrock, L. (1967). Time-shared systems: a theoretical treatment. J. ACM, 14 242–261.
    Mathematical Reviews (MathSciNet): MR273994
    Digital Object Identifier: doi:10.1145/321386.321388
  • [13] M. Frolkova, J. R. and Zwart, B. (2012). Limit theorems for bandwidth sharing networks with rate constraints. Preprint.
  • [14] Massoulié, L. and Roberts, J. (1998). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15 185–201.
  • [15] Massoulié, L. and Roberts, J. (1999). Bandwidth sharing: Objectives and algorithms. IEEE Infocom 1999, 10 320–328.
  • [16] 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.
  • [17] 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.
  • [18] Virtamo, J. (2003). Insensitivity of a network of symmetric queues with balanced service rates. Internal Report.
  • [19] Walton, N. S. (2009). Proportional fairness and its relationship with multi-class queueing networks. Ann. Appl. Probab., 22 2301–2333.
    Mathematical Reviews (MathSciNet): MR2588246
    Digital Object Identifier: doi:10.1214/09-AAP612
    Project Euclid: euclid.aoap/1259158773
  • [20] Zachary, S. (2007). A note on insensitivity in stochastic networks. J. Appl. Probab., 44 238–248.
    Mathematical Reviews (MathSciNet): MR2312999
    Digital Object Identifier: doi:10.1239/jap/1175267175
    Project Euclid: euclid.jap/1175267175

INFORMS Applied Probability Society

Stochastic Systems
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more