• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Wide-area cooperative storage with CFS (2001)

Cached

  • Download as a PDF

Download Links

  • [www.pdos.csail.mit.edu]
  • [pdos.lcs.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.distcomp.ethz.ch]
  • [dcg.ethz.ch]
  • [distcomp.ethz.ch]
  • [disco.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.ssrc.ucsc.edu]
  • [www.pdos.lcs.mit.edu]
  • [www.cs.ucsd.edu]
  • [courses.cs.vt.edu]
  • [www.eecg.toronto.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [sosp.org]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.wisc.edu]
  • [eecs.harvard.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Frank Dabek , M. Frans Kaashoek , David Karger , Robert Morris , Ion Stoica
Citations:778 - 52 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Dabek01wide-areacooperative,
    author = {Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica},
    title = { Wide-area cooperative storage with CFS},
    year = {2001}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers provide a distributed hash table (DHash) for block storage. CFS clients interpret DHash blocks as a file system. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. DHash finds blocks using the Chord location protocol, which operates in time logarithmic in the number of servers. CFS is implemented using the SFS file system toolkit and runs on Linux, OpenBSD, and FreeBSD. Experience on a globally deployed prototype shows that CFS delivers data to clients as fast as FTP. Controlled tests show that CFS is scalable: with 4,096 servers, looking up a block of data involves contacting only seven servers. The tests also demonstrate nearly perfect robustness and unimpaired performance even when as many as half the servers fail.

Citations

3028 H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353 A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1503 Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
1023 Untraceable electronic mail, return addresses, and digital pseudonyms - Chaum - 1981
928 Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
854 Resilient overlay networks - Andersen, Balakrishnan, et al. - 2001
847 Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
773 Freenet: A distributed anonymous information storage and retrieval system - Clarke, Sandberg, et al. - 2000
607 Storage Management and Caching in Past, a Large-Scale, Persistent Peer-to-Peer Storage Utility - Rowstron, Druschel - 2001
596 Summary cache: A scalable wide-area web cache sharing protocol - Fan, Cao, et al. - 2000
565 Crowds: anonymity for Web transactions - Reiter, Rubin - 1998
438 Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web - Karger, Lehman, et al. - 1997
436 A hierarchical Internet object cache - Chankhunthod, Danszig, et al. - 1996
422 Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
414 Efficient dispersal of information for security, load balancing, and fault tolerance - Rabin
185 The Free Haven project: Distributed anonymous storage service - Dingledine, Freedman, et al. - 2000
183 A digital signature based on a conventional encryption function - Merkle - 1987
179 Separating key management from file system security - Mazières, Kaminsky, et al. - 1999
175 Publius: A robust, tamper-evident, censorship-resistant and source-anonymous web publishing system - Waldman, Rubin, et al.
161 Fast and secure distributed read-only file system - Fu, Kaashoek, et al. - 2002
124 A toolkit for user-level file systems - Mazières - 2001
75 World Wide Web Caching Servers Cooperate - Malpani, Lorch, et al. - 1995
72 Web Caching with Consistent Hashing - Karger, Sherman, et al. - 1999
42 M.: A taste of crispy squid - Gadde, Chase, et al. - 1998
38 A Distributed Decentralised Information Storage and Retrieval System - CLARKE - 1999
24 A waypoint service approach to connect heterogeneous internet address spaces - Ng, Stoica, et al. - 2001
16 Consistent hashing and random trees: Algorithms for caching in distributed networks - LEWIN - 1998
7 Oceanstore: An architecture for global-scale persistent storage - Zhao - 2000
3 Peer-to-Peer: Harnessing the Power of Disruptive Computation. O’Reilly & Associates - ORAM, Ed - 2001
2 A toolkit for user-level file systems - ERES, D - 2001
2 A case study of server selection - TYAN - 2001
1 nation documentation. http://www.mojonation.net/docs - Mojo
1 as of June 17, 2001, the Ohaha application is no longer available - html
1 ÛÛÛ Ó���� ÓÑ ��×��Ò �ØÑÐ, as of June 17, 2001, the Ohaha application is no longer available - �ØØÔ�
1 k hierarchical lntemet object cache - CHANKHUNTHOD, DANZIG, et al. - 1996
1 Consistent hashing and random trees: Algorithms for caching in distributed networks - LEWlN - 1998
1 A toolkit for user-level file systems - MAZIiRES - 2001
1 nation documentation - Mojo
1 Pastry: Sealable, distributed object location and routing for large-scale peer-to-peer systems - ROWSTRON, DRUSCHEL - 2001
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University