Efficient Multicast Delivery for Data Redundancy Minimization over Wireless Data Centers

Efficient Multicast Delivery for Data Redundancy Minimization over Wireless Data Centers With the explosive growth of cloud-based services, large-scale data centers are widely built for housing critical computing resources to gain significant economic benefits. In data centers, the cloud services are generally accomplished by multicast-based group communications. Recently, many well-known industries, such as Microsoft, Google, and IBM, adopt highspeed wireless technologies to augment network capacity in data centers. However, those well-known multicast delivery schemes for traditional wired data centers do not consider the unique characteristics of wireless communications, which may result in unnecessary data transmissions and network congestions. Under the coexisting scenario of wired and wireless links, this paper studies multicast tree construction and maintenance problems. The objective is to minimize the total multicast traffic. We prove the problems are NP-hard and propose efficient heuristic algorithms for the two problems. Based on real traces and practical settings obtained from commercial data centers, a series of experiments are conducted, and the experimental results show that our proposed algorithms are effective for reducing multicast data traffic. The results also provide useful insights into the design of multicast tree construction and maintenance for wireless data center networks.