Fault-tolerant cycle embedding in the hypercube
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 2n?4 faulty nodes, is proposed. The best result thus far is to tolerate only atmost n?1 faulty nodes, which is less than the degree of the n-cube.
cycle hypercube fault tolerance graph embedding interconnection network