Skip to main content

Discrete-Time Queues with Constant Service Rate

  • Chapter
ATM Network Performance
  • 30 Accesses

Abstract

This chapter provides the necessary background on the performance of discrete-time queues with constant service rates. Well-known formulae for the queue occupancy processes are explained. Leaky buckets and associated “(σ,ρ)”-constraints on cell arrival processes are then described. Finally, simple statistical queueing results based on large deviations effective bandwidths and zero buffer approximations are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Discussion and References

  1. V. Anantharam and T. Konstantopoulos. Optimality and interchangeability of leaky buckets in tandem. Technical Report SCC-95–01, Dept of E. and C.E., U.T. Austin, Jan., 1995.

    Google Scholar 

  2. S. Asmussen. Applied probability and queues. Wiley, Chichester West Sussex, 1987.

    MATH  Google Scholar 

  3. D.D. Botvich and N.G. Duffield. Large deviations, the shape of the loss curve, and economies of scale in large multiplexers. Technical Report No. DIAS-APG-94–12, Dublin Institute for Advanced Studies, 1994.

    Google Scholar 

  4. C.-S. Chang. Stability, queue length and delay of deterministic and stochastic queueing networks. IEEE Trans. Auto. Control, Vol. 39:pp. 913–931, 1994.

    Article  MATH  Google Scholar 

  5. R. L. Cruz. A calculus for network delay, Part 1: Network elements in isolation. IEEE Trans. Inform. Theory, 37: 114131, 1991.

    Google Scholar 

  6. G. de Veciana, C. Courcoubetis, and J. Walrand. Decoupling bandwidths for networks: A decomposition approach to resource management for networks. In Proc. IEEE INFOCOM, volume 2, pages 466–473, 1994.

    Google Scholar 

  7. N.G. Duffield and N. O’Connell. Large deviations and overflow probabilities for the general single-server queue, with applications. Technical Report No. DIAS-APG-93–30, Dublin Institute for Advanced Studies, 1993.

    Google Scholar 

  8. R. Durrett. Probability: Theory and Examples. Wadsworth and Brooks, Pacific Groves, CA, 1991.

    MATH  Google Scholar 

  9. A.I. Elwalid and D. Mitra. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/A CM Trans. Networking, Vol. 1, No. 3:pp. 329–343, June 1993.

    Article  Google Scholar 

  10. R.J. Gibbens and P.J. Hunt. Effective bandwidths for multi-type UAS channel. Queueing Systems, Vol. 9, No. 1:pp. 17–28, 1991.

    Article  MATH  Google Scholar 

  11. P.W. Glynn and W. Whitt. Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Prob., 31, 1994.

    Google Scholar 

  12. S. Karlin and H.M. Taylor. A Second Course in Stochastic Processes. Academic Press Inc., New York, NY, 1981.

    MATH  Google Scholar 

  13. F.P. Kelly. Effective bandwidths of multi-class queues. Queueing Systems, Vol. 9, No. 1:pp. 5–16, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  14. G. Kesidis, J. Walrand, and C.-S. Chang. Effective bandwidths for multiclass Markov fluids and other ATM sources. IEEE/ACM Trans. Networking, Vol. 1, No. 4:pp. 424–428, Aug. 1993.

    Article  Google Scholar 

  15. J.W. Roberts. Virtual spacing for flexible traffic control. International Journal of Communication Systems, Vol. 7:pages 307–318, 1994.

    Article  Google Scholar 

  16. D. Tse, R.G. Gallager, and J.N. Tsitsiklis. Statistical multiplexing of multiple time-scaled Markov streams. IEEE JSAC, Vol. 13, No. 6:pages 1028–1038, Aug. 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kesidis, G. (1996). Discrete-Time Queues with Constant Service Rate. In: ATM Network Performance. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4568-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4568-9_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-4570-2

  • Online ISBN: 978-1-4757-4568-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics