Title :
A distributed message routing algorithm for fault-tolerant hypercube systems
Author :
Min, Youli ; Min, Yinghua
Author_Institution :
Inst. of Comput. Technol., Academia Sinica, Beijing, China
Abstract :
A distributed message routing algorithm for faulty hypercube systems is described. To improve the efficiency, the algorithm adopts a heuristic backtracking strategy and each node provides an array to record its all neighbors faulty link information to avoid unnecessary searching for the known faulty links. Furthermore, the faulty link information is dynamically accumulated and the technique of heuristically searching for optimal link is used. The algorithm routes messages through the minimum feasible path between the sender and receiver if at least one such path exists, and takes the optimal path with higher probability when many faulty links exist in the faulty hypercube
Keywords :
backtracking; computational complexity; fault tolerant computing; hypercube networks; message passing; probability; search problems; distributed message routing algorithm; efficiency; fault-tolerant hypercube systems; heuristic backtracking strategy; minimum feasible path; neighbors faulty link information; optimal link; probability; Algorithm design and analysis; Computers; Delay; Fault tolerance; Fault tolerant systems; Heuristic algorithms; Hypercubes; Laboratories; Routing; Topology;
Conference_Titel :
Test Symposium, 1993., Proceedings of the Second Asian
Conference_Location :
Beijing
Print_ISBN :
0-8186-3930-X
DOI :
10.1109/ATS.1993.398779
