融合拥塞控制的NDN路由策略
NDN Routing Policy Converged Congestion Control
DOI: 10.12677/CSA.2022.127179, PDF,    科研立项经费支持
作者: 刘 立, 桂易琪：扬州大学信息工程学院，江苏 扬州
关键词: 命名数据网络；路由算法；精英策略；蚁群算法；拥塞控制；Named Data Network； Routing Algorithm； Elite Strategy； Ant Colony Algorithm； Congestion Control
摘要: 命名数据网络采用由内容请求者驱动的通信机制，针对转发过程中路由准确性问题现有研究并没有给出具体解决方案。本文提出了一种多因素综合考虑的蚁群路由优化算法。借鉴传统蚁群生态行为和遗传算法中的精英策略，综合考虑了各节点之间路径上的信息素浓度、邻居节点间路径长度以及请求节点与转发节点间的内容相似度等因素，采用可选下一跳方法将兴趣蚂蚁往高概率节点进行转发方式来确定最佳的兴趣蚂蚁路由路径；利用内容聚合和节点转换控制的方法进行拥塞控制保证网络传输的稳定性。仿真实验结果表明，在有限网络空间资源条件下，兴趣蚂蚁请求数量增加到一定阈值时，本算法对比蚁群算法平均路由命中率提高了14%，平均路由时延降低了25%，可以更有效避免网络拥塞。
Abstract: Named data network adopts communication mechanism driven by content requester. Existing research does not provide a specific solution for the problem of routing accuracy in the forwarding process. In this paper, an ant colony algorithm for routing optimization is proposed. Referring to the traditional ant colony ecological behavior and the elite strategy in genetic algorithm, taking into account the pheromone concentration on the path between nodes, the path length between neighbor nodes and the content similarity between requesting nodes and forwarding nodes, the optional next hop method is used to forward the interest ants to high probability nodes to determine the best interest ant routing path; Content aggregation and node switching control are used to control congestion and ensure the stability of network transmission. The simulation results show that when the number of interested ant requests increases to a certain threshold under the condition of limited cyberspace resources, the average routing hit rate of this algorithm is increased by 14% and the average routing delay is reduced by 25% compared with ant colony algorithm, which can more effectively avoid network congestion.
文章引用：刘立, 桂易琪. 融合拥塞控制的NDN路由策略[J]. 计算机科学与应用, 2022, 12(7): 1781-1794. https://doi.org/10.12677/CSA.2022.127179

参考文献

[1] Din, I.U., Hassan, S., Khan, M.K., Guizani, M., Ghazali, O. and Habbal, A. (2018) Caching in Information-Centric Networking: Strategies, Challenges, and Future Research Directions. IEEE Communications Surveys 8.Tutorials, 20, 1443-1474. [Google Scholar] [CrossRef] 
[2] Conti, M., Gangwal, A., Hassan, M., Lal, C. and Losiouk, E. (2020) The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions. IEEE Communica-tions Surveys & Tutorials, 22, 2104-2129. [Google Scholar] [CrossRef] 
[3] Tariq, A., Rehman, R.A. and Kim, B.S. (2020) Forwarding Strategies in NDN-Based Wireless Networks: A Survey. IEEE Communications Surveys & Tutorials, 22, 68-95. [Google Scholar] [CrossRef] 
[4] Gui, Y. and Chen, Y. (2021) A Cache Placement Strategy Based on Entropy Weighting Method and TOPSIS in Named Data Networking. IEEE Access, 9, 56240-56252. [Google Scholar] [CrossRef] 
[5] Cheng, Y., Alexander, A., Lan, W., Zhang, B. and Zhang, L. (2012) Adaptive Forwarding in Named Data Networking. ACMSIGCOMM Computer Communication Review, 42, 62-67. [Google Scholar] [CrossRef] 
[6] Ghasemi, C., Yousefi, H., Shin, K.G. and Zhang, B. (2018) Routing Meets Caching in Named Data Networks. Proceedings of the 2018 IEEE Conference on Computer Communica-tions Workshops, Honolulu, 15-19 April 2018, 1-2. [Google Scholar] [CrossRef] 
[7] Fang, C., Yao, H., Wang, Z. and Richard, Yu.F. (2018) A Survey of Mobile Information-Centric Networking: Research Issues and Challenges. IEEE Communications Surveys & Tutorials, 20, 2353-2371. [Google Scholar] [CrossRef] 
[8] Gu, D. and Yu, Y. (2011) The Resourse Efficient Forward-ing in the Concent Centric Network. Proceedings of 10th International IFIP TC 6 Conference on Networking, Valencia, 9-13 May 2011, 66-77. [Google Scholar] [CrossRef] 
[9] Gao, Y., Fu, J. and Lu, Y. (2021) Improvement of GPSR Routing Protocol for TDMA-Based UAV Ad-Hoc Networks. 2021 World Conference on Computing and Communica-tion Technologies (WCCCT), Dalian, 23-25 January 2021, 58-63. [Google Scholar] [CrossRef] 
[10] 张国印, 唐滨, 孙建国, 李佳楠. 面向内容中心网络基于分布均匀度的蚁群路由策略[J]. 通信学报, 2015, 36(6): 1-12.
[11] 刘期烈, 诸葛丽强, 夏远鹏, 秦庆伟, 邢峰英. CCN中一种非混合式蚁群路由优化策略[J]. 重庆邮电大学学报(自然科学版), 2018, 30(4): 445-452.
[12] Shanbhag, S., Schwan, N., Rimac, I. and Varvello, M. (2011) SoCCeR: Services over Content-Centric Routing. Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, Toronto, 19 August 2011, 62-67. [Google Scholar] [CrossRef] 
[13] Khan, A.Z., Baqai, S. and Dogar, F.R. (2012) QoS Aware Path Selection in Content Centric Networks. IEEE International Conference on Communications, Ottawa, 10-15 June 2012, 2645-2649. [Google Scholar] [CrossRef] 
[14] Huang, Q. and Luo, F. (2016) Ant-Colony Optimization Based QoS Routing in Named Data Networking. Journal of Computational Methods in Sciences and Engineering, 16, 671-682. [Google Scholar] [CrossRef] 
[15] 沈越欣, 王兴伟, 李洁, 曾荣飞. 基于多源的NDN端节点拥塞控制算法[J]. 网络空间安全, 2019, 10(8): 75-83.
[16] Shi, G., Altafini, C. and John, S. (2019) Dynamic over Signed Networks. SIAM Review, 61, 229-257. [Google Scholar] [CrossRef] 
[17] Membrey, P., Hpws, D. and Plugge, E. (2015) Content Delivery Net-works. In: Practical Load Balancing, Vol. 37, Apress, New York, 71-92. [Google Scholar] [CrossRef] 
[18] 石峻岭, 王兴伟, 黄敏. 基于ICN网络架构的社区感知型MSN路由机制[J]. 软件学报, 2020, 31(6): 1786-1801.