Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T01:28:53.393Z Has data issue: false hasContentIssue false
  • English
  • Français

Stability of Polling Networks with State-Dependent Server Routing

Published online by Cambridge University Press:  27 July 2009

R. Schaβberger
R. Schaβberger
Affiliation:
Technical University of Braunschweig, D38106 Braunschweig, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

The polling network considered here consists of a finite collection of stations visited successively by a single server according to a state-dependent routing scheme. At every visit of a station, a possibly random number of customers are served and depart from the network thereafter. The server takes a possibly random time to walk from one station to the next. The network receives groups of customers at Poisson instants. These customers are distributed randomly over the stations and wait until served. A necessary condition for stability is derived, which proves to be also sufficient in certain special cases. Such cases include a starlike network and a ringlike one with a greedy service policy. Mathematically, positive recurrence of a Markov chain is studied.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 9 , Issue 4 , October 1995 , pp. 539 - 550
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Borovkov, A.A. & Schassberger, R. (1994). Ergodocity of a polling network. Stochastic Processes and Their Applications 50: 253–262.CrossRefGoogle Scholar
2.Coffman, E.G. Jr, & Gilbert, E.N. (1987). Polling and greedy servers on a line. Queuing Systems 2: 115–145.CrossRefGoogle Scholar
3.Fricker, C. & Jaibi, M.R. (1994). Monotonicity and stability of periodic polling models. Queuing Systems 15: 211–238.CrossRefGoogle Scholar
4.Georgiadis, L. & Szpankowski, W. (1992). Stability of token passing rings. Queuing Systems 11: 7–33.CrossRefGoogle Scholar
5.Kroese, D. & Schmidt, V. (1992). A continuous polling system with general service times. Annals of Applied Probability 2: 906–927.CrossRefGoogle Scholar
6.Kroese, D. & Schmidt, V. (1993). Queuing systems on a circle. Zeitschrift für Operations Research (ZOR) 37: 301–331.Google Scholar
7.Takagi, H. (1988). Queuing analysis of polling models. ACM Computing Surveys 20: 5–28.CrossRefGoogle Scholar