@inproceedings{1c7530cb56174875ace83a1b76fa5f8a,
title = "An efficient shortest-path routing algorithm in the data centre network DPillar",
abstract = "DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry property of DPillar. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(klog(n)), where k parameterizes the dimension of DPillar and n the number of ports in its switches. 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. A secondary and important effect of our work is that it emphasises that data centre networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.",
keywords = "Data centre networks, Routing algorithms, Shortest paths",
author = "Alejandro Erickson and Kiasari, {Abbas Eslami} and Javier Navaridas and Stewart, {Iain A.}",
year = "2015",
month = jan,
day = "1",
doi = "10.1007/978-3-319-26626-8_16",
language = "English",
isbn = "9783319266251",
volume = "9486",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "209--220",
editor = "Donghyun Kim and Weili Wu and Ding-Zhu Du and Zaixin Lu and Wei Li",
booktitle = "Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Proceedings",
address = "United States",
note = "9th International Conference on Combinatorial Optimization and Applications, COCOA 2015 ; Conference date: 18-12-2015 Through 20-12-2015",
}