首页 | 本学科首页   官方微博 | 高级检索  
     

一种QoS平面蚁群路由算法的设计与实现
引用本文:蔡文哲,王斌君.一种QoS平面蚁群路由算法的设计与实现[J].计算机与现代化,2015,0(12):15.
作者姓名:蔡文哲  王斌君
基金项目:公安部公安理论与软科学基金资助项目(2013LLYJGADX003)
摘    要:提高网络服务质量的关键在于寻找出高性能路由,然而传统的路由算法却很难解决此类NP C问题。基于此,本文提出一种基于改进后的自适应蚁群算法的路由解决方案,将路由问题假设为平面路由,并建立相应的网络模型。针对该网络模型,建立特定的平面QoS蚁群路由算法,并在MATLAB上对其进行模拟仿真,从而验证了它的性能。仿真实验结果表明,该路由选择方案在求解实际网络路由问题时具有一定的优越性,能够有效地解决QoS平面网络路由问题。

关 键 词:QoS平面网络路由  自适应蚁群算法    服务质量    NP-C问题  />  
收稿时间:2015-12-30

A QoS Routing Algorithm for Plane Network Based on Ant Colony Algorithm
CAI Wen zhe,WANG Bin jun.A QoS Routing Algorithm for Plane Network Based on Ant Colony Algorithm[J].Computer and Modernization,2015,0(12):15.
Authors:CAI Wen zhe  WANG Bin jun
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.
Keywords:QoS plane network routing  adaptive ant colony algorithm  quality of service  NP-C problem  
点击此处可从《计算机与现代化》浏览原始摘要信息
点击此处可从《计算机与现代化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号