A distributed delay-constrained dynamic multicast routing algorithm

Many new distributed multimedia applications involve dynamic multiple parti cipants, have stringent end-to-end delay requirement and consume large amou nt of network resources. In this paper, we propose a distributed delay-cons trained dynamic multicast routing algorithm (DCDMR) to support these applic ations. DCDMR scales well because the source of the multicast tree needs on ly limited computation or may even not be involved in the route computation . When group membership changes, the existing multicast tree is perturbed a s little as possible and the resulting tree cost performance is very satisf actory.