自愈网中通道型满溢算法的再路由能力

Rerouting Ability of Path Restoration Based Flooding Algorithm in Selfhealing Networks

在自愈网中，分布式恢复在比集中式恢复更迅速的同时，其再路由能力如何？与最大再路由能力之间的差异如何？本文通过模拟试验和分析发现，通道型满溢算法的再路由能力一般不会大大低于最大再路由能力，若迂回路由转接次数增大，则其再路由能力增强，但同时与最大再路由能力之间的差异呈增大趋势。该研究结果对于全面了解分布式恢复的性能，合理设计链路冗余容量或迂回路由转接次数，以使满溢算法的恢复率接近集中式算法的恢复率。

In selfhealing networks, distributed restorations have much higher rapidity than centralized restorations. But how about their rerouting ability and the difference between their rerouting ability and the maximum? Based on experiments and analysis, a result is presented that, path-restorations based flooding algorithm have hardly far smaller rerouting ability than the maximum, moreover, their rerouting ability and the difference between their rerouting and the maximum become large when path-hop increases. This result is useful to reveal the whole performance of distributed restorations and to assign reasonable spare link capacity or path-hop so that distributed restorations have almost the same restoration ratio as centralized restorations.