Networks
The Steiner problem in distributed computing systems
Information Sciences: an International Journal
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
| Hi-index | 0.00 |
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.