Distributed dynamic delay-constrained least-cost multicast routing heuristic

Many new distributed multimedia applications involving dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. A new DDD-CLCMR (distributed dynamic delay-constrained least-cost multicast routing algorithm) is proposed to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very well in terms of delay and cost for both static and dynamic multicast groups, compared with the best multicast algorithms known.