Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime

被引:15
作者
Bodas, Shreeshankar [1 ]
Shakkottai, Sanjay [2 ]
Ying, Lei [3 ]
Srikant, R. [4 ,5 ]
机构
[1] Qualcomm Inc, Bridgewater, NJ 08807 USA
[2] Univ Texas Austin, Dept Elect & Comp Engn, Austin, TX 78712 USA
[3] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85287 USA
[4] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[5] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
Delay optimality; large deviations; perfect matchings; random bipartite graphs; scheduling algorithms; small buffer; SERVER ALLOCATION; LARGE DEVIATIONS; POLICIES; SYSTEMS; QUEUES;
D O I
10.1109/TIT.2013.2293216
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of designing scheduling algorithms for a multichannel (e.g., orthogonal frequency division multiplexing-based) wireless downlink network is considered. The classic MaxWeight algorithm, although throughput-optimal, results in a very poor per-user delay performance in such systems. Hence, an alternate class of algorithms called iterated longest queues first (iLQF) is proposed for overcoming this issue. The iLQF-class algorithms are analyzed in a number of different system configurations. A particular algorithm in this class, called iLQF with pullup, is shown to be rate function optimal for the problem in an appropriate large deviations setting, and is shown to result in a strictly positive value of the rate function for a number of modifications to the basic system model. Thus, the proposed algorithm yields provable performance guarantees. The analytic results are confirmed through simulations.
引用
收藏
页码:1101 / 1125
页数:25
相关论文
共 24 条
[1]  
Andrews M., 2000, CDMA DATA QOS SCHEDU
[2]  
[Anonymous], 2006, MOB WIMAX 1
[3]  
[Anonymous], 2006, REQUIREMENTS EVOLVED
[4]  
Bodas S., 2009, SSG TECH RE IN PRESS
[5]  
Bodas S, 2009, PERF E R SI, V37, P121
[6]  
Dembo A., 1998, LARGE DEVIATIONS TEC
[7]  
Durrett R., 2019, Probability: Theory and Examples
[8]   Stable scheduling policies for fading wireless channels [J].
Eryilmaz, A ;
Srikant, R ;
Perkins, JR .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (02) :411-424
[9]   Optimal transmission scheduling in symmetric communication models with intermittent connectivity [J].
Ganti, Anand ;
Modiano, Eytan ;
Tsitsiklis, John N. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) :998-1008
[10]  
Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019