Skip to main content

Research Repository

Advanced Search

The influence of datacenter usage on symmetry in datacenter network design (2017)
Journal Article
Stewart, I., & Erickson, A. (2018). The influence of datacenter usage on symmetry in datacenter network design. Journal of Supercomputing, 74(6), 2276-2313. https://doi.org/10.1007/s11227-017-2217-1

We undertake the first formal analysis of the role of symmetry, interpreted broadly, in the design of server-centric datacenter networks. Although symmetry has been mentioned by other researchers, we explicitly relate it to various specific, structur... Read More about The influence of datacenter usage on symmetry in datacenter network design.

On the combinatorial design of data centre network topologies (2017)
Journal Article
Stewart, I. (2017). On the combinatorial design of data centre network topologies. Journal of Computer and System Sciences, 89, 328-348. https://doi.org/10.1016/j.jcss.2017.05.015

The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. We clarify and extend these results... Read More about On the combinatorial design of data centre network topologies.

Improved routing algorithms in the dual-port datacenter networks HCN and BCN (2017)
Journal Article
Erickson, A., Stewart, I., Pascual, J., & Navaridas, J. (2017). Improved routing algorithms in the dual-port datacenter networks HCN and BCN. Future Generation Computer Systems, 75, 58-71. https://doi.org/10.1016/j.future.2017.05.004

We present significantly improved one-to-one routing algorithms in the datacenter networks HCN and View the MathML source in that our routing algorithms result in much shorter paths when compared with existing routing algorithms. We also present a mu... Read More about Improved routing algorithms in the dual-port datacenter networks HCN and BCN.

The stellar transformation: from interconnection networks to datacenter networks (2016)
Journal Article
Erickson, A., Stewart, I., Navaridas, J., & Kiasari, A. (2017). The stellar transformation: from interconnection networks to datacenter networks. Computer Networks, 113, 29-45. https://doi.org/10.1016/j.comnet.2016.12.001

The first dual-port server-centric datacenter network, FiConn, was introduced in 2009 and there are several others now in existence; however, the pool of topologies to choose from remains small. We propose a new generic construction, the stellar tran... Read More about The stellar transformation: from interconnection networks to datacenter networks.

Sufficient conditions for Hamiltonicity in multiswapped networks (2016)
Journal Article
Stewart, I. (2016). Sufficient conditions for Hamiltonicity in multiswapped networks. Journal of Parallel and Distributed Computing, 101, 17-26. https://doi.org/10.1016/j.jpdc.2016.10.015

OTIS networks are interconnection networks amenable to deployment as hybrid networks containing both electronic and optical links. Deficiencies as regards symmetry led to the subsequent formulation of biswapped networks which were later generalized t... Read More about Sufficient conditions for Hamiltonicity in multiswapped networks.

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar (2016)
Journal Article
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2016). An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. IEEE Transactions on Parallel and Distributed Systems, 28(3), 689-703. https://doi.org/10.1109/tpds.2016.2591011

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 be... Read More about An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes (2016)
Journal Article
Kuo, C., & Stewart, I. (2016). Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theoretical Computer Science, 627, 102-106. https://doi.org/10.1016/j.tcs.2016.02.029

Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube FQn so that |F v | + |Fe | ≤ n − 2, for n ≥ 2. Choose any fault-free edge e. If n ≥ 3 then there is a fault-free cycle of length l in FQn containing e,... Read More about Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes.