Optimización multiobjetivo para enrutamiento multicast en overlay networks utilizando algoritmos evolutivos

dc.contributor.authorM Juan Carlos Montoya
dc.contributor.authorMakarena Donoso
dc.contributor.authorG Ramón Fabregat
dc.contributor.authorM Edwin Montoya
dc.contributor.authorS Diego Echeverri
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T19:53:07Z
dc.date.available2026-03-22T19:53:07Z
dc.date.issued2008
dc.description.abstractMulticast plays an important role in supporting a new generation of applications. At present and for different reasons, technical and non–technical, multicast IP hasn’t yet been totally adopted for Internet. During recent years, an active area of research is that of implementing this kind of traffic in the application layer where the multicast functionality isn´t a responsibility of the routers but that of the hosts, which we know as Multicast Overlay Networks (MON). In this article, routing in an MON is put forward as a multiobjective optimization problem (MOP) where two functions are optimized: 1) the total end to end delay of the multicast tree and 2) the maximum link utilization. The simultaneous optimization of these two functions is an NP–Complete problem and to solve this we suggest using Multiobjective Evolutionary Algorithms (MOEA), specifically NSGA–II.
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/78701
dc.language.isoes
dc.sourceUniversidad EAFIT
dc.subjectMulticast
dc.subjectProtocol Independent Multicast
dc.subjectXcast
dc.subjectComputer network
dc.subjectSource-specific multicast
dc.subjectComputer science
dc.subjectDistance Vector Multicast Routing Protocol
dc.subjectIP multicast
dc.subjectPragmatic General Multicast
dc.subjectOverlay multicast
dc.titleOptimización multiobjetivo para enrutamiento multicast en overlay networks utilizando algoritmos evolutivos
dc.typearticle

Files