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

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

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)521-528
Number of pages8
JournalInternational Journal of Communication Systems
Volume27
Issue number3
DOIs
Publication statusPublished - 2014 Mar

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Utility-based probabilistic call admission control for complete fairness in wireless networks'. Together they form a unique fingerprint.

Cite this