Stochastic bounds for a polling system
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4055548 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- A service system with two stages of waiting and feedback of customers
- Dominance relations in polling systems
- ON THE M/G/1 QUEUE WITH MULTIPLE VACATIONS AND GATED SERVICE DISCIPLINE
- On optimal polling policies
- Stability, monotonicity and invariant quantities in general polling systems
- Workloads and waiting times in single-server systems with multiple customer classes
Cited in
(8)- Mathematical methods to study the polling systems
- Performance bounds and pathwise stability for generalized vacation and polling systems
- Optimization of polling systems with Bernoulli schedules
- A batch arrival priority queue with recurrent repeated demands, admission control and hybrid failure recovery discipline
- M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES
- scientific article; zbMATH DE number 1552339 (Why is no real title available?)
- scientific article; zbMATH DE number 1285792 (Why is no real title available?)
- A polling model with smart customers
This page was built for publication: Stochastic bounds for a polling system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315347)