Anycast Routing Algorithm Based on Hybrid Strategy

To solve problem of the routing optimization and load balance in the selection of multimedia server,this paper is aimed to design an anycast routing algorithm based on hybrid strategy that combined ant colony optimazition algorithm with differential evolution algorithm,during the process of route discovery,considering not only the status of link,such as bandwidth,delay,but also introducing the server status,to discover a combination of the server and path which meet the requirement and achieve or near to the best.And then guiding the users’ request to the best server.

[1]  Arvind S. Mohais,et al.  DynDE: a differential evolution for dynamic optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[2]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[3]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[4]  Weijia Jia,et al.  A Routing Protocol for Anycast Messages , 2000, IEEE Trans. Parallel Distributed Syst..

[5]  Yan Wei,et al.  Anycast Routing Algorithm with Special Composite Distance , 2005 .