Journal of Computer Science

A Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content Distribution

Ayyasamy Sellappan and Sivanandam Natarajan

DOI : 10.3844/jcssp.2011.159.166

Journal of Computer Science

Volume 7, Issue 2

Pages 159-166


Problem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas and clients. Since malicious attacks and software errors can cause faulty nodes to exhibit Byzantine behavior, Byzantine-fault-tolerant algorithms are increasingly important. Approach: In the study, we wish to develop a robust Byzantine Fault-Tolerance Replication (BFTR) technique for peer-to-peer content distribution systems which contains fault detection and fault recovery. It is based on collaborative monitoring of each node to detect the occurrence of a fault. Already we proposed a QoS based overlay network architecture (QIRM) involving an intelligent replica placement algorithm to improve the network utilization of the P2P system. Results: By simulation results, we show that the proposed technique involves less overhead and recovery time with increased accuracy. Conclusion/Recommendations: Here the result obtained is that BFTR Technique is much efficient than the QIRM with respect to packet drop ratio, average end-to-end delay, throughput and overhead.


© 2011 Ayyasamy Sellappan and Sivanandam Natarajan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.