Treffer: Multiobjective multicast routing algorithm
Title:
Multiobjective multicast routing algorithm
Authors:
Source:
Telecommunications and networking (Fortaleza, 1-6 August 2004)Lecture notes in computer science. :1029-1034
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Télétrafic, Teletraffic, Transmission et modulation (techniques et équipements), Transmission and modulation (techniques and equipments), Algorithme évolutionniste, Evolutionary algorithm, Algoritmo evoluciónista, Diffusion donnée, Data broadcast, Difusion dato, Estimation a priori, A priori estimation, Estimación a priori, Evaluation performance, Performance evaluation, Evaluación prestación, Multidestinataire, Multicast, Multidestinatario, Optimum Pareto, Pareto optimum, Optimo Pareto, Plus court chemin, Shortest path, Camino más corto, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Routage, Routing, Enrutamiento, Simulation, Simulación, Solution optimale, Optimal solution, Solución óptima, Temps retard, Delay time, Tiempo retardo, Télétrafic, Teletraffic, Teletráfico
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
P. O. Box 1439 - National University of Asuncion, Asunción, Paraguay
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.16075196
Database:
PASCAL Archive
Weitere Informationen
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.