Ant-algorithm Based Multicast Routing
Shenghong Li · Jisuanji gongcheng · 2001
The problem of multicast routing with end-to-end delay and delay variation constraints in high speed packet-switched computer networks is studied, and a novel ant algorithm based approach to multicast routing is proposed. The simulation results show that the proposed approach can not only realize global multicast routing with delay and delay variation constraints effectively, but also overcome the limitations of some existing approaches.