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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jenjoab VIRAPANICHAROEN, Watit BENJAPOLAKUL, Kiyomichi ARAKI, "A Game Theoretic Framework for Fair-Efficient Threshold Parameters Selection in Call Admission Control for CDMA Mobile Multimedia Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 7, pp. 1280-1291, July 2007, doi: 10.1093/ietfec/e90-a.7.1280.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.7.1280/_p
Copy
@ARTICLE{e90-a_7_1280,
author={Jenjoab VIRAPANICHAROEN, Watit BENJAPOLAKUL, Kiyomichi ARAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Game Theoretic Framework for Fair-Efficient Threshold Parameters Selection in Call Admission Control for CDMA Mobile Multimedia Systems},
year={2007},
volume={E90-A},
number={7},
pages={1280-1291},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e90-a.7.1280},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - A Game Theoretic Framework for Fair-Efficient Threshold Parameters Selection in Call Admission Control for CDMA Mobile Multimedia Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1280
EP - 1291
AU - Jenjoab VIRAPANICHAROEN
AU - Watit BENJAPOLAKUL
AU - Kiyomichi ARAKI
PY - 2007
DO - 10.1093/ietfec/e90-a.7.1280
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2007
AB - 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.
ER -