Adaptive Load Balancing Algorithm of Ethereum Shard Using Bargaining Solution


KIPS Transactions on Computer and Communication Systems, Vol. 10, No. 4, pp. 93-100, Apr. 2021
https://doi.org/10.3745/KTCCS.2021.10.4.93,   PDF Download:
Keywords: Ethereum, Blockchain, Sharding, Bargaining Solution, game theory, Graph Partitioning, load balancing
Abstract

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. D. Hwan and K. S. Wook, "Adaptive Load Balancing Algorithm of Ethereum Shard Using Bargaining Solution," KIPS Transactions on Computer and Communication Systems, vol. 10, no. 4, pp. 93-100, 2021. DOI: https://doi.org/10.3745/KTCCS.2021.10.4.93.

[ACM Style]
Baek Dong Hwan and Kim Sung Wook. 2021. Adaptive Load Balancing Algorithm of Ethereum Shard Using Bargaining Solution. KIPS Transactions on Computer and Communication Systems, 10, 4, (2021), 93-100. DOI: https://doi.org/10.3745/KTCCS.2021.10.4.93.