Stability of polling systems with exhaustive service policies and state-dependent routing

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 one. POLLING SYSTEM; STABILITY; ERGODICITY OF MARKOV CHAINS; GREEDY SERVER AMS 1991 SUBJECT CLASSIFICATIONS: PRIMARY 60K25, SECONDARY 60J27 ∗This work was done while the first author held a visiting position at Technical University of Braunschweig. Partial support was provided by the INTAS grant 93–820.

[1]  Edward G. Coffman,et al.  Polling and greedy servers on a line , 1987, Queueing Syst. Theory Appl..

[2]  Dirk P. Kroese,et al.  A continuous polling system with general service times , 1991 .

[3]  Volker Schmidt,et al.  Single-server queues with spatially distributed arrivals , 1994, Queueing Syst. Theory Appl..

[4]  Eitan Altman,et al.  Queueing in space , 1994, Advances in Applied Probability.

[5]  F. Baccelli,et al.  On the saturation rule for the stability of queues , 1995, Journal of Applied Probability.

[6]  Serguei Foss,et al.  Comparison Theorems and Ergodic Properties of Polling Systems , 1996 .

[7]  J. Doob.  Stochastic processes , 1953 .

[8]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[9]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[10]  Laurent Massoulié,et al.  Stability of non-Markovian polling systems , 1995, Queueing Syst. Theory Appl..

[11]  Andreas Brandt,et al.  Marked Point Processes on the Real Line: The Dynamical Approach , 1995 .

[12]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains: Explicit construction of Lyapounov functions , 1995 .

[13]  Wojciech Szpankowski,et al.  Stability of token passing rings , 1992, Queueing Syst. Theory Appl..

[14]  R. Schassberger,et al.  Ergodicity of a polling network , 1994 .

[15]  Christine Fricker,et al.  Monotonicity and stability of periodic polling models , 1994, Queueing Syst. Theory Appl..

[16]  A. Borovkov.  Ergodicity and stability of stochastic processes , 1998 .

[17]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains , 1995 .

[18]  modelsChristine Fricker,et al.  Monotonicity and stability of periodic polling , 1994 .

[19]  Jean-Marc Lasgouttes,et al.  A State-Dependent Polling Model with Markovian Routing , 1995 .

[20]  Serguei Foss,et al.  On the Stability of Greedy Polling Systems with General Service Policies , 1998, Probability in the Engineering and Informational Sciences.

[21]  Sean P. Meyn,et al.  State-Dependent Criteria for Convergence of Markov Chains , 1994 .

[22]  R. Schaβberger.  Stability of Polling Networks with State-Dependent Server Routing , 1995 .

[23]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .