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

On the correctness of IBGP configuration

Published:19 August 2002Publication History

ABSTRACT

The Border Gateway Protocol (BGP) has two distinct modes of operation. External BGP (EBGP) exchanges reachability information between autonomous systems, while Internal BGP (IBGP) exchanges external reachability information within an autonomous system. We study several routing anomalies that are unique to IBGP because, unlike EBGP, forwarding paths and signaling paths are not always symmetric. In particular, we focus on anomalies that can cause the protocol to diverge, and those that can cause a router's chosen forwarding path to an egress point to be deflected by another router on that path. Deflections can greatly complicate the debugging of routing problems, and in the worst case multiple deflections can combine to form persistent forwarding loops. We define a correct IBGP configuration to be one that is anomaly free for every possible set of routes sent by neighboring autonomous systems. We show that determination of IBGP configuration correctness is NP-hard. However, we give simple sufficient conditions on network configurations that guarantee correctness.

References

  1. Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, and Gordon Wilfong. Route oscillations in I-BGP with route reflection. In Proceedings of ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Bates, R. Chandra, and E. Chen. BGP route reflection: An alternative to full mesh IBGP. RFC 2796, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Marc Blanchet, Florent Parent, and Bill St-Arnaud. Optical BGP (OBGP): InterAS lightpath provisioning. Internet Draft draft-parent-obgp-01.txt. Work in progress.]]Google ScholarGoogle Scholar
  4. Cisco. Endless BGP Convergence Problem in Cisco IOS Software Releases. Field Note, October 10 2001, http://www.cisco.com/warp/public/770/fn12942.html.]]Google ScholarGoogle Scholar
  5. Rohit Dube. A comparison of scaling techniques for BGP. ACM Computer Communication Review, 29(3), 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Rohit Dube and John G. Scudder. BGP scaling techniques revisited. ACM Computer Communication Review, 29(5), 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. Gao, T. G. Grin, and J. Rexford. Inherently safe backup routing with BGP. In Proceedings of the 20th IEEE Conference on Computer Communications (Infocom 2001), Anchorage, Alaska, April 2001.]]Google ScholarGoogle Scholar
  8. Lixin Gao and Jennifer Rexford. Stable internet routing without global coordination. In Proceedings of ACM SIGMETRICS, June 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, CA, 1979.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. T. G. Griffin and G. Wilfong. A safe path vector protocol. In Proceedings of the 19th Annual IEEE Conference on Computer Communications (Infocom 2000), Tel Aviv, Israel, March 2000.]]Google ScholarGoogle ScholarCross RefCross Ref
  11. Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. Policy disputes in path-vector protocols. In Proceedings of Seventh International Conference on Network Protocols (ICNP'99), pages 21--30, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Timothy G. Griffin and Gordon Wilfong. An analysis of BGP convergence properties. In Proceedings of ACM SIGCOMM, pages 277--288, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Timothy G. Griffin and Gordon Wilfong. Analysis of the MED oscillation problem in BGP. unpublished manuscript, 2002.]]Google ScholarGoogle Scholar
  15. S. Halabi and D. McPherson. Internet Routing Architectures. Cisco Press, Indianapolis, Indiana, second edition, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Huitema. Routing in the Internet. Prentice Hall, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ratul Mahajan, David Wetherall, and Tom Anderson. Understanding BGP misconfigurations. In Proceedings of ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. D. McPherson, V. Gill, D. Walton, and A. Retana. BGP persistent route oscillation condition. Internet Draft draft-ietf-idr-route-oscillation-01.txt , Work In Progress, 2002.]]Google ScholarGoogle Scholar
  19. Y. Rekhter and T. Li. A Border Gateway Protocol. RFC 1771 (BGP version 4), March 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Jonathan Rosenberg, Hussein Salma, and Matt Squire. Telephony routing over IP (TRIP). RFC 3219. January 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. P. Traina, D. McPherson, and J. Scudder. Autonomous system confederations for BGP. RFC 3056, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Kanan Varadhan, Ramesh Govindan, and Deborah Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32:1--16, 2000.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. On the correctness of IBGP configuration

    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 '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2002
      368 pages
      ISBN:158113570X
      DOI:10.1145/633025
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 32, Issue 4
        Proceedings of the 2002 SIGCOMM conference
        October 2002
        332 pages
        ISSN:0146-4833
        DOI:10.1145/964725
        Issue’s Table of Contents

      Copyright © 2002 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: 19 August 2002

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGCOMM '02 Paper Acceptance Rate25of300submissions,8%Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader