Name
Abstract | ||
|---|---|---|
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or leave, and it triggers a "stirring" process that locally rearranges the tree, when its degradation exceeds a given threshold. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ITRE.2005.1503098 | ITRE 2005: 3rd International Conference on Information Technology: Research and Education, Proceedings |
Keywords | Field | DocType |
multicast transmissions, dynamic steiner tree problem, distributed algorithms | Inter-domain,Protocol Independent Multicast,Source-specific multicast,Computer science,Xcast,Computer network,Distributed algorithm,Pragmatic General Multicast,Distance Vector Multicast Routing Protocol,Multicast,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Gatani | 1 | 49 | 8.24 |
| Giuseppe Lo Re | 2 | 338 | 41.26 |