GARET: improving throughput using gas consumption-aware relocation in Ethereum sharding environments

Woo, Sangyeon; Song, Je Seon; Kim, Sanghyeok; Kim, Young-Jae; Park, Sungyoung

doi:10.1007/s10586-020-03087-1

Cited by 10 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we force the load imbalance to be smaller/equal to 0.03, which is the average cost of an Ethereum transaction, Ethereum needs 22 iterations and Binance 36. Considering much shorter epochs and 20 shards, literature [29] reports initial load imbalances up to 65% for sharded simulations of Ethereum. Using a similar initial Ethereum load imbalance for 10 shards, an unbalance < 1 is achieved after 10 iterations and 52 iterations for an unbalance smaller/equal to 0.03.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains

Toulouse,

Dai,

Nguyen

2022

Preprint

View full text Add to dashboard Cite

Public blockchains are decentralized networks where each participating node executes the same decision-making process. This form of decentralization does not scale well because the same data are stored on each network node, and because all nodes must validate each transaction prior to their confirmation. One solution approach decomposes the nodes of a blockchain network into subsets called "shards", each shard processing and storing disjoint sets of transactions in parallel. To fully benefit from the parallelism of sharded blockchains, the processing load of shards must be evenly distributed. However, the problem of computing balanced workloads is theoretically hard and further complicated in practice as transaction processing times are unknown prior to be assigned to shards. In this paper we introduce a dynamic workload-balancing algorithm where the allocation strategy of transactions to shards is periodically adapted based on the recent workload history of shards. Our algorithm is an adaptation to sharded blockchains of a consensus-based load-balancing algorithm. It is a fully distributed algorithm inline with network based applications such as blockchains. Some preliminary results are reported based on simulations that shard transactions of three well-known blockchain platforms.

show abstract

Section: Discussionmentioning

confidence: 99%

“…We are only aware of three recent publications addressing the issue of loadbalancing in sharded blockchains [13,18,29]. All these papers propose centralized algorithms to periodically balance the workload of each shard.…”

Section: Introductionmentioning

confidence: 99%

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains

Toulouse,

Dai,

Nguyen

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In consequence, the network transaction throughput is affected and becomes low. To solve this problem, Woo et al [75] proposed a heuristic algorithm named GARET, which is a gas consumption-aware relocation mechanism for improving throughput in sharding-based Ethereum environments. In particular, the proposed GARET can relocate transaction workloads of each shard according to the gas consumption.…”

Section: Theories To Improving the Performance Of Blockchainsmentioning

confidence: 99%

“…[74] Prism Authors proposed a new blockchain protocol, i.e., Prism, aiming to achieve a scalable throughput with a full security of bitcoin. [75] GARET Authors proposed a gas consumption-aware relocation mechanism for improving throughput in sharding-based Ethereum.…”

Section: Storage Efficiencymentioning

confidence: 99%

A Survey of State-of-the-Art on Blockchains: Theories, Modelings, and Tools

Huang,

Kong,

Zhou

et al. 2020

Preprint

View full text Add to dashboard Cite

To draw a roadmap of current research activities of the blockchain community, we first conduct a brief overview of state-of-theart blockchain surveys published in the recent 5 years. We found that those surveys are basically studying the blockchain-based applications, such as blockchain-assisted Internet of Things (IoT), business applications, security-enabled solutions, and many other applications in diverse fields. However, we think that a comprehensive survey towards the essentials of blockchains by exploiting the state-of-the-art theoretical modelings, analytic models, and useful experiment tools is still missing. To fill this gap, we perform a thorough survey by identifying and classifying the most recent high-quality research outputs that are closely related to the theoretical findings and essential mechanisms of blockchain systems and networks. Several promising open issues are also summarized finally for future research directions. We wish this survey can serve as a useful guideline for researchers, engineers, and educators about the cutting-edge development of blockchains in the perspectives of theories, modelings, and tools. CCS Concepts: • General and reference → Surveys and overviews; • Computer systems organization → Dependable and faulttolerant systems and networks; • Networks → Peer-to-peer architectures;

show abstract

“…the assignment of transactions to shards such that the transaction processing time for each shard in each time interval is about the same. This issue has been addressed in an ad hoc manner in the design of some sharded blockchains and more formally in some recent publications, Kr ol et al (2021), Okanami et al (2022), Woo et al (2020) and Toulouse et al (2021).…”

Section: Introductionmentioning

confidence: 99%

Distributed load-balancing for account-based sharded blockchains

Toulouse

Dai

2022

IJWIS

View full text Add to dashboard Cite

Purpose Sharding of blockchains consists of partitioning a blockchain network into several sub-networks called “shards,” each shard processing and storing disjoint sets of transactions in parallel. Sharding has recently been applied to public blockchains to improve scalability through parallelism. The throughput of sharded blockchain is optimized when the workload among the shards is approximately the same. The purpose of this paper is to investigate the problem of balancing workload of account-based blockchains such as Ethereum. Design/methodology/approach Two known consensus-based distributed load-balancing algorithms have been adapted to sharded blockchains. These algorithms migrate accounts across shards to balance transaction processing times. Two methods to predict transaction processing times are proposed. Findings The authors identify some challenging aspects for solving the load-balancing problem in sharded blockchains. Experiments conducted with Ethereum transactions show that the two load-balancing algorithms are challenged by accounts often created to process a single transaction to optimize anonymity, while existing accounts sparsely generate transactions. Originality/value Tests in this work have been conducted on transactions originating from a blockchain platform rather than using artificially generated data distributions. They show the specificity of the load-balancing problem for sharded blockchains, which were hidden in artificial data sets.

show abstract

GARET: improving throughput using gas consumption-aware relocation in Ethereum sharding environments

Cited by 10 publications

References 16 publications

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains

A Survey of State-of-the-Art on Blockchains: Theories, Modelings, and Tools

Distributed load-balancing for account-based sharded blockchains

Contact Info

Product

Resources

About