Clone selection based multicast routing algorithm

Abstract

The problem of multicast routing with delay constraints is of great interest in the communication area in the last few years and has been proved a NP-Complete problem. A novel multicast routing algorithm based on clone selection operator is proposed to solve the problem. Simulations illustrate that compared with other algorithms, the proposed algorithm has a fast convergence speed and powerful search ability. The result shows that the proposed algorithm can find a better solution in the same time or even the shorter time. © Springer-Verlag Berlin Heidelberg 2005.