计算机与现代化

• 算法设计与分析 • 上一篇    下一篇

一种QoS平面蚁群路由算法的设计与实现

  

  1. 中国人民公安大学网络安全保卫学院,北京102623
  • 收稿日期:2015-07-08 出版日期:2015-12-23 发布日期:2015-12-30
  • 作者简介:蔡文哲(1989-),男,河南封丘人,中国人民公安大学网络安全保卫学院硕士研究生,研究方向:网络路由算法,深度学习算法; 王斌君(1962-),男,教授,博士,研究方向:网络路由算法,信息安全。
  • 基金资助:
    公安部公安理论与软科学基金资助项目(2013LLYJGADX003)

A QoS Routing Algorithm for Plane Network Based on Ant Colony Algorithm

  1. School of Network Security, People Public Security University of China, Beijing 102623, China
  • Received:2015-07-08 Online:2015-12-23 Published:2015-12-30

摘要: 提高网络服务质量的关键在于寻找出高性能路由,然而传统的路由算法却很难解决此类NPC问题。基于此,本文提出一种基于改进后的自适应蚁群算法的路由解决方案,将路由问题假设为平面路由,并建立相应的网络模型。针对该网络模型,建立特定的平面QoS蚁群路由算法,并在MATLAB上对其进行模拟仿真,从而验证了它的性能。仿真实验结果表明,该路由选择方案在求解实际网络路由问题时具有一定的优越性,能够有效地解决QoS平面网络路由问题。

关键词: QoS平面网络路由, 自适应蚁群算法; 服务质量; NP-C问题

Abstract: The key to improve the network quality of service is to find a highperformance routing, but the traditional routing algorithms are difficult to solve this NPC problem. Based on this, we propose a routing solution based on improved adaptive algorithm. Firstly routing problem is assumed to be flat route, then a corresponding network model is set up. Finally we establish a specific ant routing algorithm for the network model, and by simulating on MATLAB, we verify its performance. Experiments show that the improved adaptive ant colony optimization algorithm is of certain advantages in solving complex network routing problems.

Key words: QoS plane network routing, adaptive ant colony algorithm, quality of service, NP-C problem

中图分类号: