The QoS Routing for Anycast Message

Anycast is a one-to-any communication model in IPv6 and other networks. In any cast, a packet is intended to be delivered to one of the nearest group recipients. When quality-of-service(QoS) routing is considered, whether or not there is an appropriate routing under several constraints? How to select the destination node from many candidates? To the best of our knowledge, there is little literature about this issue. In general, finding a feasible path with two additive constraints based on any cast is an NP-complete problem. In highly dynamic large networks, the information available for making routing decisions may be inaccurate. In this paper, we propose an algorithm for delay and delay jitter constrained any cast routing with inaccurate link state information.