dc.creatorPinto, Diego
dc.creatorBarán, Benjamín
dc.date2006-08
dc.date2006-08
dc.date2012-11-14T11:32:53Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/24116
dc.identifierisbn:0-387-34825-5
dc.descriptionThis work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum endtoend delay. In this way, a set of optimal solutions, known as Pareto set is calculated in only one run of the algorithm, without a priori restrictions. Experimental results obtained with the proposed MOACS were compared to a recently published Multiobjective Multicast Algorithm (MMA), showing a promising performance advantage for multicast traffic engineering.
dc.description5th IFIP International Conference on Network Control & Engineering for QoS, Security and Mobility
dc.descriptionRed de Universidades con Carreras en Informática (RedUNCI)
dc.formatapplication/pdf
dc.languageen
dc.relation19 th IFIP World Computer Congress - WCC 2006
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.subjectCiencias Informáticas
dc.titleMultiobjective multicast routing with Ant Colony Optimization
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución