Flash: Efficient Dynamic Routing for Offchain Networks

摘要: Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through network payment channels without overhead committing onchain transactions. Routing is critical performance offchain networks. Existing solutions use either static routing with poor or dynamic high obtain channel balance information. In this paper, we propose Flash, new that leverages unique characteristics transactions in strike better tradeoff between path optimality and probing overhead. By studying traces real networks, find sizes are heavy-tailed, most highly recurrent. Flash thus differentiates treatment elephant from mice payments. It uses modified max-flow algorithm for paths sufficient capacity, strategically routes across minimize transaction fees. Mice sent by looking up table few precomputed reduce Testbed experiments data-driven simulations show improves success volume 2.3x compared state-of-the-art algorithm.