The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
OceanStore: an architecture for global-scale persistent storage
Open accessAbstract
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development.
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
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
The Computer for the Twenty-First Century
Weiser, M. (1991) · Scientific American · Cited by 2,113
Decentralized Trust Management
Blaze, M., Feigenbaum, J., & Lacy, J. (1996) · Cited by 1,870
System architecture directions for networked sensors
Hill, J. L., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. S. J. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379006 · Cited by 1,756
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Scale and performance in a distributed file system
Howard, J. H., Kazar, M. L., Menees, S. G., Nichols, D. A., Satyanarayanan, M., Sidebotham, R. N., & West, M. J. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.35059 · Cited by 1,403
Norman, D. A. (1998) · The MIT Press eBooks · Cited by 1,121
Cited by
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
“Various storage systems, such as Oceanstore [9] and PAST [17] were built on top of these routing overlays.”
MethodChord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
BOINC: A System for Public-Resource Computing and Storage
Anderson, D. P. (2005) · Fifth IEEE/ACM International Workshop on Grid Computing · doi:10.1109/grid.2004.14 · Cited by 1,924
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
A survey of peer-to-peer content distribution technologies
Androutsellis-Theotokis, S., & Spinellis, D. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041681 · Cited by 1,425
Ceph: a scalable, high-performance distributed file system
Weil, S. A., Brandt, S., Miller, E. L., Long, D. D. E., & Maltzahn, C. (2006) · eScholarship (California Digital Library) · doi:10.5555/1298455.1298485 · Cited by 1,402
A Survey of Information-Centric Networking Research
Xylomenos, G., Ververidis, C. N., Siris, V. A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Katsaros, K. V., & Polyzos, G. C. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.070813.00063 · Cited by 1,348
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
A Privacy-Preserving and Transparent Certification System for Digital Credentials
Saramago, R. Q., Meling, H., & Jehl, L. N. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2022.9 · Cited by 1,171
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
PlanetLab: an overlay testbed for broad-coverage services
Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., & Bowman, M. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956993.956995 · Cited by 1,031
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
Dynamic provable data possession
Erway, C., Küpçü, A., Papamanthou, C., & Tamassia, R. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653688 · Cited by 897
Restful web services vs. "big"' web services: making the right architectural decision
Pautasso, C., Zimmermann, O., & Leymann, F. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367606 · Cited by 879
SEDA: an architecture for well-conditioned, scalable internet services
Welsh, M., Culler, D., & Brewer, E. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502057 · Cited by 834
A low-bandwidth network file system
Muthitacharoen, A., Chen, B., & Mazières, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502052 · Cited by 784
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
A blueprint for introducing disruptive technology into the Internet
Peterson, L., Anderson, T., Culler, D., & Roscoe, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774772 · Cited by 752
Toward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Theory and Practice of Bloom Filters for Distributed Systems
Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.031611.00024 · Cited by 518
Collaborative filtering with privacy via factor analysis
Canny, J. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564419 · Cited by 508
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
Foster, I., & Iamnitchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_11 · Cited by 504
Peer-to-peer support for massively multiplayer games
Knutsson, B., Lu, H., Xu, W., & Hopkins, B. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354485 · Cited by 501
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M., Briggs, N., & Braynard, R. (2012) · Communications of the ACM · doi:10.1145/2063176.2063204 · Cited by 471
Collaborative filtering with privacy
Canny, J. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004361 · Cited by 442
Taxonomy of trust: Categorizing P2P reputation systems
Marti, S., & Garcia-Molina, H. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.011 · Cited by 433
Semantic Overlay Networks for P2P Systems
Crespo, A., & Garcia-Molina, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11574781_1 · Cited by 429
Topology control and routing in ad hoc networks: a survey
Rajaraman, R. (2002) · ACM SIGACT News · doi:10.1145/564585.564602 · Cited by 396
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Ivy: a read/write peer-to-peer file system
Muthitacharoen, A., Morris, R., Gil, T. M., & Chen, B. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844132 · Cited by 351
Anthill: a framework for the development of agent-based peer-to-peer systems
Babaoglu, O., Meling, H., & Montresor, A. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022238 · Cited by 337
Extreme Binning: Scalable, parallel deduplication for chunk-based file backup
Bhagwat, D., Eshghi, K., Long, D. D. E., & Lillibridge, M. (2009) · 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems · doi:10.1109/mascot.2009.5366623 · Cited by 325
The Computational and Storage Potential of Volunteer Computing
Anderson, D. P., & Fedak, G. (2006) · Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) · doi:10.1109/ccgrid.2006.101 · Cited by 320
PocketLens: Toward a personal recommender system
Miller, B. N., Konstan, J. A., & Riedl, J. (2004) · ACM Transactions on Information Systems · doi:10.1145/1010614.1010618 · Cited by 318
Permacoin: Repurposing Bitcoin Work for Data Preservation
Miller, A., Juels, A., Shi, E., Parno, B., & Katz, J. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.37 · Cited by 310
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
Factored operating systems (fos): the case for a scalable operating system for multicores
Wentzlaff, D., & Agarwal, A. (2009) · ACM SIGOPS Operating Systems Review · doi:10.1145/1531793.1531805 · Cited by 301
PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities
Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2004) · High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on · doi:10.1109/hpdc.2003.1210033 · Cited by 300
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Huang, C., Chen, M., & Li, J. (2007) · Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) · doi:10.1109/nca.2007.37 · Cited by 298
Analyzing peer-to-peer traffic across large networks
Sen, S., & Wang, J. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637222 · Cited by 290
A new paradigm: Data-aware scheduling in grid computing
Kosar, T., & Balman, M. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.09.006 · Cited by 266
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 257
Decentralized erasure codes for distributed networked storage
Dimakis, A. G., Prabhakaran, V., & Ramchandran, K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874535 · Cited by 253
Metadata
- Authors
- Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., & Zhao, B.
- Venue
- ACM SIGPLAN Notices
- Published
- 2000-11
- Volume
- 35
- Issue
- 11
- Pages
- 190-201
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2104210894
- Cited by
- 2,002
- References
- 31
- FWCI
- 148.19
- Type
- journal article
- Language
- en
- Open access
- bronze
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.