Latest revision as of 14:41, 21 January 2021

Abstract

This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dynamic Multicast Groups. Multitree traffic engineering uses several trees to transmit a multicast demand from a source to a set of destinations in order to balance traffic load, improving network resource utilization. Experimental results obtained by simulations using eight real net-work topologies show that this new approach gets trade off solutions while simultaneously considering five objective functions. As expected, when M-MMA is compared to an equivalent singletree alternative, it accommodates more traffic demand in a high traffic saturated network.

Original document

The different versions of the original document can be found in:

• http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1 under the license cc-by-nc-sa

• http://link.springer.com/content/pdf/10.1007/978-0-387-34747-9_26,

http://dx.doi.org/10.1007/978-0-387-34747-9_26 under the license http://www.springer.com/tdm

• https://dblp.uni-trier.de/db/conf/ifip12/ai2006.html#PrietoBC06,

https://link.springer.com/chapter/10.1007%2F978-0-387-34747-9_26,

http://sedici.unlp.edu.ar/handle/10915/23915,

https://www.cnc.una.py/publicaciones/4_145.pdf,

https://www.researchgate.net/profile/Benjamin_Baran/publication/220827586_Multitree-Multiobjective_Multicast_Routing_for_Traffic_Engineering/links/0deec532c2b54a343c000000.pdf,

http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1,

http://www.cnc.una.py/publicaciones/4_145.pdf,

https://academic.microsoft.com/#/detail/1487429811