Data of An Optimal Scheduling Algorithm Considering the Worst Transactions Delay for Multi-channel Hyperledger Fabric Network

As the most popular consortium blockchain platform, Hyperledger Fabric (Fabric for short) has re-leased multiple versions that support different consensus protocols to address the risks faced in current and future network transactions. For example, Fabric v1.4 and v2.0 use Kafka and Raft mechanisms to complete consensus to ensure that the system can withstand failures such as crashes, network partitions, or network shutdowns. For a multi-channel Fabric network architecture, the system structure cannot guarantee any behavior of malicious nodes. Complex cooperation between peer groups on different channels can greatly affect the security and efficiency of the entire network architecture, which is challenging to estimate and optimize. To address the challenge, we design a drift plus penalty algorithm and the worst transaction delay algorithm based on random peer-node scheduling using the Lyapunov optimization framework. The drift plus penalty algorithm ensures the system’s stability and gives the maximum transaction processing rate under the minimum security probability. After the worst transaction delay algorithm discards the transactions waiting too long, the optimal scheduling is given considering the Fabric system’s security probability and queue accumulation. We installed the latest stable version v2.0 of Fabric on the cloud server to simulate the implementation of the two proposed algorithms, and the evaluation results verify their effectiveness.