Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 176

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

HLP: a next generation inter-domain routing protocol

Subramanian, Lakshminarayanan, Caesar, Matthew, Ee, Cheng Tien, Handley, Mark, Mao, Morley, Shenker, Scott, Stoica, Ion·2005·Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications

Abstract

It is well-known that BGP, the current inter-domain routing protocol, has many deficiencies. This paper describes a hybrid link-state and path-vector protocol called HLP as an alternative to BGP that has vastly better scalability, isolation and convergence properties. Using current BGP routing information, we show that HLP, in comparison to BGP, can reduce the churn-rate of route updates by a factor 400 as well as isolate the effect of routing events to a region 100 times smaller than that of BGP. For a majority of Internet routes, HLP guarantees worst-case linear-time convergence. We also describe a prototype implementation of HLP on top of the XORP router platform. HLP is not intended to be a finished and final proposal for a replacement for BGP, but is instead offered as a starting point for debates about the nature of the next-generation inter-domain routing protocol.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1080091.1080095

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 176

Metadata

Authors
Subramanian, L., Caesar, M., Ee, C. T., Handley, M., Mao, M., Shenker, S., & Stoica, I.
Venue
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Publisher
ACM
Published
2005-08-22
Pages
13-24
OpenAlex
W2104941874
Cited by
176
References
1
FWCI
9.62
Type
conference paper
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: HLP: a next generation inter-domain routing protocol. https://app.cochat.ai/papers/10.1145/1080091.1080095
The paper
Subramanian, L., Caesar, M., Ee, C. T., Handley, M., Mao, M., Shenker, S., & Stoica, I. (2005). HLP: a next generation inter-domain routing protocol. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/1080091.1080095

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.