ant routing for the lightning network with c grunspan
play

Ant routing for the Lightning Network (with C. Grunspan) Ricardo P - PowerPoint PPT Presentation

May 15, 2023 •160 likes •1.32k views

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ant routing for the Lightning Network (with C. Grunspan) Ricardo P erez-Marco @rperezmarco webusers.imj-prg.fr/ ricardo.perez-marco CNRS,

  1. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  2. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. • Instantaneous and anonymous (unrecorded) transactions. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  3. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. • Instantaneous and anonymous (unrecorded) transactions. • Payment channels are composable (transitive property). R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  4. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. • Instantaneous and anonymous (unrecorded) transactions. • Payment channels are composable (transitive property). If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  5. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. • Instantaneous and anonymous (unrecorded) transactions. • Payment channels are composable (transitive property). If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob. • Fee incentive for intermediaries. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  6. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Payment channels • Payment channels: Allow off-chain transactions. • One Initial Commitment Transaction and one Settlement Transaction are the only on-chain transactions. • Unidirectional or bidirectional payment channels. Constraints and properties • Maximal volume. • Instantaneous and anonymous (unrecorded) transactions. • Payment channels are composable (transitive property). If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob. • Fee incentive for intermediaries. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  7. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  8. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  9. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  10. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). • Decentralized network: Rich and randomly connected, etc R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  11. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). • Decentralized network: Rich and randomly connected, etc • On top of the LN network we have a richer and fast communication network. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  12. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). • Decentralized network: Rich and randomly connected, etc • On top of the LN network we have a richer and fast communication network. • Nodes reserve a mempool space for routing purposes. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  13. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). • Decentralized network: Rich and randomly connected, etc • On top of the LN network we have a richer and fast communication network. • Nodes reserve a mempool space for routing purposes. Main problem: Decentralized payment path finding algorithm. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  14. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN LN set up (Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...) • LN network of payment channels (weighted oriented graph). • Decentralized network: Rich and randomly connected, etc • On top of the LN network we have a richer and fast communication network. • Nodes reserve a mempool space for routing purposes. Main problem: Decentralized payment path finding algorithm. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  15. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  16. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  17. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  18. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. • Beacon nodes or supernodes violate decentralization. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  19. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. • Beacon nodes or supernodes violate decentralization. Some hints: R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  20. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. • Beacon nodes or supernodes violate decentralization. Some hints: • Bitcoin network does not use routing tables. Information (transactions) are propagated to the whole network. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  21. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. • Beacon nodes or supernodes violate decentralization. Some hints: • Bitcoin network does not use routing tables. Information (transactions) are propagated to the whole network. • Ant path finding algorithms are efficient and highly decentralized. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  22. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Problems and difficulties • Global knowledge of the geometry of the network is a vector of attack. • Solutions based on “beacon nodes” with rich routing tables. • Beacon nodes or supernodes violate decentralization. Some hints: • Bitcoin network does not use routing tables. Information (transactions) are propagated to the whole network. • Ant path finding algorithms are efficient and highly decentralized. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  23. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ant paths R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  24. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ant paths R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  25. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  26. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  27. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  28. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  29. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) • Marking paths with pheromones. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  30. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) • Marking paths with pheromones. • Reinforcing paths with pheromones. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  31. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Goss et al. (1989) • Marking paths with pheromones. • Reinforcing paths with pheromones. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  32. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ariadne’s thread R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  33. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ariadne’s thread R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  34. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  35. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  36. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  37. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . • Bob’s pheromone seed S ( B ) = 1 ⌢ R . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  38. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . • Bob’s pheromone seed S ( B ) = 1 ⌢ R . • Derived seed: If S = X ⌢ R , the derived seed is S ′ = R . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  39. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . • Bob’s pheromone seed S ( B ) = 1 ⌢ R . • Derived seed: If S = X ⌢ R , the derived seed is S ′ = R . • Conjugate seed: If S = 0 ⌢ R (resp. S = 1 ⌢ R ), the conjugate seed is ¯ S = 1 ⌢ R (resp. ¯ S = 0 ⌢ R ). R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  40. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . • Bob’s pheromone seed S ( B ) = 1 ⌢ R . • Derived seed: If S = X ⌢ R , the derived seed is S ′ = R . • Conjugate seed: If S = 0 ⌢ R (resp. S = 1 ⌢ R ), the conjugate seed is ¯ S = 1 ⌢ R (resp. ¯ S = 0 ⌢ R ). • Alice, resp. Bob, propagates S ( A ) , resp. S ( B ) , to neighbors. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  41. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Pheromone seeds • Alice wants to pay Bob. They agree on a common random number R . • Alice’s pheromone seed S ( A ) = 0 ⌢ R . • Bob’s pheromone seed S ( B ) = 1 ⌢ R . • Derived seed: If S = X ⌢ R , the derived seed is S ′ = R . • Conjugate seed: If S = 0 ⌢ R (resp. S = 1 ⌢ R ), the conjugate seed is ¯ S = 1 ⌢ R (resp. ¯ S = 0 ⌢ R ). • Alice, resp. Bob, propagates S ( A ) , resp. S ( B ) , to neighbors. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  42. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  43. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  44. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. • If none was received, it stores S in the mempool and propagates to other neighbors. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  45. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. • If none was received, it stores S in the mempool and propagates to other neighbors. • If S was already in the mempool but not ¯ S , nothing else needs to be done. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  46. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. • If none was received, it stores S in the mempool and propagates to other neighbors. • If S was already in the mempool but not ¯ S , nothing else needs to be done. • If S is not in the mempool but ¯ S is, then a matching occurs. The node constructs the matched seed S m = 0 ⌢ S ( A ) and propagates it to the neighbors that send the pheromone seeds S ( A ) and S ( B ) . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  47. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. • If none was received, it stores S in the mempool and propagates to other neighbors. • If S was already in the mempool but not ¯ S , nothing else needs to be done. • If S is not in the mempool but ¯ S is, then a matching occurs. The node constructs the matched seed S m = 0 ⌢ S ( A ) and propagates it to the neighbors that send the pheromone seeds S ( A ) and S ( B ) . • If both S and ¯ S were already in the mempool then the matching occurred earlier and nothing needs to be done. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  48. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Propagation and matching • A node that receives a pheromone seed S notes from which neighbor it arrived and checks if S or ¯ S was received before. • If none was received, it stores S in the mempool and propagates to other neighbors. • If S was already in the mempool but not ¯ S , nothing else needs to be done. • If S is not in the mempool but ¯ S is, then a matching occurs. The node constructs the matched seed S m = 0 ⌢ S ( A ) and propagates it to the neighbors that send the pheromone seeds S ( A ) and S ( B ) . • If both S and ¯ S were already in the mempool then the matching occurred earlier and nothing needs to be done. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  49. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  50. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment • Alice waits for several matched seed to arrive, and chooses one and constructs the confirmed seed S c = 0 ⌢ S m . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  51. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment • Alice waits for several matched seed to arrive, and chooses one and constructs the confirmed seed S c = 0 ⌢ S m . • Alice propagates the confirmed seed to the neighbor that send her the matched seed and waits for Bob the confirmation of the path. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  52. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment • Alice waits for several matched seed to arrive, and chooses one and constructs the confirmed seed S c = 0 ⌢ S m . • Alice propagates the confirmed seed to the neighbor that send her the matched seed and waits for Bob the confirmation of the path. • Nodes that receive a confirmed seed propagate it back. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  53. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment • Alice waits for several matched seed to arrive, and chooses one and constructs the confirmed seed S c = 0 ⌢ S m . • Alice propagates the confirmed seed to the neighbor that send her the matched seed and waits for Bob the confirmation of the path. • Nodes that receive a confirmed seed propagate it back. • Once Bob receives the confirmed seed, he signals it to Alice and the payment is initiated through that path. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  54. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Confirmation and payment • Alice waits for several matched seed to arrive, and chooses one and constructs the confirmed seed S c = 0 ⌢ S m . • Alice propagates the confirmed seed to the neighbor that send her the matched seed and waits for Bob the confirmation of the path. • Nodes that receive a confirmed seed propagate it back. • Once Bob receives the confirmed seed, he signals it to Alice and the payment is initiated through that path. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  55. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  56. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  57. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  58. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  59. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  60. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. • Nodes only propagate pheromone seeds with an amount compatible with the volume of the payment channels. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  61. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. • Nodes only propagate pheromone seeds with an amount compatible with the volume of the payment channels. • Nodes increase the current fee field with their fee. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  62. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. • Nodes only propagate pheromone seeds with an amount compatible with the volume of the payment channels. • Nodes increase the current fee field with their fee. • The node matching conjugate pheromone seeds updated the amount of the fee field adding his fee to both fee amounts, and checks that is lower than the maximal fee. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  63. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Amount and fees • Alice and Bob enrich the pheromone seed by adding: An amount field. A maximal fee field. A current fee field initialized to 0. • Nodes only propagate pheromone seeds with an amount compatible with the volume of the payment channels. • Nodes increase the current fee field with their fee. • The node matching conjugate pheromone seeds updated the amount of the fee field adding his fee to both fee amounts, and checks that is lower than the maximal fee. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  64. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  65. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  66. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  67. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. • Alice chooses her own waiting time τ 1 and selection algorithm for selecting matched seeds (minimum fee after the period τ 1 is the obvious). R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  68. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. • Alice chooses her own waiting time τ 1 and selection algorithm for selecting matched seeds (minimum fee after the period τ 1 is the obvious). • Seeds of about 30 Bytes are probably acceptable. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  69. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. • Alice chooses her own waiting time τ 1 and selection algorithm for selecting matched seeds (minimum fee after the period τ 1 is the obvious). • Seeds of about 30 Bytes are probably acceptable. • τ 0 of about 2 sec seem realistic depending on the speed of communications. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  70. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. • Alice chooses her own waiting time τ 1 and selection algorithm for selecting matched seeds (minimum fee after the period τ 1 is the obvious). • Seeds of about 30 Bytes are probably acceptable. • τ 0 of about 2 sec seem realistic depending on the speed of communications. • A mempool space of a few Mb should be enough to process thousands of Tx per second. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  71. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Mempool management • Nodes only store non-confirmed information for a few seconds. Each node choses his treshold time τ 0 . • After a period τ 0 nodes erase the data. • Alice chooses her own waiting time τ 1 and selection algorithm for selecting matched seeds (minimum fee after the period τ 1 is the obvious). • Seeds of about 30 Bytes are probably acceptable. • τ 0 of about 2 sec seem realistic depending on the speed of communications. • A mempool space of a few Mb should be enough to process thousands of Tx per second. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  72. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  73. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features • The topology of the network is dynamical. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  74. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features • The topology of the network is dynamical. • Nodes can store historical performance of neighbors and compute some weighting. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  75. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features • The topology of the network is dynamical. • Nodes can store historical performance of neighbors and compute some weighting. • Comparison of historical weighting with short term one allows to adjust to topology changes in the network. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  76. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features • The topology of the network is dynamical. • Nodes can store historical performance of neighbors and compute some weighting. • Comparison of historical weighting with short term one allows to adjust to topology changes in the network. • Best analysis will increase traffic and profitability. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  77. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Self-improvement features • The topology of the network is dynamical. • Nodes can store historical performance of neighbors and compute some weighting. • Comparison of historical weighting with short term one allows to adjust to topology changes in the network. • Best analysis will increase traffic and profitability. R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

  78. Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Numerical simulations R. P´ erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

L is for Lightning! An analysis and comparison of lightning and lightning incidents in Co L

L is for Lightning! An analysis and comparison of lightning and lightning incidents in Co L

STRUCK BY LIZ LIGHTNING PRODUCTIONS PRESENTS: L is for Lightning! An analysis and comparison of lightning and lightning incidents in Co L orado versus F L orida By: Elizabeth Liz Lightning Prasse Why lightning? Personal survivor

423 views • 23 slides
DoS on a Bitcoin Lightning Network channel Willem Rens July 5, 2018 MSc Systems and Network

DoS on a Bitcoin Lightning Network channel Willem Rens July 5, 2018 MSc Systems and Network

DoS on a Bitcoin Lightning Network channel Willem Rens July 5, 2018 MSc Systems and Network Engineering University of Amsterdam Research Project 2 Introduction Bitcoin has a hard time scaling. The Bitcoin Lightning Network was proposed

670 views • 21 slides
Routing Routing is done by the network layer protocol to guide packets through the communication

Routing Routing is done by the network layer protocol to guide packets through the communication

Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual circuits or datagrams connections

664 views • 35 slides
4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has

4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has

4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has columns for the destination network (or hosts) with the corresponding cost and the next router address to reach a destination. Additional

1.08k views • 84 slides
Quantitative Analysis of Lightning Network Privacy Sergei Tikhomirov (University of Luxembourg),

Quantitative Analysis of Lightning Network Privacy Sergei Tikhomirov (University of Luxembourg),

Quantitative Analysis of Lightning Network Privacy Sergei Tikhomirov (University of Luxembourg), Pedro Moreno-Sanchez (TU Wien), Matteo Maffei (TU Wien) Full paper: https://eprint.iacr.org/2020/303 Why Lightning? Bitcoin scales poorly (~3

436 views • 17 slides
1 Routing Table Routing Table Destination network Next router

1 Routing Table Routing Table Destination network Next router

Lecture 12. Lecture 12. Introduction to Introduction to IP Routing IP Routing Giuseppe Bianchi Why introduction? Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a

552 views • 19 slides
Network Layer (Routing) Where we are in the Course Moving on up to the Network Layer!

Network Layer (Routing) Where we are in the Course Moving on up to the Network Layer!

Network Layer (Routing) Where we are in the Course Moving on up to the Network Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Topics Network service models Datagrams (packets), virtual

757 views • 40 slides
Network Layer (Routing) Recap: Why do we need a Network layer? Internetworking Need to

Network Layer (Routing) Recap: Why do we need a Network layer? Internetworking Need to

Network Layer (Routing) Recap: Why do we need a Network layer? Internetworking Need to connect different link layer networks Addressing Need a globally unique way to address hosts Routing and forwarding Now Need to

1.56k views • 124 slides
Network layer Distributed Routing: Link State Routing Link State Routing A very frequently

Network layer Distributed Routing: Link State Routing Link State Routing A very frequently

IN2140: Introduction to Operating Systems and Data Communication Network layer Distributed Routing: Link State Routing Link State Routing A very frequently use routing protocol IS-IS (Intermediate System-Intermediate System) OSPF

239 views • 8 slides
Network layer Distributed Routing: Distance Vector Routing Distance Vector Routing Principle

Network layer Distributed Routing: Distance Vector Routing Distance Vector Routing Principle

IN2140: Introduction to Operating Systems and Data Communication Network layer Distributed Routing: Distance Vector Routing Distance Vector Routing Principle every IS maintains a table (i.e., vector) stating best known distance to

268 views • 7 slides
Routing protocols Goals of this chapter In any network of diameter > 1, the routing &

Routing protocols Goals of this chapter In any network of diameter > 1, the routing &

Ad hoc and Sensor Networks Routing protocols Goals of this chapter In any network of diameter > 1, the routing & forwarding problem appears We will discuss mechanisms for constructing routing tables in ad hoc/sensor networks

751 views • 47 slides
1 Inter-Domain Routing Network comprised of many Autonomous Systems (ASes) or domains 23

1 Inter-Domain Routing Network comprised of many Autonomous Systems (ASes) or domains 23

CSE/EE 461 Lecture 11 Inter-domain Routing This Lecture Focus How do we make routing scale? Application Presentation Inter-domain routing Session ASes and BGP Transport Network Data Link Physical sdg // CSE/EE 461,

395 views • 5 slides
Typical P2P routing P2P network of N nodes Node s maintains a routing table T s = { ( u, IP

Typical P2P routing P2P network of N nodes Node s maintains a routing table T s = { ( u, IP

C YCLIC R OUTING IN S TRUCTURED P EER - TO -P EER N ETWORKS D MITRY K ORZUN A NDREI G URTOV AND Petrozavodsk Helsinki Institute State for Information University Technology AMICT 2008 seminar 20.05.2008 Typical P2P routing P2P network

327 views • 15 slides
What is the difference between routing and forwarding? Routing protocols: Implemented

What is the difference between routing and forwarding? Routing protocols: Implemented

Routing What is the difference between routing and forwarding? Routing protocols: Implemented distributed algorithms (scalability) Routers should have mutually consistent view of the network. Can be classified into: Intradomain

510 views • 5 slides
7 Network Layer Network Layer BGP basics Internet inter-AS routing: BGP when AS2 advertises

7 Network Layer Network Layer BGP basics Internet inter-AS routing: BGP when AS2 advertises

Network Layer Network Layer RIP ( Routing Information Protocol) RIP advertisements distance vectors: exchanged among distance vector algorithm neighbors every 30 sec via Response included in BSD-UNIX Distribution in 1982 Message

746 views • 3 slides
1 A Link-State Routing Algorithm Dijsktras Algorithm Dijkstras algorithm Notation: 5 1

1 A Link-State Routing Algorithm Dijsktras Algorithm Dijkstras algorithm Notation: 5 1

Interplay between routing and Network Layer forwarding Goals: Overview: understand principles last time routing algorithm behind network layer network layer services services: virtual circuit and datagram local forwarding

450 views • 8 slides
1 Self-Organization Self-organization is a process in which pattern at the global level of

1 Self-Organization Self-organization is a process in which pattern at the global level of

Ume University Department of Computing Science Emergent systems Spring-12 Self-organization, autonomous agents and ant algorithms http://www.cs.umu.se/kurser/5DV017 Previous lecture Nonlinear dynamic systems The Logistic map

443 views • 10 slides
A Metaheuristic Approach to Test Sequence Generation for GUI-based Applications Sebastian

A Metaheuristic Approach to Test Sequence Generation for GUI-based Applications Sebastian

A Metaheuristic Approach to Test Sequence Generation for GUI-based Applications Sebastian Bauersfeld, Dr. Joachim Wegener Berner & Mattner Systemtechnik GmbH 1 Overview Motivation Classification-Tree Editor CTE XL Professional

601 views • 10 slides
Overview Ant Colony Optimization Mathematical Model Distributed Architecture =>

Overview Ant Colony Optimization Mathematical Model Distributed Architecture =>

Distributed AgentBased Ant Colony Optimization for Solving Traveling Salesman Problem on a Partitioned Map Sorin Ilie, Amelia Badica, University of Craiova, Romania

404 views • 14 slides
Automatic Algorithm Configuration Design choices and parameters everywhere Todays

Automatic Algorithm Configuration Design choices and parameters everywhere Todays

HEURISTIC OPTIMIZATION Automatic Algorithm Configuration Design choices and parameters everywhere Todays high-performance optimizers involve a large number of design choices and parameter settings I exact solvers I design choices include

458 views • 15 slides
Swarm Swarm Intelligence Intelligence Systems Systems

Swarm Swarm Intelligence Intelligence Systems Systems

Swarm Swarm Intelligence Intelligence Systems Systems Christian Jacob Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science University

692 views • 25 slides
Recommender Systems Introduction Radek Pel anek 2019 Language lecture today: English

Recommender Systems Introduction Radek Pel anek 2019 Language lecture today: English

Recommender Systems Introduction Radek Pel anek 2019 Language lecture today: English course materials: English rest of lectures, your presentations: probably English personal consultations, project interface: English, Czech, Slovak Very

544 views • 53 slides
SOFTWARE-SELECTION AND Model-Driven Software Engineering Research Group Department of Software

SOFTWARE-SELECTION AND Model-Driven Software Engineering Research Group Department of Software

SOLVING THE QUALITY-BASED SOFTWARE-SELECTION AND Model-Driven Software Engineering Research Group Department of Software Engineering University of Isfahan HARDWARE-MAPPING PROBLEM Samaneh Hoseindoost s.hoseindoost@eng.ui.ac.ir WITH ACO

320 views • 15 slides
11.1 Evolutionary Strategies Evolutionary methods for continuous optimisation (Bienert,

11.1 Evolutionary Strategies Evolutionary methods for continuous optimisation (Bienert,

T79.4201 Search Problems and Algorithms T79.4201 Search Problems and Algorithms 11.1 Evolutionary Strategies Evolutionary methods for continuous optimisation (Bienert, Rechenberg, Schwefel et al. 1960s onwards). Unlike GAs, some

398 views • 6 slides

More recommend