Article

Free access

On the correctness of IBGP configuration

Authors:

Timothy G. Griffin,

Gordon WilfongAuthors Info & Claims

SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 17 - 29

https://doi.org/10.1145/633025.633028

Published: 19 August 2002 Publication 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.]]

Digital Library

[2]

T. Bates, R. Chandra, and E. Chen. BGP route reflection: An alternative to full mesh IBGP. RFC 2796, 2000.]]

Digital 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.]]

[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.]]

[5]

Rohit Dube. A comparison of scaling techniques for BGP. ACM Computer Communication Review, 29(3), 1999.]]

Digital Library

[6]

Rohit Dube and John G. Scudder. BGP scaling techniques revisited. ACM Computer Communication Review, 29(5), 1999.]]

Digital 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.]]

[8]

Lixin Gao and Jennifer Rexford. Stable internet routing without global coordination. In Proceedings of ACM SIGMETRICS, June 2000.]]

Digital 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.]]

Digital 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.]]

[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.]]

Digital Library

[12]

Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 2002.]]

Digital Library

[13]

Timothy G. Griffin and Gordon Wilfong. An analysis of BGP convergence properties. In Proceedings of ACM SIGCOMM, pages 277--288, 1999.]]

Digital Library

[14]

Timothy G. Griffin and Gordon Wilfong. Analysis of the MED oscillation problem in BGP. unpublished manuscript, 2002.]]

[15]

S. Halabi and D. McPherson. Internet Routing Architectures. Cisco Press, Indianapolis, Indiana, second edition, 2000.]]

Digital Library

[16]

C. Huitema. Routing in the Internet. Prentice Hall, 2000.]]

Digital Library

[17]

Ratul Mahajan, David Wetherall, and Tom Anderson. Understanding BGP misconfigurations. In Proceedings of ACM SIGCOMM, 2002.]]

Digital 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.]]

[19]

Y. Rekhter and T. Li. A Border Gateway Protocol. RFC 1771 (BGP version 4), March 1995.]]

Digital Library

[20]

Jonathan Rosenberg, Hussein Salma, and Matt Squire. Telephony routing over IP (TRIP). RFC 3219. January 2002.]]

Digital Library

[21]

P. Traina, D. McPherson, and J. Scudder. Autonomous system confederations for BGP. RFC 3056, 2001.]]

Digital Library

[22]

Kanan Varadhan, Ramesh Govindan, and Deborah Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32:1--16, 2000.]]

Cited By

Li ZRios ATrajković L(2023)Machine Learning for Detecting the WestRock Ransomware Attack Using BGP Routing RecordsIEEE Communications Magazine10.1109/MCOM.001.220021561:3(20-26)Online publication date: Mar-2023
https://doi.org/10.1109/MCOM.001.2200215
Restaino JRisso CMayr CCancela HCerqueira EGuidoni DGamess E(2022)Prefixes equivalence classesProceedings of the 2022 Latin America Networking Conference10.1145/3545250.3560851(59-63)Online publication date: 19-Oct-2022
https://dl.acm.org/doi/10.1145/3545250.3560851
Garcia-Luna-Aceves J(2022)Attaining stable and loop-free inter-domain routing without path vectorsProceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing10.1145/3527974.3545718(58-65)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3527974.3545718
Show More Cited By

Index Terms

On the correctness of IBGP configuration
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

On the correctness of IBGP configuration
Proceedings of the 2002 SIGCOMM conference

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. ...
Designing optimal iBGP route-reflection topologies
NETWORKING'08: Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet

The Border Gateway Protocol (BGP) is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a full-mesh of iBGP sessions between routers is not ...
Preventing persistent oscillations and loops in IBGP configuration with route reflection

Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomous system (AS). To avoid a full mesh of IBGP sessions between all the BGP speakers of ...

Comments

Information & Contributors

Information

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

Conference Chairs:
Matt Mathis
Pittsburgh Supercomputing Center
,
Peter Steenkiste
Carnegie Mellon University
,
Program Chairs:
Hari Balakrishnan
Massachusetts Institute of Technology
,
Vern Paxson
ICIR

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM02

Sponsor:

SIGCOMM02: SIGCOMM 2002 Conference

August 19 - 23, 2002

Pennsylvania, Pittsburgh, USA

Acceptance Rates

SIGCOMM '02 Paper Acceptance Rate 25 of 300 submissions, 8%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

122
Total Citations
View Citations
1,091
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)15

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li ZRios ATrajković L(2023)Machine Learning for Detecting the WestRock Ransomware Attack Using BGP Routing RecordsIEEE Communications Magazine10.1109/MCOM.001.220021561:3(20-26)Online publication date: Mar-2023
https://doi.org/10.1109/MCOM.001.2200215
Restaino JRisso CMayr CCancela HCerqueira EGuidoni DGamess E(2022)Prefixes equivalence classesProceedings of the 2022 Latin America Networking Conference10.1145/3545250.3560851(59-63)Online publication date: 19-Oct-2022
https://dl.acm.org/doi/10.1145/3545250.3560851
Garcia-Luna-Aceves J(2022)Attaining stable and loop-free inter-domain routing without path vectorsProceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing10.1145/3527974.3545718(58-65)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3527974.3545718
Garcia-Luna-Aceves J(2022)Eliminating Routing Loops and Oscillations in BGP Using Total Ordering2022 IEEE 47th Conference on Local Computer Networks (LCN)10.1109/LCN53696.2022.9843706(9-17)Online publication date: 26-Sep-2022
https://doi.org/10.1109/LCN53696.2022.9843706
Schneider TSchmid RVanbever L(2022)On the Complexity of Network-Wide Configuration Synthesis2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940325(1-11)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940325
Mayr CRisso CGrampín E(2021)Crafting optimal and resilient iBGP-IP/MPLS overlays for transit backbone networksOptical Switching and Networking10.1016/j.osn.2021.10063542:COnline publication date: 23-Aug-2021
https://dl.acm.org/doi/10.1016/j.osn.2021.100635
Steffen SGehr TTsankov PVanbever LVechev M(2020)Probabilistic Verification of Network ConfigurationsProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405900(750-764)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405900
Mayr CRisso CGrampin E(2019)A Combinatorial Optimization Framework for the Design of resilient iBGP Overlays2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)10.1109/DRCN.2019.8713744(6-10)Online publication date: Mar-2019
https://doi.org/10.1109/DRCN.2019.8713744
Saâdaoui ABen Youssef Ben Souayeh NBouhoula A(2019)Automated and Optimized Formal Approach to Verify SDN Access-Control MisconfigurationsTestbeds and Research Infrastructures for the Development of Networks and Communities10.1007/978-3-030-12971-2_6(96-112)Online publication date: 2-Feb-2019
https://doi.org/10.1007/978-3-030-12971-2_6
Mayr CGrampín ERisso CVillas LBraga JRosário DGamess E(2018)Optimal Route Reflection Topology DesignProceedings of the 10th Latin America Networking Conference10.1145/3277103.3277124(65-72)Online publication date: 3-Oct-2018
https://dl.acm.org/doi/10.1145/3277103.3277124
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents