Fair-efficient call admission control policies for broadband networks—a game theoretic framework
IEEE/ACM Transactions on Networking (TON)
Internet pricing with a game theoretical approach: concepts and examples
IEEE/ACM Transactions on Networking (TON)
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Call admission control for CDMA mobile communications systems supporting multimedia services
IEEE Transactions on Wireless Communications
CDMA/TDD system for wireless multimedia services with traffic unbalance between uplink and downlink
IEEE Journal on Selected Areas in Communications
Comparison of time slot allocation strategies for CDMA/TDD systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
While efficient use of network resources is an important control objective of call admission control (CAC), the issue of fairness among services should also be taken into account. Game theory provides a suitable framework for formulating such fair and efficient CAC problem. Thus, in this paper, a game theoretic framework for selecting fair-efficient threshold parameters of CAC for the asymmetrical traffic case in CDMA mobile multimedia systems is proposed. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem, including the Nash, Raiffa, and modified Thomson solutions, are investigated. Furthermore, since CAC should be simple and flexible to provide a fast response to diverse QoS call requests during a connection setup, this paper also applies the concept of load factor to the previous Jeon and Jeong's CAC scheme and proposes an approximation approach to reduce the computational complexity (proposed throughput-based CAC scheme). From the numerical results, the proposed throughput-based CAC scheme shows a comparable performance to the previous Jeon and Jeong's CAC scheme while achieving lower computational complexity. All the solutions attain the fairness by satisfying their different fairness senses and efficiency by the Pareto optimality.