SSChain: A full sharding protocol for public blockchain without data migration overhead

被引:55
作者
Chen, Huan [1 ]
Wang, Yijie [1 ]
机构
[1] Natl Univ Def Technol Changsha, Sci & Technol Parallel & Distributed Proc Lab, Coll Comp, Changsha 410073, Hunan, Peoples R China
基金
国家教育部科学基金资助; 中国国家自然科学基金;
关键词
Blockchain; Scalability; State sharding; Transaction sharding; INTERNET;
D O I
10.1016/j.pmcj.2019.101055
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain, known as distributed ledger technology, suffers from the scalability problem. A major approach to overcoming this limitation is using sharding, which divides the network into multiple smaller groups, called shards, these shards can work in parallel on disjoint transactions and maintain disjoint ledgers. Existing sharding-based protocols rely on reshuffling scheme to maintain security, however, since each shard only maintains a disjoint ledger, reshuffling the network will cause huge data migration. In this work, we propose SSChain, a novel non-reshuffling structure that supports both transaction sharding and state sharding. Our empirical evaluations suggest that SSChain can process more than 6,500 TPS in a network of 1,800 nodes without any data migration overhead. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 34 条
[1]  
Al-Bassam M., ARXIV170803778
[2]  
[Anonymous], 2016, CUST DIG ID LEV BLOC
[3]  
[Anonymous], Enabling blockchain innovations with pegged sidechains
[4]  
[Anonymous], 2016, DCCL
[5]  
Buterin V., 2013, CISC VIS NETW IND GL
[6]  
Buterin V., 2015, NOTES SCALABLE BLOCK
[7]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[8]   Spanner: Google's Globally Distributed Database [J].
Corbett, James C. ;
Dean, Jeffrey ;
Epstein, Michael ;
Fikes, Andrew ;
Frost, Christopher ;
Furman, J. J. ;
Ghemawat, Sanjay ;
Gubarev, Andrey ;
Heiser, Christopher ;
Hochschild, Peter ;
Hsieh, Wilson ;
Kanthak, Sebastian ;
Kogan, Eugene ;
Li, Hongyi ;
Lloyd, Alexander ;
Melnik, Sergey ;
Mwaura, David ;
Nagle, David ;
Quinlan, Sean ;
Rao, Rajesh ;
Rolig, Lindsay ;
Saito, Yasushi ;
Szymaniak, Michal ;
Taylor, Christopher ;
Wang, Ruth ;
Woodford, Dale .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2013, 31 (03)
[9]   Efficient Sparse Merkle Trees Caching Strategies and Secure (Non-)Membership Proofs [J].
Dahlberg, Rasmus ;
Pulls, Tobias ;
Peeters, Roel .
SECURE IT SYSTEMS, NORDSEC 2016, 2016, 10014 :199-215
[10]  
Danezis G., 23 ANN NETW DISTR SY