A New Heuristic Algorithm for Finding Minimum-cost Multicast Trees with Bounded Path Delay

摘要

This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost Multicast tree. The heuristic depends on (1) bounded delay along paths From source nodes to each destination node; (2)minimum cost of the Multicast tree; (3)dynamic multicast tree status which is maintained by Updating the existing multicast tree when nodes in the network request to Join or leave.