Ergodicity of a polling network (Q1327549): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Stability, monotonicity and invariant quantities in general polling systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ergodicity of a Jackson network by batch arrivals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotonicity and stability of periodic polling models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stability of token passing rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A continuous polling system with general service times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queueing systems on a circle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queuing analysis of polling models / rank | |||
Normal rank |
Latest revision as of 16:35, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ergodicity of a polling network |
scientific article |
Statements
Ergodicity of a polling network (English)
0 references
12 December 1994
0 references
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.
0 references
polling server
0 references
Poisson arrivals
0 references
queue length
0 references
stability
0 references
single server
0 references
Markovian routing scheme
0 references
random switching
0 references
homogeneous Poisson process
0 references