β Scribed by M.J. Kumar; L.M. Patnaik; B. Nag
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same
Almost all the previous fault-tolerant cycle embedding research could not tolerate the faulty nodes more than the degree of the network. In this paper, we have broken this limitation: a recursive method of embedding a longest cycle into an n-dimensional hypercube (n-cube), which can tolerate atmost
Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing Ο for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, Ο)/F, where