Flow-level performance and capacity of wireless networks with user mobility

被引:42
作者
Bonald, Thomas [3 ]
Borst, Sem [1 ,2 ]
Hegde, Nidhi [3 ]
Jonckheere, Matthieu [1 ]
Proutiere, Alexandre [4 ]
机构
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Alcatel Lucent, Bell Labs, Murray Hill, NJ 07974 USA
[3] Orange Labs, Paris, France
[4] Microsoft Res, Cambridge, England
关键词
Channel-aware scheduling; Flow-level performance; Processor sharing; Proportional fair allocation; Stability; Transfer delay; User mobility; Wireless networks; QUEUING-SYSTEMS; PROPORTIONAL FAIRNESS; SCHEDULING ALGORITHMS; STABILITY CONDITIONS; SERVICE; THROUGHPUT; INTEGRATION;
D O I
10.1007/s11134-009-9144-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The performance evaluation of wireless networks is severely complicated by the specific features of radio communication, such as highly variable channel conditions, interference issues, and possible hand-offs among base stations. The latter elements have no natural counterparts in wireline scenarios, and create a need for novel performance models that account for the impact of these characteristics on the service rates of users. Motivated by the above issues, we review several models for characterizing the capacity and evaluating the flow-level performance of wireless networks carrying elastic data transfers. We first examine the flow-level performance and stability of a wide family of so-called alpha-fair channel-aware scheduling strategies. We establish that these disciplines provide maximum stability, and describe how the special case of the Proportional Fair policy gives rise to a Processor-Sharing model with a state-dependent service rate. Next we turn attention to a network of several base stations with inter-cell interference. We derive both necessary and sufficient stability conditions and construct lower and upper bounds for the flow-level performance measures. Lastly we investigate the impact of user mobility that occurs on a slow timescale and causes possible hand-offs of active sessions. We show that the mobility tends to increase the capacity region, both in the case of globally optimal scheduling and local alpha-fair scheduling. It is additionally demonstrated that the capacity and user throughput improve with lower values of the fairness index alpha.
引用
收藏
页码:131 / 164
页数:34
相关论文
共 64 条
[1]  
Agrawal R., 2002, P 40 ANN ALLERTON C, P1532
[2]  
ANDREWS DM, 2005, P INF 2005
[3]   Instability of the proportional fair scheduling algorithm for HDR [J].
Andrews, M .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2004, 3 (05) :1422-1426
[4]   Scheduling in a queuing system with asynchronously varying service rates [J].
Andrews, M ;
Kumaran, K ;
Ramanan, K ;
Stolyar, A ;
Vijayakumar, R ;
Whiting, P .
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2004, 18 (02) :191-217
[5]  
[Anonymous], P EUR WIR C 2004
[6]   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
[7]  
Bonald A., 2003, 9 ANN INT C MOBILECO, P339
[8]   Insensitive bandwidth sharing in data networks [J].
Bonald, T ;
Proutière, A .
QUEUEING SYSTEMS, 2003, 44 (01) :69-100
[9]  
Bonald T., 2001, Performance Evaluation Review, V29, P82, DOI 10.1145/384268.378438
[10]  
BONALD T, 2006, P CISS 2006