An Adaptive Replication Algorithm in P2P File Systems with Unreliable Nodes

Abstract

The paper1 focuses on distributed file systems in P2P networks. We introduce a novel file replication scheme which is adaptive, reacting to changes in the patterns of access to the file system by dynamically creating or deleting replicas. Replication is used to increase data availability in the presence of site or communication failures and to decrease retrieval costs by local access if possible. Our system is completely decentralized and nodes can be removed/added dynamically. We also propose an overlay architecture for file search. This architecture is structured, but also based on random walk. Our system has a mobile agent which performs dynamic load-balancing. This agent is event driven and circulates in the network to find and “destroy” the least important files and thus limit the proliferation of superfluous replicas. We have implemented our method at TCP/IP sockets level.

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Andonie2009AnAR, title={An Adaptive Replication Algorithm in P2P File Systems with Unreliable Nodes}, author={Razvan Andonie and Luke Magill and James L. Schwing and Ben Sisson and Brandon Wysocki}, booktitle={PDPTA}, year={2009} }