On the methodology for the evaluation of unconstrained multicast routing algorithms
ICT'09 Proceedings of the 16th international conference on Telecommunications
| Hi-index | 0.00 |
The paper presents the research results of multicast heuristic algorithms. The paper is an extension of previous publications presented in [14, 15] that discussed small network structures reflecting real Internet topology. It approaches basic methods of generating the Internet topology Waxman method and the Barabasi-Albert method. A performance study of multicast trees constructed by the algorithms is carried out and analysed, also with the heuristic network generator - Inet.