Yu Y.-J.Chuang C.-C.Lin H.-P.AI-CHUN PANG2019-07-112019-07-1120139781479905379https://scholars.lib.ntu.edu.tw/handle/123456789/413233Recently, large-scale data centers are widely built to support various kinds of cloud services, which are mostly delivered by multicast. Even with multicast, cloud services may still generate a large amount of data traffic in some bottleneck links and, even worse, cause network congestion. Thus, how to reduce the redundancy of data transmissions to mitigate network congestion is essential. In addition to wired transmissions, modern data centers adopt wireless links to augment network capacity. Under the coexisting scenario of wired and wireless links, this paper studies multicast data delivery problem. Specifically, a multicast tree problem is defined, and the objective is to minimize the total multicast data traffic. We prove the problem is NP-hard and propose an efficient heuristic algorithm to solve the problem. A series of experiment results shows that our proposed algorithm is very effective, compared with an optimal solution designed for traditional wired data centers. ? 2013 IEEE.Data redundancymulticastwireless data centers[SDGs]SDG9[SDGs]SDG11conference paper10.1109/LCN.2013.67612382-s2.0-84898033934https://www.scopus.com/inward/record.uri?eid=2-s2.0-84898033934&doi=10.1109%2fLCN.2013.6761238&partnerID=40&md5=c9c87aff68a6fd588d01ca236e6cd372