Skip to main content

A Queueing Model with Varying Service Rate for ABR

  • Conference paper
  • First Online:
Book cover Computer Performance Evaluation (TOOLS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1469))

Abstract

In this paper we study a queueing model with a server that changes its service rate according to a finite birth and death process. The object of interest is the simultaneous distribution of the number of customers in the system and the state of the server in steady-state. Both infinite and finite storage capacity for customers is considered. The influence of the operating time-scale is investigated by letting the underlying birth-death process move infinitely fast as well as infinitely slow. The model can be applied to the performance analysis of (low priority) Available Bit Rate (ABR) traffic at an ATM switch in the presence of traffic with a higher priority such as Variable Bit Rate (VBR) traffic and Constant Bit Rate (CBR) traffic. For a specific example we illustrate by numerical experiments the influence of the latter traffic types on the ABR service.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. E. Altman, D. Artiges, K. Traore. On the integration of best-effort and guaranteed performance services. INRIA Research Report 3222 (1997).

    Google Scholar 

  2. The ATM Forum Technical Committee. Traffic Management Specification. Version 4.0, April 1996.

    Google Scholar 

  3. S. Blaabjerg, G. Fodor, M. Telek, A.T. Andersen. A partially blocking-queueing system with CBR/VBR and ABR/UBR arrival streams. Institute of Telecommunications, Technical University of Denmark (internal report, 1997).

    Google Scholar 

  4. J.W. Cohen. The Single Server Queue. North-Holland Publishing Company, Amsterdam, 2nd edition, 1982.

    MATH  Google Scholar 

  5. J.N. Daigle, D.M. Lucantoni. Queueing systems having phase-dependent arrival and service rates. Numerical Solution of Markov Chains (1991), W.J. Stewart (ed.), 161–202.

    Google Scholar 

  6. G. Falin, Z. Khalil, D.A. Stanford. Performance analysis of a hybrid switching system where voice messages can be queued. Queueing Systems 16 (1994), 51–65.

    Article  MATH  MathSciNet  Google Scholar 

  7. H.R. Gail, S.L. Hantler, B.A. Taylor. On a preemptive Markovian queue with multiple servers and two priority classes. Mathematics of Operations Research 17 (1992), 365–391.

    Article  MATH  MathSciNet  Google Scholar 

  8. H.R. Gail, S.L. Hantler, B.A. Taylor. Spectral analysis of M/G/1 and G/M/1 type Markov chains. Advances in Applied Probability 28 (1996), 114–165.

    Article  MATH  MathSciNet  Google Scholar 

  9. I. Gohberg, P. Lancaster, L. Rodman. Matrix Polynomials. Academic Press, New York, 1982.

    MATH  Google Scholar 

  10. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press (1987).

    Google Scholar 

  11. L.A. Kulkarni, S.-Q. Li. Performance analysis of rate based feedback control for ATM networks. Proceedings of IEEE INFOCOM’ 97, Kobe, Japan (1997), 795–804.

    Google Scholar 

  12. G. Latouche, V. Ramaswami. A logarithmic reduction algorithm for quasi-birth-death processes. J. Appl. Probab. 30 (1993), no. 3, 650–674.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Marcus, H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Inc., Boston, 1964.

    MATH  Google Scholar 

  14. I. Mitrani, R. Chakka. Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method. Performance Evaluation 23 (1995), 241–260.

    Article  MATH  Google Scholar 

  15. I. Mitrani, P.J.B. King. Multiprocessor systems with preemptive priorities. Performance Evaluation 1 (1981), 118–125.

    Article  MATH  MathSciNet  Google Scholar 

  16. I. Mitrani, D. Mitra. A spectral expansion method for random walks on semiinfinite strips. In: Iterative Methods in Linear Algebra, ed. by R. Beauwens and P. de Groen, Proceedings of the IMACS international symposium, Brussels, Belgium (1991).

    Google Scholar 

  17. M.F. Neuts. Matrix-geometric Solutions in Stochastic Models-An Algorithmic Approach. The Johns Hopkins University Press, Baltimore, 1981.

    MATH  Google Scholar 

  18. R. Núñez Queija, O.J. Boxma. Analysis of a multi-server queueing model of ABR. To appear in J. Applied Mathematics and Stochastic Analysis.

    Google Scholar 

  19. R. Núñez Queija. Steady-state analysis of a queue with varying service rate. CWI Report PNA-R9712 (1997).

    Google Scholar 

  20. R. Núñez Queija. A queue with varying service rate for ABR. Internal report (1998).

    Google Scholar 

  21. B.N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, 1980.

    MATH  Google Scholar 

  22. S.F. Yashkov. Mathematical problems in the theory of shared-processor queueing systems. J. Soviet Mathematics 58 (1992), no. 2, 101–147.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Núñez-Queija, R. (1998). A Queueing Model with Varying Service Rate for ABR. In: Puigjaner, R., Savino, N.N., Serra, B. (eds) Computer Performance Evaluation. TOOLS 1998. Lecture Notes in Computer Science, vol 1469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68061-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-68061-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64949-6

  • Online ISBN: 978-3-540-68061-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics