Skip to main content
SpringerLink
Log in

On the role of Rouché's theorem in queueing analysis

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In analytic queueing theory, Rouché's theorem is frequently used, and when it can be applied, leads quickly to tangible results concerning ergodicity and performance analysis. For more complicated models it is sometimes difficult to verify the conditions needed to apply the theorem. The natural question that arises is: Can one dispense with this theorem, in particular when the ergodicity conditions are known? In the present study we consider an M/G/1-type queueing problem which can be modelled byN coupled random walks. It is shown that it can be fully analysed without using Rouché's theorem, once it is known that the relevant functional equation has a unique solution with prescribed regularity properties.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.G. Down and O.J. Boxma, A polling model with threshold switching, in:Proceedings of the Nordic Teletraffic Seminar NTS-12, eds. I. Norros and J. Virtamo (Espoo, Finland, 1995).

    Google Scholar 

  2. H.R. Gail, S.L. Hantler and B.A. Taylor, Spectral analysis of M/G/1 and G/M/1 type Markov chains,Stochastic Models 10 (1994) 1–43.

    Google Scholar 

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

    Google Scholar 

  4. D.-S. Lee and B. Sengupta, Queueing analysis of a threshold based priority scheme for ATM networks,IEEE/ACM Transactions on Networking 1 (1993) 709–717.

    Google Scholar 

  5. T. Lindvall,Lectures on the Coupling Method (Wiley, New York, 1992).

    Google Scholar 

  6. M. Marcus and H. Minc,A Survey of Matrix Theory and Matrix Inequalities (Allyn and Bacon, Boston, 1964).

    Google Scholar 

  7. S.P. Meyn and R.L. Tweedie,Markov Chains and Stochastic Stability (Springer-Verlag, London, 1993).

    Google Scholar 

  8. I. Mitrani and D. Mitra, A spectral expansion method for random walks on semi-infinite strips, in:Iterative Methods in Linear Algebra, eds. R. Beauwens and P. de Groen (Elsevier, 1992).

  9. M.F. Neuts, Queues solvable without Rouché's theorem,Operations Research 27 (1979) 767–781.

    Google Scholar 

Download references

Author information

Author notes

  1. D. G. Down

    Present address: School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332, Atlanta, Georgia, USA

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1090, GB Amsterdam, The Netherlands

    J. W. Cohen & D. G. Down

Authors
  1. J. W. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. G. Down
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cohen, J.W., Down, D.G. On the role of Rouché's theorem in queueing analysis. Queueing Syst 23, 281–291 (1996). https://doi.org/10.1007/BF01206561

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206561

Keywords

Search

Navigation