Results 191 to 200 of about 35,864 (228)

Dumbo: Faster Asynchronous BFT Protocols

Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020
HoneyBadgerBFT, proposed by Miller et al. [34] as the first practical asynchronous atomic broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT (HB-BFT) is to achieve batching consensus using asynchronous common subset ...
Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang   +4 more
semanticscholar   +2 more sources

Bullshark: DAG BFT Protocols Made Practical

Conference on Computer and Communications Security, 2022
We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case.
N. Giridharan, Lefteris Kokoris-Kogias, A. Sonnino, A. Spiegelman   +3 more
semanticscholar   +1 more source

FnF-BFT: A BFT Protocol with Provable Performance Under Attack

Colloquium on Structural Information & Communication Complexity, 2023
Zeta Avarikioti, Lioba Heimbach, R. Schmid, Laurent Vanbever, Roger Wattenhofer, Patrick Wintermeyer   +5 more
semanticscholar   +2 more sources

Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus

European Conference on Computer Systems, 2021
We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus.
G. Danezis, Eleftherios Kokoris-Kogias, A. Sonnino, A. Spiegelman   +3 more
semanticscholar   +1 more source

The application and future of biofloc technology (BFT) in aquaculture industry: A review.

Journal of Environmental Management, 2023
This review describes the applicability of biofloc technology (BFT) to future aquaculture technologies. BFT is considered an innovative alternative for solving the problems of traditional aquaculture (for example, environmental pollution, high ...
Young-Bin Yu, Ju-hyeong Lee, Jae-Ho Choi, Young Jae Choi, Ah-Hyun Jo, C. Choi, Ju-Chan Kang, Jun-Hwan Kim   +7 more
semanticscholar   +1 more source

BFT

Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, 2008
Data centers strive to provide reliable access to the data and services that they host. This reliable access requires the hosted data and services hosted by the data center to be both consistent and available. Byzantine fault tolerance (BFT) replication offers the promise of services that are consistent and available despite arbitrary failures by a ...
Clement, Allen, MARCHETTI, Mirco, Wong, Edmund, Alvisi, Lorenzo, Dahlin, Mike   +4 more
openaire   +1 more source

BFT-Bench

Proceedings of the 7th ACM/SPEC on International Conference on Performance Engineering, 2016
Byzantine Fault Tolerance (BFT) has been extensively studied and numerous protocols and software prototypes have been proposed. However, most BFT prototypes have been evaluated in an ad-hoc setting, considering different fault types and fault injection scenarios.
Gupta, Divya, Perronne, Lucas, Bouchenak, Sara   +2 more
openaire   +2 more sources

Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency

Conference on Computer and Communications Security, 2022
Despite recent progresses of practical asynchronous Byzantine-fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance.
Yi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang   +5 more
semanticscholar   +1 more source

Visualizing BFT SMR Distributed Systems - Example of BFT-SMaRt

2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W), 2018
Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) distributed systems are very complex systems whose optimization traditionally relies on the analysis of log files or the output of debugging processes. In this work in progress, we use visualization techniques to support human users in the task of analyzing, understand, and optimizing a BFT
Noelle Rakotondravony, Hans P. Reiser
openaire   +1 more source

ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path

IACR Cryptology ePrint Archive, 2023
To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance (BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art representatives.
Xiaohai Dai, Bolin Zhang, Hai Jin, Ling Ren   +3 more
semanticscholar   +1 more source