@article {10.3844/jcssp.2011.159.166,
article_type = {journal},
title = {A Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content Distribution},
author = {Sellappan, Ayyasamy and Natarajan, Sivanandam},
volume = {7},
number = {2},
year = {2011},
month = {Feb},
pages = {159-166},
doi = {10.3844/jcssp.2011.159.166},
url = {https://thescipub.com/abstract/jcssp.2011.159.166},
abstract = {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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}