Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Genetic routing algorithm for multicast connections in packet networks

Authors

[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2008

Published in

Image Processing & Communications

Journal year: 2008 | Journal volume: vol. 13 | Journal number: no. 1-2

Article type

scientific article

Publication language

english

Keywords
EN
  • multicast
  • routing algorithms
  • genetic algorithms
Abstract

EN The article analyzes and explores the influence of different genetical solutions on the efficiency and effectiveness of the performance of genetic algorithms for multicast routing. The results of the simulation studies were compared with the results obtained with the application of classic heuristics, i.e. (KPP [12], CSPT [5] and LD). The tests were carried out for a wide range of parameters defining properties and characteristics of test networks topologies. The simulation study takes into consideration topology generation methods in line with the Waxman model and the Barabási-Albert model.

Pages (from - to)

13 - 20

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.