A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance
スポンサーリンク
概要
- 論文の詳細を見る
We propose a new method that accelerates asynchronous Byzantine Fault Tolerant (BFT) protocols designed on the principle of state machine replication. State machine replication protocols ensure consistency among replicas by applying operations in the same order to all of them. A naive way to determine the application order of the operations is to repeatedly execute the BFT consensus to determine the next executed operation, but this may introduce inefficiency caused by waiting for the completion of the previous execution of the consensus protocol. To reduce this inefficiency, our method allows parallel execution of the consensuses while keeping consistency of the consensus results at the replicas. In this paper, we also prove the correctness of our method and experimentally compare it with the existing method in terms of latency and throughput. The evaluation results show that our method makes a BFT protocol three or four times faster than the existing one when some machines or message transmissions are delayed.
著者
-
Masuzawa Toshimitsu
Graduate School Of Engineering Science Osaka University
-
Araragi Tadashi
Ntt Communication Science Laboratories Nippon Telegraph And Telephone Corporation
-
Nakamura Junya
Graduate School Of Bioresource And Bioenvironmental Sciences Kyushu University
-
MASUYAMA Shigeru
Dept. of Computer Science and Engineering, Toyohashi University of Technology
関連論文
- A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
- A Biologically Inspired Self-Adaptation of Replica Density Control
- A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
- An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
- Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
- A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
- Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
- Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
- Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
- Self-Stabilization in Dynamic Networks
- Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
- Self-Stabilizing Agent Traversal on Tree Networks(Distributed Cooperation and Agents)
- Checking Liveness Properties of Concurrent Systems by Using Reinforcement Learning
- Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
- Reasoning about Mental State Compatibilities of Rational Agents and Its Applications( Software Agent and Its Applications)
- Rice homologs of inducer of CBF expression (OsICE) are involved in cold acclimation
- Effect of Mn or Fe Addition on Age-Hardening Behaviour of Al-Mg_2Si Alloys
- A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance
- Effect of Amount of Gd and Y Contents on Precipitation in Me-Gd-Y Alloys Aged at 473K