On Data Center Network Architectures for Interconnecting Dual-Port Servers

During the past decade, various novel data center network (DCN) architectures have been proposed to meet various requirements of large scale data centers. In existing works that consider server-centric DCN architectures, the lengths of a server-to-server-direct hop and a server-to-server-via-a-switch hop are assumed to be equal. We propose the concept of Normalized Switch Delay (NSD) to distinguish a server-to-server-direct hop and a server-to-server-via-a-switch hop, to unify the design and analysis of server-centric DCN architectures for interconnecting servers with two network interface cards. In [1], the authors claim that BCN is the largest known architecture to interconnect dual-port servers, with diameter 7, given a switch port number. We notice that the existing DPillar [2] architecture accommodates more servers than BCN does under the same configurations. Motivated by this fact, we consider a fundamental problem: maximizing the number of dual-port servers, given network diameter and switch port number; and give an upper bound on this maximum number. Then, we propose three novel architectures that try to achieve this upper bound: SWCube, SWKautz, and SWdBruijn, based on the generalized hypercube, Kautz graph, and de Bruijn graph, respectively. The number of servers that SWCube can accommodate is comparable to that of DPillar. The number of servers that SWKautz and SWdBruijn can accommodate is generally greater than that of DPillar. Compared with three existing architectures, the three proposed architectures, SWCube, SWKautz and SWdBruijn demonstrate various advantages. Analysis and simulations on the newly proposed architectures also show that they have nice properties for DCNs, such as low diameter, high bisection width, good fault-tolerance, and the capability of efficiently handling network congestion.

[1]  N. Biggs Algebraic Graph Theory: The multiplicative expansion , 1974 .

[2]  Haitao Wu,et al.  FiConn: Using Backup Port for Server Interconnection in Data Centers , 2009, IEEE INFOCOM 2009.

[3]  Lixin Gao,et al.  DPillar: Scalable Dual-Port Server Interconnection for Data Center Networks , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[4]  Yunhao Liu,et al.  Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers , 2013, IEEE Transactions on Computers.

[5]  Yan Zhang,et al.  On Architecture Design, Congestion Notification, TCP Incast and Power Consumption in Data Centers , 2013, IEEE Communications Surveys & Tutorials.

[6]  Ying Yuan,et al.  MCube: A high performance and fault-tolerant network architecture for data centers , 2010, 2010 International Conference On Computer Design and Applications.

[7]  Jung Ho Ahn,et al.  HyperX: topology, routing, and packaging of efficient large-scale networks , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[8]  Abhijit Sengupta,et al.  On a Lightwave Network Topology Using Kauts Digraphs , 1999, IEEE Trans. Computers.

[9]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[10]  Paul J.M. Havinga,et al.  An algorithm for generating node disjoint routes in Kautz digraphs , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[11]  GhemawatSanjay,et al.  The Google file system , 2003 .

[12]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[13]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[14]  Hong Liu,et al.  Energy proportional datacenter networks , 2010, ISCA.

[15]  P. Castoldi,et al.  Designing Energy-Efficient Data Center Networks Using Space-Time Optical Interconnection Architectures , 2013, IEEE Journal of Selected Topics in Quantum Electronics.

[16]  Xiuzhen Cheng,et al.  Wireless data center networking , 2011, IEEE Wireless Communications.

[17]  José D. P. Rolim,et al.  Bisecting De Bruijn and Kautz Graphs , 1998, Discret. Appl. Math..

[18]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[19]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[20]  Alejandro López-Ortiz,et al.  REWIRE: An optimization-based framework for unstructured data center network design , 2012, 2012 Proceedings IEEE INFOCOM.

[21]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[22]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[23]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.