首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于聚合树模型的大规模网络动态路由协议
引用本文:谭国真,韩宁宁,刘屹,姚恒伟.基于聚合树模型的大规模网络动态路由协议[J].华中科技大学学报(自然科学版),2005,33(Z1):94-96.
作者姓名:谭国真  韩宁宁  刘屹  姚恒伟
作者单位:大连理工大学,计算机系,辽宁,大连,116023
基金项目:国家自然科学基金资助项目(60373094),国家重点基础研究发展计划资助项目(2002CB312003)
摘    要:提出了适用于网络动态拓扑改变的聚合树模型,基于路由器间链路的各种参数特性构建了聚合树模型,大幅缩减了路由过程的搜索空间.当网络发生动态变化时,启动文中提出的增量算法来更新网络.这一算法和模型可以适合网络动态改变所涉及的变化,它只需更新受到影响的链路信息,而不需要在整个网络中重新计算路由,在通信复杂度方面取得了对数级的递减.仿真结果显示这一模型在复杂度和路由准确性方面都获得了较高的性能.

关 键 词:聚合树模型  增量算法  动态拓扑改变  最优路径
文章编号:1671-4512(2005)S1-0094-03
修稿时间:2005年8月25日

Large scale networks dynamic routing protocol based on aggregation tree model
Tan Guozhen,Han Ningning,Liu Yi,Yao Hengwei.Large scale networks dynamic routing protocol based on aggregation tree model[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2005,33(Z1):94-96.
Authors:Tan Guozhen  Han Ningning  Liu Yi  Yao Hengwei
Institution:Tan Guozhen Han Ningning Liu Yi Yao HengweiProf.,Department of Computer Science,Dalian University of Technology,Dalian 116023,China.
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.
Keywords:aggregation tree routing model  increment algorithm  dynamic topology changes  optimal route
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号