Skip to main content
Log in

Polling systems and multitype branching processes

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The joint queue length process in polling systems with and without switchover times is studied. If the service discipline in each queue satisfies a certain property it is shown that the joint queue length process at polling instants of a fixed queue is a multitype branching process (MTBP) with immigration. In the case of polling models with switchover times, it turns out that we are dealing with an MTBP with immigration in each state, whereas in the case of polling models without switchover times we are dealing with an MTBP with immigration in state zero. The theory of MTBPs leads to expressions for the generating function of the joint queue length process at polling instants. Sufficient conditions for ergodicity and moment calculations are also given.

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

Access this article

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. K.B. Athreya and P.E. Ney,Branching Processes (Springer-Verlag, Berlin, 1972).

    Google Scholar 

  2. J.E. Baker and I. Rubin, Polling with a general service order table, IEEE Trans. Commun. 35 (1987) 283–288.

    Google Scholar 

  3. O.J. Boxma, H. Levy and U. Yechiali, Cyclic reservation schemes for efficient operation of multiple queue single server systems, to appear in Ann. Oper. Res.

  4. S.W. Fuhrmann, Performance analysis of a class of cyclic schedules, Bell Laboratories technical memorandum 81-59531-1 (March 1981).

  5. S.W. Fuhrmann, A decomposition result for a class of polling models, IBM Research Report, Zürich (May 1991).

  6. S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalized vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  7. N. Kaplan, The multitype Galton-Watson process with immigration, Ann. Prob. 1 (1973) 947–953.

    Google Scholar 

  8. L. Kleinrock and H. Levy, The analysis of random polling systems, Oper. Res. 36 (1988) 716–732.

    Google Scholar 

  9. A.G. Konheim and H. Levy, Efficient analysis of polling systems, in:Proc. INFOCOM'92, Florence, Italy, May 1992.

  10. H. Levy, Optimization of polling systems: The fractional exhaustive service method, Technical report, Department of Computer Science, Tel Aviv University (1988).

  11. H. Levy, Analysis of cyclic polling systems with binomial gated service, in:Performance of Distributed and Parallel Systems, eds. T. Hasegawa, H. Takagi, Y. Takahashi (North-Holland, Amsterdam, 1989) pp. 127–139.

    Google Scholar 

  12. H. Levy and M. Sidi, Polling systems with correlated arrivals, IEEE Infocom 1989 (1989) 907–913.

    Google Scholar 

  13. A.G. Pakes, A branching process with a state dependent immigration component, Adv. Appl. Prob. 3 (1971) 301–314.

    Google Scholar 

  14. M.P. Quine, The multitype Galton-Watson process with immigration, J. Appl. Prob. 7 (1970) 411–422.

    Google Scholar 

  15. R. Ramaswamy and L.D. Servi, The busy period of theM/G/1 vacation model with a Bernoulli schedule, Commun. Stat.-Stoch. Models 4 (1988) 507–521.

    Google Scholar 

  16. J.A.C. Resing, Asymptotic results in feedback systems, Ph.D. Thesis, Technical University Delft (1990).

  17. E. Seneta,Non-negative Matrices and Markov Chains, 2nd ed. (Springer-Verlag, New York, 1981).

    Google Scholar 

  18. M. Sidi and H. Levy, Customers routing in polling systems, in:Performance 1990, eds. P.J.B. King, I. Mitrani and R.J. Pooley (North-Holland, Amsterdam, 1990) pp. 319–331.

    Google Scholar 

  19. H. Tkagi,Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).

    Google Scholar 

  20. H. Takagi, Analysis of polling systems with a mixture of exhaustive and gated service disciplines, J. Oper. Res. Soc. Jpn. 32 (1989) 450–161.

    Google Scholar 

  21. H. Takagi, Queueing analysis of polling models: an update,Stochastic Analysis of Computer and Communications Systems, ed. H. Takagi (Elsevier Science Publ., Amsterdam, 1990) pp. 267–318.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was done while the author was at the Centre for Mathematics and Computer Science (CWI) in Amsterdam, The Netherlands.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Resing, J.A.C. Polling systems and multitype branching processes. Queueing Syst 13, 409–426 (1993). https://doi.org/10.1007/BF01149263

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation