Dominance relations in polling systems
From MaRDI portal
Publication:749057
DOI10.1007/BF02411471zbMath0712.60103OpenAlexW2032531681MaRDI QIDQ749057
Hanoch Levy, Moshe Sidi, Onno J. Boxma
Publication date: 1990
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02411471
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
On polling systems with infinitely many stations, Stochastic scheduling of parallel queues with set-up costs, Polling on a space with general arrival and service time distribution, Scheduling policies using marked/phantom slot algorithms, Controlled mobility in stochastic and dynamic wireless networks, Stability of polling systems with exhaustive service policies and state-dependent routing, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies, Method of Generating Functions for Performance Characteristic Analysis of the Polling Systems with Adaptive Polling and Gated Service, Mathematical methods to study the polling systems, Stability of token passing rings, Stability, monotonicity and invariant quantities in general polling systems, On optimal polling policies, An approximate analysis of a cyclic server queue with limited service and reservations, Time-limited polling systems with batch arrivals and~phase-type service times, A Globally Gated Polling System with a Dormant Server, Dominance relations in polling systems, Workloads and waiting times in single-server systems with multiple customer classes, Pseudo-cyclic policies for multi-queue single server systems, Stochastic bounds for a polling system, Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times, Monotonicity and stability of periodic polling models, Stability conditions for a pipeline polling scheme in satellite communications, Stability and continuity of polling systems
Cites Work
- Dominance relations in polling systems
- A queueing network with a single cyclically roving server
- Workloads and waiting times in single-server systems with multiple customer classes
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- Pseudo-conservation laws in cyclic-service systems
- Analysis of cyclic service systems with limited service: Bounds and approximations
- The Analysis of Random Polling Systems
- Stochastic Comparisons in Vacations Models Tedijanto
- Queues with Periodic Service and Changeover Time
