首页> 外文OA文献 >Uplink blocking probabilities in priority-based cellular CDMA networks with finite source population
【2h】

Uplink blocking probabilities in priority-based cellular CDMA networks with finite source population

机译:具有有限源群的基于优先级的蜂窝CDma网络中的上行链路阻塞概率

摘要

Fast proliferation of mobile Internet and high-demand mobile applications necessitates the introduction of different priority classes in next-generation cellular networks. This is especially crucial for efficient use of radio resources in the heterogeneous and virtualized network environments. Despite the fact that many analytical tools have been proposed for capacity and radio resource modelling in cellular networks, only a few of them explicitly incorporate priorities among services. udWe propose a novel analytical model to analyse the performance of a priority-based cellular CDMA system with finite source population. When the cell load is above a certain level, low-priority calls may be blocked to preserve the quality of service of high-priority calls. The proposed model leads to an efficient closed-form solution that enables fast and very accurate calculation of resource occupancy of the CDMA system and call blocking probabilities, for different services and many priority classes. To achieve them, the system is modelled as a continuous-time Markov chain. We evaluate the accuracy of the proposed analytical model by means of computer simulations and find that the introduced approximation errors are negligible.
机译:移动互联网和需求量很大的移动应用程序的快速普及,有必要在下一代蜂窝网络中引入不同的优先级类别。这对于在异构和虚拟化网络环境中有效使用无线电资源至关重要。尽管已经提出了许多用于在蜂窝网络中进行容量和无线电资源建模的分析工具,但只有少数明确将服务之间的优先级合并在一起。 ud我们提出了一种新颖的分析模型,用于分析具有有限源总数的基于优先级的蜂窝CDMA系统的性能。当小区负载高于一定水平时,低优先级呼叫可以被阻塞以保持高优先级呼叫的服务质量。所提出的模型导致了一种有效的封闭形式解决方案,该解决方案能够针对不同的服务和许多优先级类别快速而非常准确地计算CDMA系统的资源占用和呼叫阻塞概率。为了实现它们,将系统建模为连续时间马尔可夫链。我们通过计算机仿真评估了提出的分析模型的准确性,发现引入的近似误差可以忽略不计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号