Multicast routing based on ant-algorithm with delay and delay variation constraints

In this paper, based on the ant algorithm, we propose a distributed multicast routing scheme with delay-bounded and delay variation constraints in real-time communications. This paper first describes the ant algorithm model and gives an ant network model, then presents an approach using the ant algorithm to optimize the multicast routes with delay and delay-variation constraints. The great amount of simulation has been done to show efficiency of the algorithm, and the simulation results show that the proposed approached can find the best optimal multicast routes which satisfy the above constraints.