PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

An optimal message routing algorithm for circulant networks
Tomaž Dobravec, Janez Žerovnik and Borut Robič
Journal of Systems Architecture Volume 52, Number 5, pp. 298-306, 2006. ISSN 1383-7621

Abstract

A k-circulant network G(n; h1, h2, … , hk) is an undirected graph where the node set is $Z_n$ and the edges are given by $\{v,v\pm hi\}$. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, $k\geq 2$. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses only the address of the final destination to determine the next node to which the message must be sent in order to stay on one of the shortest paths to its destination. We introduce the restricted shortest paths, which are used by our routing algorithm, and present an efficient algorithm for their construction in 2-circulant graphs.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:2412
Deposited By:Janez Žerovnik
Deposited On:22 November 2006