论文部分内容阅读
兼有集中式和分布式优点的经路算法是很多网络设计者所关心和力争达到的目标之一,但更新经路表要花费大量的时间。本文提出一种实现这一目标的方法,其更新算法具有网络负载低、结点机执行时间短,并能在允许间隔内完成更新等优点。本算法是由收集信息和通报信息两步实现的。若把大型网络划分成几个组,则本算法也可以推广到大型网络,并且通过为每个信使和满信使赋给编号的办法,组与组之间的同步问题以及失效后的处理问题都是不难解决的。
The routing algorithm, which combines both centralized and distributed advantages, is one of the goals that many network designers care about and strive to achieve, but updating the routing tables takes a great deal of time. This paper presents a method to achieve this goal, the update algorithm with low network load, node machine execution time is short, and can be updated within the allowable interval and so on. The algorithm is achieved by collecting information and informing information in two steps. If large networks are divided into several groups, the algorithm can also be extended to large networks, and by assigning a number to each messenger and full messenger, the synchronization between groups and groups, and the processing problems after the failure It is not difficult to solve.