The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
SHARP: an architecture for secure resource peering
Abstract
This paper presents Sharp , a framework for secure distributed resource management in an Internet-scale computing infrastructure. The cornerstone of Sharp is a construct to represent cryptographically protected resource <it>claims</it>---promises or rights to control resources for designated time intervals---together with secure mechanisms to subdivide and delegate claims across a network of resource managers. These mechanisms enable flexible <it>resource peering</it>: sites may trade their resources with peering partners or contribute them to a federation according to local policies. A separation of claims into <it>tickets</it> and <it>leases</it> allows coordinated resource management across the system while preserving site autonomy and local control over resources. Sharp also introduces mechanisms for controlled, accountable <it>oversubscription</it> of resource claims as a fundamental tool for dependable, efficient resource management. We present experimental results from a Sharp prototype for PlanetLab, and illustrate its use with a decentralized barter economy for global PlanetLab resources. The results demonstrate the power and practicality of the architecture, and the effectiveness of oversubscription for protecting resource availability in the presence of failures.
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
Cites
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Managing trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management - CIKM'01 · doi:10.1145/502636.502638 · Cited by 915
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
Gray, C., & Cheriton, D. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74870 · Cited by 487
Cited by
Buyya, R., Yeo, C. S., Venugopal, S., Broberg, J., & Brandic, I. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.12.001 · Cited by 5,937
Buyya, R., Yeo, C. S., & Venugopal, S. (2008) · 2008 10th IEEE International Conference on High Performance Computing and Communications · doi:10.1109/hpcc.2008.172 · Cited by 1,156
GENI - global environment for network innovations
Elliott, C. (2008) · 2008 33rd IEEE Conference on Local Computer Networks (LCN) · doi:10.1109/lcn.2008.4664143 · Cited by 278
Metadata
- Authors
- Fu, Y., Chase, J., Chun, B., Schwab, S., & Vahdat, A.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2003-10-19
- Volume
- 37
- Issue
- 5
- Pages
- 133-148
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2141438662
- Cited by
- 236
- References
- 3
- FWCI
- 34.04
- 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
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.