Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
From MaRDI portal
Publication:5485370
DOI10.1017/S0269964800004332zbMATH Open1093.90513OpenAlexW2167511084MaRDI QIDQ5485370FDOQ5485370
Authors: Kimberly Wasserman, Nicholas Bambos 
Publication date: 30 August 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964800004332
Recommendations
- OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE
- Optimal server allocation in general, finite, multi-server queueing networks
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- On the Assignment of Customers to Parallel Queues
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
Cites Work
- Stochastic partial ordering
- Title not available (Why is that?)
- A new ordering for stochastic majorization: theory and applications
- Head of the line processor sharing for many symmetric queues with finite capacity
- On the duality between routing and scheduling systems with finite buffer space
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Sample Path Criteria for Weak Majorization
Cited In (13)
- Optimal server allocation in general, finite, multi-server queueing networks
- OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE
- Allocating capacity in parallel queues to improve their resilience to deliberate attack
- Static and dynamic server allocation in systems with on/off sources
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimal server allocation in wireless networks: the use of index policies
- Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
- Delay-minimizing capacity allocation in an infinite server-queueing system
- Simultaneous determination of capacities and load in parallel \(M/M/1\) queues
- Optimal resource allocation for multiqueue systems with a shared server pool
- Dynamic priority allocation via restless bandit marginal productivity indices
- Parallel queues with resequencing
- Optimal service assignment in a finite-source queue
This page was built for publication: Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485370)
