The current work shows an approach to solve the QoS multicast routing problem by using Particle Swarm Optimization (PSO).The problem of finding a route from a source node to multiple destination nodes (multicast) at a minimum cost is an NP-Complete problem (Steiner tree problem) and is even greater if Quality of Service -QoS- constraints are taken into account. Thus, approximation algorithms are necessary to solve this problem. This work presents a routing algorithm with two QoS constraints (delay and delay variation) for solving the routing problem based on a modified version of particle swarm optimization.
This work involved the following methodology:1. Literature Review 2. Routing algorithm design 3. Implementation of the designed routing algorithm by java programming. 4. Simulations and results.
In this work we compared our routing algorithm against the exhaustive search approach. The results showed that our algorithm improves the execution times in about 40% with different topologies.
The algorithm was tested in three different topologies with 30, 40 and 50 nodes with and a dense graph topology.
Our algorithm implements a novel technique for fine tuning the parameters of the implemented bio-inspired model (Particles Swarm Optimization) by using a Genetic Meta-Optimizer. We also present a simple and multi implementation approach by using an encoding system that fits multiple bio-inspired models.
