解决“计数到无穷”问题的改进方法

An Improvement to Solve "Counting to Infinity" Problem

提出了一种改进的方法来解决距离矢量算法中的“计数到无穷”问题。这一方法给“简单分裂水平线”(simple splithorizon)方法增加了一条新的规则:如果路由器A发给它的相邻路由器B的路由更新信息中不包含某些目标网络的条目,那么路由器B认为经过路由器A这些目标网络是不可到达的。

This article brings forward a new method to solve the ＂counting to infinity＂problem in distance vector algorithms. The method adds to the＂ simple split horizon＂ scheme a new rule： if some destination networks＇ entries are not included in update messages sent by muter A to its neighbor muter B, then muter B considers these destination networks are unreachable through muter A.