The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Open accessAbstract
We consider an architecture for a serverless distributed file system that does not assume mutual trust among the client computers. The system provides security, availability, and reliability by distributing multiple encrypted replicas of each file among the client machines. To assess the feasibility of deploying this system on an existing desktop infrastructure, we measure and analyze a large set of client machines in a commercial environment. In particular, we measure and report results on disk usage and content; file activity; and machine uptimes, lifetimes, and loads. We conclude that the measured desktop infrastructure would passably support our proposed system, providing availability on the order of one unfilled file request per user per thousand days.
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
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
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
Disconnected operation in the Coda File System
Kistler, J. J., & Satyanarayanan, M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146942 · Cited by 1,065
A case for NOW (Networks of Workstations)
Anderson, T. E., Culler, D. E., & Patterson, D. (1995) · IEEE Micro · doi:10.1109/40.342018 · Cited by 798
McKusick, M. K., Joy, W. N., Leffler, S. J., & Fabry, R. S. (1984) · ACM Transactions on Computer Systems · doi:10.1145/989.990 · Cited by 749
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
Caching in the Sprite network file system
Nelson, M. N., Welch, B. B., & Ousterhout, J. K. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.42183 · Cited by 500
A trace-driven analysis of the UNIX 4.2 BSD file system
Ousterhout, J. K., Da Costa, H., Harrison, D., Kunze, J. A., Kupfer, M., & Thompson, J. G. (1985) · ACM SIGOPS Operating Systems Review · doi:10.1145/323627.323631 · Cited by 495
Transparent process migration: Design alternatives and the Sprite implementation
Ousterhout, J. K., & Douglis, F. (n.d.) · NASA Technical Reports Server (NASA) · Cited by 446
The LOCUS distributed operating system
Walker, B., Popek, G. J., English, R. M., Kline, C. S., & Thiel, G. (1983) · ACM SIGOPS Operating Systems Review · doi:10.1145/773379.806615 · Cited by 381
Solomon, D. A., & Custer, H. (1992) · Medical Entomology and Zoology · Cited by 292
Theoria combinationis observationum erroribus minimis obnoxiae
Gauß, C. F. (1823) · doi:10.3931/e-rara-2857 · Cited by 232
Cited by
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
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Self-citationA 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
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
Metadata
- Authors
- Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M.
- Venue
- Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2000-06
- Pages
- 34-43
- OpenAlex
- W2115599946
- Cited by
- 484
- References
- 15
- FWCI
- 30.96
- Type
- conference paper
- 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.