Improve PBFT Based on Hash Ring

Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR-PBFT algorithm is proposed. First, the HR-PBFT algorithm uses a hash...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang Zhong, Xiandong Zheng, Wenlong Feng, Mengxing Huang, Siling Feng
Formato:	article
Lenguaje:	EN
Publicado:	Hindawi-Wiley 2021
Materias:	Technology T Telecommunication TK5101-6720
Acceso en línea:	https://doaj.org/article/7a77d79c5cfd4e5e8fd7682c1ab186dd
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:7a77d79c5cfd4e5e8fd7682c1ab186dd
record_format	dspace
spelling	oai:doaj.org-article:7a77d79c5cfd4e5e8fd7682c1ab186dd2021-11-22T01:10:57ZImprove PBFT Based on Hash Ring1530-867710.1155/2021/7327372https://doaj.org/article/7a77d79c5cfd4e5e8fd7682c1ab186dd2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/7327372https://doaj.org/toc/1530-8677Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR-PBFT algorithm is proposed. First, the HR-PBFT algorithm uses a hash ring to group nodes, which ensures the randomness and fairness of the grouping. Then, a dual-view mechanism is used in the consensus process, where the first layer node maintains the primary view and the second layer node maintains the secondary view to ensure the proper operation of the algorithm. Finally, the Byzantine node determination mechanism is introduced to evaluate the node status according to the node behavior in the consensus process, improve the reliability of primary node selection, and reduce the frequency of view changes. The experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused by the increase in the number of nodes in the network and prevent frequent view changes.Wang ZhongXiandong ZhengWenlong FengMengxing HuangSiling FengHindawi-WileyarticleTechnologyTTelecommunicationTK5101-6720ENWireless Communications and Mobile Computing, Vol 2021 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Technology T Telecommunication TK5101-6720
spellingShingle	Technology T Telecommunication TK5101-6720 Wang Zhong Xiandong Zheng Wenlong Feng Mengxing Huang Siling Feng Improve PBFT Based on Hash Ring
description	Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR-PBFT algorithm is proposed. First, the HR-PBFT algorithm uses a hash ring to group nodes, which ensures the randomness and fairness of the grouping. Then, a dual-view mechanism is used in the consensus process, where the first layer node maintains the primary view and the second layer node maintains the secondary view to ensure the proper operation of the algorithm. Finally, the Byzantine node determination mechanism is introduced to evaluate the node status according to the node behavior in the consensus process, improve the reliability of primary node selection, and reduce the frequency of view changes. The experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused by the increase in the number of nodes in the network and prevent frequent view changes.
format	article
author	Wang Zhong Xiandong Zheng Wenlong Feng Mengxing Huang Siling Feng
author_facet	Wang Zhong Xiandong Zheng Wenlong Feng Mengxing Huang Siling Feng
author_sort	Wang Zhong
title	Improve PBFT Based on Hash Ring
title_short	Improve PBFT Based on Hash Ring
title_full	Improve PBFT Based on Hash Ring
title_fullStr	Improve PBFT Based on Hash Ring
title_full_unstemmed	Improve PBFT Based on Hash Ring
title_sort	improve pbft based on hash ring
publisher	Hindawi-Wiley
publishDate	2021
url	https://doaj.org/article/7a77d79c5cfd4e5e8fd7682c1ab186dd
work_keys_str_mv	AT wangzhong improvepbftbasedonhashring AT xiandongzheng improvepbftbasedonhashring AT wenlongfeng improvepbftbasedonhashring AT mengxinghuang improvepbftbasedonhashring AT silingfeng improvepbftbasedonhashring
_version_	1718418346769121280

Improve PBFT Based on Hash Ring

Ejemplares similares