Ergodicity, moment stability and central limit theorems of station times in polling systems

DOI10.1080/15326349608807386MaRDI QIDQ4883752zbMATH OpenOpenAlexFDO

Authors Eitan Altman, F. M. Spieksma

Publication date 2 December 1996

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349608807386

zbMATH Keywords

central limit theoremsgeometric ergodicitymoment stabilitylaw of iterated logarithmpollinggated and globally-gated disciplinesstation times

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Stability and continuity of polling systems
• Comparison theorems and ergodic properties of polling systems.
• On polling systems with infinitely many stations
• Ergodicity of a polling network with an infinite number of stations

Cited in

(4)

• Polling on a space with general arrival and service time distribution
• Mathematical methods to study the polling systems
• M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES
• Ergodicity and analysis of the process describing the system state in polling systems with two queues

This page was built for publication: Ergodicity, moment stability and central limit theorems of station times in polling systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883752)