A dynamic algorithm used in multicast routing

Author

Li, Xiongfei ; Li, Xiangqun ; Li, Xiangni

Author_Institution

Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China

Volume

2

fYear

2004

Firstpage

1

Abstract

A dynamic multicast routing algorithm called CRMR is presented. An initial multicast tree is constructed by the KPP algorithm and a virtual trunk (VT) is built simultaneously in the algorithm. The trigger function (TF) that associates the QoS effected by members update in this region is used in CRMR. We also introduce a bandwidth indication function to alter CRMR algorithm to fit multiple QoS guaranteed, which can deal with the constraints of bandwidth and delay. The performances are compared among CRMR algorithm with others by simulation. The results indicate that CRMR is better.

Keywords

delays; multicast communication; quality of service; telecommunication network routing; trees (mathematics); CRMR; KPP algorithm; QoS; bandwidth constraints; bandwidth delay; bandwidth indication function; dynamic multicast routing algorithm; multicast tree; trigger function; virtual trunk; Bandwidth; Computer science; Educational institutions; Heuristic algorithms; Laboratories; Multicast algorithms; Quality of service; Routing; Steiner trees; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on

Print_ISBN

0-7803-7941-1

Type

conf

DOI

10.1109/CACWD.2004.1349147

Filename

1349147