Routing algorithms for recursively-defined data centre networks

Erickson, A.; Kiasari, A.; Navaridas, J.; Stewart, I.A.

Abstract

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.

Citation

Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015, December). Routing algorithms for recursively-defined data centre networks. Presented at 13th IEEE International Symposium on Parallel and Distributed Processing with Applications, Helsinki

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 13th IEEE International Symposium on Parallel and Distributed Processing with Applications
• Acceptance Date: May 29, 2015
• Publication Date: Jan 1, 2015
• Deposit Date: Jun 19, 2015
• Publicly Available Date: Jun 2, 2016
• Volume: 3
• Pages: 84-91
• Book Title: ISPA 105: The 13th IEEE International Symposium on Parallel and Distributed Processing with Applications.
• DOI: https://doi.org/10.1109/trustcom.2015.616
• Public URL: https://durham-repository.worktribe.com/output/1153286