| 基于Mobius立方体的最短路径路由算法 |
| |
| 引用本文： | 张丽果,杜慧敏,韩俊刚.基于Mobius立方体的最短路径路由算法[J].系统工程与电子技术,2011,33(12):2743-2748. |
| |
| 作者姓名： | 张丽果 杜慧敏 韩俊刚 |
| |
| 作者单位： | 1. 西安电子科技大学微电子学院， 陕西 西安 710126；2. 西安邮电学院电子工程学院， 陕西 西安 710121 |
| |
| 摘 要： | Mobius立方体是超立方体的一种变形结构。Mobius立方体除了具有超立方体本身的可扩展性和路由简单等优点外，它与含有相同数目的点和边的超立方体相比具有更好的性能。文中提出一种新的用于Mobius立方体网络的最短路径路由算法，避免了递归调用。分析和实验证明,相对于Cull P提出的最短路径算法有更高的效率，并易于硬件实现，且时间复杂度为O(n)。
|
Shortest path routing algorithm for mobius cubes |
| |
| ZHANG Li-guo,DU Hui-min,HAN Jun-gang.Shortest path routing algorithm for mobius cubes[J].System Engineering and Electronics,2011,33(12):2743-2748. |
| |
| Authors: | ZHANG Li-guo DU Hui-min HAN Jun-gang |
| |
| Institution: | 1. School of Microelectronics, Xidian University, Xi’an 710126, China; 2. School of Electronic Engineering, Xi’an University of Posts & Telecommunications, Xi’an 710121, China |
| |
| 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). |
| |
| Keywords: | |
|
| 点击此处可从《系统工程与电子技术》浏览原始摘要信息 |
| 点击此处可从《系统工程与电子技术》下载免费的PDF全文 |
