routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
package routing
|
|
|
|
|
2020-01-27 14:33:53 +03:00
|
|
|
import (
|
|
|
|
"github.com/coreos/bbolt"
|
|
|
|
"github.com/lightningnetwork/lnd/channeldb"
|
|
|
|
"github.com/lightningnetwork/lnd/lnwire"
|
|
|
|
"github.com/lightningnetwork/lnd/routing/route"
|
|
|
|
)
|
|
|
|
|
|
|
|
// routingGraph is an abstract interface that provides information about nodes
|
|
|
|
// and edges to pathfinding.
|
|
|
|
type routingGraph interface {
|
|
|
|
// forEachNodeChannel calls the callback for every channel of the given node.
|
|
|
|
forEachNodeChannel(nodePub route.Vertex,
|
|
|
|
cb func(*channeldb.ChannelEdgeInfo, *channeldb.ChannelEdgePolicy,
|
|
|
|
*channeldb.ChannelEdgePolicy) error) error
|
|
|
|
|
|
|
|
// sourceNode returns the source node of the graph.
|
|
|
|
sourceNode() route.Vertex
|
|
|
|
|
|
|
|
// fetchNodeFeatures returns the features of the given node.
|
|
|
|
fetchNodeFeatures(nodePub route.Vertex) (*lnwire.FeatureVector, error)
|
|
|
|
}
|
|
|
|
|
|
|
|
// dbRoutingTx is a routingGraph implementation that retrieves from the
|
|
|
|
// database.
|
|
|
|
type dbRoutingTx struct {
|
|
|
|
graph *channeldb.ChannelGraph
|
|
|
|
tx *bbolt.Tx
|
|
|
|
source route.Vertex
|
|
|
|
}
|
|
|
|
|
|
|
|
// newDbRoutingTx instantiates a new db-connected routing graph. It implictly
|
|
|
|
// instantiates a new read transaction.
|
|
|
|
func newDbRoutingTx(graph *channeldb.ChannelGraph) (*dbRoutingTx, error) {
|
|
|
|
sourceNode, err := graph.SourceNode()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
tx, err := graph.Database().Begin(false)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return &dbRoutingTx{
|
|
|
|
graph: graph,
|
|
|
|
tx: tx,
|
|
|
|
source: sourceNode.PubKeyBytes,
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// close closes the underlying db transaction.
|
|
|
|
func (g *dbRoutingTx) close() error {
|
|
|
|
return g.tx.Rollback()
|
|
|
|
}
|
|
|
|
|
|
|
|
// forEachNodeChannel calls the callback for every channel of the given node.
|
|
|
|
//
|
|
|
|
// NOTE: Part of the routingGraph interface.
|
|
|
|
func (g *dbRoutingTx) forEachNodeChannel(nodePub route.Vertex,
|
|
|
|
cb func(*channeldb.ChannelEdgeInfo, *channeldb.ChannelEdgePolicy,
|
|
|
|
*channeldb.ChannelEdgePolicy) error) error {
|
|
|
|
|
|
|
|
txCb := func(_ *bbolt.Tx, info *channeldb.ChannelEdgeInfo,
|
|
|
|
p1, p2 *channeldb.ChannelEdgePolicy) error {
|
|
|
|
|
|
|
|
return cb(info, p1, p2)
|
|
|
|
}
|
|
|
|
|
|
|
|
return g.graph.ForEachNodeChannel(g.tx, nodePub[:], txCb)
|
|
|
|
}
|
|
|
|
|
|
|
|
// sourceNode returns the source node of the graph.
|
|
|
|
//
|
|
|
|
// NOTE: Part of the routingGraph interface.
|
|
|
|
func (g *dbRoutingTx) sourceNode() route.Vertex {
|
|
|
|
return g.source
|
|
|
|
}
|
|
|
|
|
|
|
|
// fetchNodeFeatures returns the features of the given node. If the node is
|
|
|
|
// unknown, assume no additional features are supported.
|
|
|
|
//
|
|
|
|
// NOTE: Part of the routingGraph interface.
|
|
|
|
func (g *dbRoutingTx) fetchNodeFeatures(nodePub route.Vertex) (
|
|
|
|
*lnwire.FeatureVector, error) {
|
|
|
|
|
|
|
|
targetNode, err := g.graph.FetchLightningNode(g.tx, nodePub)
|
|
|
|
switch err {
|
|
|
|
|
|
|
|
// If the node exists and has features, return them directly.
|
|
|
|
case nil:
|
|
|
|
return targetNode.Features, nil
|
|
|
|
|
|
|
|
// If we couldn't find a node announcement, populate a blank feature
|
|
|
|
// vector.
|
|
|
|
case channeldb.ErrGraphNodeNotFound:
|
|
|
|
return lnwire.EmptyFeatureVector(), nil
|
|
|
|
|
|
|
|
// Otherwise bubble the error up.
|
|
|
|
default:
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
}
|