On polling systems with infinitely many stations

DOI10.1007/BF02104674zbMath0882.60089OpenAlexW2029834001MaRDI QIDQ1358030

N. I. Chernova, Sergeĭ Georgievich Foss

Publication date: 2 March 1998

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02104674

zbMATH Keywords

pollingqueue lengthinfinite number of stationsrandom route

Mathematics Subject Classification ID

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

Related Items

Polling: past, present, and perspective ⋮ Mathematical methods to study the polling systems ⋮ Interference queueing networks on grids ⋮ Comments on: ``Polling: past, present and perspective

Cites Work

• Dominance relations in polling systems
• Stability of token passing rings
• A continuous polling system with general service times
• Monotonicity and stability of periodic polling models
• Stability and continuity of polling systems
• Ergodicity of a polling network
• Single-server queues with spatially distributed arrivals
• Ergodicity of Jackson-type queueing networks
• On the saturation rule for the stability of queues
• On the Stability of Greedy Polling Systems with General Service Policies