Dynamic Multi-constrained Distributed Multicast Routing Algorithm Based on Multi-point Parallel Ant Search
Xuejun Song · Journal of Circuits and Systems · 2004
With the rapid progress of the commercial use in internet, multi-media multicast application attracts more research attention. Currently used multicast model are base on multiple fixed points. However, this static model can not adapt many new services, such as VOD or tele-medical applications, because users of these services access the Internet randomly. What we need is a dynamically changing multicast network with dynamic changing constrains (bandwidth requirement). Based on the extensive investigation of existing multicast algorithms, a dynamic multicast model based on ant search routing algorithm is proposed. Further improvement is also made to accelerate the speed of convergence. Results of simulation demonstrate that the proposed model is effective to dynamic group member multicast routing algorithm. Therefore, It is promising to provide practical multicast services.