Results 1 - 10 of 14

Wide-area cooperative storage with CFS

by Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica , 2001
"... 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 pr ..."
Abstract - Cited by 999 (53 self) - Add to MetaCart
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

Ivy: A Read/Write Peer-to-Peer File System

by Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen , 2002
"... 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 con ..."
Abstract - Cited by 298 (12 self) - Add to MetaCart
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 consulting all logs, but performs modifications by appending only to its own log. This arrangement allows Ivy to maintain meta-data consistency without locking

Robust and Efficient Data Management for a Distributed Hash Table

by Josh Cates , 2003
"... This thesis presents a new design and implementation of the DHash distributed hash table based on erasure encoding. This design is both more robust and more efficient than the previous replication-based implementation [15]. DHash uses ..."
Abstract - Cited by 49 (0 self) - Add to MetaCart
This thesis presents a new design and implementation of the DHash distributed hash table based on erasure encoding. This design is both more robust and more efficient than the previous replication-based implementation [15]. DHash uses

A Distributed Hash Table

by Frank Dabek , 2005
"... DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines: it maintain ..."
Abstract - Cited by 26 (2 self) - Add to MetaCart
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines

Efficient replica maintenance for distributed storage systems

by Byung-gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon, M. Frans Kaashoek, John Kubiatowicz, Robert Morris - In Proc. of NSDI , 2006
"... This paper considers replication strategies for storage systems that aggregate the disks of many nodes spread over the Internet. Maintaining replication in such systems can be prohibitively expensive, since every transient network or host failure could potentially lead to copying a server’s worth of ..."
Abstract - Cited by 122 (17 self) - Add to MetaCart
. In comparison, Total Recall and DHash require almost a factor of two more network traffic than this hypothetical system. 1

Serving DNS using a Peer-to-Peer Lookup Service

by Russ Cox, Athicha Muthitacharoen, Robert T. Morris - IN IPTPS , 2002
"... The current domain name system (DNS) couples ownership of domains with the responsibility of serving data for them. The DNS security extensions (DNSSEC) allow verificaton of records obtained by alternate means, opening exploration of alternative storage systems for DNS records. We explore one such a ..."
Abstract - Cited by 94 (1 self) - Add to MetaCart
such alternative using DHash, a peer-to-peer distributed hash table built on top of Chord. Our system inherits Chord's fault-tolerance and load balance properties, at the same time eliminating many administrative problems with the current DNS. Still, our system has significantly higher latencies and other

A Cooperative File System

by Frank Dabek - MASTER’S THESIS, MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT , 2001
"... 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 p ..."
Abstract - Cited by 17 (2 self) - Add to MetaCart
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

Melody: A Distributed Music-Sharing System

by James Robertson, M. Frans Kaashoek, C. Smith, James Robertson , 2003
"... Text search has been an important feature of file sharing applications since Napster. This thesis explores a directory hierarchy for categorizing and retrieving content in peer-to-peer systems as an alternative to keyword search. This thesis discusses Melody, a music sharing system that implements a ..."
Abstract - Add to MetaCart
a directory hierarchy. Melody is built on Chord, a distributed lookup algorithm, and DHash, a distributed hash table. We evaluate the performance consequences and usability of Melody. In addition, this thesis presents two support applications: Autocat, to support automatic categorization, and Paynet

Decentralized Multi User Read /Write Peer To Peer File Systems

by unknown authors
"... File system is main concept of any distributed system implementation. Shared read/write file systems pose a number of challenges. Major one is multiple distributed writer make maintenance of consistent file systems Meta data difficult. In this project a multi user read/write peer-peer file system is ..."
Abstract - Add to MetaCart
messages it generates, and thus optimizing replica retrieval. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. We are implementing this file system over peer to peer look up service. A

A Comparison Of Replication Strategies for Reliable Decentralised Storage

by unknown authors
"... Abstract — Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network; efficient routing can be maintained in the face of participant node failures. This fault-tolerance is an im ..."
Abstract - Add to MetaCart
are identified in terms of communication costs and latency. Index Terms — peer to peer, reliable storage, distributed hash table, dhash, chord I.
Results 1 - 10 of 14