Network of M/M/1 Cyclic Polling Systems

Carlos Martínez-Rodríguez, Raúl Montes-de-Oca, Patricia Saavedra


This paper presents a Network of Cyclic Polling Systems that consists of two cyclic polling systems with two queues each when transfer of users from one system to the other is imposed. This system is modelled in discrete time. It is assumed that each system has exponential inter-arrival times and the servers apply an exhaustive policy. Closed form expressions are obtained for the first and second moments of the queue's lengths for any time.


  1. Altman, E., Konstantopoulos, P., and Liu, Z. (1992). Stability, monotonicity and invariant quantities in general polling systems. Queueing Systems, 11(1-2):35-57.
  2. Aoun, M., Beekhuizen, P., and Argyriou, A. (2010). An analytical study of network coding in the presence of real-time messages. In 2010 IEEE International Symposium on Network Coding (NetCod), pages 1-6. IEEE.
  3. Beekhuizen, P. (2010). Performance analysis of networks on chips.
  4. Beekhuizen, P., Denteneer, D., and Adan, I. (2008a). Analysis of a tandem network model of a single-router network-on-chip. Annals of operations research, 162(1):19-34.
  5. Beekhuizen, P., Denteneer, D., and Resing, J. (2008b). Reduction of a polling network to a single node. Queueing Systems, 58(4):303-319.
  6. Beekhuizen, P. and Resing, J. A. C. (2009). Approximation of discrete-time polling systems via structured markov chains. In Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools, page 16. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
  7. Boon, M. A., Van der Mei, R., and Winands, E. M. (2011). Applications of polling systems. Surveys in Operations Research and Management Science, 16(2):67- 82.
  8. Boxma, O. J., Levy, H., and Yechiali, U. (1992). Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Annals of Operations Research, 35(3):187-208.
  9. Cooper, R. (1970). Queues served in cyclic order: Waiting times. Bell System Technical Journal, 49(3):399-413.
  10. Cooper, R. and Murray, G. (1969). Queues served in cyclic order. Bell System Technical Journal, 48(3):675-689.
  11. Cooper, R. B., Niu, S.-C., and Srinivasan, M. M. (1996). A decomposition theorem for polling models: The switchover times are effectively additive. Operations Research, 44(4):629-633.
  12. Fricker, C. and Jaibi, M. R. (1994). Monotonicity and stability of periodic polling models. Queueing systems, 15(1-4):211-238.
  13. Levy, H. and Sidi, M. (1990). Polling systems: applications, modeling, and optimization. IEEE Transactions on communications, 38(10):1750-1760.
  14. Takagi, H. (1986). Analysis of polling models. Cambridge, MIT Press, New York.
  15. van den Bos, L. and Boon, M. (2013). Networks of polling systems.
  16. Vishnevskii, V. and Semenova, O. (2006). Mathematical methods to study the polling systems. Automation and Remote Control, 67(2):173-220.

Paper Citation

in Harvard Style

Martínez-Rodríguez C., Montes-de-Oca R. and Saavedra P. (2017). Network of M/M/1 Cyclic Polling Systems . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 298-305. DOI: 10.5220/0006143802980305

in Bibtex Style

author={Carlos Martínez-Rodríguez and Raúl Montes-de-Oca and Patricia Saavedra},
title={Network of M/M/1 Cyclic Polling Systems},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},

in EndNote Style

JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Network of M/M/1 Cyclic Polling Systems
SN - 978-989-758-218-9
AU - Martínez-Rodríguez C.
AU - Montes-de-Oca R.
AU - Saavedra P.
PY - 2017
SP - 298
EP - 305
DO - 10.5220/0006143802980305