Name
Abstract | ||
|---|---|---|
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is 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 complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction 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 algorithm performs as well as the centralized version, providing good levels of convergence time and communication complexity. Moreover, the proposed approach outperforms the state-of-the-art distributed algorithms for multicast tree setup. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICPPW.2005.23 | ICPP Workshops |
Keywords | Field | DocType |
routing,steiner tree problem,distributed algorithms,point to point,distributed algorithm,network nodes,network resources,protocols,communication complexity,computer networks,network topology,cost function,network performance,steiner trees,testing | Protocol Independent Multicast,Computer science,Steiner tree problem,Xcast,Node (networking),Computer network,Network topology,Pragmatic General Multicast,Distributed algorithm,Multicast,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-2016 | 0-7695-2381-1 | 6 |
PageRank | References | Authors |
0.48 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Gatani | 1 | 49 | 8.24 |
| Giuseppe Lo Re | 2 | 338 | 41.26 |
| Salvatore Gaglio | 3 | 660 | 88.41 |