{"title":"maxREE: Maximizing Flow by Replacing Exhausted Edges in Lightning Network","authors":"Neeraj Sharma;Kalpesh Kapoor","doi":"10.1109/TNSE.2024.3522198","DOIUrl":null,"url":null,"abstract":"Blockchain-based cryptocurrencies have grown rapidly over the past decade, but issues with scalability are limiting their wider adoption. Payment Channel Network, a layer two solution, is an alternative for enhancing the scalability of a blockchain network. Two users can engage in some off-chain transactions via payment channels in the network they build in order to avoid the time and expense of on-chain settlement. The number of nodes in the Bitcoin payment channel network has nearly doubled over the last two years, and this network size is proliferating. The number of transactions on the network will increase along with its growth. However, the existing distributed routing algorithms cannot effectively schedule several concurrent transactions due to their static nature. We propose the <italic>maxREE</i> algorithm, which efficiently handles concurrent transactions with negligible overhead. Our algorithm considers substituting the necessary edges with superior alternatives to prevent the saturation of a channel's directional capacity while maintaining the height of the underlying routing tree. The transaction flow was enhanced by our proposed algorithm's self-rebalancing and link load sharing. Without compromising network privacy, the unused links are dynamically substituted for the congested ones. We have also developed a simulator, called <italic>DRLNsim</i>, to compare our algorithm with existing techniques. On the simulator, the routing approaches are examined using multiple custom network sizes. The proposed method enabled concurrent transactions 58% more effectively on average than existing techniques. The simulation's outcomes mirror the patterns found through theoretical study.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 2","pages":"1011-1025"},"PeriodicalIF":6.7000,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10816058/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Blockchain-based cryptocurrencies have grown rapidly over the past decade, but issues with scalability are limiting their wider adoption. Payment Channel Network, a layer two solution, is an alternative for enhancing the scalability of a blockchain network. Two users can engage in some off-chain transactions via payment channels in the network they build in order to avoid the time and expense of on-chain settlement. The number of nodes in the Bitcoin payment channel network has nearly doubled over the last two years, and this network size is proliferating. The number of transactions on the network will increase along with its growth. However, the existing distributed routing algorithms cannot effectively schedule several concurrent transactions due to their static nature. We propose the maxREE algorithm, which efficiently handles concurrent transactions with negligible overhead. Our algorithm considers substituting the necessary edges with superior alternatives to prevent the saturation of a channel's directional capacity while maintaining the height of the underlying routing tree. The transaction flow was enhanced by our proposed algorithm's self-rebalancing and link load sharing. Without compromising network privacy, the unused links are dynamically substituted for the congested ones. We have also developed a simulator, called DRLNsim, to compare our algorithm with existing techniques. On the simulator, the routing approaches are examined using multiple custom network sizes. The proposed method enabled concurrent transactions 58% more effectively on average than existing techniques. The simulation's outcomes mirror the patterns found through theoretical study.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.