The DOI matches its Crossref record.
Pathlet routing
Abstract
We present a new routing protocol, pathlet routing, in which networks advertise fragments of paths, called pathlets, that sources concatenate into end-to-end source routes. Intuitively, the pathlet is a highly flexible building block, capturing policy constraints as well as enabling an exponentially large number of path choices. In particular, we show that pathlet routing can emulate the policies of BGP, source routing, and several recent multipath proposals. This flexibility lets us address two major challenges for Internet routing: scalability and source-controlled routing. When a router's routing policy has only "local" constraints, it can be represented using a small number of pathlets, leading to very small forwarding tables and many choices of routes for senders. Crucially, pathlet routing does not impose a global requirement on what style of policy is used, but rather allows multiple styles to coexist. The protocol thus supports complex routing policies while enabling and incentivizing the adoption of policies that yield small forwarding plane state and a high degree of path choice.
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
GENI: A federated testbed for innovative network experiments
Berman, M., Chase, J. S., Landweber, L., Nakao, A., Ott, M., Raychaudhuri, D., Ricci, R., & Seskar, I. (2014) · Computer Networks · doi:10.1016/j.bjp.2013.12.037 · Cited by 571
A case for stateful forwarding plane
Yi, C., Afanasyev, A., Moiseenko, I., Wang, L., Zhang, B., & Zhang, L. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.01.005 · Cited by 474
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463
A Survey of Caching Mechanisms in Information-Centric Networking
Zhang, M., Luo, H., & Zhang, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2420097 · Cited by 360
Metadata
- Authors
- Godfrey, P. B., Ganichev, I., Shenker, S., & Stoica, I.
- Venue
- Proceedings of the ACM SIGCOMM 2009 conference on Data communication
- Publisher
- ACM
- Published
- 2009-08-16
- Pages
- 111-122
- OpenAlex
- W2296143987
- Cited by
- 235
- References
- 0
- FWCI
- 18.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: Pathlet routing. https://app.cochat.ai/papers/10.1145/1592568.1592583
- The paper
- Godfrey, P. B., Ganichev, I., Shenker, S., & Stoica, I. (2009). Pathlet routing. Proceedings of the ACM SIGCOMM 2009 conference on Data communication. https://doi.org/10.1145/1592568.1592583
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.