
239How to Simulate and Evaluate Multicast Routing Algorithms
In works related to simulations of multicast routing algorithms (e.g., [5,44,59,60]), the group of
receiving nodes M is determined by a random selection of m nodes in the network from among all
n nodes n = |N|. The source node s is also selected randomly from among n nodes of the network.
Such an approach is called in the present section the GroupRandom method.
The authors propose the following methods for receiving nodes arrangement [64,65]:
• GroupRadius method
(Nodes that create the multicast group M and the source node s are chosen from among N
r
nodes that are located inside the ...