Adaptive fault-tolerant routing in hypercube multicomputers

摘要: A connected hypercube with faulty links and/or nodes is called an injured hypercube. distributed adaptive fault-tolerant routing scheme proposed for in which each node required to know only the condition of its own links. Despite simplicity, this shown be capable messages successfully n-dimensional as long number components less than n. Moreover, it proved that routes via shortest paths a rather high probability, and expected length resulting path very close so path. Since assumption n might limit usefulness above scheme, based on depth-first search works presence arbitrary introduced. Due insufficient information components, however, chosen by may not always shortest. To guarantee all routed paths, authors propose equip every more The effects additional efficiency are analyzed, kept at determined. Several examples remarks given illustrate results. >