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.
Highlights
A peer-to-peer, commonly abbreviated to P2P, is any distributed network architecture composed of participants that make a portion of their resources such as processing power, disk storage or network bandwidth directly available to other network participants, without the need for central coordination instances such as servers or stable hosts
Byzantine Fault Tolerance Replication (BFTR) Technique: Architecture model: In our proposed System, clients do not interact directly with the database replicas. Instead they communicate with the agent, which acts as a front-end to the replicas and coordinates them
We have developed a Byzantine
Summary
A peer-to-peer, commonly abbreviated to P2P, is any distributed network architecture composed of participants that make a portion of their resources such as processing power, disk storage or network bandwidth directly available to other network participants, without the need for central coordination instances such as servers or stable hosts. Ensure that the client always gets correct answers implementation is evaluated over several network to queries belonging to transactions that commit, topologies and is compared with a flat Byzantine faulteven when up to f replicas are faulty tolerant approach. They optimistically adopt the order proposed by the Previous work on replica placement: System model and overview: In our QOS aware topology, nodes are grouped into strong and weak clusters based on their weight vector which comprises the following parameters: primary and respond immediately to the client.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
