AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

AI 精读

AI抽取本论文的概要总结


微博一下
In order to demonstrate the practicality of the Cooperative File System design, we present two sets of tests

Wide-area cooperative storage with CFS

SOSP, no. 5 (2001): 202-215

被引用2455|浏览150
EI
下载 PDF 全文
引用
微博一下

摘要

The Cooperative File System (CFS) is a new peer-to-peer read-only 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) ...更多

代码

数据

0
简介
  • Existing peer-to-peer systems demonstrate the benefits of cooperative storage and serving: fault tolerance, load balance, and the ability to harness idle storage and network resources.
  • Accompanying these benefits arc a number of design challenges.
  • DHash uses the Chord [31] distributed lookup system to locate the servers responsible for a block
  • This table summarizes the CFS software layering: Layer FS
重点内容
  • Existing peer-to-peer systems demonstrate the benefits of cooperative storage and serving: fault tolerance, load balance, and the ability to harness idle storage and network resources
  • A Cooperative File System file system exists as a set of blocks distributed over the available Cooperative File System servers
  • The core of the Cooperative File System software consists of two layers, distributed hash table and Chord
  • In order to demonstrate the practicality of the Cooperative File System design, we present two sets of tests
  • The first explores Cooperative File System performance on a modest number of servers distributed over the Internet, and focuses on real-world client-perceived performance
  • Cooperative File System replicates a block along consecutive servers in the identifier space
方法
  • CFS provides distributed read-only file storage.
  • It is structured as a collection of servers that provide block-level storage.
  • Each CFS client contains three software layers: a file system client, a DHash storage layer, and a Chord lookup layer.
  • The client file system uses the DHash layer to retrieve blocks.
  • The client DHash layer uses the client Chord layer to locate the servers that hold desired blocks
结果
  • In order to demonstrate the practicality of the CFS design, the authors present two sets of tests.
  • The first explores CFS performance on a modest number of servers distributed over the Internet, and focuses on real-world client-perceived performance.
  • Cryptographic verification of updates (Section 5.5) and server ID authentication (Section 4.4) were implemented but not enabled.
  • This has no effect on the results presented here
结论
  • CFS is a highly scalable, available and secure read-only file system. It presents stored data to applications through an ordinary file-system interface.
  • CFS uses the peer-to-peer Chord lookup protocol to map blocks to servers.
  • This mapping is dynamic and implicit.
  • There is no directory information to be updated when the underlying network changes
  • This makes CFS both robust and scalable.
  • CFS replicates a block along consecutive servers in the identifier space
  • It caches a block along the lookup path starting to the block's server.
  • CFS provides simple but effective protection against a single attacker inserting large amounts of data
表格
  • Table1: DHash client API; exposed to client file system software
Download tables as Excel
相关工作
  • CFS was inspired by Napster [20], Gnutella [11], and particularly Freenet [6]. CFS uses peer-to-peerdistributed hashing similar in spirit to a number of ongoing research projects [26, 29, 35]. In comparison to existing peer-to-peer file sharing systems, CFS offers simplicity of implementation and high performance without compromising correctness. CFS balances server load, finds data quickly for clients, and guarantees data availability in the face of server failures with very high probability. CFS, as a complete system, has individual aspects in common with many existing systems. The major relationships are summarized below.
基金
  • While the peer-to-peer systems in common use solve some of these problems, This research was sponsored by the Defense Advanced Research Projects Agency (DARPA) and the Space and Naval Warfare Systems Center, San Diego, under contract N66001-00-1-8933
引用论文
  • Akamai Technologies, Inc. http://www.akamai.com/, 2001.
    Findings
  • ANDERSEN,n., BALAKRISHNAN,H., KAASHOEK, M. F., AND MORRIS, R. Resilient overlay networks. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (Oct. 2001).
    Google ScholarLocate open access versionFindings
  • CHANKHUNTHOD,A., DANZIG, P., NEERDAELS, C., SCHWARTZ, M., AND WORRELL, K. k hierarchical lntemet object cache. In Proc. Usenix Technical Conference (Jan. 1996), pp. 153-163.
    Google ScholarLocate open access versionFindings
  • CHAUM,D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (Feb. 1981), 84-88.
    Google ScholarLocate open access versionFindings
  • CLARKE, I. A distributed decentralised information storage and retrieval system. Master's thesis, University of Edinburgh, 1999.
    Google ScholarFindings
  • CLARKE, 1., SANDBERG,O., WILEY, B., AND HONG, T. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability (July 2000), pp. 46-66.
    Google ScholarLocate open access versionFindings
  • DINGLEDINE,R., FREEDMAN, i., AND MOLNAR, D. The Free Haven project: Distributed anonymous storage service. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability (July 2000), pp. 67-95.
    Google ScholarLocate open access versionFindings
  • FAN, L., CAO, P., ALMEIDA,J., AND BRODER, A. Summary cache: a scalable wide-area web-cache sharing protocol. Tech. Rep. 1361, Computer Science Department, University of Wisconsin, Madison, Feb. 1998.
    Google ScholarFindings
  • FU, K., KAASHOEK, i. F., AND MAZI~RES, D. Fast and secure distributed read-only file system. In Proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation (OSDI) (October 2000), pp. 181-196.
    Google ScholarLocate open access versionFindings
  • GADDE, S., CHASE, J., AND RABINOVICH,i. A taste of crispy squid. In Workshop on lnternet Server Performance (June 1998), pp. 129-136.
    Google ScholarLocate open access versionFindings
  • Gnutella website, http://gnutella.wego.com.
    Findings
  • KARGER, D., LEHMAN, E., LEIGHTON, T., LEVINE, i,, LEWIN, n., AND PANIGRAHY,R. Consistent hashingand random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (May 1997), pp. 654-663.
    Google ScholarLocate open access versionFindings
  • KUBIATOWICZ,J., BINDEL, D., CHEN, Y., CZERWINSKI,S., EATON, P., GEELS, D., GUMMADI,R., RHEA, S., WEATHERSPOON, H., WEIMER, W., WELLS, C., AND ZHAO, B. Oceanstore: An architecture for global-scale persistent storage. In Proceeedings of the Ninth international Conference on Architectural Supportfor Programming Languages and Operating Systems (ASPLOS) (November 2000), pp. 190--201.
    Google ScholarLocate open access versionFindings
  • LEWlN, D. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, MIT, 1998.
    Google ScholarFindings
  • MALPANI, R., LORCH, J., AND BERGER, D. Making world wide web caching servers cooperate. In Fourth International World Wide Web Conference (1995), pp. 107-110.
    Google ScholarLocate open access versionFindings
  • MAZIi~RES,D. A toolkit for user-level file systems. In Proc. Usenix Technical Conference (June 2001), pp. 261-274.
    Google ScholarLocate open access versionFindings
  • MAZI~RES, D., KAMINSKY,M., KAASHOEK, i. F., AND WITCHEL, E. Separating key management from file system security. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP) (Dec. 1999), pp. 124--139.
    Google ScholarLocate open access versionFindings
  • MERKLE, R. C. A digital signature based on a conventional encryption function. In Advances in Cryptology--CRYPTO '87 (Berlin, 1987), C. Pomerance, Ed., vol. 293 of Lecture Notes in Computer Science, Springer-Verlag, pp. 369-378.
    Google ScholarLocate open access versionFindings
  • Mojo nation documentation, http://www.mojonation.neVdocsd.
    Findings
  • Napster. http://www.napster.com.
    Findings
  • NG, T. S. E., STOICA, 1., AND ZHANG,I-{.A waypoint service approach to connect heterogeneous internet address spaces. In Proc. Usenix Technical Conference (June 2001), pp. 319-332.
    Google ScholarLocate open access versionFindings
  • Ohaha. http://www.ohaha.com/design.html, as of June 17, 2001, the Ohaha application is no longer available.
    Findings
  • ORAM, A., Ed. Peer-to-Peer: Harnessing the Power of Disruptive Computation. O'Reilly & Associates, 2001.
    Google ScholarFindings
  • PLAXTON, C., RAJARAMAN,R., AND RICHA, A. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA (June 1997), pp. 311-320.
    Google ScholarLocate open access versionFindings
  • RABIN, M. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM 36, 2 (1989), 335-348.
    Google ScholarLocate open access versionFindings
  • RATNASAMY,S., FRANCIS,P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. In Proc. ACM SIGCOMM (San Diego, 2001).
    Google ScholarLocate open access versionFindings
  • REITER, M., AND RUBIN, A. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security 1, 1 (Nov. 1998), 66-92.
    Google ScholarLocate open access versionFindings
  • ROWSTRON,A., AND DRUSCHEL, P. Pastry: Sealable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001) (Nov. 2001).
    Google ScholarLocate open access versionFindings
  • ROWSTRON,A., AND DRUSCHEL, P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (Oct. 2001).
    Google ScholarLocate open access versionFindings
  • SHERMAN,A., KARGER, D., BERKHEIMER,A., BOGSTAD, B., DHANIDINA, R., IWAMOTO,K., KIM, B., MATKINS,L., AND YERUSHALMI,Y. Web caching with consistent hashing. Computer Networks 31, 11-16 (May 1999), 1203-1213.
    Google ScholarLocate open access versionFindings
  • STOICA, 1., MORRIS, R., KARGER,D., KAASHOEK,M. F., AND BALAKRISHNAN,n. Chord: A scalable peer-to-peer lookup service for interact applications. In Proc. ACM SIGCOMM (San Diego, 2001).
    Google ScholarLocate open access versionFindings
  • STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN,H. Chord: A scalable peer-to-peer lookup service for internet applications. Tech. Rep. TR-819, MIT, Cambridge, MA, March 2001.
    Google ScholarFindings
  • TYAN, T. A case study of server selection. Master's thesis, MIT, Sept. 2001.
    Google ScholarFindings
  • WALDMAN,M., ROBIN, A., AND CRANOR, L. F. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium (August 2000), pp. 59-72.
    Google ScholarLocate open access versionFindings
  • ZHAO, B., KUBIATOWICZ,J., AND JOSEPH, A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, Apr. 2001.
    Google ScholarFindings
您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科