Utility-based probabilistic call admission control for complete fairness in wireless networks

G. I. Tsiropoulos, D. G. Stratogiannis, Hsiao-Hwa Chen, P. G. Cottis

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)521-528
頁數8
期刊International Journal of Communication Systems
27
發行號3
DOIs
出版狀態Published - 2014 三月

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

指紋 深入研究「Utility-based probabilistic call admission control for complete fairness in wireless networks」主題。共同形成了獨特的指紋。

引用此