Max-utility wireless resource management for best-effort traffic

被引:106
作者
Jiang, ZM
Ge, Y
Li, YG [1 ]
机构
[1] AT&T Labs Res, Eatontown, NJ 07724 USA
[2] Ohio State Univ, Columbus, OH 43210 USA
[3] Georgia Inst Technol, Atlanta, GA USA
关键词
channel efficiency; dynamic resource management; scheduling; wireless networks;
D O I
10.1109/TWC.2004.840210
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Due to the characteristics of wireless channels, utility-based resource management in wireless networks requires a set of mechanisms that are different from those for wireline networks. This paper explores in detail why and how the requirements are different. In particular, we analyze the wireless network performance to find out the scheduling algorithm that maximizes total utility of the system. Unlike previous studies, this paper focuses on scenarios in which wireless networks are not fully loaded and all of the users are hest-effort data users, i.e., there is no streaming user. Our first key conclusion is that Kleinrock's Conservation Law provides a valuable means to accurately capture the perceived rates of best-effort users in such systems. The queueing analysis further indicates that, within periods during which channel conditions are stable for each user, albeit differ from user to user, the max-utility scheduling algorithm can be derived using queueing theorem and can be readily implemented in actual systems for utility functions that are of exponential or log format. When further taking into account the time-variant nature of wireless channel conditions, our simulation results demonstrate that dynamic weighted fair queueing, with weights adjusted according to the channel conditions, can achieve highly desirable performance with great flexibility.
引用
收藏
页码:100 / 111
页数:12
相关论文
共 23 条
[1]  
[Anonymous], 1975, QUEUEING SYSTEMS
[2]  
[Anonymous], P ACM MOBICOM
[3]  
Barford P., 1998, Performance Evaluation Review, V26, P151, DOI 10.1145/277858.277897
[4]   CDMA/HDR: A bandwidth-efficient high-speed wireless data service for nomadic users [J].
Bender, P ;
Black, P ;
Grob, M ;
Padovani, R ;
Sindhushayana, N ;
Viterbi, A .
IEEE COMMUNICATIONS MAGAZINE, 2000, 38 (07) :70-77
[5]  
Bhagwat P, 1996, IEEE INFOCOM SER, P1133, DOI 10.1109/INFCOM.1996.493057
[6]   Fair queuing in wireless networks: Issues and approaches [J].
Bharghavan, V ;
Lu, SW ;
Nandagopal, T .
IEEE PERSONAL COMMUNICATIONS, 1999, 6 (01) :44-53
[7]   On utility-fair adaptive services in wireless networks [J].
Bianchi, G ;
Campbell, AT ;
Liao, RRF .
1998 SIXTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE (IWQOS '98), 1998, :256-267
[8]  
CAI M, 2000, P GLOBECOM NOV, P1515
[9]  
CHUANG J, 2000, P 2000 UN WIR COMM C
[10]  
Fragouli C, 1998, IEEE INFOCOM SER, P572