6b70791c2d
This PR replaces the previously used edge and node ignore lists in path finding by a probability based system. It modifies path finding so that it not only compares routes on fee and time lock, but also takes route success probability into account. Allowing routes to be compared based on success probability is achieved by introducing a 'virtual' cost of a payment attempt and using that to translate probability into another cost factor. |
||
|---|---|---|
| .. | ||
| chainview | ||
| route | ||
| testdata | ||
| ann_validation.go | ||
| conf_experimental.go | ||
| conf.go | ||
| errors.go | ||
| graph.go | ||
| heap_test.go | ||
| heap.go | ||
| log.go | ||
| missioncontrol.go | ||
| mock_test.go | ||
| notifications_test.go | ||
| notifications.go | ||
| pathfind_test.go | ||
| pathfind.go | ||
| payment_lifecycle.go | ||
| payment_session_test.go | ||
| payment_session.go | ||
| README.md | ||
| router_test.go | ||
| router.go | ||
| validation_barrier_test.go | ||
| validation_barrier.go | ||
routing
The routing package implements authentication+validation of channel announcements, pruning of the channel graph, path finding within the network, sending outgoing payments into the network and synchronizing new peers to our channel graph state.
Installation and Updating
$ go get -u github.com/lightningnetwork/lnd/routing