On Multicast Path Finding Algorithms

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 reasonable response time for large networks. We discuss applications of these path finding algorithms to set up multipoint connections.

• Type: Conference
• Year: 1991
• Where: INFOCOM
• Authors: Ching-Hua Chow
• Keywords: Communications, Heuristic Algorithms, INFOCOM 1991, Multicast Paths, Path Finding Algorithms