
249How to Simulate and Evaluate Multicast Routing Algorithms
in relation to trees obtained by the KSPMA. For the Waxman model, these differences are 28%
and 37%, respectively. The differences under consideration result from the methods of constructing
trees adopted in the algorithms. The MLRA, KSPMA, and CSPT algorithms are algorithms that
construct the least cost paths, whereas the KPP algorithm optimizes the total cost of tree. Note that
in the networks generated on the basis of the Barabási–Albert model, paths with lower costs are
obtained than those in the networks generated on the basis of the Waxman model. It is so because
networks generated ...