arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.11270cs.NIcs.DMmath.OC
收藏

具有中途容量约束的5G网络调度算法

Scheduling Algorithms for 5G Networks with Mid-haul Capacity Constraints

Abhishek Sinha, Matthew Andrews, Prasanth Ananth

摘要:

我们考虑用于5G网络的虚拟化RAN架构,其中远程单元通过中间传输连接到中央单元。为了支持高数据率,使用无源光网络(PON)来实现中距离。在这种架构中,数据存储在中央单元,直到调度器决定将其通过中途传输到适当的远程单元,然后在同一时隙通过空中传输。我们研究的最优调度问题,出现在这种情况下。这个问题有两个关键特征。首先,必须同时调度多个小区以实现高效操作。其次,需要有效地处理时变无线接口速率与固定容量PON之间的相互作用。在本文中,我们采取了全面的看看这个资源分配问题,制定它作为一个效用最大化的问题。使用组合技术,我们得到有用的结构特性的最优分配,并利用这些结果来设计多项式时间的近似算法和伪多项式时间的最优算法。最后,我们数值比较所提出的算法的性能,这是无处不在的比例公平算法的自然推广的算法。

英文摘要:

We consider a virtualized RAN architecture for 5G networks where the Remote Units are connected to a central unit via a mid-haul. To support high data rates, the midhaul is realized with a Passive Optical Network (PON). In this architecture, the data are stored at the central unit until the scheduler decides to transmit it through the mid-haul to an appropriate remote unit, and then over the air at the same slot. We study an optimal scheduling problem that arises in this context. This problem has two key features. First, multiple cells must be scheduled simultaneously for efficient operation. Second, the interplay between the time-varying wireless interface rates and the fixed capacity PON needs to be handled efficiently. In this paper, we take a comprehensive look at this resource allocation problem by formulating it as a utility-maximization problem. Using combinatorial techniques, we derive useful structural properties of the optimal allocation and utilize these results to design polynomial-time approximation algorithms and a pseudopolynomial-time optimal algorithm. Finally, we numerically compare the performance of the proposed algorithms to heuristics which are natural generalizations of the ubiquitous Proportional Fair algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑