A method for distributed unicast in hypercubes

Unicast algorithms in off-line routing, have been used as a one-to-one communication between a source node and a destination node in an n-dimensional hypercube, denoted as H_n. These algorithms cannot be used in the case of distributed routing as each node knows the status of its neighbors only while in the case of off-line routing each node knows the status of all the nodes. In this paper, we propose a new method for distributed routing. It can also be used for off-line routing where the cost of collecting global information about the faulty nodes is avoided as well as the information about H, whether it is k-safe or not. The minimum requirements of the proposed method is to have the path between the source and the destination connected, hence, it may work when H_n is disconnected