高效的遗传蚁群组合算法在QoS路由上的运用
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:


An efficient combination of genetic ant colony algorithm in QoS routing
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对现有遗传蚁群算法中算法融合不佳与系统易出现拥塞现象等问题,根据遗传算法与蚁群算法不同时期的优点,提出了一种高效的遗传蚁群组合算法。该算法通过根据遗传算法的群体代价关系,提出了新的融合机制;为缓解系统最优化后所产生的节点负载压力,引入了防拥塞的赏罚机制。实验结果表明,该算法能够在保证系统传输效率的同时有效的防止数据丢包现象,与传统算法相比具有高效率、低耗能以及防丢包等优势。

    Abstract:

    Existing genetic ant colony algorithm has the problem of poor integration and prone to congestion. In response to this phenomenon, this article put forward an efficient combination of genetic ant colony algorithm based on the advantages of different periods of the genetic algorithm and ant colony algorithm. The algorithm proposes a new fusion mechanism on the basis of the consideration relationship of the genetic algorithm groups. And an anti-congestion reward and punishment mechanism is introduced to alleviate the load pressure of the system nodes. The experimental results show that the algorithm can guarantee the efficiency of the system transmission, at the same time it can effectively prevent data packet loss. Compared with the traditional algorithm, it has the advantages of high efficiency, low energy and anti-dropout.

    参考文献
    相似文献
    引证文献
引用本文

叶仕通,万智萍.高效的遗传蚁群组合算法在QoS路由上的运用[J].重庆大学学报,2013,36(10):82-88.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2013-10-29
  • 出版日期: