An oblivious shortest-path routing algorithm for fully connected cubic networks

Authors:
Xiaofan Yang;Graham M. Megson;David J. Evans
Affiliations:
Department of Computer Science and Technology, Chongqing University, PR China;Department of Computer Science, School of Systems Engineering, University of Reading, Reading, Berkshire, UK;School of Computing and Mathematics, Nottingham Trent University, Nottingham, UK
Venue:
Journal of Parallel and Distributed Computing
Year:
2006

Citing 20
Cited 2

Hypernet: A communication-efficient architecture for constructing massively parallel computers

IEEE Transactions on Computers
Hierarchical Interconnection Networks for Multicomputer Systems

IEEE Transactions on Computers
Hierarchical Cubic Networks

IEEE Transactions on Parallel and Distributed Systems
Hierarchical hypercube networks (HHN) for massively parallel computers

Journal of Parallel and Distributed Computing
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Basic Operations on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Combinatorial Properties of Two-Level Hypernet Networks

IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers
Topological Properties of OTIS-Networks

IEEE Transactions on Parallel and Distributed Systems
Routing properties of a recursive interconnection network

Journal of Parallel and Distributed Computing
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes

IEEE Transactions on Parallel and Distributed Systems
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems

IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules

IEEE Transactions on Parallel and Distributed Systems
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Models and Algorithms for Optical and Optoelectronic Parallel Computers

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Hierarchical star: a new two level interconnection network

Journal of Systems Architecture: the EUROMICRO Journal
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks

Information Processing Letters
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II

A class of hierarchical graphs as topologies for interconnection networks

Theoretical Computer Science
k-pairwise disjoint paths routing in perfect hierarchical hypercubes

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8n nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy.