skip to main content
10.1145/3359989.3365411acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

Flash: efficient dynamic routing for offchain networks

Authors Info & Claims
Published:03 December 2019Publication History

ABSTRACT

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

References

  1. 2018. Atomic Multi-path Payment. https://lists.linuxfoundation.org/pipermail/lightning-dev/2018-February/000993.html.Google ScholarGoogle Scholar
  2. 2018. Ripple transaction trace. https://crysp.uwaterloo.ca/software/speedymurmurs/.Google ScholarGoogle Scholar
  3. 2019. Bitcoin. https://bitcoin.org/en/.Google ScholarGoogle Scholar
  4. 2019. c-lightning Daemon. https://github.com/ElementsProject/lightning/tree/master/lightningd.Google ScholarGoogle Scholar
  5. 2019. Lightning Network Daemon. https://github.com/lightningnetwork/lnd.Google ScholarGoogle Scholar
  6. 2019. NetworkX. https://networkx.github.io/.Google ScholarGoogle Scholar
  7. 2019. Raiden Network Daemon. https://github.com/raiden-network/raiden.Google ScholarGoogle Scholar
  8. 2019. Real-Time Lightning Network Statistics. https://1ml.com/statistics.Google ScholarGoogle Scholar
  9. 2019. Ripple. https://ripple.com/.Google ScholarGoogle Scholar
  10. 2019. The Lightning Network. https://lightning.network/.Google ScholarGoogle Scholar
  11. 2019. The Raiden Network. https://raiden.network/.Google ScholarGoogle Scholar
  12. 2019. Transaction Rate of Bitcoin. https://www.blockchain.com/en/charts/transactions-per-second.Google ScholarGoogle Scholar
  13. Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In Proc. USENIX NSDI.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Mohammad Alizadeh, Tom Edsall, Sarang Dharmapurikar, Ramanan Vaidyanathan, Kevin Chu, Andy Fingerhut, Vinh The Lam, Francis Matus, Rong Pan, Navindra Yadav, and George Varghese. 2014. CONGA: Distributed Congestion-Aware Load Balancing for Datacenters. In Proc. ACM SIGCOMM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. MIT Press.Google ScholarGoogle Scholar
  16. Andrew R. Curtis, Jeffrey C. Mogul, Jean Tourrilhes, Praveen Yalagandula, Puneet Sharma, and Sujata Banerjee. 2011. DevoFlow: Scaling Flow Management for High-performance Networks. In Proc. ACM SIGCOMM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Lester Randolph Ford and Delbert R Fulkerson. 1956. Maximal flow through a network. Canadian Journal of Mathematics 8 (1956), 399--404.Google ScholarGoogle ScholarCross RefCross Ref
  18. Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proc. ACM SOSP.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Keqiang He, Eric Rozner, Kanak Agarwal, Wes Felter, John Carter, and Aditya Akella. 2015. Presto: Edge-based Load Balancing for Fast Datacenter Networks. In Proc. ACM SIGCOMM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Chi-Yao Hong, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Vijay Gill, Mohan Nanduri, and Roger Wattenhofer. 2013. Achieving High Utilization with Software-Driven WAN. In Proc. ACM SIGCOMM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jon Zolla, Urs Hölzle, Stephen Stuart, and Amin Vahdat. 2013. B4: Experience with a Globally-Deployed Software Defined WAN. In Proc. ACM SIGCOMM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Rami Khalil and Arthur Gervais. 2017. Revive: Rebalancing off-blockchain payment networks. In Proc. ACM CCS.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, Seth Gilbert, and Prateek Saxena. 2016. A secure sharding protocol for open blockchains. In Proc. ACM CCS.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Pedro Moreno-Sanchez, Aniket Kate, and Matteo Maffei. 2017. SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks. In Proc. NDSS.Google ScholarGoogle Scholar
  25. Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Technical Report (2008). https://bitcoin.org/bitcoin.pdfGoogle ScholarGoogle Scholar
  26. J. Perry, H. Balakrishnan, and D. Shah. 2017. Flowtune: Flowlet Control for Datacenter Networks. In Proc. USENIX NSDI.Google ScholarGoogle Scholar
  27. Joseph Poon and Thaddeus Dryja. 2016. The bitcoin lightning network: Scalable off-chain instant payments. Technical Report (2016). https://lightning.network/lightning-network-paper.pdfGoogle ScholarGoogle Scholar
  28. Pavel Prihodko, Slava Zhigulin, Mykola Sahno, Aleksei Ostrovskiy, and Olaoluwa Osuntokun. 2016. Flare:An approach to routing in lightning network. White Paper (2016). https://bitfury.com/content/downloads/whitepaper_flare_an_approach_to_routing_in_lightning_network_7_7_2016.pdfGoogle ScholarGoogle Scholar
  29. Stefanie Roos, Pedro Moreno-Sanchez, Aniket Kate, and Ian Goldberg. 2018. Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions. In Proc. NDSS.Google ScholarGoogle ScholarCross RefCross Ref
  30. Vibhaalakshmi Sivaraman, Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, Giulia Fanti, and Pramod Viswanath. 2018. Routing Cryptocurrency with the Spider Network. In Proc. ACM HotNets.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Erico Vanini, Rong Pan, Mohammad Alizadeh, Parvin Taheri, and Tom Edsall. 2017. Let It Flow: Resilient Asymmetric Load Balancing with Flowlet Switching. In Proc. USENIX NSDI.Google ScholarGoogle Scholar
  32. Jiaping Wang and Hao Wang. 2019. Monoxide: Scale Out Blockchain with Asynchronized Consensus Zones. In Proc. USENIX NSDI.Google ScholarGoogle Scholar
  33. Peng Wang, Hong Xu, Zhixiong Niu, Dongsu Han, and Yongqiang Xiong. 2016. Expeditus: Congestion-aware Load Balancing in Clos Data Center Networks. In Proc. ACM SoCC.Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393, 6684 (1998), 440.Google ScholarGoogle Scholar
  35. Gavin Wood. 2014. Ethereum: a secure decentralized transaction ledger. http://gavwood.com/paper.pdf.Google ScholarGoogle Scholar
  36. Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. Management Science 17, 11 (1971), 712--716.Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Mahdi Zamani, Mahnush Movahedi, and Mariana Raykova. 2018. RapidChain: scaling blockchain via full sharding. In Proc. ACM CCS.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Flash: efficient dynamic routing for offchain networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CoNEXT '19: Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies
        December 2019
        395 pages
        ISBN:9781450369985
        DOI:10.1145/3359989

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 December 2019

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate198of789submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader