Name
Abstract | ||
|---|---|---|
Performance-optimized datacenter networks aim to handle more efficiently the growing East-West intra-cluster traffic of BigData applications. The demanding latency constraints and traffic patterns of these applications expose the inherent bottlenecks of the often oversubscribed datacenter network topologies, favoring in stead the full-bisectional bandwidth fat-trees. And yet their topological benefits may remain unrealized in practical deployments, if such fabrics use single path or flow-level (ECMP hashing) multipath routing. Here we model in detail on Layer 2 the routing performance of modern fat-tree networks using stochastic permutations of bursty traffic. We first analytically simplify and then validate by accurate simulation models that the throughputs for `static' d-mod-k and for ECMP-like multipath routing are 63% and 47%, respectively. We also find that ECMP routing results in a wide spread of link loads under random permutation traffic, which manifests as a 3x throughput reduction for 30% of the flows. Furthermore, ECMP can lead to collisions of mouse and elephant flows, often increasing the flow completion time (FCT) of delay-sensitive flows by a factor of 10. In contrast, packet-based multipath outperforms all the others in this study. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/HPSR.2014.6900884 | High Performance Switching and Routing |
Keywords | Field | DocType |
Big Data,computer centres,delays,telecommunication congestion control,telecommunication network routing,telecommunication network topology,BigData application,East-West intracluster traffic,bursty traffic patterns,delay sensitive flow FCT,elephant flow completion time,equal cost multipath,high performance single path flow level multipath routing,link load wide spread,modern fat tree network latency constraint,mouse collision,oversubscribed data center network topology,packet based ECMP routing,random stochastic permutation traffic,static d-mod-k multipath routing | Multipath propagation,Multipath routing,Computer science,Network packet,Computer network,Real-time computing,Network topology,Random permutation,Bandwidth (signal processing),Throughput,Telecommunications link | Conference |
ISSN | Citations | PageRank |
2325-5595 | 1 | 0.35 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chrysos, N. | 1 | 1 | 0.35 |
| Gusat, M. | 2 | 1 | 0.35 |
| Neeser, F. | 3 | 1 | 0.35 |
| C. Minkenberg | 4 | 29 | 3.05 |