Performance analysis of multicast routing algorithms
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
This paper provides a theoretical performance analysis of different classes of multicast routing algorithms, namely the Shortest Path Tree, the Steiner Tree, compact routing and greedy routing. Our motivation is to determine the routing scheme which would yield the best trade-off between the stretch of the multicast routing paths, the memory space required to store the routing information and routing table as well as the communication cost. For this purpose, we also confront these results to those obtained by simulation on the CAIDA map of the Internet topology comprising 32k nodes.
CitationPapadimitriou, D.; Careglio, D.; Demeester, P. Performance analysis of multicast routing algorithms. A: International Conference on Computing, Networking and Communications. "2014 International Conference on Computing, Networking and Communications (ICNC)". Honolulu, Hawaii: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 455-461.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder