基三网络中一种最短路径路由算法  

A Shortest Path Routing Algorithm in Triplet-Based Network

作　　者：王佐[1] 石峰[1] 

机构地区：[1]北京理工大学计算机科学技术学院,北京100081

出　　处：《北京理工大学学报》2009年第5期410-414,共5页Transactions of Beijing Institute of Technology

基　　金：教育部高等学校博士学科点专项科研基金资助课题(200800071005)

摘　　要：Min-DDRA在DDRA路由算法的基础上结合中转节点的设计思想,实现了一种最短路径路由算法.该算法兼有传统基于路由表算法和DDRA路由算法的优点.基于真实网络负载的实验结果表明,与DDRA路由算法相比,Min-DDRA路由算法性能提高了2%~3%,功耗降低了3%~6%.In order to improve the performance of triplet-based network, the shortest path routing algorithm Min-DDRA based on former routing algorithm DDRA is proposed and evaluated by practical traffics on network simulator. Experimental results showed that Min-DDRA routing algorithm can increase the performance by 2 % - 3 % compared with the DDRA routing algorithm, and the energy consumption reduced by 3%-6%.

关 键 词：多核处理器 片上互连网络 拓扑结构 路由算法 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]