Switch-Centric Byzantine Fault Tolerance Mechanism in Distributed Software Defined Networks

Citations

WEB OF SCIENCE

10
Citations

SCOPUS

13

초록

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.

키워드

Process controlFault toleranceFault tolerant systemsSwitchesSynchronizationTime factorsByzantine fault toleranceswitch-centricprogrammable data planeP4
제목
Switch-Centric Byzantine Fault Tolerance Mechanism in Distributed Software Defined Networks
저자
Han, SolJang, SeokwonLee, HochanPack, Sangheon
DOI
10.1109/LCOMM.2020.3004038
발행일
2020-10
유형
Article
저널명
IEEE Communications Letters
24
10
페이지
2236 ~ 2239