Analysis and design of a k-Anycast communication model in IPv6

In an IPv6 simulation environment, this paper extends the original Anycast concept and proposes a k-Anycast communication model in IPv6 which allows n servers to cooperate with each other to accomplish a task. This model can achieve dynamic join and leave of k-Anycast nodes without restrictions on the nodes' physical location so it solves the existing scalability problem. In addition, this model can route k-Anycast service request messages to the nearest k-Anycast tree node which can provide the requested service, which makes it possible that all the k-Anycast service request messages can be evenly distributed across the k-Anycast tree nodes and be transacted effectively and efficiently. In an IPv6 simulation environment, this k-Anycast communication model is applied to file downloading service and the experimental data indicate that the k-Anycast communication model not only enhances the service quality but also effectively saves the network bandwidth, which really proves this k-Anycast communication model's validity, feasibility and practicability.