Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. An efficient distributed algorithm for generating multicast distribution trees
Gatani, L.; Lo Re, G.; Gaglio, S.;
Parallel Processing, 2005. ICPP 2005 Workshops. International Conference Workshops on
14-17 June 2005 Page(s):477 - 484
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.
Abstract | Full Text: PDF(304 KB)    IEEE CNF
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved