基于最短路径搜索序列编码的多下一跳路由  

Multi-next hop routing based on shortest path searching sequence numbering

作　　者：黄健美[1] 张兴明[1] 朱宣勇[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002

出　　处：《计算机工程与设计》2010年第14期3147-3150,3168,共5页Computer Engineering and Design

基　　金：国家863高技术研究发展计划基金项目(2007AA01Z212;2008AA01Z214)

摘　　要：多下一跳路由较之单下一跳路由有许多天然的优势,通过分析现有多下一跳路由实现机制下的路由算法,提出了基于最短路径搜索序列编码的多下一跳路由。针对SPT(shortest path tree)路由实现机制无法利用等距离邻居节点之间链路的问题,提出了采用Dijkstra算法对网络节点编码赋值的思想。该方法可以对节点进行严格有序的赋值,规范了链路传输方向,有效地避免了环路,提高了网络资源利用率。仿真分析结果表明了该算法的可行性和有效性。Compared to the single-next hop routing,multi-next hop routing have more advantages. After making a survey of the available multi-next hop routing algorithms,an improved multi-next hop routing mechanism based on shortest path searching sequence numbering （MHR-SPSN） is proposed. To solve problem of the useless links between equidistant from the destination result from SPT （shortest path tree） routing mechanism,an idea of assigning a number to each network node based on Dijkstra algorithm is designed. With this method,nodes have strict order,the link transmission direction is regulated,the loop is avoided effectively and the network resource utilization is increased. Results of the simulation analysis demonstrated the feasibility and efficiency of the presented method.

关 键 词：多下一跳 路由算法 最短路径 序列编码 资源利用率 

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