Outputs (66)

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.

Routing packets on DPillar data centre networks (2015)
Presentation / Conference Contribution
Kiasari, A., Navaridas, J., & Stewart, I. (2015, December). Routing packets on DPillar data centre networks. Presented at 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP, Zhangjiajie, China

An efficient shortest path routing algorithm in the data centre network DPillar (2015)
Presentation / Conference Contribution
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015, December). An efficient shortest path routing algorithm in the data centre network DPillar. Presented at 9th Annual International Conference on Combinatorial Optimization and Applications, COCOA, Houston, USA

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 symm... Read More about An efficient shortest path routing algorithm in the data centre network DPillar.

On the mathematics of data centre network topologies (2015)
Presentation / Conference Contribution
Stewart, I. (2015, August). On the mathematics of data centre network topologies. Presented at 20th International Symposium on Fundamentals of Computation Theory, Gdańsk, Poland

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to... Read More about On the mathematics of data centre network topologies.

Routing algorithms for recursively-defined data centre networks (2015)
Presentation / Conference Contribution
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

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... Read More about Routing algorithms for recursively-defined data centre networks.

Improved routing in the data centre networks HCN and BCN (2014)
Presentation / Conference Contribution
Stewart, I. (2014, December). Improved routing in the data centre networks HCN and BCN. Presented at 2nd International Symposium on Computing and Networking - Across Practical Development and Theoretical Research, Shizuoka, Japan

Graph editing to a fixed target (2014)
Journal Article
Golovach, P., Paulusma, D., & Stewart, I. (2017). Graph editing to a fixed target. Discrete Applied Mathematics, 216(Part 1), 181-190. https://doi.org/10.1016/j.dam.2014.07.008

For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex di... Read More about Graph editing to a fixed target.