Name
Abstract | ||
|---|---|---|
A number of new Clos data center networking fabrics have been proposed recently by using commodity off-the-shelf hardware. In Clos networks, randomized routing is typically used to achieve load balance. However, with typical communication patterns, pure randomized routing design cannot fully exploit bandwidth provided by Clos topologies. This paper strives to evaluate the performance of both randomized routing and its alternatives. As an incremental improvement, periodic path renewal is discussed first. We then discuss adaptive routing, together with its implementation consideration and costs. To reduce overhead of pure adaptive routing, a mixed routing scheme is also discussed. Through detailed discussions and comprehensive evaluations, we provide designers with useful insight and a range of options for configuring the routing scheme. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-46826-5_7 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Clos network,Routing,Data center networks | Dynamic Source Routing,Load balancing (computing),Policy-based routing,Clos network,Computer science,Computer network,Network topology,Exploit,Bandwidth (signal processing),Data center | Conference |
Volume | ISSN | Citations |
502 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| yi wang | 1 | 20 | 2.21 |
| Chen Tian | 2 | 37 | 8.36 |
| ShengJun Wang | 3 | 16 | 2.06 |
| Wenyu Liu | 4 | 3131 | 170.07 |