Hyunmin Noh;Seunggyu Ji;Yunmin Go;Gi Seok Park;Hwangjun Song
{"title":"Resilient and Fast Block Transmission System for Scalable Hyperledger Fabric Blockchain in Multi-Cloud Environments","authors":"Hyunmin Noh;Seunggyu Ji;Yunmin Go;Gi Seok Park;Hwangjun Song","doi":"10.1109/TNSM.2024.3436049","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a resilient and fast block transmission system for Hyperledger Fabric in multi-cloud environments. The goal of the proposed system is to improve the scalability, transaction throughput, and resilience of Hyperledger Fabric by minimizing the block synchronization time among nodes. To achieve this goal, the proposed system is designed to deliver blocks quickly and reliably to all the participating nodes in time-varying multi-cloud environments. The proposed system includes the delay estimating process with O(N) control message overhead over the P2P network, the effective bandwidth estimating process for block transmission, the Gaussian Mixture Model-based clustering and cluster leader selecting process, and hybrid P2P multicast tree constructing process. In addition, a control message format and delivery process are proposed to efficiently provide hybrid P2P multicast tree and neighbor nodes information to all the participating nodes. And we propose a pull-based local block loss recovery process that can receive lost blocks from multi-node without complicated scheduling using a rateless code. The proposed system is fully implemented by using well-known open sources (e.g., Hyperledger Fabric, Docker, Containernet, and Mininet) and Go/C/Python. Experiment results show that the proposed system can reduce the maximum block arriving time among all the participating nodes by approximately 50%~95% compared to the existing algorithms. This improves not only blockchain transaction per second, but also resilience to various network-layer vulnerabilities and attacks that may occur when the block propagation delay increases.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5118-5134"},"PeriodicalIF":4.7000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10616168/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a resilient and fast block transmission system for Hyperledger Fabric in multi-cloud environments. The goal of the proposed system is to improve the scalability, transaction throughput, and resilience of Hyperledger Fabric by minimizing the block synchronization time among nodes. To achieve this goal, the proposed system is designed to deliver blocks quickly and reliably to all the participating nodes in time-varying multi-cloud environments. The proposed system includes the delay estimating process with O(N) control message overhead over the P2P network, the effective bandwidth estimating process for block transmission, the Gaussian Mixture Model-based clustering and cluster leader selecting process, and hybrid P2P multicast tree constructing process. In addition, a control message format and delivery process are proposed to efficiently provide hybrid P2P multicast tree and neighbor nodes information to all the participating nodes. And we propose a pull-based local block loss recovery process that can receive lost blocks from multi-node without complicated scheduling using a rateless code. The proposed system is fully implemented by using well-known open sources (e.g., Hyperledger Fabric, Docker, Containernet, and Mininet) and Go/C/Python. Experiment results show that the proposed system can reduce the maximum block arriving time among all the participating nodes by approximately 50%~95% compared to the existing algorithms. This improves not only blockchain transaction per second, but also resilience to various network-layer vulnerabilities and attacks that may occur when the block propagation delay increases.
期刊介绍:
IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.