Asymptotically tight steady-state queue length bounds implied by drift conditions
- 17 May 2012
- journal article
- Published by Springer Science and Business Media LLC in Queueing Systems
- Vol. 72 (3-4), 311-359
- https://doi.org/10.1007/s11134-012-9305-y
Abstract
No abstract availableKeywords
Other Versions
This publication has 33 references indexed in Scilit:
- Asymptotic optimality of maximum pressure policies in stochastic processing networksThe Annals of Applied Probability, 2008
- Validity of heavy traffic steady-state approximations in generalized Jackson networksThe Annals of Applied Probability, 2006
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy trafficThe Annals of Applied Probability, 2004
- Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policiesThe Annals of Applied Probability, 1998
- Dynamic scheduling for minimum delay in tandem and parallel constrained queueing modelsAnnals of Operations Research, 1994
- Dynamic server allocation to parallel queues with randomly varying connectivityIEEE Transactions on Information Theory, 1993
- Resource pooling in queueing networks with dynamic routingAdvances in Applied Probability, 1992
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971
- Some inequalities for the queue GI/G/1Biometrika, 1962