A method for distributed unicast in hypercubes

Author

Fahmy, Hossam M A ; El-Hefnawy, Abubakr A.

Author_Institution

Dept. of Comput. Eng. & Syst., Ain Shams Univ., Cairo, Egypt

Volume

1

fYear

2000

fDate

2000

Firstpage

194

Abstract

Unicast algorithms in off-line routing, have been used as a one-to-one communication between a source node and a destination node in an n-dimensional hypercube, denoted as H_n. These algorithms cannot be used in the case of distributed routing as each node knows the status of its neighbors only while in the case of off-line routing each node knows the status of all the nodes. In this paper, we propose a new method for distributed routing. It can also be used for off-line routing where the cost of collecting global information about the faulty nodes is avoided as well as the information about H, whether it is k-safe or not. The minimum requirements of the proposed method is to have the path between the source and the destination connected, hence, it may work when H_n is disconnected

Keywords

fault tolerance; hypercube networks; network routing; distributed routing; fault tolerance; hypercube; k-safety; multiprocessor interconnection network; off-line routing; unicast algorithm; Communication networks; Costs; Fault tolerance; Hypercubes; Joining processes; Multiprocessor interconnection networks; Network topology; Routing; Systems engineering and theory; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on

Conference_Location

Jounieh

Print_ISBN

0-7803-6542-9

Type

conf

DOI

10.1109/ICECS.2000.911516

Filename

911516