Paper Info
Title
Multiobjective Multicast Routing Algorithm
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.
Year
DOI
Venue
2004
10.1007/978-3-540-27824-5_134
Lecture Notes in Computer Science
Keywords
Field
DocType
shortest path algorithm,end to end delay
Mathematical optimization,Evolutionary algorithm,Shortest path problem,Spea,Computer science,A priori and a posteriori,Algorithm,Multicast,Total cost,Pareto principle,Dijkstra's algorithm
Conference
Volume
ISSN
Citations 
3124
0302-9743
13
PageRank 
References 
Authors
0.81
7
2
Name
Order
Citations
PageRank
Jorge Crichigno116814.41
Benjamín Barán257247.27