An efficient distributed algorithm for generating multicast distribution trees

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2005, Issue , 2005, Pages 477-484

  Gatani, Luca ^a   Re, Giuseppe Lo ^a   Gaglio, Salvatore ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; MULTICASTING;

COMMUNICATION COMPLEXITY; COORDINATION PROTOCOL; DISTRIBUTED ALGORITHM; OPTIMAL MULTICAST TREES;

TREES (MATHEMATICS);

EID: 33745211444     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2005.23     Document Type: Conference Paper

References (22)

1. F. Bauer and A. Varma. Distributed algorithms for multicast path setup in data networks, IEEE/ACM Trans. Networking, 4(2):181-191, Apr. 1996.
2. G. Chen, M. Houle, and M. Kuo. The Steiner problem in distributed computing systems. Inform. Sci., 74(1-2):73-96, Oct. 1993.
3. K. Fall and K. Varadhan. The ns manual. http://www.isi.edu/nsnam/ns/, 2003.
4. R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Progr. Lang. and Syst., 5(1):66-77, Jan. 1983.
5. L. Gatani, G. Lo Re, and A. Urso. Distributed algorithms for multicast tree construction. In Proc. IEEE ISCCSP'04, Hammamet. Tunisia, Mar. 2004.
6. R. Govindan and H. Tangmunarunkit, Heuristics for Internet map discovery. In Proc. IEEE INFOCOM'00, pages 1371-1380. Tel Aviv. Israel, Mar. 2000.
7. A. O. Ivanov and A. A. Tuzhilin. Minimal Networks: The Steiner Problem and Its Generalizations. CRC Press. Cleveland, OH, 1994.
8. X. Jia. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Trans. Networking, 6(6):828-836, Dec. 1998.
9. R. M. Karp. Reducibility among combinatorial problems. In Miller and Thatcher, editors, Complexity of Computer Computations. Plenum Prest, New York, 1972.
10. V. Kompella, J. Pasquale, and G. Polyzos. Two distributed algorithms for the constrained Steiner tree problem. In Proc. Comput. Commun. and Netw., San Diego, CA, Jun. 1993.
11. L. Kou, G. Markowsky. and L. Herman. A fast algorithm for Steiner trees. Acta Informatica, 15(2): 141-145, 1981.
12. J. Lin and R. Chang. A comparison of the Internet multicast routing protocols. Computer Communications. 22(2): 144-155, 1999.
13. A. Medin, A. Lakhina, I. Matta, and J. Byers. BRITE Universal Topology Generation from a User's Perspective. http://www.cs.bu.edu/brite/user_manual/BritePaper.html, Apr. 2001.
14. R. Novak, J. Rugelj, and G. Kandus. A note on distributed multicast routing in point-to-point networks. Comput. Oper. Res., 28:1149-1164, 2001.
15. S. Ramanathan. Multicast tree generation in networks with asymmetric links. IEEE/ACM Trans. Networking. 4(4):558-568. Aug. 1996.
16. V. J. Rayward-Smith and A. Clare. On finding Steiner vertices. Networks, 16:283-294, 1986.
17. G. N. Rouskas and I. Baldine. Multicast routing with end-to-end delay and delay variation constraints. IEEE J. Select. Areas Commun., 15:346-356, June 1997.
18. G. Singh and K. Vellanki. A distributed protocol for constructing multicast tree. In Proc. IEEE Int'l Conf. on Principles of Distributed Systems, pages 41-48, Dec. 1998.
19. M. Smith and P. Winter. Path distance heuristics for the Steiner problem in undirected networks. Algorithmica, 7(23):309-327, 1992.
20. H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Int. J. Math. Educ. Sci. Technol., 14(1), 1983.
21. P. Wan, G. Calinescu, and C. Yi. Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Networking. 12(3):507-514, June 2004.
22. P. Winter. Steiner problem in networks: A survey. Networks, 17(2): 129-167, 1987.