Towards a Concurrent and Distributed Route Selection for Payment Channel Networks
This addresses the challenge of improving transaction rates in blockchain payment networks, though it appears incremental as it builds on existing flow network methods.
The paper tackles the problem of enabling concurrent and distributed route selection in payment channel networks by modeling them as flow networks and proposing an extended push-relabel algorithm with capacity locking to ensure valid flows without violating capacity constraints, presenting initial results.
Payment channel networks use off-chain transactions to provide virtually arbitrary transaction rates. In this paper, we provide a new perspective on payment channels and consider them as a flow network. We propose an extended push-relabel algorithm to find payment flows in a payment channel network. Our algorithm enables a distributed and concurrent execution without violating capacity constraints. To this end, we introduce the concept of capacity locking. We prove that flows are valid and present first results.