Stable Blockchain Sharding under Adversarial Transaction Generation
arxiv(2024)
摘要
Sharding is used to improve the scalability and performance of blockchain
systems. We investigate the stability of blockchain sharding, where
transactions are continuously generated by an adversarial model. The system
consists of n processing nodes that are divided into s shards. Following
the paradigm of classical adversarial queuing theory, transactions are
continuously received at injection rate ρ≤ 1 and burstiness b > 0.
We give an absolute upper bound max{2/k+1, 2/⌊√(2s)⌋} on the maximum injection rate for which
any scheduler could guarantee bounded queues and latency of transactions, where
k is the number of shards that each transaction accesses. We next give a
basic distributed scheduling algorithm for uniform systems where shards are
equally close to each other. To guarantee stability, the injection rate is
limited to ρ≤max{1/18k, 1/⌈ 18 √(s)⌉}. We then provide a fully distributed scheduling algorithm for non-uniform
systems where shards are arbitrarily far from each other. By using a
hierarchical clustering of the shards, stability is guaranteed with injection
rate ρ≤1/c_1d log^2 s·max{1/k,
1/√(s)}, where d is the worst distance of any transaction to
the shards it will access, and c_1 is some positive constant. We also conduct
simulations to evaluate the algorithms and measure the average queue sizes and
latency throughout the system. To our knowledge, this is the first adversarial
stability analysis of sharded blockchain systems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要