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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Hindawi-Wiley
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/7a77d79c5cfd4e5e8fd7682c1ab186dd |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|