Search Results

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.