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.

Chapter

Download BibTeX

Title

Heuristic 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

2007

Chapter type

paper

Publication language

english

Keywords
EN
  • multicast
  • routing algorithms
  • network topology
  • optimization algorithms
Abstract

EN There have been many heuristic algorithms determining multicast connection trees proposed over the past few years. However, the proposed methods are only approximations of most favourable solutions and thus, a necessity for finding a better and more suitable algorithm is still topical and up-to-date. The present article aims at presenting the attempts of finding a two-criteria algorithm that would be more effective than those presented in relevant literature so far.

Pages (from - to)

948 - 955

DOI

10.1109/EURCON.2007.4400621

URL

https://ieeexplore.ieee.org/document/4400621

Book

EUROCON 2007 - The International Conference on "Computer as a Tool"

Presented on

EUROCON 2007 - The International Conference on "Computer as a Tool", 9-12.09.2007, Warszawa, Poland

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