Abstract
Supporting byzantine fault tolerance (BFT) in distributed software-defined networks (SDNs) may lead to increased consensus delay and traffic load since all messages should be verified and multicasted among controllers. To address this problem, we propose a switch-centric byzantine fault tolerant (SC-BFT) mechanism, in which key BFT functions (e.g., message authentication and comparison) are implemented at the programmable switches. Thus, SC-BFT can accelerate the consensus procedure and mitigate the communication overhead. We implemented SC-BFT at BMv2 using P4. Analytical and simulation results show that SC-BFT provides 80% reduced response time compared to conventional BFT consensus mechanisms with significantly reduced communication overhead.
Original language | English |
---|---|
Article number | 9121972 |
Pages (from-to) | 2236-2239 |
Number of pages | 4 |
Journal | IEEE Communications Letters |
Volume | 24 |
Issue number | 10 |
DOIs | |
Publication status | Published - 2020 Oct |
Keywords
- Byzantine fault tolerance
- P4
- programmable data plane
- switch-centric
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering