A Fault-tolerant Routing Strategy for Complete Josephus Cubes

P.K.K. Loh and W.J. Hsu (Singapore)


Faulttolerance, routing, interconnection networks


This paper proposes a fault-tolerant routing strategy for a Complete Josephus Cube of dimension r. The routing algorithm tolerates up to 2(r-1) encountered faults with non-minimal routing. Routes generated are deadlock-free and livelock-free. Within stated fault conditions, message is guaranteed to be delivered in at most (2r-1) hops. Message overhead for the specified fault tolerance level is a single r-bit vector and the destination address. Router design may be implemented with standard components.

Important Links:

Go Back