Routing Algorithms for Recursively-Defined Data Centre Networks

The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of analysis and experimentation in order that they might achieve their full potential as data centre networks. We propose a family of novel routing algorithms on two well-known data centre networks of this type, (Generalized) DCell and FiConn, using techniques that can be applied more generally to the class of networks we call completely connected recursively-defined networks. In doing so, we develop a classification of all possible routes from server-node to server-node on these networks, called general routes of order t, and find that for certain topologies of interest, our routing algorithms efficiently produce paths that are up to 16% shorter than the best previously known algorithms, and are comparable to shortest paths. In addition to finding shorter paths, we show evidence that our algorithms also have good load-balancing properties.

[1]  Jason Lee,et al.  Generalized DCell Structure for Load-Balanced Data Center Networks , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[2]  William J. Dally,et al.  Flattened butterfly: a cost-efficient topology for high-radix networks , 2007, ISCA '07.

[3]  Hong Liu,et al.  Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network , 2015, Comput. Commun. Rev..

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

[5]  Amin Vahdat,et al.  Helios: a hybrid electrical/optical switch architecture for modular data centers , 2010, SIGCOMM '10.

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

[7]  C. Sanges,et al.  A recursively scalable network VLSI implementation , 1988, Future Gener. Comput. Syst..

[8]  Haitao Wu,et al.  Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports , 2011, IEEE/ACM Transactions on Networking.

[9]  Jun Li,et al.  The Generalized DCell Network Structures and Their Graph Properties , 2009 .

[10]  Antony I. T. Rowstron,et al.  Symbiotic routing in future data centers , 2010, SIGCOMM '10.

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

[12]  Lixin Gao,et al.  DPillar: Dual-port server interconnection network for large scale data centers , 2012, Comput. Networks.

[13]  Tom White,et al.  Hadoop: The Definitive Guide , 2009 .

[14]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[15]  Dong Lin,et al.  Data Center Networks: Topologies, Architectures and Fault-Tolerance Characteristics , 2013 .

[16]  Xin Yuan,et al.  LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[17]  Ankit Singla,et al.  Jellyfish: Networking Data Centers Randomly , 2011, NSDI.

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

[19]  Gen-Huey Chen,et al.  Topological Properties of WK-Recursive Networks , 1994, J. Parallel Distributed Comput..

[20]  Gen-Huey Chen,et al.  A general broadcasting scheme for recursive networks with complete connection , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

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