计算机工程2012，Vol.38Issue(4)：100-103,107,5.
基于蚁群优化算法的Chord模型
Chord Model Based on Ant Colony Optimization Algorithm
摘要
Abstract
This paper proposes a Chord model(Ant-Chord) which has an ability of physical topology matching to store the mapping information of identifiers. The ideas of Ant-Chord is to regard the storage nodes in the whole Chord as a TSP problem and solve the TSP problem quickly by using the ant colony algorithm, then to build the Chord with the obtained Traveling Salesman Problem(TSP), and proposes a method which called Luoyang Shovel Method(LSM) to optimize the Ant-Chord's routing hops. The model is simple and easy to implement, which has small changes within the original Chord model and little extra overhead cost in the routing table storage. Simulation results show that Ant-Chord has obvious advantages in average routing hops and delay in comparison with other Chord models.关键词
网络标识分离/Chord模型/蚁群优化算法/旅行商问题/物理拓扑匹配Key words
network identifier separation/ Chord model: Ant Colony Optimization(ACO) algorithm/ Traveling Salesman Prob!em(TSP)/ physical tonoloEv matchine分类
信息技术与安全科学引用本文复制引用
张建伟,刘思,李朝阳,蔡增玉..基于蚁群优化算法的Chord模型[J].计算机工程,2012,38(4):100-103,107,5.基金项目
国家“973”计划基金资助项目(2007CB307102,2007CB307100) （2007CB307102,2007CB307100）
河南省基础与前沿技术研究计划基金资助项目(082300410280) （082300410280）
