Waiting Lines and Times in a System with Polling

DOI10.1145/321832.321845MaRDI QIDQ4053121zbMATH OpenOpenAlexFDO

Authors Alan G. Konheim, Bernd Meister

Publication date 1974

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321832.321845

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(14)

• A queueing network with a single cyclically roving server
• Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
• A tandem queueing system with priorities
• Single-server queues with spatially distributed arrivals
• Mathematical methods to study the polling systems
• Mean value analysis for polling systems
• Stability and continuity of polling systems
• Two queues with alternating service and server breakdown
• An approximate analysis of a cyclic server queue with limited service and reservations
• Symmetric queues served in cyclic order
• A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems
• Average waiting time of a symmetric polling system under Bernoulli scheduling
• Queuing analysis of general loop systems
• Waiting time in a preemptive resume system with compound-Poisson input

This page was built for publication: Waiting Lines and Times in a System with Polling

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