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

Sol Han; Seokwon Jang; Hochan Lee; Sangheon Pack

doi:10.1109/LCOMM.2020.3004038

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

Sol Han, Seokwon Jang, Hochan Lee, Sangheon Pack

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

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	https://doi.org/10.1109/LCOMM.2020.3004038
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

Access to Document

10.1109/LCOMM.2020.3004038

Cite this

@article{9573d52e9f0640b4b02880cbd873ac14,

title = "Switch-Centric Byzantine Fault Tolerance Mechanism in Distributed Software Defined Networks",

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.",

keywords = "Byzantine fault tolerance, P4, programmable data plane, switch-centric",

author = "Sol Han and Seokwon Jang and Hochan Lee and Sangheon Pack",

note = "Funding Information: Manuscript received May 15, 2020; revised June 16, 2020; accepted June 16, 2020. Date of publication June 22, 2020; date of current version October 9, 2020. This work was supported in part by Institute for Information & Communications Technology Promotion Grant funded by the Korea Government (MSIT) (No. 2017-0-00195) and in part by the National Research Foundation of Korea Grant funded by the Korean Government (MSIP) (No. 2020R1A2C3006786). The associate editor coordinating the review of this letter and approving it for publication was B. Dezfouli. (Corresponding author: Sangheon Pack.) The authors are with the School of Electrical Engineering, Korea University, Seoul 02841, South Korea (e-mail: hs1087@korea.ac.kr; imsoboy2@korea.ac.kr; ghcks1000@korea.ac.kr; shpack@korea.ac.kr). Digital Object Identifier 10.1109/LCOMM.2020.3004038 Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2020",

month = oct,

doi = "10.1109/LCOMM.2020.3004038",

language = "English",

volume = "24",

pages = "2236--2239",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

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

AU - Han, Sol

AU - Jang, Seokwon

AU - Lee, Hochan

AU - Pack, Sangheon

N1 - Funding Information: Manuscript received May 15, 2020; revised June 16, 2020; accepted June 16, 2020. Date of publication June 22, 2020; date of current version October 9, 2020. This work was supported in part by Institute for Information & Communications Technology Promotion Grant funded by the Korea Government (MSIT) (No. 2017-0-00195) and in part by the National Research Foundation of Korea Grant funded by the Korean Government (MSIP) (No. 2020R1A2C3006786). The associate editor coordinating the review of this letter and approving it for publication was B. Dezfouli. (Corresponding author: Sangheon Pack.) The authors are with the School of Electrical Engineering, Korea University, Seoul 02841, South Korea (e-mail: hs1087@korea.ac.kr; imsoboy2@korea.ac.kr; ghcks1000@korea.ac.kr; shpack@korea.ac.kr). Digital Object Identifier 10.1109/LCOMM.2020.3004038 Publisher Copyright: © 1997-2012 IEEE.

PY - 2020/10

Y1 - 2020/10

N2 - 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.

AB - 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.

KW - Byzantine fault tolerance

KW - P4

KW - programmable data plane

KW - switch-centric

UR - http://www.scopus.com/inward/record.url?scp=85093683082&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2020.3004038

DO - 10.1109/LCOMM.2020.3004038

M3 - Article

AN - SCOPUS:85093683082

SN - 1089-7798

VL - 24

SP - 2236

EP - 2239

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 10

M1 - 9121972

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this