IEICE TRANSACTIONS on Fundamentals
Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory
Summary :
Call admission control (CAC) plays a significant role in providing the efficient use of the limited bandwidth and the desired quality-of-service (QoS) in mobile multimedia communications. As efficiency is an important performance issue for CAC in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory provides an appropriate framework for formulating such fair and efficient CAC problem. Thus, in this paper, a framework based on game theory (both of noncooperative and cooperative games) is proposed to select fair-efficient guard bandwidth coefficients of the CAC scheme for the asymmetrical traffic case in mobile multimedia communications. The proposed game theoretic framework provides fairness and efficiency in the aspects of bandwidth utilization and QoS for multiple classes of traffic, and also guarantees the proper priority mechanism. Call classes are viewed as the players of a game. Utility function of the player is defined to be of two types, the bandwidth utilization and the weighted sum of new call accepting probability and handoff succeeding probability. The numerical results show that, for both types of the utility function, there is a unique equilibrium point of the noncooperative game for any given offered load. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. The results also indicate that, for both types of the utility function, the Nash solution with the origin (0,0) as the starting point of the bargaining problem can achieve higher total utility than the previous CAC scheme while at the same time providing fairness by satisfying a set of fairness axioms. Since the Nash solution is determined from the domain of the Pareto boundary, the way to generate the Pareto boundary is also provided. Therefore, the Nash solution can be obtained easily.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.7 pp.1869-1880
- Publication Date
- 2005/07/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.7.1869
- Type of Manuscript
- Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)
- Category
- Network Management/Operation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Jenjoab VIRAPANICHAROEN, Watit BENJAPOLAKUL, "Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 7, pp. 1869-1880, July 2005, doi: 10.1093/ietfec/e88-a.7.1869.
Abstract: Call admission control (CAC) plays a significant role in providing the efficient use of the limited bandwidth and the desired quality-of-service (QoS) in mobile multimedia communications. As efficiency is an important performance issue for CAC in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory provides an appropriate framework for formulating such fair and efficient CAC problem. Thus, in this paper, a framework based on game theory (both of noncooperative and cooperative games) is proposed to select fair-efficient guard bandwidth coefficients of the CAC scheme for the asymmetrical traffic case in mobile multimedia communications. The proposed game theoretic framework provides fairness and efficiency in the aspects of bandwidth utilization and QoS for multiple classes of traffic, and also guarantees the proper priority mechanism. Call classes are viewed as the players of a game. Utility function of the player is defined to be of two types, the bandwidth utilization and the weighted sum of new call accepting probability and handoff succeeding probability. The numerical results show that, for both types of the utility function, there is a unique equilibrium point of the noncooperative game for any given offered load. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. The results also indicate that, for both types of the utility function, the Nash solution with the origin (0,0) as the starting point of the bargaining problem can achieve higher total utility than the previous CAC scheme while at the same time providing fairness by satisfying a set of fairness axioms. Since the Nash solution is determined from the domain of the Pareto boundary, the way to generate the Pareto boundary is also provided. Therefore, the Nash solution can be obtained easily.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.7.1869/_p
Copy
@ARTICLE{e88-a_7_1869,
author={Jenjoab VIRAPANICHAROEN, Watit BENJAPOLAKUL, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory},
year={2005},
volume={E88-A},
number={7},
pages={1869-1880},
abstract={Call admission control (CAC) plays a significant role in providing the efficient use of the limited bandwidth and the desired quality-of-service (QoS) in mobile multimedia communications. As efficiency is an important performance issue for CAC in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory provides an appropriate framework for formulating such fair and efficient CAC problem. Thus, in this paper, a framework based on game theory (both of noncooperative and cooperative games) is proposed to select fair-efficient guard bandwidth coefficients of the CAC scheme for the asymmetrical traffic case in mobile multimedia communications. The proposed game theoretic framework provides fairness and efficiency in the aspects of bandwidth utilization and QoS for multiple classes of traffic, and also guarantees the proper priority mechanism. Call classes are viewed as the players of a game. Utility function of the player is defined to be of two types, the bandwidth utilization and the weighted sum of new call accepting probability and handoff succeeding probability. The numerical results show that, for both types of the utility function, there is a unique equilibrium point of the noncooperative game for any given offered load. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. The results also indicate that, for both types of the utility function, the Nash solution with the origin (0,0) as the starting point of the bargaining problem can achieve higher total utility than the previous CAC scheme while at the same time providing fairness by satisfying a set of fairness axioms. Since the Nash solution is determined from the domain of the Pareto boundary, the way to generate the Pareto boundary is also provided. Therefore, the Nash solution can be obtained easily.},
keywords={},
doi={10.1093/ietfec/e88-a.7.1869},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1869
EP - 1880
AU - Jenjoab VIRAPANICHAROEN
AU - Watit BENJAPOLAKUL
PY - 2005
DO - 10.1093/ietfec/e88-a.7.1869
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2005
AB - Call admission control (CAC) plays a significant role in providing the efficient use of the limited bandwidth and the desired quality-of-service (QoS) in mobile multimedia communications. As efficiency is an important performance issue for CAC in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory provides an appropriate framework for formulating such fair and efficient CAC problem. Thus, in this paper, a framework based on game theory (both of noncooperative and cooperative games) is proposed to select fair-efficient guard bandwidth coefficients of the CAC scheme for the asymmetrical traffic case in mobile multimedia communications. The proposed game theoretic framework provides fairness and efficiency in the aspects of bandwidth utilization and QoS for multiple classes of traffic, and also guarantees the proper priority mechanism. Call classes are viewed as the players of a game. Utility function of the player is defined to be of two types, the bandwidth utilization and the weighted sum of new call accepting probability and handoff succeeding probability. The numerical results show that, for both types of the utility function, there is a unique equilibrium point of the noncooperative game for any given offered load. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. The results also indicate that, for both types of the utility function, the Nash solution with the origin (0,0) as the starting point of the bargaining problem can achieve higher total utility than the previous CAC scheme while at the same time providing fairness by satisfying a set of fairness axioms. Since the Nash solution is determined from the domain of the Pareto boundary, the way to generate the Pareto boundary is also provided. Therefore, the Nash solution can be obtained easily.
ER -
English
