Abstract:

The Mobius cube is a variant type of hypercubes. In addition to its good scalability and simplicity of routing, Mobius cubes have a better performance than hypercubes with the same number of links and processors. This paper presents a new shortest path routing algorithm for Mobius cubes without recursion. The experimental result and analysis show that the algorithm has the advantages of smaller delay, higher efficiency, and easy to implement by hardware,and the time complexity of the presented algorithm is O(n).