摘要： 针对传统单下一跳路由协议总是选择最优路径进行路由，容易导致网络拥塞的问题，提出多下一跳路由信息协议。在邻居节点之间交换最优路由信息并构建路由有向图，为节点建立多下一跳路由表，以实现无环并行传输。基于扩展SSFNet的仿真结果表明，该协议可以降低网络拥塞风险。
关键词:
拥塞,
路由信息协议,
多下一跳,
路由有向图
Abstract: 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.
Key words:
congestion,
Route Information Protocol(RIP),
multi-next-hop,
route directed graph
中图分类号:
陈文平;张兴明;张建辉;王 滨. 基于距离矢量的多下一跳路由信息协议[J]. 计算机工程, 2010, 36(2): 94-96.
CHEN Wen-ping; ZHANG Xing-ming; ZHANG Jian-hui; WANG Bin. Multi-next-hop Route Information Protocol Based on Distance Vector[J]. Computer Engineering, 2010, 36(2): 94-96.