The DOI matches its Crossref record.
An analysis of BGP convergence properties
Open accessAbstract
The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol used to exchange reachability information between Autonomous Systems in the global Internet. BGP is a path-vector protocol that allows each Autonomous System to override distance-based metrics with policy-based metrics when choosing best routes. Varadhan et al. [18] have shown that it is possible for a group of Autonomous Systems to independently define BGP policies that together lead to BGP protocol oscillations that never converge on a stable routing. One approach to addressing this problem is based on static analysis of routing policies to determine if they are safe. We explore the worst-case complexity for convergence-oriented static analysis of BGP routing policies. We present an abstract model of BGP and use it to define several global sanity conditions on routing policies that are related to BGP convergence/divergence. For each condition we show that the complexity of statically checking it is either NP-complete or NP-hard.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
On inferring autonomous system relationships in the Internet
Gao, L. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.974527 · Cited by 1,070
The controller placement problem
Heller, B., Sherwood, R., & McKeown, N. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342444 · Cited by 869
Understanding BGP misconfiguration
Mahajan, R., Wetherall, D., & Anderson, T. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633027 · Cited by 533
Detecting BGP configuration faults with static analysis
Feamster, N., & Balakrishnan, H. (2005) · doi:10.5555/1251203.1251207 · Cited by 307
BGP routing stability of popular destinations
Rexford, J., Wang, J., Xiao, Z., & Zhang, Y. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637232 · Cited by 298
Metadata
- Authors
- Griffin, T. G., & Wilfong, G.
- Venue
- Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 1999-08-30
- Pages
- 277-288
- OpenAlex
- W1980507101
- Cited by
- 369
- References
- 0
- FWCI
- 13.00
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An analysis of BGP convergence properties. https://app.cochat.ai/papers/10.1145/316188.316231
- The paper
- Griffin, T. G., & Wilfong, G. (1999). An analysis of BGP convergence properties. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication. https://doi.org/10.1145/316188.316231
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.