Online Payment Network Design
Data Structures and Algorithms
2019-08-02 v1 Distributed, Parallel, and Cluster Computing
Abstract
Payment channels allow transactions between participants of the blockchain to be executed securely off-chain, and thus provide a promising solution for the scalability problem of popular blockchains. We study the online network design problem for payment channels, assuming a central coordinator. We focus on a single channel, where the coordinator desires to maximize the number of accepted transactions under given capital constraints. Despite the simplicity of the problem, we present a flurry of impossibility results, both for deterministic and randomized algorithms against adaptive as well as oblivious adversaries.
Cite
@article{arxiv.1908.00432,
title = {Online Payment Network Design},
author = {Georgia Avarikioti and Kenan Besic and Yuyi Wang and Roger Wattenhofer},
journal= {arXiv preprint arXiv:1908.00432},
year = {2019}
}
Comments
To appear in 3rd International Workshop on Cryptocurrencies and Blockchain Technology (CBT) 2019