IM: Optimizing Byzantine Consensus for High-Performance Distributed Networks
<|reference_start|>IM: Optimizing Byzantine Consensus for High-Performance Distributed Networks: Byzantine Fault Tolerant (BFT) consensus, a crucial component of blockchains, has made significant advancements. However, the efficiency of existing protocols can still be damaged by certain attacks from faulty nodes and network instability. In this paper, we propose a novel Shared Mempool (SMP) protocol, namely IM, that enhances performance under these attacks. Technically, IM organizing microblocks into chains, combined with coding techniques, achieves totality and availability efficiently. IM can be easily integrated into a BFT protocol. We take Fast-HotStuff as an example and obtain the IM-FHS with guarantees of \emph{order keeping}, \emph{bandwidth adaptability} and \emph{over-distribution resistance}. IM-FHS is conducted in a system with up to 256 nodes, and experimental results validate the efficiency of our approach. IM-FHS achieves higher throughput and smaller latency with faulty nodes than Stratus-FHS, the state-of-the-art protocol, and the throughput gain increases as the number of fault nodes. In a system with 100 nodes with 33 faulty nodes, IM-FHS achieves 9 times the throughput of Stratus-FHS while maintaining 1/10 the latency when dealing with maximum resilience against faulty nodes.<|reference_end|>
@article{zeng2024im:,
    title={IM: Optimizing Byzantine Consensus for High-Performance Distributed
  Networks},
    author={Qingming Zeng (Harbin Institute of Technology, Shenzhen), Mo Li (The
  Chinese University of Hongkong, Shenzhen), Ximing Fu (Harbin Institute of
  Technology, Shenzhen), Chuanyi Liu (Harbin Institute of Technology, Shenzhen,
  Peng Cheng Laboratory, Shenzhen), Hui Jiang (Tsinghua University, Baidu Inc)},
    journal={arXiv preprint arXiv:2409.19286},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.19286},
    primaryClass={cs.DC}
}