摘要
为解决无线数据中心网络中群组通信因数据传输冗余产生的网络拥塞问题,提出一种基于流量最小化的多播数据传输方案,通过构建由有线和无线链路组成的多播树,实现总体多播数据流量最小化。阐述在有线和无线链路共存的条件下,多播树的构建问题;验证多播树的构建问题是NP难题,提出一种高效的启发式求解算法;利用真实数据中心测得的实际参数设置进行仿真实验,评估该求解算法的性能。实验结果表明,与传统有线数据中心的最优解决方案相比,该方案可以有效降低多播流量的总体数据冗余。
To solve the congestion problems caused by the redundancy of data transmission in group communication in the wire‐less data center network ,a multicast data transmission scheme based on traffic minimization was proposed .Multicast trees were built composing wired and wireless links for minimizing the total multicast data traffic .First ,the multicast tree building problem under the circumstances of coexisting wired and wireless links in wireless data center networks was formulated .Then ,the target problem was verified to be a NP‐hard problem and an efficient heuristic algorithm was proposed to solve the problem .Finally ,a series of simulations based on practical parameter settings measured from real data centers were conducted to evaluate the per‐formance of the proposed algorithm .The simulation results demonstrate that the proposed algorithm is effective in reducing the total data redundancy of the multicast traffic compared with an optimal solution designed for traditional wired data centers .
出处
《计算机工程与设计》
北大核心
2015年第6期1457-1463,共7页
Computer Engineering and Design
关键词
数据中心
多播树
NP难题
数据流量
启发式算法
data centers
multicast trees
NP-hard problem
data traffic
heuristic algorithm