Loading [a11y]/accessibility-menu.js
Scheduling Most Valuable Committees for the Sharded Blockchain | IEEE Journals & Magazine | IEEE Xplore

Scheduling Most Valuable Committees for the Sharded Blockchain


Abstract:

In a sharded blockchain, transactions are processed by a number of parallel committees. Thus, the transaction throughput can be largely boosted. A problem is that some gr...Show More

Abstract:

In a sharded blockchain, transactions are processed by a number of parallel committees. Thus, the transaction throughput can be largely boosted. A problem is that some groups of blockchain nodes consume large latency to form committees at the beginning of each epoch. Moreover, the heterogeneous processing capabilities of different committees also result in imbalanced consensus latency. Such imbalanced two-phase latency brings a large cumulative age to the transactions pending in transaction pool. Consequently, the blockchain throughput can be significantly degraded. We believe that a good committee-scheduling strategy can reduce the cumulative age of transactions, and thus benefit the throughput. However, we have not yet found a committee-scheduling mechanism that works for accelerating block formation in the context of blockchain sharding. To this end, this paper studies a fine-balanced tradeoff between the transactions’ throughput and their cumulative age in a large-scale sharded blockchain. We formulate this tradeoff as a utility-maximization problem, which is proved NP-hard. To solve this problem, we propose an online distributed Stochastic-Exploration (SE) algorithm, which guarantees a near-optimal system utility. We then rigorously analyze three theoretical properties of the proposed algorithm, including the theoretical convergence time, the probability of committees’ failure due to Sybil attacks, as well as the performance perturbation brought by committees’ offline events. Finally, we evaluate the proposed algorithm using the dataset of real-world blockchain transactions. The simulation results demonstrate that the proposed SE algorithm outperforms other baselines in terms of system utility, the valuable degree of yielded solutions, latency, and throughput performance.
Published in: IEEE/ACM Transactions on Networking ( Volume: 31, Issue: 6, December 2023)
Page(s): 3284 - 3299
Date of Publication: 31 May 2023

ISSN Information:

Funding Agency:


I. Introduction

The classical Byzantine consensus protocol, e.g., the Nakamoto consensus [1] adopted by Bitcoin, requires miners to generate new blocks by solving a hash-based puzzle. When one of the miners calculates a nonce value that fits the required difficulty, a new block is generated. Through altering the difficulty parameter, Bitcoin maintains a stable rate of block generation. However, such Proof-of-Work (PoW) protocol does not scale well on the transaction throughput. Thus, Luu et al. [2] proposed a new distributed consensus protocol, called Elastico, for the permissionless blockchains. The key idea of Elastico is to partition the blockchain network into smaller committees. Each committee consists of a group of miners, who collaboratively process a disjoint set of transactions. In this paper, we call the set of disjoint transactions a shard.

Contact IEEE to Subscribe

References

References is not available for this document.