An Efficient Algorithm for Anycast Routing with Bandwidth and Delay Constraints
Anycasting communication is a new Internet service that is proposed in IPv6. With more and more applications need anycast service, especially for replicated servers, Anycast has recently become an important research topic. In this paper we study the problem of anycast routing problem with bandwidth and delay constraints. This problem is known to be NP-complete and hence a algorithm based on genetic algorithm to optimize network resource and balance the load in the network is proposed to find solutions for the problem. On condition that meet the needs of the bandwidth and delay constraints, the algorithm takes communication consumption and load distribution as objective functions, and is used to find the closeto-optimal solution. In the end, we analyze the algorithms by the network simulation experiments. The simulations results show that our algorithm can effective minimize the network resource and balance the load for anycast routing.
anycasting QoS genetic algorithm network routingp load-balance
LI Taoshen CHEN Songqiao CHEN Yan SONG Ling
School of Information Science and Engineering University of Central South Changsha, Hunan Province 4 School of Computer, Electronics and Information University of Guangxi Nanning, Guangxi Province 5300
国际会议
武汉
英文
820-825
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）