期刊文献+

基于聚合树模型的大规模网络动态路由协议

Large scale networks dynamic routing protocol based on aggregation tree model
下载PDF
导出
摘要 提出了适用于网络动态拓扑改变的聚合树模型,基于路由器间链路的各种参数特性构建了聚合树模型,大幅缩减了路由过程的搜索空间.当网络发生动态变化时,启动文中提出的增量算法来更新网络.这一算法和模型可以适合网络动态改变所涉及的变化,它只需更新受到影响的链路信息,而不需要在整个网络中重新计算路由,在通信复杂度方面取得了对数级的递减.仿真结果显示这一模型在复杂度和路由准确性方面都获得了较高的性能. 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.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2005年第z1期94-96,共3页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(60373094) 国家重点基础研究发展计划资助项目(2002CB312003)
关键词 聚合树模型 增量算法 动态拓扑改变 最优路径 aggregation tree routing model increment algorithm dynamic topology changes optimal route
  • 相关文献

参考文献5

  • 1[1]Lui Kingshan,Nahrstedt K,Chen Shigang.Routing with topology aggregation in delay-bandwidth sensitive networks[J].IEEE/ACM Transactions on Networking,2004,12(1):17-29
  • 2[2]Rezvan M,Pawlikowski K,Sirisena H.A distributed cache architecture for routing in hierarchical QoS-capable networks[A].In:Benedikt M,Benzinger R,et al,eds.The Implicit Computational Complexity Workshop (ICC'03)[C].Ottawa,2003.1 749-1 753
  • 3[3]Hao F,Zegura W.On scalable QoS routing performance evaluation of topology aggregation[A].In:Rom R,Schulzrinne H,eds.Proc IEEE Infocom the Conference on Computer Communication [C].Tel Aviv,2000.147-156
  • 4[4]Yuan Xin,Yang Guang.Empirical probability based QoS routing[A].In:Benedikt M,ed.The Implicit Computational Complexity Workshop (ICC' 03) [C].Ottawa,2003.1 713-1 717
  • 5[5]Franciosa P,Frigioni D,Giaccio R.Semi-dynamic shortest paths and breadth-first search in digraph[A].In:Reischuk R,Morvan M,eds.Proc 14th Annu Symp Theoretical Aspects of Computer Science [C].Lübeck,1997.33-46

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部