Skip to main content
Log in

Closed polling models with failing nodes

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Closed polling systems with station breakdowns, under the gated, exhaustive or globally gated services regimes, are studied and analyzed. Multi-dimensional sets of probability generating functions of the system's state are derived. They are further utilized to obtain an approximate solution for the mean number of jobs residing in the system's various queues at polling instants. The analysis is then concentrated on the case of cyclic Bernoulli polling. Explicit formulae for the mean number of jobs, as well as for the expected cycle duration and system utilization, are derived. Comparison of the throughputs of the three regimes concludes the paper.

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.

Similar content being viewed by others

References

  1. E. Altman and U. Yechiali, Cyclic Bernoulli polling, ZOR–Methods and Models of Oper. Res. 38 (1993) 55–76.

    Article  Google Scholar 

  2. E. Altman and U. Yechiali, Polling in a closed network, Probab. in the Eng. and Inform. Sci. 8 (1994) 327–343.

    Article  Google Scholar 

  3. R. Armony and U. Yechiali, Polling systems with permanent and transient customers, Stochastic Models 15 (1999) 395–427.

    Google Scholar 

  4. O.J. Boxma and J.W. Cohen, The M/G/1 queue with permanent customers, IEEE Trans. Commun. 9 (1991) 179–184.

    Google Scholar 

  5. S. Browne and U. Yechiali, Dynamic priority rules for cyclic-type queues, Adv. in Appl. Probab. 21 (1989) 432–450.

    Article  Google Scholar 

  6. M. Eisenberg, Queues with periodic service and changeover time, Oper. Res. 20 (1972) 440–451.

    Article  Google Scholar 

  7. I. Eliazar and U. Yechiali, Polling under the randomly timed gated regime, Stochastic Models 14 (1998) 79–93.

    Google Scholar 

  8. S.W. Fuhrmann, H. Levy and M. Sidi, A queueing network with a single cyclically roving server, Queueing Systems 11 (1992) 121–144.

    Article  Google Scholar 

  9. D. Kofman and U. Yechiali, Polling systems with station breakdowns, Performance Evaluation 27/28 (1996) 647–672.

    Google Scholar 

  10. D. Kofman and U. Yechiali, Queueing networks with station breakdowns and globally gated service regime, in: Telletraffic Contribution for the Information Age, eds. V. Ramaswamy and P.E. Wirth (North-Holland, 1997) pp. 285–296.

  11. H. Levy and M. Sidi, Polling systems: Applications, modeling and optimization, IEEE Trans. Commun. 8 (1990) 1750–1760.

    Article  Google Scholar 

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

    Google Scholar 

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

  14. U. Yechiali, Analysis and control of polling systems, in: Performance Evaluation of Computer and Communications Systems, eds. L. Donatiello and R. Nelson (Springer, Berlin, 1993) pp. 630–650.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dror, H., Yechiali, U. Closed polling models with failing nodes. Queueing Systems 35, 55–81 (2000). https://doi.org/10.1023/A:1019181725107

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019181725107

Navigation