HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Stability of non markovian polling systems

Abstract : In this article we consider polling systems with markovian server routings and where each station is attended according to a specific policy. A stationary regime for this system is constructed under general statistical assumptions (stationarity, ergodicity) on the input processes to the stations (in particular it is not required that these processes be mutually independent). The method of construction is as follows : one constructs recursively a sequence of stationary regimes for fictive systems that approximate in some sense the original polling system, the stationary regime is then identified as the limit of this sequence of stationary processes. The main tools for these results are Palm calculus and Birkhoff's ergodictheorem. It is shown by a coupling argument that this stationary regime is minimal in the stochastic ordering sense. The assumptions on the service policies allow to consider the purely gated policy, the a-limited policy, the binomial-gated policy and others. As a by-product sufficient conditions for the stationary regime of a G/G/1/0 queue with multiple server vacations are obtained.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:40:23 PM
Last modification on : Friday, February 4, 2022 - 3:19:39 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 5:20:46 PM


  • HAL Id : inria-00074524, version 1



Laurent Massoulie. Stability of non markovian polling systems. RR-2148, INRIA. 1993. ⟨inria-00074524⟩



Record views


Files downloads