A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems

DOI10.1016/0167-6377(91)90009-EzbMath0748.90020MaRDI QIDQ1180845

Hanoch Levy

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

expected delaycyclic pollingdelay computationnon-symmetric polling systems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• The Analysis of Random Polling Systems
• Polling in a Loop System
• Waiting Lines and Times in a System with Polling
• A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service
• Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
• Queues Served in Cyclic Order
• Queues Served in Cyclic Order: Waiting Times
• Queues with Periodic Service and Changeover Time

This page was built for publication: A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems