Paper
16 September 1998 Multicast routing in BMSNs through greedy, weighted greedy, and Dijkstra algorithms: a comparative analysis
Andrea Borella, Franco Chiaraluce
Author Affiliations +
Proceedings Volume 3408, Broadband European Networks and Multimedia Services; (1998) https://doi.org/10.1117/12.321921
Event: SYBEN-Broadband European Networks and Electronic Image Capture and Publishing, 1998, Zurich, Switzerland
Abstract
The performances of some popular routing algorithms used for multicast communications are extensively simulated and analyzed in comparative terms, assuming the Bidirectional Manhattan Street Network as a valued test-bed. Multicast traffic is inserted over a substrate of point-to-point communications, contributing to increase the value of some cost parameters, suitably defined to express the routing efficiency. Both the cases of uncorrelated and bursty traffic are considered. The analysis confirms that the superiority of an algorithm over the others cannot be claimed since it depends on the input variables and on the criterion used for performance evaluation. Anyway conclusions can be drawn under specific assumptions, and they are usable in the framework of the network design.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andrea Borella and Franco Chiaraluce "Multicast routing in BMSNs through greedy, weighted greedy, and Dijkstra algorithms: a comparative analysis", Proc. SPIE 3408, Broadband European Networks and Multimedia Services, (16 September 1998); https://doi.org/10.1117/12.321921
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Networks

Network architectures

Computer networks

Computer simulations

Chemical elements

Distance measurement

Packet switching

Back to Top