Ergodicity of a polling network
A queueing system with a single server and with \(N\) service stations is considered which are successively visited by the server who is polling them according to a Markovian routing scheme. For every \(i\in \{1,\dots, N\}\), the server can serve no more than a random maximum number \(D_ i\) of customers during each visit at station \(i\). The \(D_ i\) and the service times at this station are drawn independently from general distributions which may depend on \(i\). For switching from station \(i\) to station \(j\), the server needs a random switching time whose distribution may depend on the pair \((i,j)\). At each station, groups of customers arrive according to a homogeneous Poisson process whose intensity and group-size distribution may be station-dependent, too. Arrival processes, routing, switching times, and service times are mutually independent. The temporal evolution of the system is described by the Markov chain \((S, {\mathcal X})= \{(S(n), X_ 1(n),\) \(\dots, X_ i (n))\); \(n\geq 0\}\) where \(S(n)\) denotes the \(n\)th station polled by the server, and \(X_ i(n)\) the queue length at station \(i\) at the moment when the \(n\)th switching time is terminated. Conditions are derived under which \((S,{\mathcal X})\) is positive recurrent.
- Ergodicity of a polling network with an infinite number of stations
- Ergodicity and analysis of the process describing the system state in polling systems with two queues
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- Stability of polling networks with state-dependent server routing
- On polling systems with infinitely many stations
- A continuous polling system with general service times
- Ergodicity of a Jackson network by batch arrivals
- Monotonicity and stability of periodic polling models
- Queueing systems on a circle
- Queuing analysis of polling models
- Stability of token passing rings
- Stability, monotonicity and invariant quantities in general polling systems
- Stability of periodic polling system with BMAP arrivals
- Single-server queues with spatially distributed arrivals
- On polling systems with infinitely many stations
- Polling on a space with general arrival and service time distribution
- Ergodicity of a polling network with an infinite number of stations
- Polling systems in the critical regime.
- Stability of non-Markovian polling systems
- Stability of polling systems with exhaustive service policies and state-dependent routing
- Polling systems with parameter regeneration, the general case
- Mathematical methods to study the polling systems
- A Markov chain model of a polling system with parameter regeneration
- Ergodicity and analysis of the process describing the system state in polling systems with two queues
- Stability of a cyclic polling system with an adaptive mechanism
- Ergodicity properties of rerouting strategies in queueing networks
- Stability of polling networks with state-dependent server routing
- scientific article; zbMATH DE number 1191592 (Why is no real title available?)
- scientific article; zbMATH DE number 6850478 (Why is no real title available?)
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- A State-Dependent Polling Model with Markovian Routing
- Periodicity in the transient regime of exhaustive polling systems
This page was built for publication: Ergodicity of a polling network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327549)
