Polling Models With and Without Switchover Times

DOI10.1287/OPRE.45.4.536MaRDI QIDQ4363755zbMATH OpenOpenAlexFDO

Authors Sem Borst, Onno Boxma

Publication date 12 November 1997

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/5141

zbMATH Keywords

steady-state queue length distributiondifferent switchover time scenariossingle-server cyclic polling models

Mathematics Subject Classification ID

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

Recommendations

• Relating polling models with zero and nonzero switchover times
• A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive
• A polling model with smart customers
• Delay in polling systems with large switch-over times

Cited in

(29)

• Mathematical methods to study the polling systems
• Relating polling models with zero and nonzero switchover times
• Polling: past, present, and perspective
• Open Problem—M/G/1 Scheduling with Preemption Delays
• \(M/D^{[y]}/1\) periodically gated vacation model and its application to IEEE 802.16 network
• Queueing analysis of the DRX power saving mechanism in fault-tolerant 3GPP LTE wireless networks
• Gated polling models with customers in orbit.
• Towards a unifying theory on branching-type polling systems in heavy traffic
• Dynamic scheduling with reconfiguration delays
• \(\mathrm{M}/\mathrm{M}/c\) multiple synchronous vacation model with gated discipline
• A two-queue polling model with two priority levels in the first queue
• Unified analysis of BMAP/G/1 cyclic polling models
• A decomposition result for a class of polling models
• Queue lengths and workloads in polling systems
• Queue-length balance equations in multiclass multiserver queues and their generalizations
• Wait-and-see strategies in polling models
• Polling models with multi-phase gated service
• Stochastic decomposition in discrete-time queues with generalized vacations and applications
• A polling model with an autonomous server
• A polling model with reneging at polling instants
• Delay in polling systems with large switch-over times
• Ergodicity and analysis of the process describing the system state in polling systems with two queues
• Computing the moments of polling models with batch Poisson arrivals by transform inversion
• Controlled mobility in stochastic and dynamic wireless networks
• A polling model with smart customers
• On open problems in polling systems
• Branching-type polling systems with large setups
• A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times
• Gated polling systems with Lévy inflow and inter-dependent switchover times: A dynamical-systems approach

This page was built for publication: Polling Models With and Without Switchover Times

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