Volume 39 Issue 2
May  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2010  >  39(2): 271-274

QI Shi-feng, LI Yan-hua, MEI Da-cheng. Application Research of Ant Colony Algorithm for QoS Unicast routing[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 271-274. doi: 10.3969/j.issn.1001-0548.2010.02.025
Citation: QI Shi-feng, LI Yan-hua, MEI Da-cheng. Application Research of Ant Colony Algorithm for QoS Unicast routing[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 271-274. doi: 10.3969/j.issn.1001-0548.2010.02.025
shu

Application Research of Ant Colony Algorithm for QoS Unicast routing

doi: 10.3969/j.issn.1001-0548.2010.02.025
  • 1.

    Institute of Computer,Panzhihua University Panzhihua Sichuan 617000;

  • 2.

    Institute of Computer,Southwest Petroleum University Chengdu 610500

  • Received Date: 2008-10-06
  • Rev Recd Date: 2009-06-01
  • Publish Date: 2010-04-15
  • QoS routing problem is proved to be a NP-C problem, it is very difficult to solve the NP-C problem effectively by conventional routing algorithms. This paper puts forward an QoS unicast routing algorithm which is based on the principle of ant colony algorithm and used to solve the problem of bandwidth and delay constrain. The rule of ant colony algorithm that the ants find the shortest path through the laying down of pheromone and the rule with emphasis on the maximal network throughput and the lowest average cell delay are also used to define the transition probability of ants, routing table, and the way pheromone is updated. A detailed routing scheme algorithm based on the ant colony algorithm is implemented. Results prove that the algorithm has strong ability of searching an optimum solution and show its better flexibility and potential parallelism.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3623) PDF downloads(46) Cited by()

Related
Proportional views

Application Research of Ant Colony Algorithm for QoS Unicast routing

doi: 10.3969/j.issn.1001-0548.2010.02.025
  • 1. Institute of Computer,Panzhihua University Panzhihua Sichuan 617000;
  • 2. Institute of Computer,Southwest Petroleum University Chengdu 610500
  • Received Date: 2008-10-06
  • Rev Recd Date: 2009-06-01
  • Publish Date: 2010-04-15

Abstract: QoS routing problem is proved to be a NP-C problem, it is very difficult to solve the NP-C problem effectively by conventional routing algorithms. This paper puts forward an QoS unicast routing algorithm which is based on the principle of ant colony algorithm and used to solve the problem of bandwidth and delay constrain. The rule of ant colony algorithm that the ants find the shortest path through the laying down of pheromone and the rule with emphasis on the maximal network throughput and the lowest average cell delay are also used to define the transition probability of ants, routing table, and the way pheromone is updated. A detailed routing scheme algorithm based on the ant colony algorithm is implemented. Results prove that the algorithm has strong ability of searching an optimum solution and show its better flexibility and potential parallelism.

QI Shi-feng, LI Yan-hua, MEI Da-cheng. Application Research of Ant Colony Algorithm for QoS Unicast routing[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 271-274. doi: 10.3969/j.issn.1001-0548.2010.02.025
Citation: QI Shi-feng, LI Yan-hua, MEI Da-cheng. Application Research of Ant Colony Algorithm for QoS Unicast routing[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 271-274. doi: 10.3969/j.issn.1001-0548.2010.02.025
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return