Routing Algorithms for Recursively-Defined Datacenter Networks

The server-centric datacenter 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 datacenter networks. We propose a family of novel routing algorithms for completely-connected recursively-defined datacenter networks that are immediately applicable to the well-known datacenter networks (Generalized) DCell and FiConn. Our routing algorithms involve the concept of proxy search and we show, via an extensive experimental evaluation, that our methodology leads to significant improvements in terms of hop-length, faulttolerance, load-balance, network-throughput, end-toend latency, and workload completion time when we compare our algorithms with the existing routing algorithms for (Generalized) DCell and FiConn.