Samrat Bhattacharjee
Mostafa H. Ammar
Ellen W. Zegura
ABSTRACT
Server replication is a key approach for maintaining user-perceived quality of service within a geographically wide-spread network. The anycasting communication paradigm is designed to support server replication by allowing applications to easily select and communicate with the ``best" server, according to some performance or policy criteria, in a group of content-equivalent servers. We examine the definition and support of the anycasting paradigm at the application layer, providing a service that maps anycast domain names into one or more IP addresses using anycast resolvers. In addition to being independent from network-layer support, our definition includes the notion of filters, functions that are applied to groups of addresses to affect the selection process. We consider both metric-based filters (e.g., server response time) and policy-based filters; we further allow filtering both at the anycast resolver and local to the anycast client. A key input to the filtering process is metric information describing the relative performance of replicated servers. We examine the use of various techniques for maintaining this information at anycast resolvers.
- P. B. Danzig, D. Delucia, and K. Obraczka, "Massively replicating services in wide-area internetworks." Tech. Rep., University of Southern California, January 1994.Google Scholar
- P. Danzig, R. Hall, and M. Schwartz, "A case for caching file objects inside internetworks," in Proceedings of SIGCOMM 93, pp. 239-248, 1993. Google ScholarDigital Library
- J. Pitkow and M. Recker, "A simple yet robust caching algorithm based on dynamic access patterns," in Proceedings of 2nd WWW conference, 1994.Google Scholar
- A. Dan, D. Sitaram, and P. Shahabuddin, "Scheduling policies for an on-demand video server with batching," in Proceedings of ACM Multimedia 94, pp. 15- 23, 1994. Google ScholarDigital Library
- D. Gifford, "Polychannel systems for mass digital Communication" Communications of the ACM, vol. 33, pp. 1847-1851, February 1990. Google ScholarDigital Library
- R. Clark and M. Ammar, "Providing scalable web service using multicast delivery," in Proceedings of 2nd IEEE Workshop on Services in Distributed and Networked Environments, pp. 19-26, 1995. Google ScholarDigital Library
- C. Partridge, T. Mendez, and W. Milliken, "Host anycasting service," RFC 1546, November 1993.Google Scholar
- K. Birman and T. Joseph, "Reliable communication in the presence of failures," ACM Transactions on Computer Systems, vol. 5, pp. 47-76, February 1987. Google ScholarDigital Library
- R. Hinden and S. Deering, "IP version 6 addressing architecture," RFC 1884, December 1995. Google ScholarDigital Library
- J. Bernabeu, M. Ammar, and M. Ahamad, "Optimizing a generalized polling protocol for resource finding over a multiple access channel," Computer Networks and ISDN Systems, vol. 27, pp. 1429-1445, 1995. Google ScholarDigital Library
- D. Oppen and Y. Dalal, "The Clearinghouse: A decentralized agent for locating named objects in a distributed environment," ACM Transactions on Office Information Systems, vol. 3, pp. 230-253, July 1983. Google ScholarDigital Library
- P. Mockapetris, "Domain names - concepts- and facilities," RFC 1034, November 1987.Google Scholar
- I. Gopal and A. Segall, "Directories for networks with casually connected users," in Proceedings of INFOCOM 88, pp. 1060-1064, 1988.Google Scholar
- A. Birrel, R. Levin, and M. Schroeder, "Grapevine: An exercise in distributed computing," Communications of the ACM, vol. 25, pp. 260-274, April 1982. Google ScholarDigital Library
- D. Terry, "Caching hints in distributed systems," IEEE Transactions on Software Engineering, vol. 13, pp. 48-54, January 1987. Google ScholarDigital Library
- R. Fowler, Decentralized Object Finding Using Forwarding Addresses. PhD thesis, University of Washington, 1985. Google ScholarDigital Library
- J. Veizades, E. Guttman, C. Perkins, and S. Kaplan, "Service location protocol," Internet Draft (work in progress) draft-ietf-srvloc-protocol-13t.txt, June 1996. Google ScholarDigital Library
- J. Guyton and M. Schwartz, "Locating nearby copies of replicated Internet servers," in Proceedings of SIGCOMM 95, pp. 288-298, 1995. Google ScholarDigital Library
- C. M. Bowman, P. Danzig, D. Hardy, U. Manber, M. Schwartz, and D. Wessels, "Harvest: A scalable, customizable discovery and access system," Tech. Rep. CU-CS-732-94, University of Colorado - Boulder, 1995.Google Scholar
- J. Gwertzman and M. Seltzer, "The case for geographical push caching," Tech. Rep. 34-94, Harvard University, 1994.Google Scholar
- M. Humes, "Netscape's server push, client pull and CGI animation." http://www.emf.net/ mal/animate.html.Google Scholar
- E. D. Katz, M. Butler, and R. McCrath, "A scalable HTTP server: The NCSA prototype," Computer Networks and ISDN Systems, vol. 27, pp. 155-164, 1994. Google ScholarDigital Library
- L. Lamport, "The implementation of reliable distributed multiprocess systems," Computer Networks, vol. 2, pp. 95-114, 1978.Google Scholar
- D. Gifford, "Weighted voting for replicated data," in Proceedings of 7th Symposium on Operating Systems, pp. 150-162, ACM, 1979. Google ScholarDigital Library
- M. Ahamad and M. H. Ammar, "Performance characterization of quorum-consensus algorithms for replicated data," IEEE Transactions on Software Engineering, vol. 15, pp. 492-496, April 1989. Google ScholarDigital Library
- D. Barbara and H. Garcia-Molina, "Mutual exclusion in partitioned distributed systems," Distributed Computing, vol. 1, pp. 119-132, 1986.Google ScholarCross Ref
- S. Bhattacharjee, M. Ammar, E. Zegura, V. Shah, and Z. Fei, "Application level anycasting," Tech. Rep. 96-25, College of Computing, Georgia Institute of Technology.Google Scholar
- E. C. Rosen, "The updating protocol of ARPANET's new routing algorithm," Computer Networks, no. 4, pp. 11-19, 1980.Google Scholar
Recommendations
An Efficient Algorithm for Application-Layer Anycasting
DCW '02: Revised Papers from the 4th International Workshop on Distributed Communities on the WebAnycasting 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. ...
Secure dynamic anycasting for 'best' server selection using active networks
The networking community has tackled the resource-finding problem using several methods. The knowledge of the name or property of the resource enables one to find it over the network. Many techniques were proposed and investigated for a single instance ...
Comments