RoutingWorkPage

Protocol.RoutingWorkPage History

Hide minor edits - Show changes to output

November 26, 2006, at 10:06 PM by ryan -

Deleted line 3:

* alternative forking formula: minimize [sum over all forks(query amount * distance to target)] * # of forks

Changed lines 5-6 from:

to:

* 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.

Restore

October 26, 2006, at 11:12 PM by ryan -

Added line 3:

* merge this section with [[Protocol/Path Discovery]]?

Restore

October 26, 2006, at 11:04 PM by ryan -

Changed lines 4-5 from:

to:

* link state routing, see below

Restore

October 26, 2006, at 11:04 PM by ryan -

Added lines 1-6:

'''To Do'''

* alternative forking formula: minimize [sum over all forks(query amount * distance to target)] * # of forks

----------------------

Restore

October 26, 2006, at 10:53 PM by ryan -

Added lines 1-9:

'''Query Routing'''

Replace Metropolis-Hastings with [[Link State -> Main/Grouped Link-State Routing]] -- 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

Restore