To Do

  • merge this section with Path Discovery?
  • link state routing, see below
  • specify how nodes may route queries with no routing target, or queries whose routing target is the node doing the routing itself, towards queries they have received with the same paymend ID, coming from the opposite end.

Query Routing

Replace Metropolis-Hastings with Link State? -- routing options:

  • 2-d routing table with distances between local/neighbour nodes and every other known node
    • Dijkstra's algorithm for each local node
    • best paths, but space/time intensive
  • locally-computed Metropolis-Hastings for finding reasonable paths dynamically.
    • significantly worse paths, but easier on time/space requirements