Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
From MaRDI portal
Publication:5286009
Recommendations
- On the Optimality of the Generalized Shortest Queue Policy
- scientific article; zbMATH DE number 5363765
- scientific article; zbMATH DE number 65357
- Extremal properties of the FIFO discipline in queueing networks
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Finite \(M/G/1\) queueing system with Bernoulli feedback under optimal \(N\)-policy
Cited in
(12)- Asymptotics of insensitive load balancing and blocking phases
- Dynamic load balancing in parallel queueing systems: stability and optimal control
- Self-Learning Threshold-Based Load Balancing
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
- Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
- Partial flexibility in routeing and scheduling
- Optimal control of multiclass parallel service systems
- Multiple-server system with flexible arrivals
- ON A ROUTING PROBLEM
- Sample path methods in the control of queues
This page was built for publication: Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286009)