Name
Abstract | ||
|---|---|---|
Performance optimized datacenters (PoDs) require efficient PoD interconnects to deal with the increasing volumes of inter-server (east-west) traffic. To cope with these stringent traffic patterns, datacenter networks are abandoning the oversubscribed topologies of the past, and move towards full-bisection fat-tree fabrics. However, these fabrics typically employ either single-path or coarse-grained (flow-level) multi-path routing. In this paper, we use computer simulations and analysis to characterize the waste of bandwidth that is due to routing inefficiencies. Our analysis suggests that, under a randomly selected permutation, the expected throughputs of d-mod-k routing and of flow-level multi-path routing are close to 63% and 47%, respectively. Furthermore, nearly 30% of the flows are expected to undergo an unnecessary 3-fold slowdown. By contrast, packet-level multi-path routing consistently delivers full throughput to all flows, and proactively avoids internal hotspots, thus serving better the growing demands of inter-server (east-west) traffic. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2556857.2556861 | Proceedings of the 8th International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip |
Keywords | DocType | Citations |
packet-level multi-path,flow-level multi-path routing,stringent traffic pattern,expected throughput,multi-path routing,efficient datacenter fabric,datacenter network,3-fold slowdown,d-mod-k routing,computer simulation,efficient pod interconnects | Conference | 4 |
PageRank | References | Authors |
0.41 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolaos Chrysos | 1 | 60 | 8.56 |
| Fredy D. Neeser | 2 | 15 | 2.69 |
| Mitch Gusat | 3 | 46 | 4.77 |
| Cyriel Minkenberg | 4 | 399 | 39.21 |
| Wolfgang E. Denzel | 5 | 212 | 14.56 |
| Claude Basso | 6 | 62 | 6.85 |