Abstract
We consider a single-server cyclic polling system with three queues where the server follows an adaptive rule: if it finds one of queues empty in a given cycle, it decides not to visit that queue in the next cycle. In the case of limited service policies, we prove stability and instability results under some conditions which are sufficient but not necessary, in general. Then we discuss open problems with identifying the exact stability region for models with limited service disciplines: we conjecture that a necessary and sufficient condition for the stability may depend on the whole distributions of the primitive sequences, and illustrate that by examples. We conclude the paper with a section on the stability analysis of a polling system with either gated or exhaustive service disciplines.
Similar content being viewed by others
References
Borst, S. C. (1995). Polling systems CWI tracts, vol. 115. Amsterdam: Centrum voor Wiskunde en Informatica
Boxma, O. J., Bruin, J., & Fralix, B. H. (2009). Sojourn times in polling systems with various service disciplines. Performance Evaluation, 66, 621–639.
Bramson, M. (1998). Stability of two families of queueing networks and a discussion of fluid limits. Queueing Systems, 28, 7–31.
Chen, H., & Mandelbaum, A. (1991). Discrete flow networks: Bottlenecks analysis and fluid approximations. Mathematics of Operations Research, 16, 408–446.
Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid models. The Annals of Applied Probability, 5, 49–77.
Dai, J. G. (1996). A fluid limit model criterion for instability of multiclass queueing networks. The Annals of Applied Probability, 6, 751–757.
Dai, J. G., & Meyn, S. P. (1995). Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Transactions on Automatic Control, 40, 1889–1904.
Dai, J. G., Hasenbein, J. J., & Kim, B. (2007). Stability of join-the-shortest-queue networks. Queueing Systems, 57(4), 129–145.
Down, D. G. (1996). On the stability of polling models with multiple servers. Journal of Applied Probability, 35, 925–935.
Foss, S., & Kovalevskii, A. (1999). A stability criterion via fluid limits and its application to a polling system. Queueing Systems, 32, 131–168.
Rybko, A. N., & Stolyar, A. L. (1992). Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Information Transmission, 28, 3–26.
Stolyar, A. L. (1995). On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes. Markov Processes and Related Fields, 1, 491–512.
Vishnevsky, V. M., & Semenova, O. V. (2008). Adaptive dynamical polling in wireless networks. Cybernetics and Information Technologies, 8, 3–11.
Wierman, A., Winands, E. M. M., & Boxma, O. J. (2007). Scheduling in polling systems. Performance Evaluation, 64, 1009–1028.
Winands, E. M. M., Adan, I. J. B. F., van Houtum, G. J., & Down, D. G. (2009). A state-dependent polling model with k-limited service. Probability in the Engineering and Informational Sciences, 23, 385–408.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chernova, N., Foss, S. & Kim, B. On the stability of a polling system with an adaptive service mechanism. Ann Oper Res 198, 125–144 (2012). https://doi.org/10.1007/s10479-011-0963-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0963-7