Multi-objective optimization of committee selection for hierarchical Byzantine fault tolerance-based consensus protocols

Authors

  • Igor Y. Mazurok Odessa I. I. Mechnikov National University. 2, Dvoryanskaya Str. Odessa, 65082, Ukraine
  • Yevhen Y. Leonchyk Odessa I. I. Mechnikov National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine
  • Sergii S. Grybniak Odessa National Polytechnic University. 1, Shevchenko Ave. Odessa, 65044, Ukraine
  • Alisa Y. Vorokhta Odessa I. I. Mechnikov National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine
  • Oleksandr S. Nashyvan Odessa I. I. Mechnikov. National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine

DOI:

https://doi.org/10.15276/hait.06.2023.3

Keywords:

Distributed ledger technology, decentralized system, blockchain, consensus protocol, Byzantine fault tolerance

Abstract

Decentralized platforms like blockchain have been attracting significant attention in recent years, especially in the context of financial and payment systems. They are designed to provide a transparent, secure, and reliable environment for digital transactions without the need for a central authority. The core of a decentralized platform like blockchain is a consensus layer that allows all participants (called Workers), who properly operate and follow all network protocols and have access to the same state of the distributed ledger, to coordinate their actions and arrive at the same decisions. However, some Workers may be temporarily offline at their own discretion, without any confirmation, or their work may be faulty due to technical circumstances, resulting in unpredictable behavior. The goal of this article is to present an approach for multi-objective optimizing of Byzantine fault tolerance (BFT)-based consensus protocols, to reduce the impact on the network of faulty participants. Two criteria were considered – minimization of the number of sent service messages, and maximization of the mathematical expectation of the number of produced blocks. The result is a method to determine the optimal committee size and distribution of Workers, depending on their total number in the network and the expected proportion of Byzantine faulty nodes. All protocol amendments presented in this work are tested with corresponding simulation models and have demonstrated notable enhancements in the performance of the system and decreased the load on network nodes. These improvements will be implemented to the consensus protocol Gozalandia on the Waterfall platform, enhancing its overall reliability, performance, and security. In addition, the presented optimizing algorithm can be applied to a wide range of consensus protocols in blockchains, where blocks must be signed by randomly selected committees to confirm their validity

Downloads

Download data is not yet available.

Author Biographies

Igor Y. Mazurok, Odessa I. I. Mechnikov National University. 2, Dvoryanskaya Str. Odessa, 65082, Ukraine

PhD (Eng.), Associate Professor of the Department of Optimal Control and Economic Cybernetics Scopus Author ID: 57210121184

Yevhen Y. Leonchyk, Odessa I. I. Mechnikov National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine

PhD. in Physics and Mathematics, Associate Professor of the Department of Mathematical Analysis,  Scopus Author ID: 57192064365 

Sergii S. Grybniak, Odessa National Polytechnic University. 1, Shevchenko Ave. Odessa, 65044, Ukraine

PhD Student in Applied Mathematics and Information Technology

Alisa Y. Vorokhta, Odessa I. I. Mechnikov National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine

Master of Applied Mathematics

Oleksandr S. Nashyvan, Odessa I. I. Mechnikov. National University, 2, Dvoryanskaya Str. Odessa, 65082, Ukraine

Master of Software for Automated Systems

Downloads

Published

2023-04-04

How to Cite

Mazurok, I. Y., Leonchyk, Y. Y. ., Grybniak, S. S. ., Vorokhta, A. Y., & Nashyvan, O. S. (2023). Multi-objective optimization of committee selection for hierarchical Byzantine fault tolerance-based consensus protocols. Herald of Advanced Information Technology, 6(1), 39–53. https://doi.org/10.15276/hait.06.2023.3