Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers

DOI10.1017/S0269964800004332MaRDI QIDQ5485370zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

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

• A new ordering for stochastic majorization: theory and applications
• Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
• Head of the line processor sharing for many symmetric queues with finite capacity
• scientific article; zbMATH DE number 941166 (Why is no real title available?)
• On the duality between routing and scheduling systems with finite buffer space
• Sample Path Criteria for Weak Majorization
• Stochastic partial ordering

Cited in

(13)

• Simultaneous determination of capacities and load in parallel \(M/M/1\) queues
• Allocating capacity in parallel queues to improve their resilience to deliberate attack
• Optimal server allocation in general, finite, multi-server queueing networks
• Optimal service assignment in a finite-source queue
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Parallel queues with resequencing
• OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE
• Delay-minimizing capacity allocation in an infinite server-queueing system
• Optimal server allocation in wireless networks: the use of index policies
• Optimal resource allocation for multiqueue systems with a shared server pool
• Static and dynamic server allocation in systems with on/off sources
• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• Dynamic priority allocation via restless bandit marginal productivity indices

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)