A dynamic algorithm used in multicast routing

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.