skip to main content
10.1145/1080091.1080127acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Towards a global IP anycast service

Published:22 August 2005Publication History

ABSTRACT

IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion, has long been considered an important means of service discovery. The growth of P2P applications presents appealing new uses for IP anycast. Unfortunately, IP anycast suffers from serious problems: it is very hard to deploy globally, it scales poorly by the number of anycast groups, and it lacks important features like load-balancing. As a result, its use is limited to a few critical infrastructure services such as DNS root servers. The primary contribution of this paper is a new IP anycast architecture, PIAS, that overcomes these problems while largely maintaining the strengths of IP anycast. PIAS makes use of a proxy overlay that advertises IP anycast addresses on behalf of group members and tunnels anycast packets to those members. The paper presents a detailed design of PIAS and evaluates its scalability and efficiency through simulation. We also present preliminary measurement results on anycasted DNS root servers that suggest that IP anycast provides good affinity. Finally, we describe how PIAS supports two important P2P and overlay applications.

References

  1. C. Partridge, T. Mendez, and W. Milliken, "RFC 1546 - Host Anycasting Service," November 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Hardy, "RFC 3258 - Distributing Authoritative Name Servers via Shared Unicast Addresses," April 2002.]]Google ScholarGoogle Scholar
  3. J. Abley, "Hierarchical Anycast for Global Service Distribution," ISC Technical Note ISC-TN-2003-1 www.isc.org/tn/isc-tn-2003-1.html.]]Google ScholarGoogle Scholar
  4. D. Kim, D. Meyer, H. Kilmer, and D. Farinacci, "RFC 3446 - Anycast Rendevous Point (RP) mechanism using Protocol Independent Multicast (PIM) and Multicast Source Discovery Protocol (MSDP)," January 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Katabi, "The Use of IP-Anycast for Building Efficient Multicast Trees," in Proc. of Global Telecommunications Conference, 1999.]]Google ScholarGoogle Scholar
  6. C. Huitema, "RFC 3068 - An Anycast Prefix for 6to4 Relay Routers," June 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. "AS112 Project Home Page," www.as112.net.]]Google ScholarGoogle Scholar
  8. R. Hinden and S. Deering, "RFC 3513 - Internet Protocol Version 6 (IPv6) Addressing Architecture," April 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Akamai Technologies Inc., "Internet Bottlenecks: the Case for Edge Delivery Services," 2000, www.akamai.com/en/resources/pdf/whitepapers/Akamai_Internet_Bottlenecks_Whitepaper.pdf.]]Google ScholarGoogle Scholar
  10. B. Greene and D. McPherson, "ISP Security: Deploying and Using Sinkholes," www.nanog.org/ mtg-0306/sink.html, June 2003, NANOG TALK.]]Google ScholarGoogle Scholar
  11. D. R. Karger, E. Lehman, F. T. Leighton, R. Panigrahy, M. S. Levine, and D. Lewin, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web." in Proc. of STOC, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Rodrigues, B. Liskov, and L. Shrira, "The design of a robust peer-to-peer system," in Proc. of the Tenth ACM SIGOPS European Workshop, September 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Gupta, B. Liskov, and R. Rodrigues, "One Hop Lookups for Peer-to-Peer Overlays," in Proc. of 9th Workshop on Hot Topics in Operating Systems, May 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. of the eighteenth ACM Symposium on Operating Systems Principles, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, "Characterizing the Internet Hierarchy from Multiple Vantage Points." in Proc. of INFOCOM, 2002.]]Google ScholarGoogle Scholar
  16. N. Spring, R. Mahajan, and T. Anderson, "Quantifying the Causes of Path Inflation," in Proc. of ACM SIGCOMM, August 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Z. M. Mao, R. Govindan, G. Varghese, and R. H. Katz, "Route flap damping exacerbates Internet routing convergence," in Proc. of ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Abley, "A Software Approach to Distributing Requests for DNS Service Using GNU Zebra, ISC BIND 9, and FreeBSD," in Proc. of USENIX Annual Technical Conference, FREENIX Track, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. T. S. E. Ng and H. Zhang, "Predicting Internet Network Distance with Coordinates-Based Approaches." in Proc. of INFOCOM, 2002.]]Google ScholarGoogle Scholar
  20. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: a decentralized network coordinate system," in Proc. of ACM SIGCOMM, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. C. Alaettinoglu and S. Casner, "Detailed Analysis of ISIS Routing Protocol on the Qwest Backbone," February 2002, NANOG TALK.]]Google ScholarGoogle Scholar
  22. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulie, "SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication," in Proc. of the Third International COST264 Workshop on Networked Group Communication, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: high bandwidth data dissemination using an overlay mesh," in Proc. of the Nineteenth ACM Symposium on Operating Systems Principles, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman, "PlanetLab: An Overlay Testbed for Broad-Coverage Services," ACM SIGCOMM Computer Communication Review, vol. 33, no. 3, pp. 3--12, July 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. "ISC F-Root Sites," www.isc.org/index.pl?/ops/f-root/.]]Google ScholarGoogle Scholar
  26. P. Barber, M. Larson, M. Kosters, and P. Toscano, "Life and Times of J-Root," www.nanog.org/mtg-0410/kosters.html, October 2004, NANOG TALK.]]Google ScholarGoogle Scholar
  27. R. Bush, Mailing list posting www.ripe.net/ripe/maillists/archives/routing-wg/2004/msg00183.html.]]Google ScholarGoogle Scholar
  28. K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, "The feasibility of supporting large-scale live streaming applications with dynamic application end-points," in Proc. of ACM SIGCOMM, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. X. Zhang, J. Wang, and P. Francis, "Scaling the Internet through Tunnels," pias.gforge.cis.cornell.edu/tbgp.pdf.]]Google ScholarGoogle Scholar
  30. "SSFNet," www.ssfnet.org/homePage.html.]]Google ScholarGoogle Scholar
  31. "Netfilter," www.netfilter.org.]]Google ScholarGoogle Scholar
  32. E. Basturk, R. Haas, R. Engel, D. Kandlur, V. Peris, and D. Saha, "Using IP Anycast For Load Distribution And Server Location," in Proc. of IEEE Globecom Global Internet Mini Conference, November 1998.]]Google ScholarGoogle Scholar
  33. S. Matsunaga, S. Ata, H. Kitamura, and M. Murata, "Applications of IPv6 Anycasting," draft-ata-ipv6-anycast-app-00, February 2005.]]Google ScholarGoogle Scholar
  34. D. Katabi and J. Wroclawski, "A framework for scalable global IP-anycast (GIA)," in Proc. of ACM SIGCOMM, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. E. W. Zegura, M. H. Ammar, Z. Fei, and S. Bhattacharjee, "Application-layer anycasting: a server selection architecture and use in a replicated Web service," IEEE/ACM Trans. Netw., vol. 8, no. 4, pp. 455--466, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. 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." in Proc. of INFOCOM, 1998.]]Google ScholarGoogle Scholar
  37. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, "Internet Indirection Infrastructure," in Proc. of ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. "Mobility for IPv6 (mip6), IETF Working Group Charter," www.ripe.net/ripe/maillists/archives/routing-wg/2004/msg00183.html.]]Google ScholarGoogle Scholar
  39. B. Aboba, L. Blunk, J. Vollbrecht, J. Carlson, and H. Levkowetz, "RFC 3748 - Extensible Authentication Protocol (EAP)," June 2004.]]Google ScholarGoogle Scholar
  40. A. D. Keromytis, V. Misra, and D. Rubenstein, "SOS: secure overlay services." in Proc. of ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. H. Ballani and P. Francis, "Root-Server Anycast Deployment: A Meaurement Study," pias.gforge.cis.cornell.edu/am.pdf.]]Google ScholarGoogle Scholar

Index Terms

  1. Towards a global IP anycast service

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2005
      350 pages
      ISBN:1595930094
      DOI:10.1145/1080091
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 35, Issue 4
        Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
        October 2005
        324 pages
        ISSN:0146-4833
        DOI:10.1145/1090191
        Issue’s Table of Contents

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 August 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader