On multicast path finding algorithms
C.-H. Chow · 1991
Three multicast path-finding algorithms for networks with directed links are designed and implemented: 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 reasonable response time for large networks. Applications of these path-finding algorithms to set up multipoint connections for broadband multimedia multiparty services are discussed.>
Cited by 91 works. doi:10.1109/infcom.1991.147651
Authors
References
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Reducibility among Combinatorial Problems
- A note on two problems in connexion with graphs
- Reducibility Among Combinatorial Problems
- Routing of multipoint connections
- Multicast routing in datagram internetworks and extended LANs
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
- An approximate solution for the Steiner problem in graphs
- Steiner problem in networks: A survey
- The steiner problem in graphs