An Optimized Scheduling Algorithm for the Multi-channel Hyperledger Fabric

Hyperledger Fabric (Fabric for short), a typical consortium blockchain platform, has released many versions that support different consensus protocols to ensure that the system can withstand faults (such as crashes, network partitions, or network shutdowns). However, if there is a malicious node in the system, Fabric cannot guarantee any behavior of the malicious node. Therefore, when a certain number of nodes are attacked simultaneously, it directly affects the security and efficiency of the entire system. In the face of multi-channel Fabric network architecture, the parallel processing of transactions by node groups linked on different channels significantly improves the throughput of the Fabric network. However, it may also cause system congestion and safety problems. To solve this problem, this paper designs a Lyapunov-based scheduling algorithm for the performance optimization of Fabric. When considering the system's security probability and queue accumulation, we give the maximum consensus verification rate under the minimum security probability guarantee. Finally, we installed the latest stable version v2.0 of Fabric on the cloud server to verify the algorithm's effectiveness.