Erickson, A. and Kiasari, A. and Navaridas, J. and Stewart, I.A. (2015) 'Routing algorithms for recursively-defined data centre networks.', in ISPA 105: The 13th IEEE International Symposium on Parallel and Distributed Processing with Applications. Piscataway, NJ: IEEE Computer Society Press, pp. 84-91.
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.
|Item Type:||Book chapter|
|Full text:||(AM) Accepted Manuscript|
Download PDF (178Kb)
|Publisher Web site:||http://dx.doi.org/10.1109/Trustcom.2015.616|
|Publisher statement:||© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|Date accepted:||29 May 2015|
|Date deposited:||02 June 2016|
|Date of first online publication:||2015|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|