首页 | 本学科首页   官方微博 | 高级检索  
     


Utility‐based probabilistic call admission control for complete fairness in wireless networks
Authors:G.I. Tsiropoulos  D.G. Stratogiannis  Hsiao‐Hwa Chen  P.G. Cottis
Affiliation:1. School of Electrical and Computer Engineering, National Technical University of Athens, Zografou, Greece;2. Department of Engineering Science, National Cheng Kung University, Tainan, Taiwan
Abstract:Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.
Keywords:call admission control  call blocking probability  quality of service (QoS)  wireless network
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号