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

Yang, Xiaofan and Megson, Graham M. and Evans, David J. (2006) An oblivious shortest-path routing algorithm for fully connected cubic networks. Journal of Parallel and Distributed Computing, 66 (10). pp. 1294-1303. ISSN 0743-7315

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.jpdc.2006.03.008

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.

Item Type: Article
Subjects: University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)
Depositing User: Miss Nina Watts
Date Deposited: 03 Feb 2009 10:43
Last Modified: 20 Oct 2009 13:47
URI: http://westminsterresearch.wmin.ac.uk/id/eprint/5786

Actions (login required)

Edit Item (Repository staff only) Edit Item (Repository staff only)