DocumentCode
2777808
Title
Fault-tolerant routing in the star graph
Author
Rezazad, S.M. ; Sarbazi-Azad, H.
Author_Institution
IPM Sch. of Comput. Sci., Sharif Univ. of Technol., Tehran, Iran
Volume
2
fYear
2004
fDate
29-31 March 2004
Firstpage
503
Abstract
We present a fault tolerant routing algorithm for the star graph. The algorithm is based on the concept of unsafety vectors originally proposed for binary n-cubes [J. Al-Sadi et al., (2002)]. Each node starts by computing a first level unsafely set, composed of the set of unreachable neighbours. lt then performs some exchanges with its neighbours to determine the unsafely nodes. After that all of the nodes have the addresses of all faulty nodes. Based on the information gathered in each node. Fault-tolerant routing between a source node and a destination node is realised.
Keywords
computer networks; fault tolerant computing; graph theory; binary n-cubes; destination node; fault tolerant routing algorithm; source node; star graph; Computer science; Fault tolerance; Greedy algorithms; Hypercubes; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications, 2004. AINA 2004. 18th International Conference on
Print_ISBN
0-7695-2051-0
Type
conf
DOI
10.1109/AINA.2004.1283853
Filename
1283853
Link To Document