DocumentCode
2353566
Title
Heuristic Algorithm for Multicast Connections in Packet Networks
Author
Piechowiak, Maciej ; Zwierzykowski, Piotr
Author_Institution
Kazimierz Wielki Univ., Bydgoszcz
fYear
2007
fDate
9-12 Sept. 2007
Firstpage
948
Lastpage
955
Abstract
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.
Keywords
multicast communication; trees (mathematics); heuristic algorithm; multicast connection tree; packet network; Costs; Delay effects; Electronic mail; Heuristic algorithms; Multicast algorithms; Network topology; Propagation delay; Quality of service; Routing; Testing; multicast; network topology; optimization algorithms; routing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
EUROCON, 2007. The International Conference on "Computer as a Tool"
Conference_Location
Warsaw
Print_ISBN
978-1-4244-0813-9
Electronic_ISBN
978-1-4244-0813-9
Type
conf
DOI
10.1109/EURCON.2007.4400621
Filename
4400621
Link To Document