...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on mobile computing >Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks
【24h】

Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks

机译：连接接纳过程对蜂窝网络中直接重试负载均衡算法的影响

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

摘要

We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool ($({rm DR}_{K})$). The model, developed for a baseline case of two cell network, differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based on their priorities. The quantitative results illustrate that, for example, cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply adjusting the length of the random access phase. Our analysis also allows for the quantitative determination of the blocking probability individual users will experience given a specific length of random access phase. Furthermore, we observe that the improvement in blocking probability per shared channel for load balanced users using $({rm DR}_{K})$ is maximized at an intermediate number of shared channels, as opposed to the maximum number of these shared resources. This occurs because a balance is achieved between the number of users requesting connections and those that are already admitted to the network. We also present an extension of our analytical model to a multicell network (by means of an approximation) and an application of the proposed load balancing scheme in the context of opportunistic spectrum access.
机译：我们提出了一种用于分析蜂窝网络中基于优先级的负载平衡方案的分析框架，该方案基于一种称为直接重试的新算法，该算法具有截短的卸载信道资源池（$（{rm DR} _ {K}）$）。该模型是针对两个蜂窝网络的基准情况而开发的，在许多方面与以前的负载均衡工作有所不同。最重要的是，它通过随机访问结合了呼叫接纳过程。具体而言，提出的模型实现了3GPP网络标准中使用的物理随机访问信道。此外，提出的模型允许基于用户的优先级来区分用户。定量结果表明，例如，蜂窝网络运营商可以通过简单地调整随机接入阶段的长度来控制流量在相邻小区之间的卸载方式。我们的分析还可以定量确定给定特定长度的随机访问阶段，各个用户将遇到的阻塞概率。此外，我们观察到，使用$ {{rm DR} _ {{K}）$的负载平衡用户的每个共享信道的阻塞概率的改善在共享信道的中间数量最大，而不是这些共享资源的最大数量。发生这种情况的原因是，在请求连接的用户数量与已被允许进入网络的用户数量之间取得了平衡。我们还提出了将分析模型扩展到多小区网络的方法（通过一种近似方法），并提出了负载均衡方案在机会频谱接入方面的应用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号