A fault tolerant routing algorithm based on cube algebra for hypercube systems |
| |
| Affiliation: | 1. Department of Chemistry, The University of Michigan, Ann Arbor, MI 48109-1055, United States;2. College of Chemical Engineering, Zhejiang University of Technology, China |
| |
| Abstract: | We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a non-faulty hypercube. The number of faulty nodes and links may be rather large and if any path between the nodes exists, the developed algorithm determines it. To construct this algorithm, some properties of the cube algebra are considered and some transformations based on this algebra are developed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
