【摘要】 提出了适用于网络动态拓扑改变的聚合树模型,基于路由器间链路的各种参数特性构建了聚合树模型,大幅缩减了路由过程的搜索空间.当网络发生动态变化时,启动文中提出的增量算法来更新网络.这一算法和模型可以适合网络动态改变所涉及的变化,它只需更新受到影响的链路信息,而不需要在整个网络中重新计算路由,在通信复杂度方面取得了对数级的递减.仿真结果显示这一模型在复杂度和路由准确性方面都获得了较高的性能.更多还原

【Abstract】 Aggregation tree routing model(ATRM) for dynamic topology changes is proposed.ATRM first constructs aggregation tree based on various parameter characteristics of links,narrowing the searching space into much smaller domains.When link cost or topology changes,the increment algorithm is executed to update the network states,which merely computes and updates the affected links state instead of re-computing the whole route information of network.Our simulation results prove that the new ATRM model combined with the increment algorithm can achieve logarithmic reduction in communication traffic and obtain higher performance in the same condition.更多还原