The DOI matches its Crossref record.
Declarative routing: extensible routing with declarative queries
Abstract
The Internet's core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior research on this problem has included new hard-coded routing protocols on the one hand, and fully extensible Active Networks on the other. In this paper, we explore a new point in this design space that aims to strike a better balance between the extensibility and robustness of a routing infrastructure. The basic idea of our solution, which we call declarative routing, is to express routing protocols using a database query language. We show that our query language is a natural fit for routing, and can express a variety of well-known routing protocols in a compact and clean fashion. We discuss the security of our proposal in terms of its computational expressive power and language design. Via simulation, and deployment on PlanetLab, we demonstrate that our system imposes no fundamental limits relative to traditional protocols, is amenable to query optimizations, and can sustain long-lived routes under network churn and congestion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Naiad: a timely dataflow system
Murray, D. G., McSherry, F., Isaacs, R., Isard, M., Barham, P., & Abadi, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522738 · Cited by 656
Frenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034812 · Cited by 584
NetKAT: semantic foundations for networks
Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D., Schlesinger, C., & Walker, D. (2014) · Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2535838.2535862 · Cited by 373
Network virtualization in multi-tenant datacenters
Koponen, T., Amidon, K., Balland, P., Casado, M., Chanda, A., Fulton, B., Ganichev, I., Gross, J., Gude, N. S., Ingram, P., et al. (2014) · doi:10.5555/2616448.2616468 · Cited by 278
Declarative networking: language, execution and optimization
Loo, B. T., Condie, T., Garofalakis, M., Gay, D. E., Hellerstein, J. M., Maniatis, P., Ramakrishnan, R., Roscoe, T., & Stoica, I. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142485 · Cited by 268
Self-citation
Metadata
- Authors
- Loo, B. T., Hellerstein, J. M., Stoica, I., & Ramakrishnan, R.
- Venue
- Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2005-08-22
- Pages
- 289-300
- OpenAlex
- W2105170773
- Cited by
- 211
- References
- 0
- FWCI
- 10.01
- 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: Declarative routing: extensible routing with declarative queries. https://app.cochat.ai/papers/10.1145/1080091.1080126
- The paper
- Loo, B. T., Hellerstein, J. M., Stoica, I., & Ramakrishnan, R. (2005). Declarative routing: extensible routing with declarative queries. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/1080091.1080126
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.