Skip to main content
SpringerLink
Log in

A numerical approach to cyclic-service queueing models

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

An iterative numerical technique for the evaluation of queue length distributions is applied to multi-queue systems with one server and cyclic service discipline with Bernoulli schedules. The technique is based on power-series expansions of the state probabilities as functions of the load of the system. The convergence of the series is accelerated by applying a modified form of the epsilon algorithm. Attention is paid to economic use of memory space.

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. J.P.C. Blanc, A note on waiting times in systems with queues in parallel, J. Appl. Probab. 24 (1987) 540–546.

    Article  Google Scholar 

  2. J.P.C. Blanc, On a numerical method for calculating state probabilities for queueing systems with more than one waiting line, J. Comput. Appl. Math. 20 (1987) 119–125.

    Article  Google Scholar 

  3. J.P.C. Blanc, A numerical study of a coupled processor model, in:Computer Performance and Reliability, eds. G. Iazeolla, P.J. Courtois and O.J. Boxma (North-Holland, Amsterdam, 1988) pp. 289–303.

    Google Scholar 

  4. O.J. Boxma and W.P. Groenendijk, Pseudo conservation laws in cyclic-service systems, J. Appl. Probab. 24 (1987) 949–964.

    Article  Google Scholar 

  5. O.J. Boxma and B.W. Meister, Waiting-time approximations in multi-queue systems with cyclic service, Perform. Eval. 7 (1987) 59–70.

    Article  Google Scholar 

  6. C. Brezinski,Accélération de la Convergence en Analyse Numérique, Lecture Notes in Mathematics 584 (Springer, Heidelberg, 1977).

    Google Scholar 

  7. R.B. Cooper, Queues served in cyclic order: waiting times, Bell Syst. Techn. J. 49 (1970) 399–413.

    Google Scholar 

  8. G. Hooghiemstra, M. Keane and S. van de Ree, Power series for stationary distributions of coupled processor models, SIAM J. Appl. Math. 48 (1988) 1159–1166.

    Article  Google Scholar 

  9. P.J. Kühn, Multi-queue systems with non-exhaustive cyclic service, Bell Syst. Techn. J. 58 (1979) 671–698.

    Google Scholar 

  10. L.D. Servi, Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules, IEEE J. Sel. Areas Comm. SAC-4 (1986) 813–822.

    Article  Google Scholar 

  11. H. Takagi,Analysis of Polling Systems (The MIT Press, Cambridge, MA, 1986).

    Google Scholar 

  12. K.S. Watson, Performance evaluation of cyclic service strategies — a survey, in:Performance '84, ed. E. Gelenbe (North-Holland, Amsterdam, 1985) pp. 521–533.

    Google Scholar 

  13. P. Wynn, On the convergence and stability of the epsilon algorithm, SIAM J. Numer. Anal. 3 (1966) 91–122.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tilburg University, Faculty of Economics, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands

    J. P. C. Blanc

Authors
  1. J. P. C. Blanc
    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

Blanc, J.P.C. A numerical approach to cyclic-service queueing models. Queueing Syst 6, 173–188 (1990). https://doi.org/10.1007/BF02411472

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation