Suboptimal network coding subgraph algorithms for 5G minimum-cost multicast networks

5G最小代价多播网络中的次优编码子图算法（英文）

To reduce the transmission cost in 5G multicast networks that have separate control and data planes, we focus on the minimum-power-cost network-coding subgraph problem for the coexistence of two multieasts in wireless networks. We propose two suboptimal algorithms as extensions of the Steiner tree multicast. The critical 1-cut path eliminating （C1CPE） algorithm attempts to find the minimum-cost solution for the coexistence of two multicast trees with the same throughput by reusing the links in the topology, and keeps the solution decodable by a coloring process. For the special case in which the two multicast trees share the same source and destinations, we propose the extended selective closest terminal first （E-SCTF） algorithm out of the CICPE algorithm. Theoretically the complexity of the E-SCTF algorithm is lower than that of the C1CPE algorithm. Simulation results show that both algorithms have superior performance in terms of power cost and that the advantage is more evident in networks with ultra-densification.

为降低具有控制—数据分离架构的5G网络中多播的传输代价,本文关注无线网络中两多播共存时的功率代价最小网络编码子图形成问题。提出两个基于Steiner树的扩展次优算法:当两个具有相同吞吐量的多播组共存时,C1CPE算法通过复用拓扑中已经占用链路的方式寻找可行的最小代价方案,并采用节点涂色的方式保证网络编码方案可解码。另外,针对两多播组的源点和目的点相同的特殊情况,在C1CPE算法基础上提出E-SCTF算法。此算法精简了涂色方案,通过理论分析可知此算法复杂度比C1CPE算法低。仿真结果表明,两个算法在功率代价上都有良好表现,在密集部署下性能仍可进一步提升。