On the methodology for the evaluation of unconstrained multicast routing algorithms

Having in mind various implementations of methods for generating network topology, there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.