A Markov chain model of a polling system with parameter regeneration (Q2475027): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q267616 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Jevsey Morozov / rank | |||
Normal rank |
Revision as of 09:27, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Markov chain model of a polling system with parameter regeneration |
scientific article |
Statements
A Markov chain model of a polling system with parameter regeneration (English)
0 references
20 March 2008
0 references
The authors consider a polling system containing several stations and a single server switching (with non-zero random time) from a station to another station when it completes all jobs at a given station (exhaustive service). A particular case when only two stations are open receiving jobs at any time is studied, and the routing of server to visit stations follows an irreducible Markov chain. Jobs arrive at the open stations following (two) Poisson streams. The main assumption is that a (general) service time distribution and the arrival rates are regenerated at the start of each switching time using a regeneration measure depending upon the (ordered) pair of open stations only. The main goal of the paper is to establish stability conditions of the polling model. All results are based on constructive theory of Markov chains.The conditions for the existence of polynomial moments of hitting times for the related random walk are derived. The unusual phenomenon of a large null-recurrence region is obtained even for in the case of zero switching times. Instability conditions are also considered.
0 references
polling system
0 references
parameter regeneration
0 references
stability
0 references
time-inhomogeneous Markov chains
0 references
recurrence
0 references
Lyapunov functions
0 references