dc.contributorUniversidad EAFIT. Departamento de Ingeniería de Sistemas
dc.contributorI+D+I en Tecnologías de la Información y las Comunicaciones
dc.creatorMontoya, J.
dc.creatorDonoso, Y.
dc.creatorMontoya, E.
dc.creatorEcheverri, D.
dc.date.accessioned2021-04-12T21:07:07Z
dc.date.accessioned2022-09-23T22:04:54Z
dc.date.available2021-04-12T21:07:07Z
dc.date.available2022-09-23T22:04:54Z
dc.date.created2021-04-12T21:07:07Z
dc.date.issued2008-01-01
dc.identifier9783901882272
dc.identifierSCOPUS;2-s2.0-51849131090
dc.identifierhttp://hdl.handle.net/10784/28755
dc.identifier10.1109/ONDM.2008.4578405
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3538973
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 isnt 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.languageeng
dc.relationhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-51849131090&doi=10.1109%2fONDM.2008.4578405&partnerID=40&md5=c8571ea72ebc8bd1633c7aabc941c9f0
dc.sourceMultiobjective Model For Multicast Overlay Networks Over Ip/mpls Using Moea
dc.titleMultiobjective model for multicast overlay networks over IP/MPLS using MOEA
dc.typeinfo:eu-repo/semantics/conferencePaper
dc.typeconferencePaper
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typepublishedVersion


Este ítem pertenece a la siguiente institución