| 一种高效的de bruijn有向图路由算法 |
| |
| 引用本文： | 张永才,张卫东,刘峰.一种高效的de bruijn有向图路由算法[J].数字社区&智能家居,2009(11). |
| |
| 作者姓名： | 张永才 张卫东 刘峰 |
| |
| 作者单位： | 石河子大学信息科学与技术学院;新疆大学信息科学与工程学院; |
| |
| 摘 要： | 通过对de bruijn有向图最长路径路由算法和最短路径路由算法的分析,提出了一种新的路由算法,它有效结合了两种算法的优点,并能根据网络时延来选择最优路径,对于时延的判断是由下一跳的时延和剩余各跳的预测时延两个部分组成,从而有效避免路由信息的局部性。分析表明,新的路由算法是行之有效的。
|
| 关 键 词： | debruijn有向图 最长路径 最短路径 跳数 时延 |
An Efficient de Bruijn Directed Graph Routing Algorithm |
| |
| ZHANG Yong-cai,ZHANG Wei-dong,LIU Feng.An Efficient de Bruijn Directed Graph Routing Algorithm[J].Digital Community & Smart Home,2009(11). |
| |
| Authors: | ZHANG Yong-cai ZHANG Wei-dong LIU Feng |
| |
| Affiliation: | 1.Shihezi University;College of Information Science and Technology;Shihezi 832003;China;2.Xinjiang University;College of Informa-tion Science and Engineering;Urumqi 830046;China |
| |
| Abstract: | The directed graph de bruijn the longest path and shortest path routing algorithm for the analysis of routing algorithm,a new routing algorithm,which effectively combines the advantages of two algorithms and the network delay to select the optimal path,for the time delay to determine the next hop by the delay and the remainder of the forecast of the jump time-delay of two components,so as to effectively avoid the partial routing information.Analysis showed that the new routing algorithm is effective. |
| |
| Keywords: | de bruijn directed graph the longest path the shortest path hops delay |
| 本文献已被 CNKI 等数据库收录！ |
