A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm

Yifei Xie; Btissam Er-Rahmadi; Xiao Chen; Tiejun Ma; Jane Hillston

doi:10.1007/978-3-031-31209-0_20

A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm

Yifei Xie^*, Btissam Er-Rahmadi, Xiao Chen, Tiejun Ma, Jane Hillston

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Byzantine fault-tolerance (BFT) algorithms enhance trustworthiness of distributed systems by guaranteeing their resilience to Byzantine faults. Traditional BFT algorithms suffer from scalability issues, resulting in performance bottlenecks (e.g., low throughputs) in large-scale distributed systems. Moreover, distributed systems are generally deployed on geographically and/or logically distributed networks, which aggravates the performance-scalability issue. To tackle this challenge, existing works have proposed a number of new BFT algorithms (e.g., HotStuff, FastBFT). However, limited work has explored parallel BFT based on a partitioned set of connected subgroups. This is challenging due to 1) heterogeneous communications delays between different, potentially geographically distributed, peers, and 2) peers may have a random crash and/or Byzantine failures, which contribute to the failure of the BFT consensus. To address these issues, we propose a stochastic programming (SP) model to maximise the throughput, while considering communications delays and failure behaviors as constraints. The SP model solution provides the optimal multi-committee organisation. Evaluation results show 24% throughput enhancement with the SP model.

Original language	English
Title of host publication	Euro-Par 2022: Parallel Processing Workshops
Editors	Jeremy Singer, Yehia Elkhatib, Dora Blanco Heras, Patrick Diehl, Nick Brown, Aleksandar Ilic
Publisher	Springer
Pages	267-273
Number of pages	6
Volume	13835
ISBN (Electronic)	9783031312090
ISBN (Print)	9783031312083
DOIs	https://doi.org/10.1007/978-3-031-31209-0_20
Publication status	Published - 2 May 2023
Event	28th International European Conference on Parallel and Distributed Computing - Glasgow, United Kingdom Duration: 24 Aug 2022 → 26 Aug 2022 Conference number: 28 https://2022.euro-par.org/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	28th International European Conference on Parallel and Distributed Computing
Abbreviated title	Euro-Par 2022
Country/Territory	United Kingdom
City	Glasgow
Period	24/08/22 → 26/08/22
Internet address	https://2022.euro-par.org/

Keywords / Materials (for Non-textual outputs)

Stochastic Programming
Byzantine Fault Tolerant Algorithm
Parallel Consensus

Access to Document

10.1007/978-3-031-31209-0_20Licence: All Rights Reserved

A Stochastic_XIE_DOA29042022_AFVAccepted author manuscript, 267 KBLicence: Creative Commons: Attribution (CC-BY)

https://link.springer.com/chapter/10.1007/978-3-031-31209-0_20#chapter-infoLicence: All Rights Reserved

Cite this

Xie, Y., Er-Rahmadi, B., Chen, X., Ma, T., & Hillston, J. (2023). A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm. In J. Singer, Y. Elkhatib, D. B. Heras, P. Diehl, N. Brown, & A. Ilic (Eds.), Euro-Par 2022: Parallel Processing Workshops (Vol. 13835, pp. 267-273). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-031-31209-0_20

Xie, Yifei ; Er-Rahmadi, Btissam ; Chen, Xiao et al. / A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm. Euro-Par 2022: Parallel Processing Workshops. editor / Jeremy Singer ; Yehia Elkhatib ; Dora Blanco Heras ; Patrick Diehl ; Nick Brown ; Aleksandar Ilic. Vol. 13835 Springer, 2023. pp. 267-273 (Lecture Notes in Computer Science).

@inproceedings{04ed0b4678da427090a477c2a3046670,

title = "A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm",

abstract = "Byzantine fault-tolerance (BFT) algorithms enhance trustworthiness of distributed systems by guaranteeing their resilience to Byzantine faults. Traditional BFT algorithms suffer from scalability issues, resulting in performance bottlenecks (e.g., low throughputs) in large-scale distributed systems. Moreover, distributed systems are generally deployed on geographically and/or logically distributed networks, which aggravates the performance-scalability issue. To tackle this challenge, existing works have proposed a number of new BFT algorithms (e.g., HotStuff, FastBFT). However, limited work has explored parallel BFT based on a partitioned set of connected subgroups. This is challenging due to 1) heterogeneous communications delays between different, potentially geographically distributed, peers, and 2) peers may have a random crash and/or Byzantine failures, which contribute to the failure of the BFT consensus. To address these issues, we propose a stochastic programming (SP) model to maximise the throughput, while considering communications delays and failure behaviors as constraints. The SP model solution provides the optimal multi-committee organisation. Evaluation results show 24% throughput enhancement with the SP model.",

keywords = "Stochastic Programming, Byzantine Fault Tolerant Algorithm, Parallel Consensus",

author = "Yifei Xie and Btissam Er-Rahmadi and Xiao Chen and Tiejun Ma and Jane Hillston",

note = "Funding Information: This project has also received funding from the EU Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie grant agreement No. 801215 and the University of Edinburgh Data-Driven Innovation programme, part of the Edinburgh and SE Scotland City Region Deal. Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 28th International European Conference on Parallel and Distributed Computing, Euro-Par 2022 ; Conference date: 24-08-2022 Through 26-08-2022",

year = "2023",

month = may,

day = "2",

doi = "10.1007/978-3-031-31209-0_20",

language = "English",

isbn = "9783031312083",

volume = "13835",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "267--273",

editor = "Jeremy Singer and Yehia Elkhatib and Heras, {Dora Blanco} and Patrick Diehl and Nick Brown and Aleksandar Ilic",

booktitle = "Euro-Par 2022: Parallel Processing Workshops",

address = "United Kingdom",

url = "https://2022.euro-par.org/",

}

Xie, Y, Er-Rahmadi, B, Chen, X, Ma, T & Hillston, J 2023, A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm. in J Singer, Y Elkhatib, DB Heras, P Diehl, N Brown & A Ilic (eds), Euro-Par 2022: Parallel Processing Workshops. vol. 13835, Lecture Notes in Computer Science, Springer, pp. 267-273, 28th International European Conference on Parallel and Distributed Computing, Glasgow, United Kingdom, 24/08/22. https://doi.org/10.1007/978-3-031-31209-0_20

A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm. / Xie, Yifei; Er-Rahmadi, Btissam; Chen, Xiao et al.
Euro-Par 2022: Parallel Processing Workshops. ed. / Jeremy Singer; Yehia Elkhatib; Dora Blanco Heras; Patrick Diehl; Nick Brown; Aleksandar Ilic. Vol. 13835 Springer, 2023. p. 267-273 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm

AU - Xie, Yifei

AU - Er-Rahmadi, Btissam

AU - Chen, Xiao

AU - Ma, Tiejun

AU - Hillston, Jane

N1 - Conference code: 28

PY - 2023/5/2

Y1 - 2023/5/2

N2 - Byzantine fault-tolerance (BFT) algorithms enhance trustworthiness of distributed systems by guaranteeing their resilience to Byzantine faults. Traditional BFT algorithms suffer from scalability issues, resulting in performance bottlenecks (e.g., low throughputs) in large-scale distributed systems. Moreover, distributed systems are generally deployed on geographically and/or logically distributed networks, which aggravates the performance-scalability issue. To tackle this challenge, existing works have proposed a number of new BFT algorithms (e.g., HotStuff, FastBFT). However, limited work has explored parallel BFT based on a partitioned set of connected subgroups. This is challenging due to 1) heterogeneous communications delays between different, potentially geographically distributed, peers, and 2) peers may have a random crash and/or Byzantine failures, which contribute to the failure of the BFT consensus. To address these issues, we propose a stochastic programming (SP) model to maximise the throughput, while considering communications delays and failure behaviors as constraints. The SP model solution provides the optimal multi-committee organisation. Evaluation results show 24% throughput enhancement with the SP model.

AB - Byzantine fault-tolerance (BFT) algorithms enhance trustworthiness of distributed systems by guaranteeing their resilience to Byzantine faults. Traditional BFT algorithms suffer from scalability issues, resulting in performance bottlenecks (e.g., low throughputs) in large-scale distributed systems. Moreover, distributed systems are generally deployed on geographically and/or logically distributed networks, which aggravates the performance-scalability issue. To tackle this challenge, existing works have proposed a number of new BFT algorithms (e.g., HotStuff, FastBFT). However, limited work has explored parallel BFT based on a partitioned set of connected subgroups. This is challenging due to 1) heterogeneous communications delays between different, potentially geographically distributed, peers, and 2) peers may have a random crash and/or Byzantine failures, which contribute to the failure of the BFT consensus. To address these issues, we propose a stochastic programming (SP) model to maximise the throughput, while considering communications delays and failure behaviors as constraints. The SP model solution provides the optimal multi-committee organisation. Evaluation results show 24% throughput enhancement with the SP model.

KW - Stochastic Programming

KW - Byzantine Fault Tolerant Algorithm

KW - Parallel Consensus

U2 - 10.1007/978-3-031-31209-0_20

DO - 10.1007/978-3-031-31209-0_20

M3 - Conference contribution

SN - 9783031312083

VL - 13835

T3 - Lecture Notes in Computer Science

SP - 267

EP - 273

BT - Euro-Par 2022: Parallel Processing Workshops

A2 - Singer, Jeremy

A2 - Elkhatib, Yehia

A2 - Heras, Dora Blanco

A2 - Diehl, Patrick

A2 - Brown, Nick

A2 - Ilic, Aleksandar

PB - Springer

T2 - 28th International European Conference on Parallel and Distributed Computing

Y2 - 24 August 2022 through 26 August 2022

ER -

Xie Y, Er-Rahmadi B, Chen X, Ma T , Hillston J. A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm. In Singer J, Elkhatib Y, Heras DB, Diehl P, Brown N, Ilic A, editors, Euro-Par 2022: Parallel Processing Workshops. Vol. 13835. Springer. 2023. p. 267-273. (Lecture Notes in Computer Science). Epub 2022 Aug 26. doi: 10.1007/978-3-031-31209-0_20

A Stochastic Programming Approach for an Enhanced Performance of a Multi-committees Byzantine Fault Tolerant Algorithm

Abstract

Publication series

Conference

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this