In Link We Trust: BFT at the Speed of CFT using Switches
Lior Zeno, Naama Ben-David, Mark Silberstein
Abstract
We introduce SwitchBFT, a novel BFT consensus protocol for data centers that matches the performance and fault tolerance guarantees of the fastest Crash Fault Tolerance (CFT) protocols. We take advantage of several unique properties of the trusted network that have emerged in modern data centers. SwitchBFT leverages packet source authentication to eliminate the overheads of cryptographic signatures, thus speeding up the fault-free scenario, and utilizes network switch programmability to enforce agreement decisions and to verify that safety is not violated, thereby offering robust performance even when some replicas are faulty. Designing a practical BFT that makes the most of these properties requires solving several challenges, such as packet losses and switch crash faults, all within the tight switch resource budget. We show that SwitchBFT outperforms state-of-the-art BFTs in scalability and performance, attaining the speed of NOPaxos, an in-switch CFT implementation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3cc01140-a428-40ff-b123-6c499f6cc8c6Builds on9
- Using trio: juniper networks' programmable chipset - for emerging in-network applicationsMingran Yang, Alex Baban, Valery Kugel, Jeff Libby et al.SIGCOMM 2022 · 57 citations
- SwiSh: Distributed Shared State Abstractions for Programmable SwitchesLior Zeno, Dan R. K. Ports, Jacob Nelson, Daehyeok Kim et al.NSDI 2022 · 38 citations
- Bidl: A High-throughput, Low-latency Permissioned Blockchain Framework for Datacenter NetworksJi Qi, Xusheng Chen, Yunpeng Jiang, Jianyu Jiang et al.SOSP 2021 · 36 citations
- uBFT: Microsecond-Scale BFT using Disaggregated MemoryMarcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Antoine Murat et al.ASPLOS 2023 · 20 citations
- NeoBFT: Accelerating Byzantine Fault Tolerance Using Authenticated In-Network OrderingGuangda Sun, Mingliang Jiang, Xin Zhe Khooi, Yunfan Li et al.SIGCOMM 2023 · 13 citations
Related papers
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 255 citations
- Integrating 2PC with Consensus for Fast ReplicationYan Chen, Xinyi Yu, Shengyun Liu, Ruofan Xiong et al.SIGCOMM 2026
- Dissecting BFT Consensus: In Trusted Components we Trust!Suyash Gupta, Sajjad Rahnama, Shubham Pandey, Natacha Crooks et al.EuroSys 2023 · 27 citations
- ENGRAFT: Enclave-guarded Raft on Byzantine Faulty NodesWeili Wang, Sen Deng, Jianyu Niu, Michael K. Reiter et al.CCS 2022 · 19 citations
- TockOwl: Asynchronous Consensus with Fault and Network AdaptabilityMinghang Li, Qianhong Wu, Zhipeng Wang, Bo Qin et al.USENIX Security 2025
