QoS multicast routing based on particle swarm optimization

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

Abstract

The purpose of this paper is to solve Quality-of-Service (QoS) multicast routing problem by Particle Swarm Optimization (PSO). The QoS multicast routing optimization problem was transformed into a quasicontinuous problem by constructing a new integer coding and the constrained conditions in the problem were solved by the method of penalty function. The experimental results indicated that the proposed algorithm could converge to the optimal on near-optimal solution with less computational cost. It also appeared that PSO outperformed Genetic Algorithm on QoS the tested multicast routing problem. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Jing, L., Jun, S., & Wenbo, X. (2006). QoS multicast routing based on particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 936–943). Springer Verlag. https://doi.org/10.1007/11875581_112

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