Adaptive fault tolerant routing in star graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3326, Issue , 2004, Pages 385-390

  Das, Rajib K ^a  

^a TEZPUR UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; ROUTING ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE;

ADAPTIVE FAULT TOLERANT; FAULT TOLERANT ROUTING; FAULT-TOLERANT ROUTING ALGORITHM; FAULTY LINKS; FAULTY NODE; NEIGHBOURHOOD; SHORT-PATH; SOURCE-DESTINATION PAIRS; STAR GRAPHS; STARS: BE; SHORTEST PATH;

FAULT TOLERANCE; GRAPH THEORY;

EID: 35048902507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30536-1_43     Document Type: Article

References (7)

1. Akers, S. B., Harel, D., Krishnamurthy B.: The star graph : An attractive alternative to the n-cube. In: Proc. of Int. Conf. on Parallel Processing. (1987) 393-400
2. Akers, S. B., Krishnamurthy, B.: A group theoretic model for symmetric Interconnection Networks. IEEE Transaction on Computers. 38 (1989) 555-566
3. Misic, J., Jovanovic, Z.: Routing function and deadlock avoidance in a star graph. Journal of Parallel and Distributed Computing. (1994) 216-228
4. Bagherzadeh, N., Nassif, N., Latifi, S.: "A routing and broadcasting scheme on faulty star graphs. IEEE Trans. on Computers, 42 (1993). 1398-1403
5. Day, K., Ayyoub, A. E. A. I.: Reliable Communication in faulty star. In: Proc. of International Parallel and Distributed Processing Symposium. (2002)
6. Wu, J.: Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors. IEEE Transaction on Parallel and Distributed Systems. 9 (1998) 321-334
7. Wu, J., Gao, F., Li, Z., Min, Y.: Optimal and Reliable communication in Hypercubes Using Extended Safety Vectors. IEEE Transactions on Reliability (to appear)