Pathwise optimality of the exponential scheduling rule for wireless channels
- 1 December 2004
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 36 (4) , 1021-1045
- https://doi.org/10.1239/aap/1103662957
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy trafficThe Annals of Applied Probability, 2004
- Control of mobile communications with time-varying channels in heavy trafficIEEE Transactions on Automatic Control, 2002
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policyThe Annals of Applied Probability, 2001
- Brownian models of open processing networks: canonical representation of workloadThe Annals of Applied Probability, 2000
- Heavy traffic resource pooling in parallel‐server systemsQueueing Systems, 1999
- Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policiesThe Annals of Applied Probability, 1998
- State space collapse with application to heavy traffic limits for multiclass queueing networksQueueing Systems, 1998
- Dynamic control of Brownian networks: state space collapse and equivalent workload formulationsThe Annals of Applied Probability, 1997
- A multiclass feedback queue in heavy trafficAdvances in Applied Probability, 1988
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971