In this paper, we propose and analyze a routing protocol for anycast message. These methods differ from each other on information used to maintain orders, the impact on QoS, and the compatibility to the existing routing protocols. In particular, the fixed and adaptive methods are proposed to determine the weights. Both of them explicitly take into account the characteristics of distribution of anycast recipient group while the adaptive method uses the dynamic information of the anycast traffic as well. Correctness property of the protocol is formally proven.
Extensive simulation is performed to evaluate our newly designed protocol.
In particular, the protocol using the SBT or CBT loop-prevention methods and the adaptive WRS approach performs very close to a dynamic optimal routing protocol in most cases. All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .