Hedera: Dynamic Flow Scheduling for Data Center Networks

Source: University of California

Favorite

Free registration required

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.
Format:PDF Size:1399.90
Date:Mar 2010