Mesh网络p-cycle的快速配置方法

Pre-configuration-Cycle Fast Configuration Techniques in Mesh Network

该文提出了mesh冗余网络中快速配置p-cycle保护环的方法。算法从两个方面有效地提高配置速度:一方面在一次比较搜索过程中,配置一个多容量p—cycle环,而不是仅配置一个单位容量环;另一方面,将已有算法基于圈的搜索策略,改进为基于通路的搜索策略。这样可以有效地防止大量的搜索信息汇聚到一个节点,降低配置速度。当改为通路搜索后,原来汇聚到一个节点的处理,可分散到多个相邻节点进行并行处理,这将有效地加快配置速度。通过仿真表明,该钟法具有同已有算法相当的恢复率,但所需的搜索趟数性能却能获得大幅度的改善,同时也不显著增加备用容量的消耗。结果表明网络规模越大,本文算法的优势越明显。

A new fast distributed p-cycle pre-configuration searching algorithm is proposed in this paper. It can speed up the searching process convergence from two aspects. (1) The multi-p-cycle found by the algorithm within one searching wave should be completed configuration through rnulti searching waves in classical algorithm. This is the reason why this method faster than classical one. (2) Our algorithm has been changed over from the cycle-based searching to the path-based searching. Using this technique, searching information converged on one node in classical algorithm will be split to its multiple adjacent nodes so reduce the performance requirement of node equipment. The p-cycles searched by the distributed algorithm have been filtered within adjacent node hence the searching process be comes faster. The simulation result also shows that the penalty to spare capacity consumed is very small in our algorithm as well as the obvious benefit on the number of searching wave descent.