2011Unpublished venueRequires access

Redundant data management in unstructured peer-to-peer networks

Sanjeev S. Sannakki, S. Gowri

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Scalability, Distributed computing, Peer-to-peer, Provisioning, Replication (statistics), File system, Load balancing (electrical power)

Related papers

Back to paper searchBrowse research topicsOriginal source
Redundant data management in unstructured peer-to-peer networks — Research Paper | ScholarLens