Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Evaluation and Comparative Analysis of Scalability and Fault Tolerance for Practical Byzantine Fault Tolerant based Blockchain

프랙티컬 비잔틴 장애 허용 기반 블록체인의 확장성과 내결함성 평가 및 비교분석

  • Lee, Eun-Young (Department of Future Convergence Technology Engineering, Sungshin Women's University) ;
  • Kim, Nam-Ryeong (Department of Convergence Security Engineering, Sungshin Women's University) ;
  • Han, Chae-Rim (Department of Convergence Security Engineering, Sungshin Women's University) ;
  • Lee, Il-Gu (Department of Future Convergence Technology Engineering, Sungshin Women's University)
  • Received : 2021.11.29
  • Accepted : 2022.01.06
  • Published : 2022.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

PBFT(Practical Byzantine Fault Tolerant)는 분산 네트워크 환경에서 비의도적·의도적 결함을 해결하여 합의를 달성할 수 있는 합의 알고리즘으로 높은 성능과 절대적 최종성을 보장할 수 있다. 하지만 합의 과정에서 반복적으로 발생하는 메시지 브로드캐스팅으로 인해 네트워크의 규모가 증가할수록 네트워크 부하도 커진다. PBFT 알고리즘의 특성상 소규모·프라이빗 블록체인에는 적합하지만, 대규모·퍼블릭 블록체인에 적용하기엔 한계가 있다. PBFT는 블록체인 네트워크의 성능에 영향을 끼치기 때문에 산업에서는 PBFT가 제품 및 서비스에 적합한지 테스트할 수 있어야 하며, 학계에서는 PBFT 성능 향상 연구를 위한 통일된 평가지표와 평가 기술이 필요하다. 본 논문에서는 PBFT 계열 합의 알고리즘을 평가할 수 있는 정량적 지표와 평가 프레임워크에 대해 연구한다. 또한 제안한 PBFT 평가 프레임워크를 사용하여 PBFT의 처리량, 지연시간, 내결함성을 평가한다.

Keywords

Acknowledgement

This work was partly supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2020R1F 1A1061107) and Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea Government (MOTIE) (P0008703, The Competency Development Program for Industry Specialist).

References

  1. D. Tapscot and A. Tapscot, Blockchain revolution: how the technology behind bitcoin is changing money, business, and the world, Penguin, 2016.
  2. J. C. Yim, H. K. Yoo, J. K. Kwak, and S. M. Kim, "Blockchain and Consensus Algorithm," Electronics and Telecommunications Trends, vol. 33, no. 1, pp. 45-56, Feb. 2018. https://doi.org/10.22648/ETRI.2018.J.330105
  3. M. Castro and B. Liskov, "Practical byzantine fault tolerance," OSDI, vol. 99, no. 1999, pp. 173-186, Feb. 1999.
  4. H. Kim, J. Yun, Y. Goh, and J. M. Chung, "Adaptive Consensus Bound PBFT Algorithm Design for Eliminating Interface Factors of Blockchain Consensus," Journal of Internet Computing and Services, vol. 21, no. 1, pp. 17-31, Feb. 2020. https://doi.org/10.7472/JKSII.2020.21.1.17
  5. Y. Yang, "Linbft: Linear-communication byzantine fault tolerance for public blockchains," arXiv preprint arXiv: 1807.01829, Jul. 2018.
  6. A. Harshavardhan, T. Vijayakumar, and S. R. Mugunthan, "Blockchain Technology in Cloud Computing to Overcome Security Vulnerabilities," the Second International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud), Palladam, pp. 1279-1286, Aug. 2018.
  7. G. Xu, Y. Liu, J. Xing, T. Luo, Y. Gu, S. Liu, X. Zheng, and A. V. Vasilakos, "SG-PBFT: a Secure and Highly Efficient Blockchain PBFT Consensus Algorithm for Internet of Vehicles," arXiv preprint arXiv:2101.01306, Jan. 2018.
  8. H. S. Heo and D. Y. Seo, "A Study on Scalable PBFT Consensus Algorithm based on Blockchain Cluster," The Journal of The Institute of Internet, Broadcasting and Communication, vol. 20, no. 2, pp. 45-53, Apr. 2020. https://doi.org/10.7236/JIIBC.2020.20.2.45
  9. W. Li, C. Feng, L. Zhang, H. Xu, B. Cao, and M. A. Imran, "A scalable mult-layer PBFT consensus for blockchain," IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 5, pp. 1146-1160, Dec. 2020.
  10. M. Alharby and A. V. Moorsel, "Blocksim: a simulation framework for blockchain systems," ACM SIGMETRICS Performance Evaluation Review, vol. 46, no. 3, pp. 135-138, 2019. https://doi.org/10.1145/3308897.3308956
  11. M. Alharby and A. V. Moorsel, "Blocksim: An extensible simulation tool for blockchain systems," Frontiers in Blockchain, vol. 3, pp. 28, Jun. 2020. https://doi.org/10.3389/fbloc.2020.00028
  12. Github. bip-0141.mediawiki [Internet]. Available: https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki#cite_note-3.
  13. Blockchain.com. Average Block Size(MB) [Internet]. Available: https://www.blockchain.com/charts/avg-block-size.