基于有效性验证的V-D算法研究

Research of Vector-distance Routing Algorithm Based on Verification of Validity

论述了TCP/IP网络中距离向量 (V D)算法中的慢收敛问题 ,以及一些解决方法的不足。针对路由信息的有效性问题 ,提出了基于有效性验证的V D算法 ,有效地防止了无效路由信息对路由表的修改 ,解决了慢收敛问题。同时提出采用环路消除分组的方法 ,以防止环路产生 ,并可以快速消除环路上的无效信息。

The thesis describes some solutions for the slow convergence (count to infinite) problem in Vector-Distance algorithm in TCP/IP and points some shortages of them. Concerning the validity of routing information, an improved algorithm is raised which based on verifying of the validity of routing modifying information, avoiding the routing table updated by invalid information and resolving the slow convergence efficiently. To prevent loop from occurring and remove some invalid routing information along the loop, the loop-removing packet is employed.