Forest build tree algorithms for multiple destinations
Guoqing Hu · IEEE Potentials · 1998
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.