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 t...Show MoreMetadata
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.
Published in: ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.
Date of Conference: 27-30 June 2005
Date Added to IEEE Xplore: 06 September 2005
Print ISBN:0-7803-8932-8