Share Email Print

Proceedings Paper

Multicast routing in BMSNs through greedy, weighted greedy, and Dijkstra algorithms: a comparative analysis
Author(s): Andrea Borella; Franco Chiaraluce
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 16 September 1998
PDF: 11 pages
Proc. SPIE 3408, Broadband European Networks and Multimedia Services, (16 September 1998); doi: 10.1117/12.321921
Show Author Affiliations
Andrea Borella, Univ. degli Studi di Ancona (Italy)
Franco Chiaraluce, Univ. degli Studi di Ancona (Italy)

Published in SPIE Proceedings Vol. 3408:
Broadband European Networks and Multimedia Services
Stephan Fischer; Ralf Steinmetz; Heinrich J. Stuettgen; Harmen R. van As; Roberto Vercelli, Editor(s)

© SPIE. Terms of Use
Back to Top