TY - GEN

T1 - Testing and Comparative Analysis of the F-BFT-based DLT Solution

AU - Bogdanov, Alexander

AU - Shchegoleva, Nadezhda

AU - Korkhov, Vladimir

AU - Khvatov, Valery

AU - Zaynalov, Nodir

AU - Kiyamov, Jasur

AU - Dik, Aleksandr

AU - Faradzhov, Anar

PY - 2021/9/11

Y1 - 2021/9/11

N2 - Consensus algorithm is a crucial part of a blockchain system. In particular, in any blockchain-based Distributed Ledger Technology (DLT) solution the consensus algorithm plays the key role in maintaining consistency of databases. The choice of consensus type during design of the distributed system will inevitably and significantly affect such characteristics as throughput and network load what in turn can impose serious restrictions on functionality or applicability of the whole system. In this research paper we overview the most commonly used algorithms and approaches, the highest attention is paid to those based on the solution of the Byzantine Fault Tolerance problem (BFT). One of the best-known algorithms of that type is the Practical Byzantine Fault Tolerance (PBFT) which has become the basis and the benchmark for a plenty of different BFT algorithms. The focus of this paper is sharpened on a particular PBFT modification known as the Federalized BFT. The aim of this study is to investigate a particular F-BFT-based DLT solution, to compare it with the other systems of that type and to determine areas of its applicability.

AB - Consensus algorithm is a crucial part of a blockchain system. In particular, in any blockchain-based Distributed Ledger Technology (DLT) solution the consensus algorithm plays the key role in maintaining consistency of databases. The choice of consensus type during design of the distributed system will inevitably and significantly affect such characteristics as throughput and network load what in turn can impose serious restrictions on functionality or applicability of the whole system. In this research paper we overview the most commonly used algorithms and approaches, the highest attention is paid to those based on the solution of the Byzantine Fault Tolerance problem (BFT). One of the best-known algorithms of that type is the Practical Byzantine Fault Tolerance (PBFT) which has become the basis and the benchmark for a plenty of different BFT algorithms. The focus of this paper is sharpened on a particular PBFT modification known as the Federalized BFT. The aim of this study is to investigate a particular F-BFT-based DLT solution, to compare it with the other systems of that type and to determine areas of its applicability.

KW - Blockchain

KW - Distributed ledger technology

KW - Smart contracts

UR - https://link.springer.com/chapter/10.1007/978-3-030-86973-1_3

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

U2 - 10.1007/978-3-030-86973-1_3

DO - 10.1007/978-3-030-86973-1_3

M3 - Conference contribution

SN - 9783030869724

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 31

EP - 41

BT - Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings

A2 - Gervasi, Osvaldo

A2 - Murgante, Beniamino

A2 - Misra, Sanjay

A2 - Garau, Chiara

A2 - Blečić, Ivan

A2 - Taniar, David

A2 - Apduhan, Bernady O.

A2 - Rocha, Ana Maria

A2 - Tarantino, Eufemia

A2 - Torre, Carmelo Maria

PB - Springer Nature

CY - Cham

T2 - 21st International Conference on Computational Science and Its Applications, ICCSA 2021

Y2 - 13 September 2021 through 16 September 2021

ER -