Ergodicity of a polling network
The polling network considered here consists of a finite collection of stations visited successively by a single server who is following a Markovian routing scheme. At every visit of a station a positive random number of the customers present at the start of the visit are served, whereupon the server takes a positive random time to walk to the station to be visited next. The network receives arrivals of customer groups at Poisson instants, and all customers wait until served, whereupon they depart from the network. Necessary and sufficient conditions are derived for the server to be able to cope with the traffic. For the proof a multidimensional imbedded Markov chain is studied.
Year of publication: |
1994
|
---|---|
Authors: | Borovkov, A. A. ; Schassberger, R. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 50.1994, 2, p. 253-262
|
Publisher: |
Elsevier |
Keywords: | queuing networks polling network multidimensional Markov chain ergodicity |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Sostojanija ėkonomik i "reformy" v Rossii
Borovkov, Alʹbert Vasilʹevič, (1998)
-
Weak convergence for generalized semi-Markov processes
Hordijk, A., (1982)
-
A Note on Optimal Service Selection in a Single Server Queue
Schassberger, R., (1975)
- More ...