DocumentCode
1426661
Title
Forest build tree algorithms for multiple destinations
Author
Hu, Guo-Quing
Author_Institution
Dept. of Comput. Sci., Illinois Univ., Chicago, IL, USA
Volume
17
Issue
3
fYear
1998
Firstpage
13
Lastpage
16
Abstract
The multiple destination routing (MDR) problem is the essential routing problem in multicast communication networks. This problem has been proven to NP-complete, hence, we look at only heuristic algorithms that are of practical interest. Forest build tree (FBT) like algorithms are discussed and two new algorithms are presented. A performance evaluation is carried out and simulation results given
Keywords
broadcasting; computational complexity; telecommunication network routing; trees (mathematics); FBT-like algorithms; MDR problem; NP-complete problem; forest build tree algorithms; heuristic algorithms; multicast communication networks; multiple destination routing; performance; simulation; Costs; Joining processes;
fLanguage
English
Journal_Title
Potentials, IEEE
Publisher
ieee
ISSN
0278-6648
Type
jour
DOI
10.1109/45.714611
Filename
714611
Link To Document