On multicast path finding algorithms

C.-H. Chow
1991 IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings  
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show that the heuristic algorithms can find multicast paths whose costs are close to optimal and can operate with
more » ... able response time for large networks. We discuss applications of these path finding algorithms to set up multipoint connections.
doi:10.1109/infcom.1991.147651 dblp:conf/infocom/Chow91 fatcat:2nrsea3vobbb7oq5lxsnx4mai4