Polling Models With and Without Switchover Times
From MaRDI portal
Recommendations
Cited in
(33)- A polling model with an autonomous server
- A decomposition result for a class of polling models
- Gated polling models with customers in orbit.
- Polling: past, present, and perspective
- Queue-length balance equations in multiclass multiserver queues and their generalizations
- A polling model with reneging at polling instants
- Polling models with multi-phase gated service
- Gated polling systems with Lévy inflow and inter-dependent switchover times: A dynamical-systems approach
- Relating polling models with zero and nonzero switchover times
- Stochastic decomposition in discrete-time queues with generalized vacations and applications
- \(\mathrm{M}/\mathrm{M}/c\) multiple synchronous vacation model with gated discipline
- Mathematical methods to study the polling systems
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Ergodicity and analysis of the process describing the system state in polling systems with two queues
- Wait-and-see strategies in polling models
- \(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
- Dynamic scheduling with reconfiguration delays
- Controlled mobility in stochastic and dynamic wireless networks
- On open problems in polling systems
- Polling systems with zero switch-over periods: a general method for analyzing the expected delay
- Queue lengths and workloads in polling systems
- Delay in polling systems with large switch-over times
- A POLLING MODEL WITH RETRIAL CUSTOMERS
- A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times
- IMPROVING THE PERFORMANCE OF POLLING MODELS USING FORCED IDLE TIMES
- Open Problem—M/G/1 Scheduling with Preemption Delays
- Computing the moments of polling models with batch Poisson arrivals by transform inversion
- A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive
- A polling model with smart customers
- A two-queue polling model with two priority levels in the first queue
- Branching-type polling systems with large setups
- Unified analysis of BMAP/G/1 cyclic polling models
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)
