Nikolaos Chrysos
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.
- A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta: "VL2: a scalable and flexible data center network" In ACM SIGCOMM CCR, 2009. Google Scholar
Digital Library
- M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat: "Hedera: Dynamic Flow Scheduling for Data Center Networks", NSDI 2010. Google ScholarDigital Library
- M. Schlansker, J. Tourrilhes, Y. Turner, and J. R. Santos: "Killer fabrics for scalable datacenters", In IEEE International Conference Communications (ICC), Cape Town, May, 2010.Google ScholarCross Ref
- L. Valiant, G. Brebner: "Universal Schemes for Parallel Communication" Proc. 13th ACM Symp. STOC, Milwaukee, May 1981. Google ScholarDigital Library
- A. Dixit, P. Prakash, Y. C. Hu, and R. R Kompella: "On the Impact of Packet Spraying in Data Center Networks", Proc. IEEE INFOCOM, April, 2013.Google ScholarCross Ref
- O. Rottenstreich, P. Li, I. Horev, I. Keslassy and S. Kalyanaraman "The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party", IEEE Transactions on Computers.Google Scholar
- C. Gomez, F. Gilabert, M. E. Gomez, P. Lopez, and J. Duato: "Deterministic versus adaptive routing in fat-trees." In IEEE IPDPS 2007.Google Scholar
- C. E. Leiserson, et al: "The network architecture of the Connection Machine CM-5": In Proc. ACM symposium on Parallel algorithms and architectures, pp. 272--285. 1992. Google ScholarDigital Library
- X. Yuan, W. Nienaber, Z. Duan, and R. Melhem: "Oblivious routing for fat-tree based system area networks with uncertain traffic demands", In ACM SIGMETRICS Performance Evaluation Review, vol. 35, no. 1, ACM, 2007. Google ScholarDigital Library
- R. Rojas-Cessa, E. Oki, H. J. Chao: "CIXOB-k: Combined Input-Crosspoint-Output Buffered Switch", Proc. IEEE GLOBECOM, Texas, Nov. 2001.Google ScholarCross Ref
- M. Alizadeh and T. Edsall: "On the Data Path Performance of Leaf-Spine Datacenter Fabrics": In IEEE HOTI, 2013. Google ScholarDigital Library
Index Terms
- All routes to efficient datacenter fabrics
Recommendations
Large switches or blocking multi-stage networks? An evaluation of routing strategies for datacenter fabrics
Cloud computing clusters require efficient interconnects to deal with the increasing volume of inter-server (east-west) traffic. To cope with these new traffic patterns, datacenter networks are abandoning the oversubscribed topologies of the past, and ...
Quantifying the BGP routes diversity inside a tier-1 network
NETWORKING'06: Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications SystemsMany large ISP networks today rely on route-reflection [1] to allow their iBGP to scale. Route-reflection was officially introduced to limit the number of iBGP sessions, compared to the $\frac{n\times(n-1)}{2}$ sessions required by an iBGP full-mesh. ...
Locating BGP missing routes using multiple perspectives
NetT '04: Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning realityThere have been many studies on measuring and interpreting inter-domain routing dynamics. Most of them, however, are based on the approach of off-line and passive post-processing BGP routing updates. We propose a new methodology that uses real-time and ...
Comments