Ergodicity of a polling network with an infinite number of stations

DOI10.1023/A:1019139121047MaRDI QIDQ1809733zbMATH OpenOpenAlexFDO

Authors Dmitry Korshunov, A. A. Borovkov, R. Schaßberger

Publication date 10 February 2000

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019139121047

zbMATH Keywords

boundsergodicitymonotonicity properties of a polling systempolling system with infinitely many stationsweak ergodicity

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Recommendations

• Ergodicity of a polling network
• On polling systems with infinitely many stations
• Ergodicity and analysis of the process describing the system state in polling systems with two queues
• Comparison theorems and ergodic properties of polling systems.

Cited in

(9)

• Comparison theorems and ergodic properties of polling systems.
• Ergodicity of a polling network
• On polling systems with infinitely many stations
• Interference queueing networks on grids
• Mathematical methods to study the polling systems
• Ergodicity and analysis of the process describing the system state in polling systems with two queues
• Ergodicity, moment stability and central limit theorems of station times in polling systems
• M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES
• Comments on: ``Polling: past, present and perspective

This page was built for publication: Ergodicity of a polling network with an infinite number of stations

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