A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive

DOI10.1287/opre.44.4.629zbMath0865.90065OpenAlexW2010180275MaRDI QIDQ5689785

Robert B. Cooper, Mandyam M. Srinivasan, Shun-Chen Niu

Publication date: 7 January 1997

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

Full work available at URL: https://doi.org/10.1287/opre.44.4.629

zbMATH Keywords

classical polling modelzero-switchover-times model

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (6)

Polling: past, present, and perspective ⋮ The polling system with a stopping server ⋮ Relating polling models with zero and nonzero switchover times ⋮ Mathematical methods to study the polling systems ⋮ Gated polling systems with Lévy inflow and inter-dependent switchover times: A dynamical-systems approach ⋮ Analysis of alternating-priority queueing models with (cross) correlated switchover times

This page was built for publication: A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive