MDRL-IR: Incentive Routing for Blockchain Scalability With Memory-Based Deep Reinforcement Learning

Blockchain-based cryptocurrencies have developed rapidly in recent years, however, scalability is one of the biggest challenge. Payment channel networks (PCNs) are one of the important solutions to blockchain scalability and routing is the most critical problem in PCN. Routing algorithms in PCNs hav...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on services computing Vol. 16; no. 6; pp. 4375 - 4388
Main Authors: Tang, Bingxin, Liang, Junyuan, Cai, Zhongteng, Cai, Ting, Zhou, Xiaocong, Chen, Yingye
Format: Journal Article
Language:English
Published: Piscataway IEEE 01-11-2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Blockchain-based cryptocurrencies have developed rapidly in recent years, however, scalability is one of the biggest challenge. Payment channel networks (PCNs) are one of the important solutions to blockchain scalability and routing is the most critical problem in PCN. Routing algorithms in PCNs have evolved fast and achieved high throughput. However, most of these routing algorithms are designed from the perspective of technical feasibility, and few algorithms focus on the incentives of each off-chain participant, especially the economic incentives for intermediate routing nodes. Besides, due to the highly dynamic nature of off-chain channel deposits, existing routing algorithms rely heavily on channel deposit probing in order to ensure high throughput. In this article, we design routing algorithms from an incentive perspective to improve the profit of intermediate nodes and use deep learning to reduce the dependency of off-chain routing on channel deposit probing. Our experiments show that under the same model, MDRL-IR can increase the profit of intermediate nodes by up to 1.87x and increase the throughput by up to 2.0x compared to the state-of-the-art routing algorithm, while ensuring that the user routing cost per unit throughput remains unchanged. Moreover, approximate performance can be achieved when deposit probing is greatly reduced.
ISSN:1939-1374
2372-0204
DOI:10.1109/TSC.2023.3323647