A Multicast Routing Algorithm for CSCW

Abstract. The CRMR, which is an algorithm for updating multicast tree dynamically, is presented. It constructs an initial multicast tree using KPP and builds a virtual trunk (VT) simultaneously. The nodes of the VT are relatively stable and nodes changes are based on the VT. The algorithm employs trigger function (TF) that associates QoS reduction caused by members update in this region, at the same time the algorithm satisfies delay constraints. We compare the performance of CRMR algorithm, by simulation, with others. The simulation results indicate that CRMR algorithm provides better balance between cost performance and changes in the multicast tree after each update. We also introduce into bandwidth indication function to alter CRMR algorithm to multiple QoS guaranteed algorithm, which can deal with the constraints of bandwidth and delay.