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...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Hindawi-Wiley
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/7a77d79c5cfd4e5e8fd7682c1ab186dd |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sea el primero en dejar un comentario!