maxREE: Maximizing Flow by Replacing Exhausted Edges in Lightning Network

作     者：Sharma, Neeraj Kapoor, Kalpesh 

作者机构：Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 India Indian Inst Technol Guwahati Dept Math North Guwahati 781039 India 

出 版 物：《IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING》 (IEEE Trans. Netw. Sci. Eng.)

年 卷 期：2025年第12卷第2期

页      面：1011-1025页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 

主　　题：Routing Bitcoin Blockchains Peer-to-peer computing Routing protocols Heuristic algorithms Lightning Topology System recovery Spread spectrum communication Blockchain concurrency distributed routing algorithms lightning network payment channel network rebalancing 

摘      要：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.