A Controlled Region Rearrangement Dynamic algorithm for Delay-constrained Least-cost Multicast Routing

摘要

With the proliferation of multicast technology applications in communication networks, the study of multicast routing has become more and more important. In this paper, we propose a new dynamic algorithm for de- lay-constrained least-cost multicast routing with controlled region rearrangement. We compare the performance of our algorithm by simulation with that of CRCDM~[1]. The simulation results indicate that our algorithm provides better performance.