Standard
Testing and Comparative Analysis of the F-BFT-based DLT Solution. / Bogdanov, Alexander; Shchegoleva, Nadezhda; Korkhov, Vladimir; Khvatov, Valery; Zaynalov, Nodir; Kiyamov, Jasur; Dik, Aleksandr; Faradzhov, Anar.
Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings. ed. / Osvaldo Gervasi; Beniamino Murgante; Sanjay Misra; Chiara Garau; Ivan Blečić; David Taniar; Bernady O. Apduhan; Ana Maria Rocha; Eufemia Tarantino; Carmelo Maria Torre. Cham : Springer Nature, 2021. p. 31-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12952 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Bogdanov, A, Shchegoleva, N, Korkhov, V, Khvatov, V, Zaynalov, N
, Kiyamov, J, Dik, A
& Faradzhov, A 2021,
Testing and Comparative Analysis of the F-BFT-based DLT Solution. in O Gervasi, B Murgante, S Misra, C Garau, I Blečić, D Taniar, BO Apduhan, AM Rocha, E Tarantino & CM Torre (eds),
Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12952 LNCS, Springer Nature, Cham, pp. 31-41, 21st International Conference on Computational Science and Its Applications, ICCSA 2021, Virtual, Online, Italy,
13/09/21.
https://doi.org/10.1007/978-3-030-86973-1_3
APA
Bogdanov, A., Shchegoleva, N., Korkhov, V., Khvatov, V., Zaynalov, N.
, Kiyamov, J., Dik, A.
, & Faradzhov, A. (2021).
Testing and Comparative Analysis of the F-BFT-based DLT Solution. In O. Gervasi, B. Murgante, S. Misra, C. Garau, I. Blečić, D. Taniar, B. O. Apduhan, A. M. Rocha, E. Tarantino, & C. M. Torre (Eds.),
Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings (pp. 31-41). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12952 LNCS). Springer Nature.
https://doi.org/10.1007/978-3-030-86973-1_3
Vancouver
Bogdanov A, Shchegoleva N, Korkhov V, Khvatov V, Zaynalov N
, Kiyamov J et al.
Testing and Comparative Analysis of the F-BFT-based DLT Solution. In Gervasi O, Murgante B, Misra S, Garau C, Blečić I, Taniar D, Apduhan BO, Rocha AM, Tarantino E, Torre CM, editors, Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings. Cham: Springer Nature. 2021. p. 31-41. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
https://doi.org/10.1007/978-3-030-86973-1_3
Author
Bogdanov, Alexander ; Shchegoleva, Nadezhda ; Korkhov, Vladimir ; Khvatov, Valery ; Zaynalov, Nodir
; Kiyamov, Jasur ; Dik, Aleksandr
; Faradzhov, Anar. /
Testing and Comparative Analysis of the F-BFT-based DLT Solution. Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings. editor / Osvaldo Gervasi ; Beniamino Murgante ; Sanjay Misra ; Chiara Garau ; Ivan Blečić ; David Taniar ; Bernady O. Apduhan ; Ana Maria Rocha ; Eufemia Tarantino ; Carmelo Maria Torre. Cham : Springer Nature, 2021. pp. 31-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inproceedings{db51788bc20749d2b2d887e2a90ee9f2,
title = "Testing and Comparative Analysis of the F-BFT-based DLT Solution",
abstract = "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.",
keywords = "Blockchain, Distributed ledger technology, Smart contracts",
author = "Alexander Bogdanov and Nadezhda Shchegoleva and Vladimir Korkhov and Valery Khvatov and Nodir Zaynalov and Jasur Kiyamov and Aleksandr Dik and Anar Faradzhov",
year = "2021",
month = sep,
day = "11",
doi = "10.1007/978-3-030-86973-1_3",
language = "English",
isbn = "9783030869724",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "31--41",
editor = "Osvaldo Gervasi and Beniamino Murgante and Sanjay Misra and Chiara Garau and Ivan Ble{\v c}i{\'c} and David Taniar and Apduhan, {Bernady O.} and Rocha, {Ana Maria} and Eufemia Tarantino and Torre, {Carmelo Maria}",
booktitle = "Computational Science and Its Applications – ICCSA 2021 - 21st International Conference, Proceedings",
address = "Germany",
note = "21st International Conference on Computational Science and Its Applications, ICCSA 2021, ICCSA 2021 ; Conference date: 13-09-2021 Through 16-09-2021",
}
RIS
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 -
