Research on anycast routing algorithm with multi-QoS requirements Academic Article

abstract

• Anycast is a new network service defined in IPv6. The problem of finding a set of low-cost paths for anycast routing with multiple QoS requirements is known to be NP-complete. In this paper, an anycast service model with multiple QoS requirements and a new anycast multi-path routing algorithm are proposed. The idea of this algorithm is as follows: (1) dividing dynamically path search space of whole network diagram into k sub-space according to the size of anycast group, which per sub-space only contains one member of this group; (2) initiating and coding per sub-population; (3) parallel-searching and evolving on the several non-overlapping sub-space until obtaining optimum solution that meets the needs of the QoS . The experimental results show that this algorithm is effective and feasible. It can satisfy the constrained condition of multiple QoS requirements, balance network load fairly, and improve the quality of network service.

authors

• Chen, Jianer

published proceedings

• Journal of Computational Information Systems

author list (cited authors)

• Li, T., Chen, S., Chen, Y., & Chen, J.

complete list of authors

• Li, T||Chen, S||Chen, Y||Chen, J

publication date

• April 2008

published in

• Journal of Computational Information Systems  Journal

start page

• 731

end page

• 738

volume

• 4

issue

• 2