论文部分内容阅读
本文在分析现有路径算法的基础上提出一种后补路径算法,其特点是:只向现有最短路径上后继结点以外的相邻结点,传送最短路径值,对于上述后继结点只传送后补最短路径值,从而使路径修改过程的性能指标有很大改进。在环形网络中完全消除了信件的及复回送现象,在复杂的网络中这一现象也得到根本改善。算法的时间复杂性和空间复杂性与经典算法基本相同,但控制信件传送的数量及收敛时间大为减少。从对一个具有30个结点的网络的模拟测试中,采用本算法时,控制信件的传送数量比经典算法减少70％,而收敛时间缩短50％。
Based on the analysis of the existing path algorithms, this paper proposes a post-fill path algorithm, which is characterized in that: the shortest path value is transmitted only to the adjacent nodes except the succeeding node on the existing shortest path, and for the subsequent nodes Send shortest path value, so that the performance of the path modification process has been greatly improved. In the ring network completely eliminate the letter of the complex and return to send the phenomenon in the complex network, this phenomenon has been fundamentally improved. The time complexity and space complexity of the algorithm are basically the same as those of the classical algorithm, but the number of control messages sent and the convergence time are greatly reduced. From the simulation test of a network with 30 nodes, the number of control messages is reduced by 70% compared with the classical algorithm and the convergence time is reduced by 50%.