Shashi Bhushan

Work place: Chandigarh Engineering College, Landran, Punjab, INDIA



Research Interests: Engineering


Shashi Bhushan (1974) received his B. Tech. (Computer Technology) degree from Nagpur University, Nagpur INDIA in 1998. He received his M. Tech. (Computer Science and Engineering) degree from JRN Rajasthan Vidyapeeth, Rajasthan in 2005 and presently pursuing PhD in the field of Peer-to-Peer Networks from National Institute of Technology, Kurukshetra, INDIA. His fields of interest are Peer-toPeer Networks, Sensor Networks and Mobile Computing.

Author Articles
Self Organized Replica Overlay Scheme for P2P Networks

By Shashi Bhushan Mayank Dave R. B. Patel

DOI:, Pub. Date: 8 Sep. 2012

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 faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network. The architecture for IHQC is also proposed for implementing the scheme that supports improved performance of P2P systems. This scheme also maximizes the degree of intersection set of read and write quorums; hence, having higher probability to get updated data as compared to all other schemes. The mathematical correctness of the scheme is also presented in the paper. The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.

[...] Read more.
Other Articles