...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences >Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory
【24h】

Fair-Efficient Guard Bandwidth Coefficients Selection in Call Admission Control for Mobile Multimedia Communications Using Framework of Game Theory

机译：基于博弈论框架的移动多媒体通信呼叫接纳控制中公平有效的保护带宽系数选择

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：呼叫准入控制（CAC）在提供有效使用有限带宽和移动多媒体通信中所需的服务质量（QoS）方面起着重要作用。由于效率是具有多媒体服务的移动网络中CAC的重要性能问题，因此还应考虑服务之间的公平性概念。博弈论为制定这种公平有效的CAC问题提供了一个适当的框架。因此，在本文中，提出了一种基于博弈论的框架（非合作博弈和合作博弈），为移动多媒体通信中的非对称流量情况选择CAC方案的公平有效的保护带宽系数。所提出的博弈论框架在多类流量的带宽利用率和QoS方面提供了公平性和效率，并保证了适当的优先级机制。通话类别被视为游戏的玩家。播放器的效用函数被定义为两种类型，带宽利用和新呼叫接受概率和切换成功概率的加权和。数值结果表明，对于两种类型的效用函数，对于任何给定的给定负载，非合作博弈都有一个唯一的平衡点。对于合作博弈，研究了效用和讨价还价问题的人际比较仲裁方案。结果还表明，对于两种类型的效用函数，以原点（0,0）作为讨价还价问题的起点的Nash解可以实现比以前的CAC方案更高的总效用，同时提供公平性通过满足一组公平公理。由于纳什解决方案是根据帕累托边界的域确定的，因此也提供了生成帕累托边界的方法。因此，可以容易地获得纳什溶液。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号