The Influence of Group Members Arrangement on the Multicast Tree Cost
[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2009
artykuł naukowy
angielski
- multicasting
- multicast tree
- network topology
- routing algorithm
EN 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 multicast 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.
248 - 257