一种改进的分布式自愈算法

提出了一种新的自愈算法，较好地解决了洪泛机制分布式自愈算法存在的消息数量大、恢复路径选择难的问题．主要措施为：(1)让网络中各节点预先知道彼此之间的逻辑距离(hop数)，使得那些在hop阈值条件下不可能到达目的节点的消息及早丢弃；(2)在搜索消息包中引入链路容量跟踪信息，使得在Chooser端只要通过简单的计算就可以有效地选择恢复路径．通过用随机网络的办法进行了仿真比较，结果表明，在2S的恢复时间的限制下，新的自愈算法在恢复速度和恢复率方面都优于经典算法．

Improved distributed self-healing algorithm

Although the distributed self-healing algorithm based on flooding routing has many advantages, it has two fatal disadvantages, i.e. to generate surplus messages and to select restoration routines difficultly, especially in a large scale network. A new algorithm is proposed to preferably resolve these two problems. The main adopted measures are: (1) As the nodes foreknow the logic distances (hop count) between each other, the messages, which can't reach the target under the hop-limit constraint, can be discarded as soon as possible. (2) By simple computation at Chooser, the restoration routes will be selected effectively, because the link capacity information is contained in the searching messages. The simulation results in the random networks show that under the 2's restoration time constraint, both the restoration speed and ratio are better than those of classic algorithms.