A swarm intelligence based algorithm for QoS multicast routing problem

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The QoS multicast routing problem is to find a multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay, delay jitter and loss rate. This problem is NP Complete. In this paper, we present a swarming agent based intelligence algorithm using a hybrid Ant Colony Optimization/Particle Swarm Optimization (ACO/PSO) algorithm to optimize the multicast tree. The algorithm starts with generating a large amount of mobile agents in the search space. The ACO algorithm guides agents' movement by pheromones in the shared environment locally and the global maximum of the attribute values are obtained through the random interaction between the agents using PSO algorithm. The performance of the proposed algorithm is evaluated through simulation. The simulation results reveal that our algorithm performs better than the existing algorithms. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Patel, M. K., Kabat, M. R., & Tripathy, C. R. (2011). A swarm intelligence based algorithm for QoS multicast routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7077 LNCS, pp. 38–45). https://doi.org/10.1007/978-3-642-27242-4_5

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