Efficiency Analysis of Multicast Routing Algorithms in Large Networks

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.

[1]  John Crawford,et al.  Heuristics for ATM Multicast Routing , 1998 .

[2]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[3]  Changjia Chen,et al.  A fast delay-constrained multicast routing algorithm , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[5]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[6]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[7]  Sylwester Kaczmarek.  POZNAN UNIVERSITY OF TECHNOLOGY ACADEMIC JOURNALS , 2007 .

[8]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[11]  P. Żmudziński,et al.  The influence on network topology on the efficiency of multicast heuristic algorithms , 2006 .

[12]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[13]  Demetres D. Kouvatsos,et al.  Performance modelling and evaluation of heterogeneous networks , 2005, Perform. Evaluation.

[14]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[15]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[16]  Quan Sun,et al.  Efficient Multicast Routing for Delay-Sensitive Applications , 1995 .

[17]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[18]  Mohamed F. Mokbel.  A Delay-Constrained Shortest Path Algorithm for Multicast Routing in Multimedia Applications , 2001 .

[19]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[20]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[21]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.