Paper Info
Title
A Multicast Routing Algorithm Using Multiobjective Optimization
Abstract
Multicast routing problem in computer networks, with more than one objective to consider, like cost and delay, is usually treated as a mono-objective Optimization Problem, where the cost of the tree is minimized subject to a priori restrictions on the delays from the source to each destination. This paper presents a new multicast algorithm based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay and the average delay from the source node to each destination node. Simulation results show that the proposed algorithm is able to find Pareto optimal solutions. In addition, they show that for the problem of minimum cost with constrained end-to-end delay, the proposed algorithm provides better solutions than other well-known alternatives as Shortest Path and KPP algorithms.
Year
DOI
Venue
2004
10.1007/978-3-540-27824-5_144
Lecture Notes in Computer Science
Keywords
Field
DocType
shortest path,end to end delay,optimization problem,multiobjective optimization,computer network
Mathematical optimization,Evolutionary algorithm,Shortest path problem,Spea,Computer science,A priori and a posteriori,Multi-objective optimization,Multicast,Optimization problem,Pareto principle
Conference
Volume
ISSN
Citations 
3124
0302-9743
13
PageRank 
References 
Authors
0.85
7
2
Name
Order
Citations
PageRank
Jorge Crichigno116814.41
Benjamín Barán257247.27