Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measurements and analysis of end-to-end Internet dynamics
Measurements and analysis of end-to-end Internet dynamics
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
A framework for scalable global IP-anycast (GIA)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
On the nonstationarity of Internet traffic
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Measurements of Wide Area Internet TraffiC
Measurements of Wide Area Internet TraffiC
A Novel Middleware Based Web Database Model
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Online Algorithm for Application Layer Anycast
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
An efficient reliable architecture for application layer anycast service
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
Anycasting communication is proposed in IPv6, and it is designed to support server replication by allowing applications to select and communicate with the "best" server, according to some performance or policy criteria, among the replicated servers. Originally anycast researchers focus on network layer. In this paper we pay more attention to application-layer anycasting, because at application layer we can obtain more flexibility and scalability. First of all, we describe the application-layer anycast model, and then summarize the previous work in application-layer anycasting, especially the periodical probing algorithms for updating the database of anycast resolver. After that, we present our algorithm, the requirement-based probing algorithm, an efficient and practical algorithm. In the end, we analyse the algorithms using the queuing theory and the statistics characteristics of Internet traffic. The results show that the requirement-base probing algorithm has better performance not only in the average waiting time for all anycast queries, but also in the average time used for an anycast query.