EBSF: Node Characteristics-Based Block Allocation Plans for Efficient Blockchain Storage

The heavy storage problem has become a key obstacle to the application of blockchain to the actual business environments, because each node needs to keep a complete replica of blockchain data. The data volume grows undesirably large in practice. It prevents the widely used devices, e.g., tablets and mobile phones, to join blockchain systems due to their limited storage and computing resource. Previous work addressed the storage issue by allowing participating nodes to only keep a fraction of the entire transaction set, e.g., sharding. However, existing studies focus on transaction placement with the minimum cross-shard communications. These studies neglect the node characteristics (e.g., storage capacity, cost, and response capability), which impacts the storage performance adversely. In this paper, we propose EBSF, a block storage framework that achieves efficient block storage by constructing a block allocation plan based on node characteristics. Blockchain nodes are organized into committees such that nodes in a committee work together to maintain the entire blockchain data. We formulate the block allocation plan problem that assigns each block to at least one node in a committee. The goal is to minimize the total cost while reaching the threshold of the response capability of each block. We prove the NP-hardness of the problem and propose heuristic algorithms. We also propose two strategies to handle the dynamic scenario of new blocks. Extensive evaluation shows the efficiency and effectiveness of the proposed framework.