Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

An optimal single-path routing algorithm in the datacenter network DPillar.

Erickson, A. and Kiasari, A.E. and Navaridas, J. and Stewart, I.A. (2016) 'An optimal single-path routing algorithm in the datacenter network DPillar.', IEEE transactions on parallel and distributed systems., 28 (3). pp. 689-703.

Abstract

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
(415Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1109/TPDS.2016.2591011
Publisher statement:© 2016 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:07 July 2016
Date deposited:19 July 2016
Date of first online publication:13 July 2016
Date first made open access:19 July 2016

Save or Share this output

Export:
Export
Look up in GoogleScholar