Paper
Efficient message routing in PrΣ-network

https://doi.org/10.1016/0165-6074(94)90006-XGet rights and content

Abstract

The PrΣ-network is a high performance interconnection network constructred by the recursive expansion method on the basis of the Petersen graph. As its cost (degree × diameter), a main performance measure for static interconnection networks, is very low in comparison with other known networks of the same size, PrΣ becomes an attractive configuration for high performance interconnection networks. This paper describes how message routing in a PrΣ network can be efficiently carried out. We first show a node addressing scheme for the network, and then present a simple and efficient routing algorithm for message routing in the network. Our algorithm realizes point-to-point message routing without the need of maintaining a routing table at each node, and has a time complexity of O(log nr) for a PrΣ-network containing nr = 10r + 1 nodes, where r ⩾ 0.

References (5)

There are more references available in the full text version of this article.

Cited by (0)

Previously with Department of Computer Science, Åbo Akademi University, Finland.

2

hong @ cit.gn.edu.au., fax: (07) 8755051.

View full text