Polling systems with parameter regeneration, the general case
DOI10.1214/08-AAP519zbMath1154.60351arXiv0803.0625MaRDI QIDQ2378627
Dimitri Petritis, Mikhail V. Menshikov, Iain M. MacPhee, Serguei Popov
Publication date: 13 January 2009
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.0625
stabilityrandom matricesLyapunov functionsrecurrencepolling systemtime-inhomogeneous Markov chainsparameter regeneration
Martingales with discrete parameter (60G42) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Random walks in two-dimensional complexes
- Periodicity in the transient regime of exhaustive polling systems
- Random difference equations and renewal theory for products of random matrices
- Stability of polling systems with exhaustive service policies and state-dependent routing
- A Markov chain model of a polling system with parameter regeneration
- Passage-time moments for nonnegative stochastic processes and an application to reflected random walks in a quadrant
- The M / G /1 queue with two service speeds
- Topics in the Constructive Theory of Countable Markov Chains
- Heavy tail properties of stationary solutions of multidimensional stochastic recursions
- Queueing models with multiple waiting lines
This page was built for publication: Polling systems with parameter regeneration, the general case