z-logo
open-access-imgOpen Access
Self Organized Replica Overlay Scheme for P2P Networks
Author(s) -
Shashi Bhushan,
Mayank Dave,
R. B. Patel
Publication year - 2012
Publication title -
international journal of computer network and information security
Language(s) - English
Resource type - Journals
eISSN - 2074-9104
pISSN - 2074-9090
DOI - 10.5815/ijcnis.2012.10.02
Subject(s) - computer science , distributed computing , replica , overhead (engineering) , overlay network , overlay , scheme (mathematics) , peer to peer , fault tolerance , computer network , the internet , art , mathematical analysis , mathematics , world wide web , visual arts , operating system , programming language
Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode. P2P systems are suitable for large- scale distributed environments in which nodes can share resources other than data such as computing power, memory and network bandwidth. Some of important parameters that affect the performance of P2P systems are peer availability, data availability, network overhead, overlay structure, churn rate, and data access time. In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed. This scheme organizes replicas in a Self Organized Hierarchical Logical Structure (SOHLS) that has special properties. The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums and reducing network overhead. This scheme is highly fault tolerant (tolerate up to

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom