Hedera: Dynamic Flow Scheduling for Data Center Networks

Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end switches, data center topologies typically consist of multi-rooted trees with many equal-cost paths between any given pair of hosts. Existing IP multipathing protocols usually rely on per-flow static hashing and can cause substantial bandwidth losses due to long-term collisions.

Provided by: University of California Topic: Data Centers Date Added: Mar 2010 Format: PDF

Download Now

Find By Topic