In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of competitiveness, convergence time, and communication complexity. Furthermore, we propose a novel distributed technique for dynamically updating the multicast tree.

GATANI, L., LO RE, G., GAGLIO, S. (2005). A Dynamic Distributed Algorithm for Multicast Path Setup. In LECTURE NOTES IN COMPUTER SCIENCE (pp. 595-605) [10.1007/11549468_67].

A Dynamic Distributed Algorithm for Multicast Path Setup

GATANI, Luca;LO RE, Giuseppe;GAGLIO, Salvatore
2005-01-01

Abstract

In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of competitiveness, convergence time, and communication complexity. Furthermore, we propose a novel distributed technique for dynamically updating the multicast tree.
2005
GATANI, L., LO RE, G., GAGLIO, S. (2005). A Dynamic Distributed Algorithm for Multicast Path Setup. In LECTURE NOTES IN COMPUTER SCIENCE (pp. 595-605) [10.1007/11549468_67].
File in questo prodotto:
File Dimensione Formato  
A Dynamic Distributed Algorithm for Multicast Path Setup.pdf

Solo gestori archvio

Descrizione: articolo principale + front matter + indice
Dimensione 847.03 kB
Formato Adobe PDF
847.03 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10447/1852
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact