Imitater: An Efficient Shared Mempool Protocol with Application to Byzantine Fault Tolerance
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913790256218112 |
|---|---|
| author | Zeng, Qingming Li, Mo Fu, Ximing Liu, Chuanyi Jiang, Hui |
| author_facet | Zeng, Qingming Li, Mo Fu, Ximing Liu, Chuanyi Jiang, Hui |
| contents | Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under conditions of network instability or malicious exploitation of system mechanisms.
We propose a novel Shared Mempool (SMP) protocol, named Imitater, which can be seamlessly integrated into BFT protocols. By chaining microblocks and applying coding techniques, Imitater efficiently achieves \emph{totality} and \emph{availability}. Furthermore, a BFT protocol augmented with Imitater ensures \emph{order preservation} of client transactions while mitigating the risks of \emph{over-distribution} and \emph{unbalanced workload}.
In the experiment, we integrate Imitater into the HotStuff protocol, resulting in Imitater-HS. The performance of Imitater-HS is validated in a system with up to 256 nodes. Experimental results demonstrate the efficiency of our approach: Imitater-HS achieves higher throughput and lower latency in the presence of faulty nodes compared to Stratus-HS, the state-of-the-art protocol. Notably, the throughput improvement increases with the number of faulty nodes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19286 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Imitater: An Efficient Shared Mempool Protocol with Application to Byzantine Fault Tolerance Zeng, Qingming Li, Mo Fu, Ximing Liu, Chuanyi Jiang, Hui Distributed, Parallel, and Cluster Computing Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under conditions of network instability or malicious exploitation of system mechanisms. We propose a novel Shared Mempool (SMP) protocol, named Imitater, which can be seamlessly integrated into BFT protocols. By chaining microblocks and applying coding techniques, Imitater efficiently achieves \emph{totality} and \emph{availability}. Furthermore, a BFT protocol augmented with Imitater ensures \emph{order preservation} of client transactions while mitigating the risks of \emph{over-distribution} and \emph{unbalanced workload}. In the experiment, we integrate Imitater into the HotStuff protocol, resulting in Imitater-HS. The performance of Imitater-HS is validated in a system with up to 256 nodes. Experimental results demonstrate the efficiency of our approach: Imitater-HS achieves higher throughput and lower latency in the presence of faulty nodes compared to Stratus-HS, the state-of-the-art protocol. Notably, the throughput improvement increases with the number of faulty nodes. |
| title | Imitater: An Efficient Shared Mempool Protocol with Application to Byzantine Fault Tolerance |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2409.19286 |