The Community for Technology Leaders
Peer-to-Peer Computing, IEEE International Conference on (2005)
Konstanz, Germany
Aug. 31, 2005 to Sept. 2, 2005
ISBN: 0-7695-2376-5
pp: 201-208
Suresh Jagannathan , Purdue University
Ananth Grama , Purdue University
Murali Krishna Ramanathan , Purdue University
Ronaldo A. Ferreira , Purdue University
Distributed peer-to-peer storage systems rely on voluntary participation of peers to effectively manage a storage pool. Files are generally replicated in several sites to provide acceptable levels of availability. If disk space on these peers is not carefully monitored and provisioned, the system may not be able to provide availability for certain files. In particular, identification and elimination of redundant data are important problems that may arise in long-lived systems. Scalability and availability are competing goals in these networks: scalability concerns would dictate aggressive elimination of replicas, while availability considerations would argue conversely. In this paper, we provide a novel and efficient solution that addresses both these goals with respect to management of redundant data. Specifically, we address the problem of duplicate elimination in the context of systems connected over an unstructured peer-to-peer network in which there is no a priori binding between an object and its location. We propose a new randomized protocol to solve this problem in a scalable and decentralized fashion that does not compromise availability requirements of the application. Performance results using both large-scale simulations, and a prototype built on PlanetLab, demonstrate that the protocols provide high probabilistic guarantees of success, while incurring minimal administrative overheads.
Suresh Jagannathan, Ananth Grama, Murali Krishna Ramanathan, Ronaldo A. Ferreira, "Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems", Peer-to-Peer Computing, IEEE International Conference on, vol. 00, no. , pp. 201-208, 2005, doi:10.1109/P2P.2005.30
96 ms
(Ver 3.3 (11022016))