基于距离矢量的多下一跳路由信息协议  

Multi-next-hop Route Information Protocol Based on Distance Vector

作　　者：陈文平[1] 张兴明[1] 张建辉[1] 王滨[1] 

机构地区：[1]解放军信息工程大学信息工程学院信息技术研究所,郑州450002

出　　处：《计算机工程》2010年第2期94-96,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2007AA01z2a1)

摘　　要：针对传统单下一跳路由协议总是选择最优路径进行路由,容易导致网络拥塞的问题,提出多下一跳路由信息协议。在邻居节点之间交换最优路由信息并构建路由有向图,为节点建立多下一跳路由表,以实现无环并行传输。基于扩展SSFNet的仿真结果表明,该协议可以降低网络拥塞风险。Network congestion is easily to be caused by traditional single-next-hop routing protocol that always chooses the best path to route. Aiming at this problem,this paper proposes a multi-next-hop Route Information Protocol（RIP）. The optimization route information is changed between neighborhood node and the route directed graph is constructed. The multi-next-hop route table for the nodes is established to realize loop free parallel transmission. Analysis results based on extended SSFNet show that this protocol can decrease the network congestion risk.

关 键 词：拥塞 路由信息协议 多下一跳 路由有向图 

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