作者: Mostafa I. Abd-El-Barr , Mohammad M. Nadeem , Khalid Al-Tawil
关键词:
摘要: In this paper, we consider fault-tolerant routing algorithms in hypercube multicomputer networks. particular, one of the most quoted adaptive algorithm for hypercubes literature is studied detail and its limited ability to route messages presence some fault patterns (i.e., combination node link faults), pointed out. A modified proposed performance, using simulation, compared that above mentioned algorithm. It shown outperforms existing terms routable around and/or links faults. This improvement achieved while same average path length or even improving it. Illustrative examples are support such improvement.