The DOI matches its Crossref record.
Implementing declarative overlays
Abstract
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building and adapting these overlays to the intended application and the target environment is a difficult and time consuming process.To ease the development and the deployment of such overlay networks we have implemented P2, a system that uses a declarative logic language to express overlay networks in a highly compact and reusable form. P2 can express a Narada-style mesh network in 16 rules, and the Chord structured overlay in only 47 rules. P2 directly parses and executes such specifications using a dataflow architecture to construct and maintain overlay networks. We describe the P2 approach, how our implementation works, and show by experiment its promising trade-off point between specification complexity and performance.
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
A catalog of stream processing optimizations
Hirzel, M., Soulé, R., Schneider, S., Gedik, B., & Grimm, R. (2014) · ACM Computing Surveys · doi:10.1145/2528412 · Cited by 299
Frenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · Proceedings of the 16th ACM SIGPLAN international conference on Functional programming · doi:10.1145/2034773.2034812 · Cited by 269
Security and Data Accountability in Distributed Systems: A Provenance Survey
Tan, Y. S., Ko, R. K. L., & Holmes, G. (2013) · 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing · doi:10.1109/hpcc.and.euc.2013.221 · Cited by 53
Metadata
- Authors
- Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2005-10-20
- Volume
- 39
- Issue
- 5
- Pages
- 75-90
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2073904762
- Cited by
- 292
- References
- 0
- FWCI
- 31.68
- 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: Implementing declarative overlays. https://app.cochat.ai/papers/10.1145/1095809.1095818
- The paper
- Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005). Implementing declarative overlays. ACM SIGOPS Operating Systems Review. https://doi.org/10.1145/1095809.1095818
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.
