Exploiting network locality in a decentralized read-write peer-to-peer file system

We have developed a completely decentralized multiuser read-write peer-to-peer file system with good locality properties. In our system all data is contained in blocks stored using the Past distributed hash table (DHT), thus taking advantage of the fault tolerance and locality properties of Past and...

Full description

Saved in:
Bibliographic Details
Published inProceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004 pp. 289 - 296
Main Authors Picconi, F., Busca, J.-M., Sens, P.
Format Conference Proceeding
LanguageEnglish
Published Los Alamitos CA IEEE 2004
IEEE Computer Society
Subjects
Applied sciences
Authentication
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Cryptography
Data security
Exact sciences and technology
Fault tolerant systems
File systems
Intelligent networks
Java
Large-scale systems
Peer to peer computing
Prototypes
Software
Multiple access
Input output
Peer to peer
JAVA language
Relaxed consistency
Locality
File management
Distributed system
Modeling
Open source software
Fault tolerance
Authentication
Hashing
Parallelism
Cryptography
Operating system
Integrity
Online AccessGet full text

Cover

More Information
Summary:We have developed a completely decentralized multiuser read-write peer-to-peer file system with good locality properties. In our system all data is contained in blocks stored using the Past distributed hash table (DHT), thus taking advantage of the fault tolerance and locality properties of Past and Pastry. We have also introduced a modification to the Past DHT which allows us to further increase performance when using a relaxed but nevertheless useful consistency model. Authentication and integrity are assured using standard cryptographic mechanisms. We have developed a prototype in order to evaluate the performance of our design. Our prototype is programmed in Java and uses the FreePastry open-source implementation of Past and Pastry. It allows applications to choose between two degrees of consistency. Preliminary results obtained through simulation suggest that our system is approximately twice as slow as NFS. In comparison, Ivy and Oceanstore are between two to three times slower than NFS.
ISBN:9780769521527
0769521525
ISSN:1521-9097
2690-5965
DOI:10.1109/ICPADS.2004.1316107