Skip to content
Open access

LB-Louvain: Balancing Transaction Locality and Shard Load in Account-Based State Sharding

Sep 2026 · Applied Sciences · Vol 16, pp. 8959 · 0 citations · 16 references

TL;DR

LB-Louvain is presented, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement, and component-wise ablation confirms complementary roles for load-aware assignment and boundary refinement.

Abstract

Account-based state sharding improves blockchain parallelism by distributing account states and transaction execution across physical shards, but effective placement must preserve transaction locality without concentrating processing demand on a small number of shards. This paper presents LB-Louvain, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement. In controlled BlockEmulator experiments using 300,000 replayed Ethereum transactions and five repeated system runs per configuration, relative to CLPA, the complete LB-Louvain pipeline reduces the mean cross-shard transaction ratio by approximately 2.1%, increases active throughput by approximately 19.7%, and reduces average confirmation latency by approximately 9.4%. Component-wise ablation confirms complementary roles for load-aware assignment and boundary refinement. The evaluated behavior remains stable over β∈[1,4], while partition-only profiling keeps the measured partition computation below 100 ms across the tested 50,000–300,000 transaction prefixes and 4–24 physical shards. An auxiliary migration experiment further shows that Fine-Grained activation reduces the observed migration-deferred set by approximately 39.8% relative to Full Locking while maintaining comparable throughput and confirmation latency. Broader archived experiments with Monoxide and CLPA are retained separately from the controlled revision results.

Read PDF

Similar papers

Book Open access Sep 2026

BigBFT: Scaling BFT without Compromising Fault Tolerance via State Sharding

Scalability remains a major challenge for Byzantine fault tolerance (BFT) systems, whose throughput is often limited by sequential transaction processing at each node. Prior work has attempted to address this challenge by full sharding or by replacing total ordering with serializable concurrent execution, but these app...

Guang-Da Sun, Jialin Li · 0 citations
Preprint Sep 2026

Flamingo: On Load Balancing in DAG-based Consensus Protocols

Distributed data management systems deployed in untrusted environments rely on Byzantine Fault-Tolerant (BFT) consensus protocols to tolerate malicious failures. DAG-based BFT protocols improve throughput by letting validators disseminate transactions concurrently and by scaling execution across multiple workers. Howev...

Zhen Ping Khor, Garvit Gupta, Mohammad Javad Amiri et al. · 0 citations
Open access Sep 2026

A Mathematical Framework for Performance Multi-Objective Optimization of Blockchain Sharding with MongoDB Distributed Storage

Blockchain sharding partitions network state and transaction load across multiple parallel subchains (shards) in order to overcome the throughput ceiling of monolithic consensus protocols. In this study, we develop a mathematical performance model for blockchain sharding in which the underlying persistence layer is rea...

Divyesh Bhatnagar, Anil Gupta · 0 citations
2026

Mecury: Integrating Account Allocation and Scheduling for Enhancing Blockchain Sharding Performance

Existing sharded blockchain systems suffer from excessive cross-shard communication overhead and workload imbalance. Although state-of-the-art account allocation schemes partially alleviate these problems, they still fail to simultaneously achieve effective cross-shard transaction reduction and balanced workload distri...

Zitong Zhang, Hao-Xiang Han, Chao-Ming Shi et al. · 0 citations
Preprint Sep 2026

Lantern: Finding Committable Transactions via Back-Propagation on DAGs

Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for...

Deng-Long Li, Gerui Wang, Tian Guan et al. · 0 citations
Book Open access Sep 2026

MiTDM: Eliminating False Conflicts in Scalable MVCC in Disaggregated Memory

MiTDM introduces a hierarchical block version chain that combines the benefits of array and chained structures, supporting dynamic version expansion while maintaining low-latency access, and achieves up to 80.1% higher throughput compared to FaRMV2 and 42.7% higher than Motor.

Ao-Xin Wei, Jin-Tian Wu, Jian Zhou et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.