【24h】

Achieving Fair New Call CAC for Heterogeneous Services in Wireless Networks

机译:为无线网络中的异构服务实现公平的新呼叫CAC

获取原文
获取原文并翻译 | 示例

摘要

In wireless mobile network, handoff dropping probability and new call blocking probability are main issues for satisfaction of quality of service (QoS) requirements. Seeking just to control handoff dropping probability and to optimize utilization without any consideration of fair allocation, serious unfairness occurs among new connections with different QoS requirements. In this paper, we propose a novel call admission control (CAC) scheme and resource management algorithm that guarantee both short-term and long-term fairness between heterogeneous services with different traffic properties and enhance resource utilization of system. These improvements are largely dependent of seeking reservation partition for each class based on stochastic control. We analyze the system model of a cell using two-dimensional Markov chain and Neut's matrix-geometric solutions. By numerical analysis, we demonstrate that our CAC scheme actually achieves call blocking probability (CBP) fairness for wideband and narrowband calls and improve resource utilization.
机译:在无线移动网络中,越区切换丢弃概率和新呼叫阻塞概率是满足服务质量(QoS)要求的主要问题。在不考虑公平分配的情况下,仅试图控制切换丢弃概率并优化利用率,在具有不同QoS要求的新连接之间会出现严重的不公平现象。在本文中,我们提出了一种新颖的呼叫准入控制(CAC)方案和资源管理算法,可以保证具有不同流量特性的异构服务之间的短期和长期公平性,并提高系统的资源利用率。这些改进很大程度上取决于基于随机控制为每个类别寻求预留分区。我们使用二维马尔可夫链和Neut的矩阵几何解决方案分析单元的系统模型。通过数值分析,我们证明了我们的CAC方案实际上实现了宽带和窄带呼叫的呼叫阻塞概率(CBP)公平性,并提高了资源利用率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号