Skip to main content
Conference ProceedingsOPEN ACCESS

An improved ACO algorithm for multicast routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3779 LNCS 238-244
DOI: 10.1007/11577188_31
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The multicast routing problem with quality of service (QoS) constraints is a key requirement of computer networks supporting multi-media applications. In order to resolve Qos multicast routing effectively and efficiently, an improved ant colony optimization (ACO) algorithm is proposed to resolve this problem.The core idea of improved ACO algorithm is mainly realized through pheromone local and global updating rule.Experimental results show that this algorithm can find optimal solution quickly and has a good scalability. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Wang, Z., & Zhang, D. (2005). An improved ACO algorithm for multicast routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 238–244). Springer Verlag. https://doi.org/10.1007/11577188_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free