PCD2014
Summary
Papadimitriou, D., Careglio, D. and Demeester, P. (2014) Performance analysis of multicast routing algorithms. In Computing, Networking and Communications (ICNC), 2014 International Conference on. Honolulu (Hawaii), United States, Feb, pages 455-461.
Abstract
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.
Bibtex entry
@INPROCEEDINGS { PCD2014,
AUTHOR = { Papadimitriou, D. and Careglio, D. and Demeester, P. },
TITLE = { Performance analysis of multicast routing algorithms },
ADDRESS = { Honolulu (Hawaii), United States },
BOOKTITLE = { Computing, Networking and Communications (ICNC), 2014 International Conference on },
YEAR = { 2014 },
MONTH = { Feb },
PAGES = { 455-461 },
ABSTRACT = { 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. },
DOI = { 10.1109/ICCNC.2014.6785378 },
}