Performance of Fast Multicast Algorithms in Real Networks

Multicast heuristic algorithms are currently the field of interest for networks researchers. The optimization analysis of fast algorithms is performed using random and heuristic networks (graphs). This theoretical work approaches problem of constructing trees between the sender and group of receivers in real computer networks. The paper presents basic methods of generating the Internet topology on graph level -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.