Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ivanov, A.O., Tuzhilin, A.A.: Minimal Networks: The Steiner Problem and Its Generalizations. CRC Press, Cleveland (1994)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Prest, New York (1972)
Winter, P.: Steiner problem in networks: A survey. Networks 17, 129–167 (1987)
Hwang, F., Richards, D.: Steiner tree problems. Networks 22, 55–89 (1992)
Ramanathan, S.: Multicast tree generation in networks with asymmetric links. IEEE/ACM Transactions on Networking 4, 558–568 (1996)
Kompella, V., Pasquale, J., Polyzos, G.: Two distributed algorithms for the constrained Steiner tree problem. In: Proc. Comput. Commun. and Netw., San Diego, CA (1993)
Chen, G., Houle, M., Kuo, M.: The Steiner problem in distributed computing systems. Information Sciences 74, 73–96 (1993)
Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking 4, 181–191 (1996)
Singh, G., Vellanki, K.: A distributed protocol for constructing multicast tree. In: Proc. IEEE Int’l Conf. on Principles of Distributed Systems, pp. 41–48 (1998)
Novak, R., Rugelj, J., Kandus, G.: A note on distributed multicast routing in point-to-point networks. Computers & Operations Research 28, 1149–1164 (2001)
Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. In: Proc. IEEE GLOBECOM, Singapore (1995)
Kadirire, J., Knight, G.: Comparison of dynamic multicast routing algorithms for wide-area packet switched networks. In: Proc. IEEE INFOCOM, Boston, MA (1995)
Imase, M., Waxman, B.: Steiner tree problems. SIAM J. Discrete Math. 4, 369–384 (1991)
Gatani, L., Lo Re, G.: Urso, A.: Distributed algorithms for multicast tree construction. In: Proc. IEEE ISCCSP 2004, Hammamet, Tunisia (2004)
Plesnik, J.: Worst-case relative performances of heuristics for the Steiner problem in graphs. Acta Mathematica Universitatis Comenianae 60, 269–284 (1991)
Rayward-Smith, V.J., Clare, A.: On finding Steiner vertices. Networks 16, 283–294 (1986)
Di Fatta, G., Lo Re, G.: Efficient tree construction for the multicast problem. In: Proc. IEEE ITS 1998, Sao Paolo, Brazil (1998)
Fall, K., Varadhan, K.: The ns Manual (2003), http://www.isi.edu/nsnam/ns/doc/index.html
Medin, A., Lakhina, A., Matta, I., Byers, J.: BRITE Universal Topology Generation from a User’s Perspective (2001), http://www.cs.bu.edu/brite/usermanual/BritePaper.html
Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, pp. 1371–1380 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gatani, L., Lo Re, G., Gaglio, S. (2005). A Dynamic Distributed Algorithm for Multicast Path Setup. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_67
Download citation
DOI: https://doi.org/10.1007/11549468_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)