Analysis of the Influence of Group Members Arrangement on the Multicast Tree Cost

Maciej Piechowiak, Maciej Stasiak, Piotr Zwierzykowski
2009 2009 Fifth Advanced International Conference on Telecommunications  
The article proposes a novel multicast routing algorithm without constraints and introduces the group members arrangement as a new parameter for analyzing multicast routing algorithms finding multicast trees. The objective of STA (Switched Trees Algorithm) is to minimize the total cost of the multicast tree using a modification of the classical Prim's algorithm (Pruned Prim's Heuristic) and the SPT (Shortest Path Tree) algorithm that constructs a shortest path tree between a source and each
more » ... icast node. In the article, the results of the proposed STA algorithm are compared with the representative algorithms without constrains. The results part of the article also contains some selected statistical properties of the multicast routing algorithms finding multicast trees as part of a wider research methodology.
doi:10.1109/aict.2009.77 dblp:conf/aict/PiechowiakSZ09 fatcat:obsqcbv73rcblgh4wtmlyh6r2i