In the Internet, a group of replicated servers is commonly used in order to improve the scalability of a networked service. An anycasting service is the new network service that resolves an anycast address to one its member IP address from the group. The anycasting service uses some criteria to choose the one "best" server as a destination. In this paper we will present an optimal algorithm for mapping each anycasting query from clients into the one "best" video distribution server of replicas, such as Video-On-Demand servers on the Internet. The algorithm is developed at application-layer of the network based on economic models and queuing theory. By using this algorithm clients can get maximal satisfaction while system resources can be utilized most efficiently.
Available at: http://works.bepress.com/zheng_da_wu/11/