Optimizing Betweenness In Payment Channels

Please enable javascript in your browser.

Kasnavi Yazdi, Mohammad Reza | 2021

512 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 54091 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Fazli, Mohammad Amin
Abstract:
The need for a fast, light and affordable payment method, was a reason to produce multiple payment channel network on various of networks. To deploy and expand these networks, we need to deploy a profit model for new customers on the betweenness they add to network. In this research we maximum profit solutions for network with fixed payment cost and network with reduced betweenness profit for longer distances.At first, we suggest for a limited fund, we decide to make channels with most betweenness profit and prove it's a np-hard problem. Then for limited charge of making new channels, we show that it's a np-hard too. In graph of a path, we prove there is a solution based on length of path, and on a multi-component graph we suggest a polynomial solution that works for most cases and also an 1/4 approximation of best solution. and for limited number of new channels we introduce a polynomial solution
Keywords:
Optimization ; Betweenness Profit ; Payment Channels ; Lightning Coin Network ; Betweenness ; NP-Hard Problems