This document proposes a new multicast routing scheme called ESM for data center networks. ESM addresses the challenges of inefficient multicast tree formation in densely connected data center networks and the difficulty of low-end switches supporting a large number of multicast groups. ESM builds efficient multicast trees using a source-to-receiver expansion approach rather than receiver-driven routing. It also combines in-packet Bloom filters and in-switch entries to reduce the number of entries needed while minimizing additional bandwidth overhead. Simulations show ESM saves 40-50% network traffic and doubles application throughput compared to receiver-driven routing.

1. Impulse Technologies
Beacons U to World of technology
044-42133143, 98401 03301,9841091117 ieeeprojects@yahoo.com www.impulse.net.in
ESM: Efficient and Scalable Data Center Multicast Routing
Abstract
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
Your Own Ideas or Any project from any company can be Implemented
at Better price (All Projects can be done in Java or DotNet whichever the student wants)
1