Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A Byzantine and consistent technology, applied in the field of distributed system copy management, can solve problems such as performance degradation, and achieve the effect of solving the inconsistent state of nodes
Active Publication Date: 2019-12-03
SUN YAT SEN UNIV
View PDF3 Cites 16 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0007] Aiming at the problem that the performance of the Byzantine protocol in the prior art is severely degraded when there are error nodes, the present invention provides a Byzantine fault-tolerant method,
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0043] Such as figure 1 As shown, a Byzantine fault-tolerant method works in a distributed system. There are 3f+1 replica nodes in the system, of which at most f nodes are error nodes, and f is less than the total of all replica nodes in the system It includes three sub-protocols: consensus protocol, view replacement protocol and checkpoint protocol;
[0044] The consensus protocol coordinates the replica nodes to agree on the execution order of the requests from the master replica nodes;
[0045] When the replica nodes cannot reach a consensus, the slave replica node triggers the view replacement protocol, elects a new master replica node, and executes the consensus protocol again to ensure that the consensus can be reached;
[0046] After the distributed system executes a certain number of requests, the log of the replica node is periodically cleaned up, and the replica node updates its own status.
[0047] The request history stored on each replica node includes the foll...
Embodiment 2
[0067] In the specific implementation, we apply the proposed Byzantine fault tolerance method with smooth performance degradation to 4-16 virtual machines, these virtual machines use 3.4GHz CPU, Linux 2.6Kernel, and are connected through a LAN with a bandwidth of 100Mbps. We evaluate the performance of the protocol by two metrics, throughput and latency. Experiments were carried out in scenarios where there are no fault nodes, that is, fault-free cases, and there are fault nodes, that is, normal cases. The effectiveness of the present invention is illustrated by comparing with two currently more efficient BFT protocols, PBFT and Zyzzyva.
[0068]Under fault-free cases and normal cases, we evaluate the performance of the algorithm by testing the throughput and delay changes of the system when serving different numbers of clients, and by testing the number of different error nodes, the number of nodes is 1-5, the protocol Performance changes to evaluate the fault tolerance of t...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention discloses a Byzantine fault tolerance method, which comprises three sub-protocols including a consensus protocol, a view replacement protocol and a check point protocol, the consensus protocol coordinates the execution sequence of the request from the replica node to the main replica node to be consistent; when the replica nodes cannot be consistent, the slave replica nodes trigger the view replacement protocol, select new master replica nodes and execute the consensus protocol again; after the distributed system executes a certain number of requests each time, logs of the replica nodes are periodically cleared, and the replica nodes update the states of the replica nodes. According to the method, good performance can be obtained in the absence of error nodes, smooth performance reduction can be realized in the presence of the error nodes, the problem of inconsistent node states possibly occurring in the continuous view replacement process is solved, and the problem of severe performance reduction in the presence of the error nodes in some BFT protocols is solved.
Description
technical field [0001] The invention relates to the field of distributed system copy management, more specifically, a Byzantine fault tolerance method. Background technique [0002] As the number of users and data continues to grow, most Internet applications are deployed on public network environments, such as cloud platforms, which makes applications likely to become targets of network intrusion and attacks. In a network environment where there are attacks and intrusions, how to ensure high availability and high reliability of application services and user data in a distributed system is a topic of great concern to both industry and academia. [0003] Replication backup (replication) technology is the basic means to achieve high availability and high reliability [1] , it avoids inaccessibility / data loss caused by a single point of failure by making multiple copies of the data and storing the data copies on different nodes. However, there may be malicious nodes in the rep...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more