By Topic

Multiobjective Evolutionary Algorithms and a Combined Heuristic for Route Reconnection Applied to Multicast Flow Routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bueno, M.L.P. ; Fac. of Comput., Fed. Univ. of Uberlandia, Uberlandia, Brazil ; Oliveira, G.M.B.

Multicast transmission corresponds to send data to several destinations often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). This work investigates new evolutionary models to tackle Multicast Flow Routing in a Pareto multiobjective perspective. Two multiobjective evolutionary algorithms (SPEA and SPEA2) were applied as the underlying search of such models. QoS and TE requirements are also considered in the route calculus by optimizing four objectives - maximum link utilization, total cost, maximum end-to-end delay and hops count - attending a link capacity constraint. Besides, three heuristics for subtrees reconnection to be used on crossover and mutation operators are investigated. The first heuristic uses a shortest path algorithm to improve the convergence; the second one employs a random search to reconnect subtrees into a valid route and the third one mixes the other two combining the good skills of each one. The resultant evolutionary environments were evaluated using four multiobjective metrics: two for convergence and two for diversity. SPEA2 reached better results than SPEA on the vast majority cases. The design of crossover and mutation operators that provide more diversity lead to very good improvements on both multiobjective goals - convergence and diversity - being that the heuristic which combines random and shortest path reconnections and returned the best results.

Published in:

Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on

Date of Conference:

June 29 2010-July 1 2010