Queueing Systems

, Volume 9, Issue 1–2, pp 5–15

Effective bandwidths at multi-class queues

  • F. P. Kelly
Article

Abstract

Consider a queue which serves traffic from a number of distinct sources and which is required to deliver a performance guarantee, expressed in terms of the mean delay or the probability the delay exceeds a threshold. For various simple models we show that an effective bandwidth can be associated with each source, and that the queue can deliver its performance guarantee by limiting the sources served so that their effective bandwidths sum to less than the capacity of the queue.

Keywords

Large deviations M/G/1 queue circuit-switched network connection acceptance control 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Brockmeyer, H.L. Halstrom and A. Jensen,The Life and Works of A.K. Erlang (Academy of Technical Sciences, Copenhagen, 1948).Google Scholar
  2. [2]
    P. Billingsley,Probability and Measure, 2nd ed. (Wiley, New York, 1986).Google Scholar
  3. [3]
    O.J. Boxma and A.G. Konheim, Approximate analysis of exponential queueing systems with blocking, Acta Informatica 15 (1981) 19–66.Google Scholar
  4. [4]
    Z. Dziong, J. Choquette, K.-Q. Liao and L. Mason, Admission control and routing in ATM networks,ITC Specialist Seminar, Adelaide (1989).Google Scholar
  5. [5]
    W. Feller,An Introduction to Probability Theory and its Applications, vol. 1, 2nd ed. (Wiley, New York, 1971).Google Scholar
  6. [6]
    R.J. Gibbens, P.J. Hunt and F.P. Kelly, On models of buffering, in preparation.Google Scholar
  7. [7]
    R.J. Gibbens and F.P. Kelly, Dynamic routing in fully connected networks, IMA J. Math. Control Info. 7 (1990) 77–111.Google Scholar
  8. [8]
    T.R. Griffiths, Analysis of connection acceptance strategies in asynchronous transfer mode networks,7th UK Teletraffic Symp., Durham (1990).Google Scholar
  9. [9]
    J.Y. Hui, Resource allocation for broadband networks, IEEE Selected Areas in Commun. SAC-6 (1988) 1598–1608.Google Scholar
  10. [10]
    J.Y. Hui,Switching and Traffic Theory for Integrated Broadband Networks (Kluwer, Boston, 1990).Google Scholar
  11. [11]
    F.P. Kelly,Reversibility and Stochastic Networks (Wiley, Chichester, 1979).Google Scholar
  12. [12]
    F.P. Kelly, The throughput of a series of buffers, Advan. Appl. Prob. 14 (1982) 633–653.Google Scholar
  13. [13]
    F.P. Kelly, Routing in circuit-switched networks: optimization, shadow prices and decentralization, Advan. Appl. Prob. 20 (1988) 112–144.Google Scholar
  14. [14]
    F.P. Kelly, Loss networks, Ann. Appl. Prob. 1 (1991).Google Scholar
  15. [15]
    J.F.C. Kingman, The heavy traffic approximation in the theory of queues, in:Proc. Symp. on Congestion Theory, eds. W.L. Smith and W. Wilkinson (University of North Carolina Press, Chapel Hill, 1965) pp. 137–169.Google Scholar
  16. [16]
    J.F.C. Kingman, Inequalities in the theory of queues, J. Roy. Stat. Soc., Series B 32 (1970) 102–110.Google Scholar
  17. [17]
    S.M. Ross, Bounds on the delay distribution inGI/G/1 queues, J. Appl. Prob. 11 (1974) 417–421.Google Scholar
  18. [18]
    W.L. Smith, On the distribution of queueing times, Proc. Cambridge Phil. Soc. 49 (1953) 449–461.Google Scholar
  19. [19]
    W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Bell Labs. Tech. J. 64 (1985) 1807–1856.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1991

Authors and Affiliations

  • F. P. Kelly
    • 1
  1. 1.Statistical LaboratoryUniversity of CambridgeCambridgeEngland

Personalised recommendations