A Fault—Tolerant and Heuristic Routing Algorithm for Faulty Hypercubes
摘要
A fault-tolerant and heuristic routing algorithm for faulty hypercube systems 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 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 faulty links exist in the faulty hypercube.
引用本文（GB/T 7714）
闵有力, 闵应骅. A Fault—Tolerant and Heuristic Routing Algorithm for Faulty Hypercubes[J]. 未知来源, 1995.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。