Optimal scaling of average queue sizes in an input-queued switch: an open problem
From MaRDI portal
Publication:383214
DOI10.1007/s11134-011-9234-1zbMath1275.60087OpenAlexW2065649422MaRDI QIDQ383214
Yuan Zhong, John N. Tsitsiklis, Devavrat Shah
Publication date: 25 November 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/73530
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)
Related Items (7)
Diffusion approximation for an input-queued switch operating under a maximum weight matching policy ⋮ Optimal heavy-traffic queue length scaling in an incompletely saturated switch ⋮ A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline ⋮ Effect of global FCFS and relative load distribution in two-class queues with dedicated servers ⋮ Optimal queue-size scaling in switched networks ⋮ Improved queue-size scaling for input-queued switches via graph factorization ⋮ Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
Cites Work
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Brownian models of open processing networks: Canonical representation of workload.
- Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
- Link scheduling in polynomial time
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Bin Packing with Queues
This page was built for publication: Optimal scaling of average queue sizes in an input-queued switch: an open problem