Redundant data management in unstructured peer-to-peer networks
Sanjeev S. Sannakki, S. Gowri
Abstract
Sanjeev S. Sannakki, S. Gowri
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Computer science, Scalability, Distributed computing, Peer-to-peer, Provisioning, Replication (statistics), File system, Load balancing (electrical power)