TY - GEN
T1 - PrestigeBFT
T2 - 40th IEEE International Conference on Data Engineering, ICDE 2024
AU - Zhang, Gengrui
AU - Pan, Fei
AU - Tijanic, Sofia
AU - Jacobsen, Hans Arno
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Passive view-change protocols are widely employed in BFT algorithms; however, they present the risks of selecting unavailable or slow servers as leaders. To tackle these challenges, we propose PrestigeBFT, a novel BFT consensus algorithm that incorporates an active view-change protocol with reputation mechanisms. PrestigeBFT evaluates a server's reputation based on its past behavior and elects more reputable servers as leaders. Our reputation mechanism incentivizes protocol-abiding behavior while penalizing faulty servers by imposing computational work. PrestigeBFT significantly enhances system availability and efficiency by avoiding unavailable or slow servers being assigned as leaders. Under normal operation, PrestigeBFT achieves 5× higher throughput than the baseline that uses passive view-change protocols. In addition, PrestigeBFT's throughput remains unaffected under benign faults and witnesses only a 24% drop under a variety of Byzantine faults, whereas the baseline throughput drops by 62% and 69%, respectively. In the long run, while the baseline's availability struggles at 37%, PrestigeBFT progressively improves its availability to over 90%.
AB - Passive view-change protocols are widely employed in BFT algorithms; however, they present the risks of selecting unavailable or slow servers as leaders. To tackle these challenges, we propose PrestigeBFT, a novel BFT consensus algorithm that incorporates an active view-change protocol with reputation mechanisms. PrestigeBFT evaluates a server's reputation based on its past behavior and elects more reputable servers as leaders. Our reputation mechanism incentivizes protocol-abiding behavior while penalizing faulty servers by imposing computational work. PrestigeBFT significantly enhances system availability and efficiency by avoiding unavailable or slow servers being assigned as leaders. Under normal operation, PrestigeBFT achieves 5× higher throughput than the baseline that uses passive view-change protocols. In addition, PrestigeBFT's throughput remains unaffected under benign faults and witnesses only a 24% drop under a variety of Byzantine faults, whereas the baseline throughput drops by 62% and 69%, respectively. In the long run, while the baseline's availability struggles at 37%, PrestigeBFT progressively improves its availability to over 90%.
KW - Byzantine fault tolerance
KW - consensus protocols
UR - http://www.scopus.com/inward/record.url?scp=85184139577&partnerID=8YFLogxK
U2 - 10.1109/ICDE60146.2024.00156
DO - 10.1109/ICDE60146.2024.00156
M3 - Conference contribution
AN - SCOPUS:85184139577
T3 - Proceedings - International Conference on Data Engineering
SP - 1930
EP - 1943
BT - Proceedings - 2024 IEEE 40th International Conference on Data Engineering, ICDE 2024
PB - IEEE Computer Society
Y2 - 13 May 2024 through 17 May 2024
ER -