2026-09-19T12:55:57Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1241292021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Mohammad Alizadeh.
Sivaraman, Vibhaalakshmi.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2020-03-09T18:59:15Z
2020-03-09T18:59:15Z
2019
2019
https://hdl.handle.net/1721.1/124129
1142812072
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-73).
With the growing usage of Bitcoin and other cryptocurrencies, many scalability challenges have emerged. A promising scaling solution, exemplified by the Lightning Network, uses a network of bidirectional payment channels that allows fast transactions between two parties. However, routing payments on these networks efficiently is non-trivial, since payments require finding paths with sufficient funds, and channels can become unidirectional over time blocking further transactions through them. Today's payment channel networks (PCNs) exacerbate these problems by attempting to deliver all payments atomically. This thesis presents the Spider protocol, a protocol inspired by congestion control for data networks that addresses these challenges. We formalize the PCN routing problem as an optimization problem and motivate Spider using that. Spider splits payments into transaction units and uses an explicit multipath transport protocol to control the rates at which the transaction units are sent through the PCN. Spider routers signal congestion to end-hosts based on observed queuing delay and end-hosts accordingly adjust sending rates on their paths. This thesis shows through extensive simulations that Spider requires less than 25% of the funds needed by state-of-the-art approaches to successfully route over 95% of the transactions across a wide range of synthetic and real topologies. Our improvements are significant across all sizes of transactions: Spider completes 40% more of the largest 25% of transactions attempted on the real Lightning Network topology compared to the state-of- the-art.
by Vibhaalakshmi Sivaraman.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
81 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
High-efficiency cryptocurrency routing in payment channel networks
Thesis
application/pdf
2020-03-09T18:59:14Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1f2b96d0-3a2f-4cbd-a1cf-db3c6be797f2">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>High-efficiency cryptocurrency routing in payment channel networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Sivaraman, Vibhaalakshmi.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>With the growing usage of Bitcoin and other cryptocurrencies, many scalability challenges have emerged. A promising scaling solution, exemplified by the Lightning Network, uses a network of bidirectional payment channels that allows fast transactions between two parties. However, routing payments on these networks efficiently is non-trivial, since payments require finding paths with sufficient funds, and channels can become unidirectional over time blocking further transactions through them. Today's payment channel networks (PCNs) exacerbate these problems by attempting to deliver all payments atomically. This thesis presents the Spider protocol, a protocol inspired by congestion control for data networks that addresses these challenges. We formalize the PCN routing problem as an optimization problem and motivate Spider using that. Spider splits payments into transaction units and uses an explicit multipath transport protocol to control the rates at which the transaction units are sent through the PCN. Spider routers signal congestion to end-hosts based on observed queuing delay and end-hosts accordingly adjust sending rates on their paths. This thesis shows through extensive simulations that Spider requires less than 25% of the funds needed by state-of-the-art approaches to successfully route over 95% of the transactions across a wide range of synthetic and real topologies. Our improvements are significant across all sizes of transactions: Spider completes 40% more of the largest 25% of transactions attempted on the real Lightning Network topology compared to the state-of- the-art.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>