• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of mobile network design and innovation >Optimising the multiplexing gain in Cloud RAN using the minimum spanning tree algorithm
【24h】

Optimising the multiplexing gain in Cloud RAN using the minimum spanning tree algorithm

机译：使用最小生成树算法优化云中的多路复用增益

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

摘要

The cloud radio access network (Cloud-RAN) has been proposed as a cost efficient way of serving the increasing mobile traffic. The basic idea, supporting the cost efficiency, is the statistical multiplexing gain. Such a gain can be achieved when reusing the same processing power, realising BBU functions, for different, spatially distributed cells. Cells served by a single BBU pool need to be close to each other to support the mobility (handovers) and improve coordination. This article proposes the clustering algorithm, based on the minimum spanning tree (MSP). The algorithm allocates the geographically distributed sites onto a predefined set of BBU pools, keeping the clusters compact while achieving high multiplexing gain. We created, using the described algorithm, the BBU pools based on data traffic statistics from commercial network. We compared the multiplexing gain achieved with the maximum multiplexing gain achievable having given the daily profiles of analysed sites.
机译：已经提出了云无线电接入网络（云RAN）作为服务增加移动流量的成本有效的方式。支持成本效率的基本思想是统计复用增益。在重用相同的处理能力，实现BBU功能时，可以实现这种增益，用于不同的空间分布的单元。由单个BBU池服务的细胞需要彼此接近以支持移动性（切换）并改善协调。本文基于最小生成树（MSP）提出了聚类算法。该算法将地理上分布式站点分配到预定义的BBU池集上，在实现高复用增益的同时保持群集紧凑。我们使用所描述的算法是根据来自商业网络的数据流量统计来创建的BBU池。我们比较了通过在分析的位点的日常概况中获得的最大多路复用增益实现的多路复用增益。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号