By Topic

Algorithms to Augment Diversity and Convergence in Multiobjective 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
$33 $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)
Marcos L. P. Bueno ; Fac. of Comput. Sci., Fed. Univ. of Uberlandia, Uberlandia, Brazil ; Gina M. B. Oliveira

Multicast transmission corresponds to send data to several destinations, often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). These multiple requirements lead to the need of optimizing a set of conflicting objectives subject to constraints. Starting from the well-known evolutionary algorithm SPEA2, two formulations for the Routing problem were considered, minimizing four objectives - maximum link utilization, total cost, maximum end-to-end delay and hops count - subject to a link capacity constraint. The key investigation performed here is about the incorporation of a mechanism to reduced repeated individuals along the population, evaluating three algorithms for such task. One of them (ftm) is proposed on this study, whose results in six instances of the problem with five metrics to evaluate convergence and diversity goals, indicates that the evolutionary model based on SPEA2 using our algorithm had returned the better results.

Published in:

2010 Eleventh Brazilian Symposium on Neural Networks

Date of Conference:

23-28 Oct. 2010