| Autor: |
Neeraj Sharma, Kalpesh Kapoor, V. Anirudh |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Blockchain: Research and Applications, Vol 5, Iss 2, Pp 100179- (2024) |
| Druh dokumentu: |
article |
| ISSN: |
2666-9536 |
| DOI: |
10.1016/j.bcra.2023.100179 |
| Popis: |
Payment Channel Networks (PCNs) are a promising alternative to improve the scalability of a blockchain network. A PCN employs off-chain micropayment channels that do not need a global block confirmation procedure, thereby sacrificing the ability to confirm transactions instantaneously. PCN uses a routing algorithm to identify a path between two users who do not have a direct channel between them to settle a transaction. The performance of most of the existing centralized path-finding algorithms does not scale with network size. The rapid growth of Bitcoin PCN necessitates considering distributed algorithms. However, the existing decentralized algorithms suffer from resource underutilization. We present a decentralized routing algorithm, Swift, focusing on fee optimization. The concept of a secret path is used to reduce the path length between a sender and a receiver to optimize the fees. Furthermore, we reduce a network structure into combinations of cycles to theoretically study fee optimization with changes in cloud size. The secret path also helps in edge load sharing, which results in an improvement of throughput. Swift routing achieves up to 21% and 63% in fee and throughput optimization, respectively. The results from the simulations follow the trends identified in the theoretical analysis. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
