A fault-tolerant and heuristic routing algorithm for faulty hypercube sys-tems is described. To improve the efficiency, the algorithm adopts a heuristic backtracking strategy and each node has 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 algo rithm routes messages through the minimum feasible path between the sender and receiver if at Ieast one such path ekists, and ta.kes the optimal path with higher probability when faulty links exist in the faulty hypercube.
展开▼
