1st International ICST Conference on Communications and Networking in China

Research Article

A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/CHINACOM.2006.344753,
    author={Hua  Wang and Zhao Shi and Jun Ma},
    title={A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344753}
}
  • Hua Wang
    Zhao Shi
    Jun Ma
    Year: 2007
    A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2006.344753
Hua Wang1,2,*, Zhao Shi1,2,*, Jun Ma1,2,*
  • 1: School of Computer Science and Technology, Shandong University
  • 2: Jinan, Shandong Province, P. R. China
*Contact email: wanghua@sdu.edu.cn, shizhao198334@163.com, majun@sdu.edu.cn

Abstract

This paper proposes a modified ant colony algorithm and applies it to multi-constraint multicast routing problem. This modified algorithm adds the orientation factor to the basic ant colony algorithm, which enables the ant to get rid of the initial blindness when searching paths. This makes use of the search results and reduces the misguiding function of pheromone on irrelevant paths, thus overcoming the drawbacks of slow convergence existing in the basic ant colony algorithm. The simulation results show that the accuracy and convergence speed of the modified algorithm are better than those of the basic ant colony algorithm.

Published
2007-04-10
Publisher
IEEE
http://dx.doi.org/10.1109/CHINACOM.2006.344753
Copyright © 2006–2024 IEEE
EAI Logo

About EAI

Community

Publish with EAI