【摘要】 首先介绍了用于路由选择的DVR(距离矢量路由)算法及其存在的无穷计算问题。然后阐述了用于解决该问题的水平分裂算法的思想,并运用MST(最小生成树)分析法对其进行了基于树型、环型和网状3种网络拓扑结构的算法分析。最后提出了一种改进的水平分裂算法———下一跳算法,并在实例分析的基础上对其存在的问题进行了总结。更多还原

【Abstract】 The distance vector routing(DVR) algorithm for routing choice and count-to-infinity problem in itself is introduced first.Then the idea of split horizon algorithm that is used to settle this problem is stated,and this algorithm is analyzed with minimum spanning tree(MST) method,based on tree,ring and net topologies.Finally,an improved split horizon algorithm,the next-hop algorithm is proposed,and the existent problem is summarized on the basis of instance analysis.更多还原