【摘要】 Mbius立方体是超立方体的一种变形结构。Mbius立方体除了具有超立方体本身的可扩展性和路由简单等优点外,它与含有相同数目的点和边的超立方体相比具有更好的性能。文中提出一种新的用于Mbius立方体网络的最短路径路由算法,避免了递归调用。分析和实验证明,相对于Cull P提出的最短路径算法有更高的效率,并易于硬件实现,且时间复杂度为O(n)。更多还原

【Abstract】 The Mbius cube is a variant type of hypercubes.In addition to its good scalability and simplicity of routing,Mbius 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 Mbius 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).更多还原