A distributed delay-constrained dynamic multicast routing algorithm |
| |
Authors: | Sun Quan Langendőrfer Horst |
| |
Affiliation: | (1) Institute of Operating Systems and Computer Networks, Technical University of Braunschweig, Bültenweg 74/75, 38106 Braunschweig, Germany |
| |
Abstract: | Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR 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 and the resulting tree cost performance is very satisfactory. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|