Stability of polling systems with exhaustive service policies and state-dependent routing. (English) Zbl 0863.60091

Summary: We consider a polling system with a finite number of stations fed by compound Poisson arrival streams of customers asking for service. A server travels through the system and upon arrival at a station the server serves all waiting customers until the queue is empty, where the service time distribution depends on the station. The choice of the station to be visited next as well as the corresponding walking time may depend on the whole current state. Examples are systems with a greedy-type routing mechanism. Under appropriate independence assumptions it is proved that the system is stable if and only if the workload is less than 1.


60K25 Queueing theory (aspects of probability theory)
60J27 Continuous-time Markov processes on discrete state spaces
Full Text: DOI


[1] ALTMAN, E. and LEVY, H. 1994. Queueing in space. Adv. in Appl. Probab. 26 1095 1116. Z. JSTOR: · Zbl 0824.60097
[2] BACCELLI, F. and FOSS, S. 1995. On the saturation rule for the stability of queues. J. Appl. Probab. 32 494 507. Z. JSTOR: · Zbl 0823.60092
[3] BOROVKOV, A. A. 1994. Ergodicity and Stability of Stochastic Processes. TVP Publishers, Moscow. To appear. Z.
[4] BOROVKOV, A. A. and SCHASSBERGER, R. 1994. Ergodicity of a polling network. Stochastic Process. Appl. 50 253 262. Z. · Zbl 0802.60084
[5] COFFMAN, E. G., JR. and GILBERT, E. N. 1987. Polling and greedy servers on a line. Queueing Sy stems Theory Appl. 2 115 145. Z. · Zbl 0653.90021
[6] DAI, J. G. 1995. On positive Harris recurrence for multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5 49 77. Z. · Zbl 0822.60083
[7] FAy OLLE, G. and LASGOUTTES, J. 1994. A state-dependent polling model with Markovian routing. INRIA Report 2279. Z.
[8] FAy OLLE, G., MALy SHEV, V. A. and MENSHIKOV, M. V. 1995. Topics in the Constructive Theory of Countable Markov Chains. Cambridge Univ. Press. Z.
[9] FOSS, S. and CHERNOVA, N. 1996. Ergodic properties of polling sy stems. Problems Inform. Transmission. To appear. Z. · Zbl 1038.60502
[10] FOSS, S. and LAST, G. 1995. On the stability of greedy polling sy stems with general service policies. Preprint. Z.
[11] FRICKER, C. and JAIBI, M. R. 1994. Monotonicity and stability of periodic polling sy stems. Queueing Sy stems Theory Appl. 15 211 238. Z. · Zbl 0789.60092
[12] GEORGIADIS, L. and SZPANKOWSKI, W. 1992. Stability of token passing rings. Queueing Sy stems Theory Appl. 11 7 34.Z. · Zbl 0748.68004
[13] KROESE, D. P. and SCHMIDT, V. 1992. A continuous polling sy stem with general service times. Ann. Appl. Probab. 2 906 927. Z. · Zbl 0772.60075
[14] KROESE, D. P. and SCHMIDT, V. 1994. Single-server queues with spatially distributed arrivals. Queueing Sy stems Theory Appl. 17 317 345. · Zbl 0806.60084
[15] LAST, G. and BRANDT, A. 1995. Marked Point Processes on the Real Line: The Dy namic Approach. Springer, New York. Z. · Zbl 0829.60038
[16] LEVY, H., SIDI, M. and BOXMA, O. J. 1990. Dominance relations in polling sy stems. Queueing Sy stems Theory Appl. 6 155 171. Z. · Zbl 0712.60103
[17] MALy SHEV, V. A. and MENSHIKOV, M. V. 1982. Ergodicity, continuity and analyticity of countable Markov chains. Trans. Moscow Math. Soc. 1 1 48. Z. · Zbl 0459.60059
[18] MASSOULIE, L. 1995. Stability of non-Markovian polling sy stems. Queueing Sy stems Theory Áppl. 21 67 95. Z. · Zbl 0851.60089
[19] MEy N, S. P. and TWEEDIE, R. L. 1993. Markov Chains and Stochastic Stability. Springer, London. Z. · Zbl 0925.60001
[20] MEy N, S. P. and TWEEDIE, R. L. 1994. State-dependent criteria for convergence of Markov chains. Ann. Appl. Probab. 4 149 168. Z. · Zbl 0803.60060
[21] SCHASSBERGER, R. 1993. Stability of polling networks with state-dependent server routing. Technical Report 12 93, Technical Univ. Braunschweig. Z.
[22] TAGAKI, H. 1990. Queueing analysis of polling sy stems. In Stochastic Analy sis of Computer and Z. Communication Sy stems H. Takagi, ed. 267 318. North-Holland, Amsterdam.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.