A variety of routing algorithms have been proposed for hypercube networks. Recently, several routing algorithms has introduced the concept related to unsafe nodes and its extension, and achieved a successful routing. This paper focuses on one-to-one routing and shows that a considerable number of unexplored shortest paths can be found by introducing a preliminary knowledge into the routing.
展开▼
