基于蚁群算法的ICN路由算法  

Survey of ICN routing algorithm based on ACO

作　　者：龚娉婷 周金和[1] GONG Ping-ting;ZHOU Jin-he(School of Information and Communication Engineering,Beijing Information Science and Technology University,Beijing 100101,China)

机构地区：[1]北京信息科技大学信息与通信工程学院,北京100101

出　　处：《计算机工程与设计》2020年第9期2415-2422,共8页Computer Engineering and Design

摘　　要：针对信息中心网络(ICN)路由问题,提出一种基于蚁群算法的ICN路由算法(IRABA)。基于传统蚁群觅食行为,综合考虑相邻节点间内容浓度、兴趣蚂蚁队列长度以及请求节点与转发节点集间的内容相似度3个因素,获取转发概率计算模型。采用轮盘赌模型进行兴趣蚂蚁转发接口的选择,在不造成拥塞的情况下,将兴趣蚂蚁往高概率节点转发,确定最佳的兴趣蚂蚁路由路径。仿真结果表明,在兴趣蚂蚁请求数量不断增加的情况下,使用IRABA可以有效避免网络拥塞,降低网络能耗,提高平均路由命中率,减少路由执行时间。Aiming at the problem of information center network(ICN)routing,an ICN routing algorithm based on ACO(IRABA)was proposed.Based on the traditional ant colony foraging behavior,the three factors of content concentration between adjacent nodes,the length of interest ant queues and the content similarity of adjacent nodes were considered,and the forwarding probability calculation model was obtained.The roulette model was used to select the ant forwarding interface of interest,and the ant was forwarded to the high probability node without causing congestion to determine the best interest ant routing path.Simulation results show that using IRABA can effectively avoid network congestion,reduce network energy consumption,improve average route hit rate and reduce route execution time when the number of interested ant requests increases.

关 键 词：蚁群算法 信息中心网络 内容浓度 队列长度 内容相似度 服务质量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]