TY - GEN
T1 - AODV–based routing for payment channel networks
AU - Hoenisch, Philipp
AU - Weber, Ingo
N1 - Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.
PY - 2018
Y1 - 2018
N2 - Payment Channel Networks such as the Lightning Network (LN), Raiden or COMIT were created to tackle the scalability problems of their underlying blockchains, by moving from expensive and slow on-chain transactions to inexpensive and fast off-chain ones. However, those networks are unregulated and decentralised, comprise point-to-point channels that may be opened or closed without coordination or warning, and fees may change at any time – making routing over these networks a hard problem. In addition, by connecting different blockchains using such off-chain networks, an immense network of channels will evolve which is under continues change. Routing needs to take into account the current network status, availability and distributions of channels’ funding, fees for each node, and exchange rates between different currencies. In this work, we identify requirements for such a routing protocol and adapt the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol to this end by enhancing the messages with information on fees and exchanges rates. This approach allows finding suitable routes through the network, while intermediate nodes can maintain their economic incentives. We simulate different network topologies and evaluate the adapted AODV protocol on 3 different networks of 500, 1,000 and 5,000 nodes.
AB - Payment Channel Networks such as the Lightning Network (LN), Raiden or COMIT were created to tackle the scalability problems of their underlying blockchains, by moving from expensive and slow on-chain transactions to inexpensive and fast off-chain ones. However, those networks are unregulated and decentralised, comprise point-to-point channels that may be opened or closed without coordination or warning, and fees may change at any time – making routing over these networks a hard problem. In addition, by connecting different blockchains using such off-chain networks, an immense network of channels will evolve which is under continues change. Routing needs to take into account the current network status, availability and distributions of channels’ funding, fees for each node, and exchange rates between different currencies. In this work, we identify requirements for such a routing protocol and adapt the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol to this end by enhancing the messages with information on fees and exchanges rates. This approach allows finding suitable routes through the network, while intermediate nodes can maintain their economic incentives. We simulate different network topologies and evaluate the adapted AODV protocol on 3 different networks of 500, 1,000 and 5,000 nodes.
UR - http://www.scopus.com/inward/record.url?scp=85049363147&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-94478-4_8
DO - 10.1007/978-3-319-94478-4_8
M3 - Conference contribution
AN - SCOPUS:85049363147
SN - 9783319944777
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 107
EP - 124
BT - Blockchain – ICBC 2018 - 1st International Conference, Held as Part of the Services Conference Federation, SCF 2018, Proceedings
A2 - Chen, Shiping
A2 - Zhang, Liang-Jie
A2 - Wang, Harry
PB - Springer Verlag
T2 - 1st International Conference on Blockchain, ICBC 2018 Held as Part of the Services Conference Federation, SCF 2018
Y2 - 25 June 2018 through 30 June 2018
ER -