Fence: Fee-Based Online Balance-Aware Routing in Payment Channel Networks
- 16 October 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (2) , 1661-1676
Abstract
Scalability is a critical challenge for blockchain-based cryptocurrencies. Payment channel networks (PCNs) have emerged as a promising solution for this challenge. However, channel balance depletion can significantly limit the capacity and usability of a PCN. Specifically, frequent transactions that result in unbalanced payment flows from two ends of a channel can quickly deplete the balance on one end, thus blocking future payments from that direction. In this paper, we propose Fence, an online balance-aware fee setting algorithm to prevent channel depletion and improve PCN sustainability and long-term throughput. In our algorithm, PCN routers set transaction fees based on the current balance and level of congestion on each channel, in order to incentivize payment senders to utilize paths with more balance and less congestion. Our algorithm is guided by online competitive algorithm design, and achieves an asymptotically tight competitive ratio with constant violation in a unidirectional PCN. We further prove that no online algorithm can achieve a finite competitive ratio in a general PCN. Extensive simulations under a real-world PCN topology show that Fence achieves high throughput and keeps network channels balanced, compared to state-of-the-art PCN routing algorithms.Keywords
Funding Information
- NSF (2007083, 2008935, 2045539)
This publication has 43 references indexed in Scilit:
- Towards an economic analysis of routing in payment channel networks2017
- Revive2017
- SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks2017
- TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub2017
- Towards Bitcoin Payment Networks2016
- Greedy Distance Vector Routing2011
- Protecting Privacy Using k-AnonymityJournal of the American Medical Informatics Association, 2008
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic AnalysesOperations Research, 2008
- Protecting Location Privacy with Personalized k-Anonymity: Architecture and AlgorithmsIEEE Transactions on Mobile Computing, 2007
- Fast Local Rerouting for Handling Transient Link FailuresIEEE/ACM Transactions on Networking, 2007