DocumentCode :
1804194
Title :
Distributed algorithms for multicast path setup in data networks
Author :
Bauer, Fred ; Varma, Anujan
Author_Institution :
Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
Volume :
2
fYear :
1995
fDate :
14-16 Nov 1995
Firstpage :
1374
Abstract :
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding multicast trees in point-to-point data networks. These algorithms are based on two centralized Steiner heuristics, the shortest path heuristic (SPH) and the Kruskal-based shortest path heuristic (K-SPH), and have the advantage that only the multicast members and nodes in the neighborhood of the multicast tree need to participate in the execution of the algorithm. We compare our algorithms by simulation against a baseline algorithm, the pruned minimum spanning-tree heuristic, which is the basis of many previously published algorithms for finding multicast trees. Our results show that the competitiveness (the ratio of the sum of the heuristic tree´s edge weights to that of the best solution found) of both of our algorithms was on the average 25 percent better in comparison to those produced by the pruned spanning-tree approach. In addition, our algorithm´s competitiveness in almost all cases was within 10 percent of the best solution found by any of the Steiner heuristics considered, including both centralized and distributed algorithms
Keywords :
asynchronous transfer mode; computational complexity; data communication; distributed algorithms; telecommunication network routing; trees (mathematics); Kruskal-based shortest path heuristic; NP-complete Steiner problem; centralized Steiner heuristics; data networks; distributed algorithms; multicast path setup; multicast tree; point-to-point network; pruned minimum spanning-tree heuristic; shortest path heuristic; switch nodes; wide-area ATM network; Algorithm design and analysis; Analytical models; Computer networks; Distributed algorithms; Electronic mail; Intelligent networks; Multicast algorithms; Radio access networks; Steiner trees; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE
Print_ISBN :
0-7803-2509-5
Type :
conf
DOI :
10.1109/GLOCOM.1995.502627
Filename :
502627
Link To Document :
بازگشت