arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.11665cs.NI
收藏

WebFlow:高资源利用率支付通道网络的可扩展和分散路由

WebFlow: Scalable and Decentralized Routing for Payment Channel Networks with High Resource Utilization

Xiaoxue Zhang, Shouqian Shi, Chen Qian

摘要:

支付通道网络(PCN)被设计和利用来解决区块链的可扩展性挑战和吞吐量限制。路由是PCNs的核心问题。理想的PCN路由方法需要实现1)对于大型PCN可以维持低的每节点存储器和通信成本的高可扩展性,2)支付通道的高资源利用率,以及3)用户的隐私。然而,现有的PCN系统都没有考虑所有这些要求。在这项工作中,我们提出了WebFlow,PCNs的分布式路由解决方案,它只需要每个用户维护本地化的信息,可用于具有高资源利用率的大规模网络。我们利用两个分布式数据结构:多跳德洛内三角剖分(MDT)最初提出的无线网络和我们的创新称为分布式沃罗诺伊图。我们提出了新的协议,以产生一个虚拟的欧几里德空间,以适用于MDT PCNs和使用分布式沃罗诺伊图,以提高路由隐私。我们进行了广泛的模拟和原型实现,以进一步评估WebFlow。使用真实和合成PCN拓扑和事务跟踪的结果表明,与现有方法相比,WebFlow可以实现极低的每节点开销和高成功率。

英文摘要:

Payment channel networks (PCNs) have been designed and utilized to address the scalability challenge and throughput limitation of blockchains. Routing is a core problem of PCNs. An ideal PCN routing method needs to achieve 1) high scalability that can maintain low per-node memory and communication cost for large PCNs, 2) high resource utilization of payment channels, and 3) the privacy of users. However, none of the existing PCN systems consider all these requirements. In this work, we propose WebFlow, a distributed routing solution for PCNs, which only requires each user to maintain localized information and can be used for massive-scale networks with high resource utilization. We make use of two distributed data structures: multi-hop Delaunay triangulation (MDT) originally proposed for wireless networks and our innovation called distributed Voronoi diagram. We propose new protocols to generate a virtual Euclidean space in order to apply MDT to PCNs and use the distributed Voronoi diagram to enhance routing privacy. We conduct extensive simulations and prototype implementation to further evaluate WebFlow. The results using real and synthetic PCN topologies and transaction traces show that WebFlow can achieve extremely low per-node overhead and a high success rate compared to existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑