Abstract
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 any-cast 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Bhattacharjee, M. H. Ammar, E. W. Zegura, V. Shah, and Z. Fei, “Application-layer Anycasting,” Technology report, College of Computing, Georgia Institute of Technology, 1996
S. Bhattacharjee, M. H. Ammar, E. W. Zegura, V. Shah, and Z. Fei, “Application-layer Anycasting,” IEEE INFOCOM’97, April, 1997
R. Caceres, “Measurements of wide-area Internet Traffic,” Tech. Report. UCB/CSD 89/550, Computer science Department, University of California, Berkeley, 1989.
Jin Cao, William S. Cleveland, Dong Lin, and Don X. Sun, “On the Nonstationarity of Internet Traffic,” Proc. ACM Sigmetrics’ 01, 102–112, 2001
S. Deering and R. Hinden, “Internet Protocol Version 6(Ipv6) Specification,” RFC 2460, Dec. 1998.
J. Guyton and M. Schwartz, “Locating Nearby Copies of Replicated Internet Servers,” in Proceeding of SIGCOMM 95, pp. 288–298, 1995.
R. Hinden and S. Deering, “IP Version 6 Addressing Architecture,” RFC 1884, Dec. 1995.
Z. Fei, S. Bhattacharjee, E. W. Zegura, and M. H. Ammar, “A Novel Server Selection Technique for Improving the Response Time of a Replicated Service,” IEEE INFOCOM’98.
Weijia Jia, G. Xu and W. Zhao, “Integrated Fault-tolerant Multicast and Anycasting Routing Algorithms”, IEE Proceedings-Computers and Digital techniques, Vol. 147, No. 4, July 2000.
Weijia Jia, W. Zhou, and Joerg Kaiser, “Efficient Algorithms for Mobile Multicast using Anycasting Group”, IEE Proceedings-Communications, Vol. 48, No. 1, February 2001
D. Katabi, and J. Wroclawsi, “A Framework for Scalable Global IP-Anycasting (GIA),” SIGCOMM’00, Stockholm, Sweden, Auguest, 2000
C. Partridge, T. Mendez, and W. Milliken, “Host Anycast Service,” RFC 1546, Nov. 1993.
Vern Paxson, “Measurements and Analysis of End-to-End Internet Dybamics,” Ph.D. thesis, University of California Berkeley, 1997
Vern Paxson, “End-to-End Internet Packet Dynamics,” IEEE/ACM Transactions on Networking, Vol. 7, No. 3, pp. 277–292, June 1999.
Robbert V. Renesse, “Scalable and Secure Resource Location,” the Proceedings of the Hawaii International Conference on System Sciences, Maui, Hawaii, January 2000.
Ricard V. Sole, and Sergi Valverde, “Information Transfer and Phase Transitions in a Model of Internet Traffic,” Ricard V. Sole and Sergi Valverde, Physica A 289 595–605, 2001
Dong Xuan, Weijia Jia, Wei Zhao, and Hongwen Zhu, “A Routing Protocol for Anycasting Massages,” IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 6, June 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, S., Zhou, W., Huang, F., Lan, M. (2002). An Efficient Algorithm for Application-Layer Anycasting. In: Plaice, J., Kropf, P.G., Schulthess, P., Slonim, J. (eds) Distributed Communities on the Web. DCW 2002. Lecture Notes in Computer Science, vol 2468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36261-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-36261-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00301-4
Online ISBN: 978-3-540-36261-6
eBook Packages: Springer Book Archive