Pathwise optimality of the exponential scheduling rule for wireless channels

Advances in Applied Probability

Volumn 36, Issue 4, 2004, Pages 1021-1045

  Shakkottai, Sanjay ^a   Srikant, R ^b   Stolyar, Alexander L ^c  

^a The University of Texas at Austin   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Complete resource pooling; Exponential rule; Heavy traffic limit; Optimality; Quality of service; Queueing network; Scheduling; State space collapse; Wireless network; Workload

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; OPTIMIZATION; QUALITY OF SERVICE; QUEUEING NETWORKS; QUEUEING THEORY; RANDOM PROCESSES; SCHEDULING; STATE SPACE METHODS; TELECOMMUNICATION TRAFFIC;

COMPLETE RESOURCE POOLING; EXPONENTIAL RULE; HEAVY TRAFFIC LIMIT; PATHWISE OPTIMALITY; STATE SPACE COLLAPSE; WIRELESS NETWORK;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 13344286024     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1103662957     Document Type: Article

References (19)

1. Andrews, M. et al. (2004). Scheduling in a queueing system with asynchronously varying service rates. Prob. Eng. Inf. Sci. 18 191-217.
2. Bell, S. L. and Williams, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: asymptotic optimality of a continuous review threshold policy. Ann. Appl. Prob. 11, 608-649.
3. Bramson, M. (1998). State space collapse with applications to heavy traffic limits for multiclass queueing networks. Queueing Systems 30, 89-148.
4. Buche, R. and Kushner, H. J. (2002). Control of mobile communications with time-varying channels in heavy traffic. IEEE Trans. Automatic Control 47, 992-1003.
5. Bender, P. et al. (2000). CDMA/HDR: A bandwidth efficient high speed wireless data service for nomadic users. IEEE Commun. Magazine, July 2000, 70-77.
6. Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. John Wiley, New York.
7. Glynn, P. W. (1990). Diffusion approximations. In Stochastic Models (Handbooks Operat. Res. Manag. Sci. 2), eds D. P. Heyman and M. J. Sobel, North-Holland, Amsterdam, pp. 145-198.
8. Harrison, J. M. (1998). Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies. Ann. Appl. Prob. 8, 822-848.
9. Harrison, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Prob. 10, 75-103.
10. Harrison, J. M. AND LOPEZ, M. J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33, 339-368.
11. Harrison, J. M. and Van Mieghem, J. A. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Prob. 7, 747-771.
12. Jakes, W. C. (ed.) (1974). Microwave Mobile Communications. John Wiley, New York.
13. Reiman, M. I. (1984). Some diffusion approximations with state space collapse. In Modelling and Performance Evaluation Methodology (Paris, 1983; Lecture Notes Control Inf. Sci. 60), Springer, New York, pp. 209-240.
14. Reiman, M. I. (1988). A multiclass feedback queue in heavy traffic. Adv. Appl. Prob. 20, 179-207.
15. Shakkottai, S. and Stolyar, A. L. (2002). Scheduling for multiple flows sharing a time-varying channel: the exponential rule. In Analytic Methods in Applied Probability (Amer. Math. Soc. Trans. Ser. 2, 207), ed. Yu. M. Suhov, American Mathematical Society, Providence, RI, pp. 185-201.
16. Stolyar, A. L. (2004). Maxweight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann. Appl. Prob. 14, 1-53.
17. Whitt, W. (1997). Weak convergence theorems for priority queues: preemptive-resume discipline. J. Appl. Prob. 8, 74-94.
18. Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems 30, 27-88.
19. Williams, R. J. (2000). On dynamic scheduling of a parallel server system with complete resource pooling. In Analysis of Communication Networks: Call Centres, Traffic and Performance (Toronto, 1998; Fields Inst. Commun. 28), American Mathematical Society, Providence, RI, pp. 49-71.