The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Ivy: a read/write peer-to-peer file system
Abstract
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer storage system or the other users of the file system.An Ivy file system consists solely of a set of logs, one log per participant. Ivy stores its logs in the DHash distributed hash table. Each participant finds data by consuiting all logs, but performs modifications by appending only to its own log. This arrangement allows Ivy to maintain meta-data consistency without locking. Ivy users can choose which other logs to trust, an appropriate arrangement in a semi-open peer-to-peer system.Ivy presents applications with a conventional file system interface. When the underlying network is fully connected, Ivy provides NFS-like semantics, such as close-to-open consistency. Ivy detects conflicting modifications made during a partition, and provides relevant version information to application-specific conflict resolvers. Performance measurements on a wide-area network show that Ivy is two to three times slower than NFS.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
Self-citationTime, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
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
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Self-citationWide-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
Self-citationScale 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
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
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
Ritchie, D. M., & Thompson, K. (1983) · Communications of the ACM · doi:10.1145/357980.358014 · Cited by 960
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Ritchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
Managing update conflicts in Bayou, a weakly connected replicated storage system
Terry, D. B., Theimer, M. M., Petersen, K., Demers, A. J., Spreitzer, M. J., & Hauser, C. H. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224070 · Cited by 815
Venti: A New Approach to Archival Storage
Quinlan, S., & Dorward, S. (2002) · Cited by 732
Design and implementation of the Sun network filesystem
Sandberg, R., Golgberg, D., Kleiman, S. R., Walsh, D., & Lyon, B. (1988) · Artech House, Inc. eBooks · Cited by 730
National Technical Information Service
(2008) · Reference Reviews · doi:10.1108/09504120810872238 · Cited by 611
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
Detection of Mutual Inconsistency in Distributed Systems
Parker, D. S., Popek, G. J., Rudisin, G., Stoughton, A., Walker, B. J., Walton, E., Chow, J., Edwards, D., Kiser, S., & Kline, C. S. (1983) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1983.236733 · Cited by 356
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319160 · Cited by 332
Deciding when to forget in the Elephant file system
Santry, D. S., Feeley, M. J., Hutchinson, N. C., Veitch, A., Carton, R. W., & Ofir, J. (1999) · doi:10.1145/319151.319159 · Cited by 277
Replication in the harp file system
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., & Williams, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121169 · Cited by 273
Disconnected operation in the Coda file system
Kistler, J. J., & Satyanarayanan, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121166 · Cited by 262
Fast and secure distributed read-only file system
Fu, K., Kaashoek, M. F., & Mazières, D. (2002) · ACM Transactions on Computer Systems · doi:10.1145/505452.505453 · Cited by 212
NFS Version 3 Protocol Specification
Callaghan, B., Pawlowski, B., & Staubach, P. (1995) · doi:10.17487/rfc1813 · Cited by 172
How to build a trusted database system on untrusted storage
Maheshwari, U., Vingralek, R., & Shapiro, W. H. (2000) · doi:10.5555/1251229.1251239 · Cited by 170
Building secure file systems out of byzantine storage
Mazières, D., & Shasha, D. E. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571840 · Cited by 152
Cited by
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
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
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
MR-PDP: Multiple-Replica Provable Data Possession
Curtmola, R., Khan, O., Burns, R., & Ateniese, G. (2008) · 2008 The 28th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2008.68 · Cited by 473
Secure Untrusted Data Repository (SUNDR)
Li, J., Krohn, M., Mazieres, D., & Shasha, D. (2003) · doi:10.21236/ada445862 · Cited by 394
Metadata
- Authors
- Muthitacharoen, A., Morris, R., Gil, T. M., & Chen, B.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2002-12-31
- Volume
- 36
- Issue
- SI
- Pages
- 31-44
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2071958655
- Cited by
- 351
- References
- 32
- FWCI
- 33.54
- 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.