DocumentCode
2041223
Title
Redundant data management in unstructured peer-to-peer networks
Author
Sannakki, Sanjeev S. ; Shree Gowri, S.S.
Author_Institution
Dept. of Comput. Sci., K.L.S.´´s Gogte Inst. of Technol., Belgaum, India
Volume
4
fYear
2011
fDate
8-10 April 2011
Firstpage
213
Lastpage
217
Abstract
Peer-to-Peer system is a distributed system composed of a large number of distributed peers in which participants share storage capacity and file contents. Files are replicated in several sites to provide acceptable levels of availability. If storage space on these peers with replication is not carefully monitored and provisioned, the system may not be able to provide availability for certain files. In this paper we provide efficient solution that address scalability and availability with respect to the 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 by using Java. We propose randomized protocols to solve this problem in a scalable and decentralized fashion that does not compromise availability requirements of the application.
Keywords
Java; data handling; peer-to-peer computing; storage management; Java; randomized protocol; redundant data management; scalability; storage space; unstructured peer-to-peer network; Availability; Java; Lead; Nominations and elections; Peer to peer computing; Probabilistic logic; Protocols; Peer-to-Peer Systems; Randomized Protocols; Redundant Data Management; Unstructured networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics Computer Technology (ICECT), 2011 3rd International Conference on
Conference_Location
Kanyakumari
Print_ISBN
978-1-4244-8678-6
Electronic_ISBN
978-1-4244-8679-3
Type
conf
DOI
10.1109/ICECTECH.2011.5941889
Filename
5941889
Link To Document