Stochastic bounds for a polling system

DOI10.1007/BF02024662zbMath0787.60117OpenAlexW2093070189MaRDI QIDQ1315347

Onno J. Boxma, M. Ya. Kel'bert

Publication date: 19 May 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

queueing systemsstochastic orderingspolling systemservice time distributions

Mathematics Subject Classification ID

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

Related Items (3)

A polling model with smart customers ⋮ Mathematical methods to study the polling systems ⋮ A batch arrival priority queue with recurrent repeated demands, admission control and hybrid failure recovery discipline

Cites Work

• Unnamed Item
• Unnamed Item
• Dominance relations in polling systems
• Stability, monotonicity and invariant quantities in general polling systems
• On optimal polling policies
• Workloads and waiting times in single-server systems with multiple customer classes
• A service system with two stages of waiting and feedback of customers
• ON THE M/G/1 QUEUE WITH MULTIPLE VACATIONS AND GATED SERVICE DISCIPLINE

This page was built for publication: Stochastic bounds for a polling system