Loading...
Loading...

Go to the content (press return)

Performance analysis of multicast routing algorithms

Author
Papadimitriou, D.; Careglio, D.; Demeester, P.
Type of activity
Presentation of work at congresses
Name of edition
International Conference on Computing, Networking and Communications 2014
Date of publication
2014
Book of congress proceedings
2014 International Conference on Computing, Networking and Communications (ICNC)
First page
455
Last page
461
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICCNC.2014.6785378 Open in new window
Repository
http://hdl.handle.net/2117/24094 Open in new window
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 tho...
Citation
Papadimitriou, 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.
Keywords
Algorithm, Multicast, Performance, Routing
Group of research
CBA - Communications and Broadband Architectures Lab

Participants

  • Papadimitriou, Dimitri  (author and speaker )
  • Careglio, Davide  (author and speaker )
  • Demeester, Piet M.A.  (author and speaker )

Attachments