Paper Info
Title
Multiobjective multicast routing algorithm for traffic engineering
Abstract
This paper presents a new version of a multiobjective multicast routing algorithm (MMA) for traffic-engineering, based on the strength Pareto evolutionary algorithm (SPEA), which simultaneously optimizes the maximum link utilization, the cost of the tree, the maximum end-to-end delay and the average delay. 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 dynamic multicast routing, where the traffic requests arrive one after another, MMA outperforms other known algorithms
Year
DOI
Venue
2004
10.1109/ICCCN.2004.1401652
Chicago, IL
Keywords
Field
DocType
Pareto optimisation,delays,evolutionary computation,multicast communication,telecommunication network routing,telecommunication traffic,Pareto set,a priori restriction,dynamic multicast routing,maximum end-to-end delay,maximum link utilization,multiobjective multicast routing algorithm,strength Pareto evolutionary algorithm,traffic engineering
Mathematical optimization,Evolutionary algorithm,Spea,Computer science,A priori and a posteriori,Computer network,Evolutionary computation,Multicast,Traffic engineering,Pareto principle,Distributed computing,Routing algorithm
Conference
ISSN
ISBN
Citations 
1095-2055
0-7803-8814-3
30
PageRank 
References 
Authors
1.22
7
2
Name
Order
Citations
PageRank
Jorge Crichigno116814.41
Benjamín Barán257247.27