Degree-Delay-Bounded Heuristic Algorithm Based on Genetic Operations for Multicast Routing
XU Zheng-quanand · Wuhan University Journal · 2004
Delay constraint is a significant constrained factor in constructing multicast routing tree and degree constraint takes multicasting ability of switch or router into account and can keep networks load balancing, so there is realistic meaning in investigating delay-degree-constrained multicast routing algorithms for next generation communication networks. This paper proposes an effective and efficient delay-degree-constrained multicast routing algorithm (DDCMRA) using the simplicity of heuristic algorithm, similarity principle of paths and crossover/mutation operations (but not genetic algorithm). Simulation result shows the proposed algorithms perform with less tree cost and time of finding near-optimal tree, the performance of this algorithms is better than that of the other similar algorithms. This proposed approaches also provide a method for dynamic multicast routing and keep load balancing.