Abstract
This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Simulation results show that MMA is able to find Pareto optimal solutions. They also show that for the constrained end-to-end delay problem in which the traffic demands arrive one by one, MMA outperforms the shortest path algorithm in maximum link utilization and total cost metrics. © Springer-Verlag 2004.
Cite
CITATION STYLE
Crichigno, J., & Barán, B. (2004). Multiobjective multicast routing algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 1029–1034. https://doi.org/10.1007/978-3-540-27824-5_134
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
