Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
LIPSIN: line speed publish/subscribe inter-networking
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Towards automated performance diagnosis in a large IPTV network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
BUFFALO: bloom filter forwarding architecture for large organizations
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Dr. multicast: Rx for data center communication scalability
Proceedings of the 5th European conference on Computer systems
Building mega data center from heterogeneous containers
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
Scalable data center multicast using multi-class Bloom Filter
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
ISRN Communications and Networking
Scaling IP multicast on datacenter topologies
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
Multicast benefits group communications in saving network traffic and improving application throughput, both of which are important for data center applications. However, the technical trend of data center design poses new challenges for efficient and scalable multicast routing. First, the densely connected networks make traditional receiver-driven multicast routing protocols inefficient in multicast tree formation. Second, it is quite difficult for the low-end switches widely used in data centers to hold the routing entries of massive multicast groups. In this paper, we propose ESM, an efficient and scalable multicast routing scheme for data center networks. ESM addresses the challenges above by exploiting the feature of modern data center networks. Based on the regular topology of data centers, ESM uses a source-to-receiver expansion approach to build efficient multicast trees, excluding many unnecessary intermediate switches used in receiver-driven multicast routing. For scalable multicast routing, ESM combines both in-packet Bloom Filters and in-switch entries to make the tradeoff between the number of multicast groups supported and the additional bandwidth overhead. Simulations show that ESM saves 40% - 50% network traffic and doubles the application throughputs compared to receiver-driven multicast routing, and the combination routing scheme significantly reduces the number of in-switch entries required. We implement ESM on a Linux platform. The experimental results further demonstrate that ESM can well support online tree building for large-scale groups with churns, and the overhead of the combination forwarding engine is light-weighted.