Multiobjective Multicast Routing with Ant Colony Optimization

Abstract

This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal solutions, known as Pareto set is calculated in only one run of the algorithm, without a priori restrictions. Experimental results obtained with the proposed MOACS were compared to a recently published Multiobjective Multicast Algorithm (MMA), showing a promising performance advantage for multicast traffic engineering.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1007/978-0-387-34827-8_9

• https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_9.pdf

• http://www.springerlink.com/index/pdf/10.1007/978-0-387-34827-8_9,

http://dx.doi.org/10.1007/978-0-387-34827-8_9

• https://link.springer.com/chapter/10.1007/978-0-387-34827-8_9,

https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2006.html#PintoB06,

https://rd.springer.com/chapter/10.1007/978-0-387-34827-8_9,

https://academic.microsoft.com/#/detail/1862226204