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

Journal of Computer Science

Sivanandam Natarajan¹  Ayyasamy Sellappan¹ 

关键词: Fault-tolerance;    Internet Protocol (IP);    replication technique;    content distribution;    Byzantine Fault Tolerance (BFT);    Peer to Peer (P2P);    Origin Server (OS);   

DOI  :  10.3844/jcssp.2011.159.166

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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

【 授权许可】

Unknown