A comparative study of bandwidth reservation and admission control schemes in QoS-sensitive cellular networks

被引:40
作者
Choi, S [1 ]
Shin, KG
机构
[1] Philips Res USA, Briarcliff Manor, NY 10510 USA
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Real Time Comp Lab, Ann Arbor, MI 48109 USA
关键词
User Mobility; Admission Control; Sojourn Time; Design Goal; Current Cell;
D O I
10.1023/A:1019154001580
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper compares five different schemes - called CHOI, NAG, AG, BHARG, and NCBF - for reserving bandwidths for handoffs and admission control for new connection requests in QoS-sensitive cellular networks. CHOI and NAG are to keep the handoff dropping probability below a target value, AG is to guarantee no handoff drops through per-connection bandwidth reservation, and BHARG and NCBF use another type of per-connection bandwidth reservation. CHOI predicts the bandwidth required to handle handoffs by estimating possible handoffs from adjacent cells, then performs admission control for each newly-requested connection. On the other hand, NAG predicts the total required bandwidth in the current cell by estimating both incoming and outgoing handoffs at each cell. AG requires the set of cells to be traversed by the mobile with a newly-requested connection, and reserves bandwidth for each connection in each of these cells. The last two schemes reserve bandwidth for each connection in the predicted next cell of a mobile where the two schemes use different admission control policies. We adopt the history-based mobility estimation for the first two schemes. Using extensive simulations, the five schemes are compared quantitatively in terms of (1) handoff dropping probability, connection-blocking probability, and bandwidth utilization; (2) dependence on the design parameters; (3) dependence on the accuracy of mobility estimation; and (4) complexity. The simulation results indicate that CHOI is the most desirable in that it achieves good performance while requiring much less memory and computation than the other four schemes.
引用
收藏
页码:289 / 305
页数:17
相关论文
共 10 条
[1]  
CHOI S, 1998, P ACM SIGCOMM 98 VAN, P155
[2]  
HONG D, 1986, IEEE T VEH TECHNOL, V35, P77, DOI 10.1109/T-VT.1986.24076
[3]   A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept [J].
Levine, DA ;
Akyildiz, IF ;
Naghshineh, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) :1-12
[4]  
LU S, 1996, P ACM SIGCOMM 96 AUG, P231
[5]  
Lu S., 1997, P INT WORKSH QUAL SE
[6]   Distributed call admission control in mobile/wireless networks [J].
Naghshineh, M ;
Schwartz, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (04) :711-717
[7]  
Papoulis A., 1991, PROBABILITY RANDOM V
[8]  
Ramjee R, 1996, IEEE INFOCOM SER, P43, DOI 10.1109/INFCOM.1996.497876
[9]  
Talukdar A., 1997, P IEEE INFOCOM 97 AP, P1048
[10]  
Zhao Y., 1997, Vehicle Location and Navigation Systems