论文标题
基于区块链的支付系统中的吞吐量最佳路由
Throughput Optimal Routing in Blockchain Based Payment Systems
论文作者
论文摘要
比特币等加密货币网络已成为传统集中式金融交易网络的分布式替代品。但是，扩大此类网络的吞吐量存在主要挑战。闪电网络和蜘蛛网是使用智能合约在加密货币网络之上构建双向支付渠道的替代方案，以实现绕过区块链的快速交易。在本文中，我们研究了这种付款处理网络中路由交易的问题。我们首先提出了一个随机模型来研究这种系统，而不是文献中研究的流体模型。这种模型中的每个链接都是双面队列，与经典队列不同，除非有外部控制，否则此类队列不稳定。我们建议使用链上重新平衡的概念，建议由此类双面队列组成的付款处理网络的稳定性概念。然后，我们表征容量区域，并提出一种吞吐量最佳算法，该算法可以在容量区域内的任何负载下稳定系统。随机模型使我们能够研究闭环策略，通常比文献中研究的开放循环策略（或静态拆分规则）具有更好的排队/延迟性能。我们通过模拟调查了这一点。
Cryptocurrency networks such as Bitcoin have emerged as a distributed alternative to traditional centralized financial transaction networks. However, there are major challenges in scaling up the throughput of such networks. Lightning network and Spider network are alternates that build bidirectional payment channels on top of cryptocurrency networks using smart contracts, to enable fast transactions that bypass the Blockchain. In this paper, we study the problem of routing transactions in such a payment processing network. We first propose a Stochastic model to study such a system, as opposed to a fluid model that is studied in the literature. Each link in such a model is a two-sided queue, and unlike classical queues, such queues are not stable unless there is an external control. We propose a notion of stability for the payment processing network consisting of such two-sided queues using the notion of on-chain rebalancing. We then characterize the capacity region and propose a throughput optimal algorithm that stabilizes the system under any load within the capacity region. The stochastic model enables us to study closed loop policies, which typically have better queuing/delay performance than the open loop policies (or static split rules) studied in the literature. We investigate this through simulations.
