CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain

The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Jing Xiao [verfasserIn] Tao Luo [verfasserIn] Chaoqun Li [verfasserIn] Jie Zhou [verfasserIn] Zhigang Li [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2024

Schlagwörter:	Blockchain Consensus algorithm Consortium blockchain PBFT

Übergeordnetes Werk:	In: Journal of King Saud University: Computer and Information Sciences - Elsevier, 2016, 36(2024), 2, Seite 101957-
Übergeordnetes Werk:	volume:36 ; year:2024 ; number:2 ; pages:101957-

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1016/j.jksuci.2024.101957

Katalog-ID:	DOAJ099731312

Internformat


LEADER	01000naa a22002652 4500
001	DOAJ099731312
003	DE-627
005	20240414091327.0
007	cr uuu---uuuuu
008	240414s2024 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.jksuci.2024.101957 \|2 doi
035			\|a (DE-627)DOAJ099731312
035			\|a (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA75.5-76.95
100	0		\|a Jing Xiao \|e verfasserin \|4 aut
245	1	0	\|a CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
264		1	\|c 2024
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.
650		4	\|a Blockchain
650		4	\|a Consensus algorithm
650		4	\|a Consortium blockchain
650		4	\|a PBFT
653		0	\|a Electronic computers. Computer science
700	0		\|a Tao Luo \|e verfasserin \|4 aut
700	0		\|a Chaoqun Li \|e verfasserin \|4 aut
700	0		\|a Jie Zhou \|e verfasserin \|4 aut
700	0		\|a Zhigang Li \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of King Saud University: Computer and Information Sciences \|d Elsevier, 2016 \|g 36(2024), 2, Seite 101957- \|w (DE-627)746705778 \|w (DE-600)2716720-3 \|x 13191578 \|7 nnns
773	1	8	\|g volume:36 \|g year:2024 \|g number:2 \|g pages:101957-
856	4	0	\|u https://doi.org/10.1016/j.jksuci.2024.101957 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b \|z kostenfrei
856	4	0	\|u http://www.sciencedirect.com/science/article/pii/S1319157824000466 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1319-1578 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_224
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2110
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2232
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2470
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 36 \|j 2024 \|e 2 \|h 101957-

Indexfelder

author_variant	j x jx t l tl c l cl j z jz z l zl
matchkey_str	article:13191578:2024----::ebthgaalbltcnessloihfragsae
hierarchy_sort_str	2024
callnumber-subject-code	QA
publishDate	2024
allfields	10.1016/j.jksuci.2024.101957 doi (DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b DE-627 ger DE-627 rakwb eng QA75.5-76.95 Jing Xiao verfasserin aut CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols. Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science Tao Luo verfasserin aut Chaoqun Li verfasserin aut Jie Zhou verfasserin aut Zhigang Li verfasserin aut In Journal of King Saud University: Computer and Information Sciences Elsevier, 2016 36(2024), 2, Seite 101957- (DE-627)746705778 (DE-600)2716720-3 13191578 nnns volume:36 year:2024 number:2 pages:101957- https://doi.org/10.1016/j.jksuci.2024.101957 kostenfrei https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b kostenfrei http://www.sciencedirect.com/science/article/pii/S1319157824000466 kostenfrei https://doaj.org/toc/1319-1578 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 AR 36 2024 2 101957-
spelling	10.1016/j.jksuci.2024.101957 doi (DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b DE-627 ger DE-627 rakwb eng QA75.5-76.95 Jing Xiao verfasserin aut CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols. Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science Tao Luo verfasserin aut Chaoqun Li verfasserin aut Jie Zhou verfasserin aut Zhigang Li verfasserin aut In Journal of King Saud University: Computer and Information Sciences Elsevier, 2016 36(2024), 2, Seite 101957- (DE-627)746705778 (DE-600)2716720-3 13191578 nnns volume:36 year:2024 number:2 pages:101957- https://doi.org/10.1016/j.jksuci.2024.101957 kostenfrei https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b kostenfrei http://www.sciencedirect.com/science/article/pii/S1319157824000466 kostenfrei https://doaj.org/toc/1319-1578 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 AR 36 2024 2 101957-
allfields_unstemmed	10.1016/j.jksuci.2024.101957 doi (DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b DE-627 ger DE-627 rakwb eng QA75.5-76.95 Jing Xiao verfasserin aut CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols. Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science Tao Luo verfasserin aut Chaoqun Li verfasserin aut Jie Zhou verfasserin aut Zhigang Li verfasserin aut In Journal of King Saud University: Computer and Information Sciences Elsevier, 2016 36(2024), 2, Seite 101957- (DE-627)746705778 (DE-600)2716720-3 13191578 nnns volume:36 year:2024 number:2 pages:101957- https://doi.org/10.1016/j.jksuci.2024.101957 kostenfrei https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b kostenfrei http://www.sciencedirect.com/science/article/pii/S1319157824000466 kostenfrei https://doaj.org/toc/1319-1578 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 AR 36 2024 2 101957-
allfieldsGer	10.1016/j.jksuci.2024.101957 doi (DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b DE-627 ger DE-627 rakwb eng QA75.5-76.95 Jing Xiao verfasserin aut CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols. Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science Tao Luo verfasserin aut Chaoqun Li verfasserin aut Jie Zhou verfasserin aut Zhigang Li verfasserin aut In Journal of King Saud University: Computer and Information Sciences Elsevier, 2016 36(2024), 2, Seite 101957- (DE-627)746705778 (DE-600)2716720-3 13191578 nnns volume:36 year:2024 number:2 pages:101957- https://doi.org/10.1016/j.jksuci.2024.101957 kostenfrei https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b kostenfrei http://www.sciencedirect.com/science/article/pii/S1319157824000466 kostenfrei https://doaj.org/toc/1319-1578 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 AR 36 2024 2 101957-
allfieldsSound	10.1016/j.jksuci.2024.101957 doi (DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b DE-627 ger DE-627 rakwb eng QA75.5-76.95 Jing Xiao verfasserin aut CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols. Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science Tao Luo verfasserin aut Chaoqun Li verfasserin aut Jie Zhou verfasserin aut Zhigang Li verfasserin aut In Journal of King Saud University: Computer and Information Sciences Elsevier, 2016 36(2024), 2, Seite 101957- (DE-627)746705778 (DE-600)2716720-3 13191578 nnns volume:36 year:2024 number:2 pages:101957- https://doi.org/10.1016/j.jksuci.2024.101957 kostenfrei https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b kostenfrei http://www.sciencedirect.com/science/article/pii/S1319157824000466 kostenfrei https://doaj.org/toc/1319-1578 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 AR 36 2024 2 101957-
language	English
source	In Journal of King Saud University: Computer and Information Sciences 36(2024), 2, Seite 101957- volume:36 year:2024 number:2 pages:101957-
sourceStr	In Journal of King Saud University: Computer and Information Sciences 36(2024), 2, Seite 101957- volume:36 year:2024 number:2 pages:101957-
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Blockchain Consensus algorithm Consortium blockchain PBFT Electronic computers. Computer science
isfreeaccess_bool	true
container_title	Journal of King Saud University: Computer and Information Sciences
authorswithroles_txt_mv	Jing Xiao @@aut@@ Tao Luo @@aut@@ Chaoqun Li @@aut@@ Jie Zhou @@aut@@ Zhigang Li @@aut@@
publishDateDaySort_date	2024-01-01T00:00:00Z
hierarchy_top_id	746705778
id	DOAJ099731312
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ099731312</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414091327.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240414s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jksuci.2024.101957</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ099731312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jing Xiao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Blockchain</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consortium blockchain</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PBFT</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tao Luo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chaoqun Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jie Zhou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhigang Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of King Saud University: Computer and Information Sciences</subfield><subfield code="d">Elsevier, 2016</subfield><subfield code="g">36(2024), 2, Seite 101957-</subfield><subfield code="w">(DE-627)746705778</subfield><subfield code="w">(DE-600)2716720-3</subfield><subfield code="x">13191578</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:101957-</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jksuci.2024.101957</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/article/pii/S1319157824000466</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1319-1578</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2024</subfield><subfield code="e">2</subfield><subfield code="h">101957-</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Jing Xiao
spellingShingle	Jing Xiao misc QA75.5-76.95 misc Blockchain misc Consensus algorithm misc Consortium blockchain misc PBFT misc Electronic computers. Computer science CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
authorStr	Jing Xiao
ppnlink_with_tag_str_mv	@@773@@(DE-627)746705778
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	QA75
illustrated	Not Illustrated
issn	13191578
topic_title	QA75.5-76.95 CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain Blockchain Consensus algorithm Consortium blockchain PBFT
topic	misc QA75.5-76.95 misc Blockchain misc Consensus algorithm misc Consortium blockchain misc PBFT misc Electronic computers. Computer science
topic_unstemmed	misc QA75.5-76.95 misc Blockchain misc Consensus algorithm misc Consortium blockchain misc PBFT misc Electronic computers. Computer science
topic_browse	misc QA75.5-76.95 misc Blockchain misc Consensus algorithm misc Consortium blockchain misc PBFT misc Electronic computers. Computer science
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of King Saud University: Computer and Information Sciences
hierarchy_parent_id	746705778
hierarchy_top_title	Journal of King Saud University: Computer and Information Sciences
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)746705778 (DE-600)2716720-3
title	CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
ctrlnum	(DE-627)DOAJ099731312 (DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b
title_full	CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
author_sort	Jing Xiao
journal	Journal of King Saud University: Computer and Information Sciences
journalStr	Journal of King Saud University: Computer and Information Sciences
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2024
contenttype_str_mv	txt
container_start_page	101957
author_browse	Jing Xiao Tao Luo Chaoqun Li Jie Zhou Zhigang Li
container_volume	36
class	QA75.5-76.95
format_se	Elektronische Aufsätze
author-letter	Jing Xiao
doi_str_mv	10.1016/j.jksuci.2024.101957
author2-role	verfasserin
title_sort	ce-pbft: a high availability consensus algorithm for large-scale consortium blockchain
callnumber	QA75.5-76.95
title_auth	CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
abstract	The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.
abstractGer	The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.
abstract_unstemmed	The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700
container_issue	2
title_short	CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain
url	https://doi.org/10.1016/j.jksuci.2024.101957 https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b http://www.sciencedirect.com/science/article/pii/S1319157824000466 https://doaj.org/toc/1319-1578
remote_bool	true
author2	Tao Luo Chaoqun Li Jie Zhou Zhigang Li
author2Str	Tao Luo Chaoqun Li Jie Zhou Zhigang Li
ppnlink	746705778
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1016/j.jksuci.2024.101957
callnumber-a	QA75.5-76.95
up_date	2024-07-04T00:06:27.847Z
_version_	1803604813781401600
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ099731312</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414091327.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240414s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jksuci.2024.101957</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ099731312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ8456fee7fb394c3196413cf82eadb18b</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jing Xiao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The consortium blockchain has been widely applied in various fields such as agricultural product traceability, supply chain management, and logistics transportation. As an indispensable component of a consortium blockchain, the consensus algorithm ensures the consistency and trustworthiness of each node in the network. However, existing consensus algorithms in large-scale consortium blockchain scenarios suffer from low system throughput and high latency due to the complexity of communication processes, rendering them impractical for real-world use. To address these issues, this paper proposes a novel consensus algorithm called credit evaluation-based practical Byzantine fault tolerance (CE-PBFT). This algorithm designs a new node credit evaluation model that considers node completion rate, consensus decay, and node behavior. It effectively measures and reflects the specific reliability status of nodes during system operation, thereby enhancing system reliability and security. Additionally, the paper introduces the innovative use of decision tree algorithms to analyze network node behavior and simplifies the existing consensus protocol. Nodes are categorized as excellent, good, ordinary, or poor based on the classification results, and non-Byzantine nodes are dynamically selected accordingly. This greatly improves the overall efficiency of the system. The performance of CE-PBFT is validated through experiments and compared with PBFT, G-PBFT, RBFT, WBFT and PPoR. Experimental results demonstrate that in large-scale consortium scenarios, CE-PBFT significantly improves system throughput, effectively reduces transaction latency and communication overhead, and outperforms the compared protocols.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Blockchain</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consortium blockchain</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PBFT</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tao Luo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chaoqun Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jie Zhou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhigang Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of King Saud University: Computer and Information Sciences</subfield><subfield code="d">Elsevier, 2016</subfield><subfield code="g">36(2024), 2, Seite 101957-</subfield><subfield code="w">(DE-627)746705778</subfield><subfield code="w">(DE-600)2716720-3</subfield><subfield code="x">13191578</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:101957-</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jksuci.2024.101957</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/8456fee7fb394c3196413cf82eadb18b</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/article/pii/S1319157824000466</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1319-1578</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2024</subfield><subfield code="e">2</subfield><subfield code="h">101957-</subfield></datafield></record></collection>
score	7.400936

Nicht das Richtige dabei?

Schreiben Sie uns!

CE-PBFT: A high availability consensus algorithm for large-scale consortium blockchain

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?