| 基于蚁群算法的Overlay路由扩展性问题 |
| |
| 引用本文： | 叶枰,李益忠,夏勤. 基于蚁群算法的Overlay路由扩展性问题[J]. 解放军理工大学学报(自然科学版), 2008, 9(5): 492-496 |
| |
| 作者姓名： | 叶枰 李益忠 夏勤 |
| |
| 作者单位： | 东南大学,计算机网络和信息集成教育部重点实验室,江苏,南京,210096;东南大学,计算机科学与工程学院,江苏,南京,210096;东南大学,计算机网络和信息集成教育部重点实验室,江苏,南京,210096;东南大学,计算机科学与工程学院,江苏,南京,210096;东南大学,计算机网络和信息集成教育部重点实验室,江苏,南京,210096;东南大学,计算机科学与工程学院,江苏,南京,210096 |
| |
| 基金项目： | 国家自然科学基金,国家自然科学基金 |
| |
| 摘 要： | 扩展性问题是Overlay网络研究中所需解决的重要问题之一.通过使用蚁群算法对目前Overlay路由系统广泛采用的单跳转发路由机制OHPR(one-hop path routing)进行改进,通过采用维护邻居节点集合的方式降低系统部署和运行的总开销.仿真实验结果表明,基于蚁群算法的单跳路由算法ACOHPR(ant colony optimization based one-hop path routing)在500个节点的Overlay系统中,与OHPR算法相比可以有效的降低系统路由的查询开销到30个节点左右,而获得的通信时延差别不超过9 ms.
|
| 关 键 词： | 时延优化Overlay路由 蚁群算法 邻居节点集合 |
ACO -based overlay routing scalability |
| |
| YE Ping,LI Yi-zhong and XIA Qin. ACO -based overlay routing scalability[J]. Journal of PLA University of Science and Technology(Natural Science Edition), 2008, 9(5): 492-496 |
| |
| Authors: | YE Ping LI Yi-zhong XIA Qin |
| |
| Affiliation: | Key Laboratory of Computer Network and Information Integration,Southeast University,Nanjing 210096,China;School of Computer Science and Engineering,Southeast University,Nanjing 210096,China;Key Laboratory of Computer Network and Information Integration,Southeast University,Nanjing 210096,China;School of Computer Science and Engineering,Southeast University,Nanjing 210096,China;Key Laboratory of Computer Network and Information Integration,Southeast University,Nanjing 210096,China;School of Computer Science and Engineering,Southeast University,Nanjing 210096,China |
| |
| Abstract: | Sca labili ty is one o f the most impo rtant problems in Ov erlay netwo rk research. Ant co lony o ptimiza tio n w as used to improv e the w idely-used o ne-ho p pa th ro uting alg orithm( O HPR) in Ov erlay routingsystem, and the deplo ying and running ov erload w as reduced by maintaining the neighbo rhood set. Simulationresul ts show that compared wi th OHPR in an Ov erlay netw ork w ith 500 nodes, ant-co lony-optimi zationbased o ne-ho p path ro uting alg orithm ( ACOHPR) ca n ef fectively reduce the querying ov erload to a lmost 30 nodes in system routing wi th no mo re tha n 9 ms di fference in communica tion delay. |
| |
| Keywords: | delay optimi za tion Ov erlay ro uting ACO(a nt colo ny optimi za tion) neighborhood set |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《解放军理工大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《解放军理工大学学报(自然科学版)》下载免费的PDF全文 |
|
