The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
The stable paths problem and interdomain routing
Abstract
Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the shortest paths problem. The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does not solve a shortest paths problem since any interdomain protocol is required to allow policy-based metrics to override distance-based metrics and enable autonomous systems to independently define their routing policies with little or no global coordination. It is then natural to ask if BGP can be viewed as a distributed algorithm for solving some fundamental problem. We introduce the stable paths problem and show that BGP can be viewed as a distributed algorithm for solving this problem. Unlike a shortest path tree, such a solution does not represent a global optimum, but rather an equilibrium point in which each node is assigned its local optimum. We study the stable paths problem using a derived structure called a dispute wheel, representing conflicting routing policies at various nodes. We show that if no dispute wheel can be constructed, then there exists a unique solution for the stable paths problem. We define the simple path vector protocol (SPVP), a distributed algorithm for solving the stable paths problem. SPVP is intended to capture the dynamic behavior of BGP at an abstract level. If SPVP converges, then the resulting state corresponds to a stable paths solution. If there is no solution, then SPVP always diverges. In fact, SPVP can even diverge when a solution exists. We show that SPVP will converge to the unique solution of an instance of the stable paths problem if no dispute wheel exists.
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
Cites
(1979) · Cited by 43,841
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
A Border Gateway Protocol 4 (BGP-4)
Rekhter, Y., & Li, T. (1995) · doi:10.17487/rfc1771 · Cited by 892
Hedrick, C. L. (1988) · doi:10.17487/rfc1058 · Cited by 765
Nightingale, S. D., Byrd, L. T., Southern, P. M., Jockusch, J. D., Cal, S. X., & Wynne, B. A. (1992) · The Journal of Infectious Diseases · doi:10.1093/infdis/165.6.1082 · Cited by 529
An analysis of BGP convergence properties
Griffin, T. G., & Wilfong, G. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316231 · Cited by 369
Self-citationLabovitz, C., Malan, G. R., & Jahanian, F. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.731185 · Cited by 359
Binmore, K. (1991) · Medical Entomology and Zoology · Cited by 290
Persistent route oscillations in inter-domain routing
Varadhan, K., Govindan, R., & Estrin, D. (2000) · Computer Networks · doi:10.1016/s1389-1286(99)00108-5 · Cited by 283
Cited by
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Detecting BGP configuration faults with static analysis
Feamster, N., & Balakrishnan, H. (2005) · doi:10.5555/1251203.1251207 · Cited by 307
A general approach to network configuration verification
Beckett, R., Gupta, A., Mahajan, R., & Walker, D. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098834 · Cited by 262
Tang, F., Mao, B., Fadlullah, Z. M., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1700244 · Cited by 247
Metadata
- Authors
- Griffin, T. G., Shepherd, F. B., & Wilfong, G.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2002-04
- Volume
- 10
- Issue
- 2
- Pages
- 232-243
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2142065670
- Cited by
- 518
- References
- 21
- FWCI
- 23.95
- Type
- journal article
- Language
- en
- Open access
- closed
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: The stable paths problem and interdomain routing. https://app.cochat.ai/papers/10.1109/90.993304
- The paper
- Griffin, T. G., Shepherd, F. B., & Wilfong, G. (2002). The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.993304
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.