2019-01-24 20:15:10 +00:00
|
|
|
// Copyright (C) 2019 Storj Labs, Inc.
|
2018-04-18 17:55:28 +01:00
|
|
|
// See LICENSE for copying information.
|
|
|
|
|
2018-06-13 19:22:32 +01:00
|
|
|
package overlay
|
2018-04-18 16:34:15 +01:00
|
|
|
|
|
|
|
import (
|
2018-05-16 19:47:59 +01:00
|
|
|
"context"
|
2019-01-15 16:08:45 +00:00
|
|
|
"errors"
|
2019-05-30 18:35:04 +01:00
|
|
|
"net"
|
2019-04-04 17:34:36 +01:00
|
|
|
"time"
|
2018-04-18 16:34:15 +01:00
|
|
|
|
2018-06-13 19:22:32 +01:00
|
|
|
"github.com/zeebo/errs"
|
2018-12-22 04:51:42 +00:00
|
|
|
"go.uber.org/zap"
|
2018-11-16 16:31:14 +00:00
|
|
|
|
2018-09-18 05:39:06 +01:00
|
|
|
"storj.io/storj/pkg/pb"
|
2018-11-30 13:40:13 +00:00
|
|
|
"storj.io/storj/pkg/storj"
|
2018-06-13 19:22:32 +01:00
|
|
|
"storj.io/storj/storage"
|
2018-04-18 16:34:15 +01:00
|
|
|
)
|
|
|
|
|
2018-12-17 18:47:26 +00:00
|
|
|
// ErrEmptyNode is returned when the nodeID is empty
|
|
|
|
var ErrEmptyNode = errs.New("empty node ID")
|
|
|
|
|
|
|
|
// ErrNodeNotFound is returned if a node does not exist in database
|
2019-03-29 08:53:43 +00:00
|
|
|
var ErrNodeNotFound = errs.Class("node not found")
|
2018-11-21 17:31:27 +00:00
|
|
|
|
2019-05-27 12:13:47 +01:00
|
|
|
// ErrNodeOffline is returned if a nodes is offline
|
|
|
|
var ErrNodeOffline = errs.Class("node is offline")
|
|
|
|
|
2019-06-24 15:46:10 +01:00
|
|
|
// ErrNodeDisqualified is returned if a nodes is disqualified
|
|
|
|
var ErrNodeDisqualified = errs.Class("node is disqualified")
|
|
|
|
|
2018-12-17 18:47:26 +00:00
|
|
|
// ErrBucketNotFound is returned if a bucket is unable to be found in the routing table
|
2019-03-29 08:53:43 +00:00
|
|
|
var ErrBucketNotFound = errs.New("bucket not found")
|
2018-11-21 17:31:27 +00:00
|
|
|
|
2019-01-31 18:49:00 +00:00
|
|
|
// ErrNotEnoughNodes is when selecting nodes failed with the given parameters
|
|
|
|
var ErrNotEnoughNodes = errs.Class("not enough nodes")
|
|
|
|
|
2018-07-09 23:43:32 +01:00
|
|
|
// OverlayError creates class of errors for stack traces
|
2019-03-29 08:53:43 +00:00
|
|
|
var OverlayError = errs.Class("overlay error")
|
2018-06-05 22:06:37 +01:00
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
// DB implements the database for overlay.Cache
|
|
|
|
type DB interface {
|
2019-02-11 19:24:51 +00:00
|
|
|
// SelectStorageNodes looks up nodes based on criteria
|
|
|
|
SelectStorageNodes(ctx context.Context, count int, criteria *NodeCriteria) ([]*pb.Node, error)
|
|
|
|
// SelectNewStorageNodes looks up nodes based on new node criteria
|
2019-04-23 21:47:11 +01:00
|
|
|
SelectNewStorageNodes(ctx context.Context, count int, criteria *NodeCriteria) ([]*pb.Node, error)
|
2019-01-31 18:49:00 +00:00
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
// Get looks up the node by nodeID
|
2019-04-04 17:34:36 +01:00
|
|
|
Get(ctx context.Context, nodeID storj.NodeID) (*NodeDossier, error)
|
2019-06-18 23:22:14 +01:00
|
|
|
// KnownOffline filters a set of nodes to offline nodes
|
|
|
|
KnownOffline(context.Context, *NodeCriteria, storj.NodeIDList) (storj.NodeIDList, error)
|
2019-05-01 14:45:52 +01:00
|
|
|
// KnownUnreliableOrOffline filters a set of nodes to unhealth or offlines node, independent of new
|
|
|
|
KnownUnreliableOrOffline(context.Context, *NodeCriteria, storj.NodeIDList) (storj.NodeIDList, error)
|
2019-07-08 23:04:35 +01:00
|
|
|
// Reliable returns all nodes that are reliable
|
|
|
|
Reliable(context.Context, *NodeCriteria) (storj.NodeIDList, error)
|
2019-01-30 16:29:18 +00:00
|
|
|
// Paginate will page through the database nodes
|
2019-04-04 17:34:36 +01:00
|
|
|
Paginate(ctx context.Context, offset int64, limit int) ([]*NodeDossier, bool, error)
|
2019-07-12 15:35:48 +01:00
|
|
|
// PaginateQualified will page through the qualified nodes
|
|
|
|
PaginateQualified(ctx context.Context, offset int64, limit int) ([]*pb.Node, bool, error)
|
2019-06-03 15:53:30 +01:00
|
|
|
// IsVetted returns whether or not the node reaches reputable thresholds
|
|
|
|
IsVetted(ctx context.Context, id storj.NodeID, criteria *NodeCriteria) (bool, error)
|
2019-04-22 10:07:50 +01:00
|
|
|
// Update updates node address
|
2019-06-20 14:56:04 +01:00
|
|
|
UpdateAddress(ctx context.Context, value *pb.Node, defaults NodeSelectionConfig) error
|
2019-03-25 22:25:09 +00:00
|
|
|
// UpdateStats all parts of single storagenode's stats.
|
|
|
|
UpdateStats(ctx context.Context, request *UpdateRequest) (stats *NodeStats, err error)
|
2019-04-10 07:04:24 +01:00
|
|
|
// UpdateNodeInfo updates node dossier with info requested from the node itself like node type, email, wallet, capacity, and version.
|
|
|
|
UpdateNodeInfo(ctx context.Context, node storj.NodeID, nodeInfo *pb.InfoResponse) (stats *NodeDossier, err error)
|
2019-03-25 22:25:09 +00:00
|
|
|
// UpdateUptime updates a single storagenode's uptime stats.
|
2019-06-20 14:56:04 +01:00
|
|
|
UpdateUptime(ctx context.Context, nodeID storj.NodeID, isUp bool, lambda, weight, uptimeDQ float64) (stats *NodeStats, err error)
|
2019-01-15 16:08:45 +00:00
|
|
|
}
|
|
|
|
|
2019-03-23 08:06:11 +00:00
|
|
|
// FindStorageNodesRequest defines easy request parameters.
|
|
|
|
type FindStorageNodesRequest struct {
|
|
|
|
MinimumRequiredNodes int
|
|
|
|
RequestedCount int
|
2019-04-26 13:15:06 +01:00
|
|
|
FreeBandwidth int64
|
|
|
|
FreeDisk int64
|
|
|
|
ExcludedNodes []storj.NodeID
|
|
|
|
MinimumVersion string // semver or empty
|
2019-03-23 08:06:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// NodeCriteria are the requirements for selecting nodes
|
|
|
|
type NodeCriteria struct {
|
2019-06-18 18:40:28 +01:00
|
|
|
FreeBandwidth int64
|
|
|
|
FreeDisk int64
|
|
|
|
AuditCount int64
|
|
|
|
UptimeCount int64
|
|
|
|
ExcludedNodes []storj.NodeID
|
|
|
|
ExcludedIPs []string
|
|
|
|
MinimumVersion string // semver or empty
|
|
|
|
OnlineWindow time.Duration
|
|
|
|
DistinctIP bool
|
2019-03-23 08:06:11 +00:00
|
|
|
}
|
|
|
|
|
2019-03-25 22:25:09 +00:00
|
|
|
// UpdateRequest is used to update a node status.
|
|
|
|
type UpdateRequest struct {
|
|
|
|
NodeID storj.NodeID
|
|
|
|
AuditSuccess bool
|
|
|
|
IsUp bool
|
2019-06-20 14:56:04 +01:00
|
|
|
// n.b. these are set values from the satellite.
|
|
|
|
// They are part of the UpdateRequest struct in order to be
|
|
|
|
// more easily accessible in satellite/satellitedb/overlaycache.go.
|
|
|
|
AuditLambda float64
|
|
|
|
AuditWeight float64
|
|
|
|
AuditDQ float64
|
|
|
|
UptimeLambda float64
|
|
|
|
UptimeWeight float64
|
|
|
|
UptimeDQ float64
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-04-04 17:34:36 +01:00
|
|
|
// NodeDossier is the complete info that the satellite tracks for a storage node
|
|
|
|
type NodeDossier struct {
|
|
|
|
pb.Node
|
2019-05-30 22:38:23 +01:00
|
|
|
Type pb.NodeType
|
|
|
|
Operator pb.NodeOperator
|
|
|
|
Capacity pb.NodeCapacity
|
|
|
|
Reputation NodeStats
|
|
|
|
Version pb.NodeVersion
|
|
|
|
Contained bool
|
2019-06-18 10:14:31 +01:00
|
|
|
Disqualified *time.Time
|
2019-04-04 17:34:36 +01:00
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
// NodeStats contains statistics about a node.
|
2019-03-25 22:25:09 +00:00
|
|
|
type NodeStats struct {
|
2019-06-17 21:48:04 +01:00
|
|
|
Latency90 int64
|
|
|
|
AuditSuccessCount int64
|
|
|
|
AuditCount int64
|
|
|
|
UptimeSuccessCount int64
|
|
|
|
UptimeCount int64
|
|
|
|
LastContactSuccess time.Time
|
|
|
|
LastContactFailure time.Time
|
|
|
|
AuditReputationAlpha float64
|
|
|
|
UptimeReputationAlpha float64
|
|
|
|
AuditReputationBeta float64
|
|
|
|
UptimeReputationBeta float64
|
2019-06-20 14:56:04 +01:00
|
|
|
Disqualified *time.Time
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-03-23 08:06:11 +00:00
|
|
|
// Cache is used to store and handle node information
|
2018-06-13 19:22:32 +01:00
|
|
|
type Cache struct {
|
2019-03-23 08:06:11 +00:00
|
|
|
log *zap.Logger
|
|
|
|
db DB
|
|
|
|
preferences NodeSelectionConfig
|
2018-04-18 16:34:15 +01:00
|
|
|
}
|
|
|
|
|
2018-12-20 13:57:54 +00:00
|
|
|
// NewCache returns a new Cache
|
2019-03-25 22:25:09 +00:00
|
|
|
func NewCache(log *zap.Logger, db DB, preferences NodeSelectionConfig) *Cache {
|
2019-03-23 08:06:11 +00:00
|
|
|
return &Cache{
|
|
|
|
log: log,
|
|
|
|
db: db,
|
|
|
|
preferences: preferences,
|
|
|
|
}
|
2018-12-20 13:57:54 +00:00
|
|
|
}
|
|
|
|
|
2019-01-18 13:54:08 +00:00
|
|
|
// Close closes resources
|
|
|
|
func (cache *Cache) Close() error { return nil }
|
|
|
|
|
2018-12-20 13:57:54 +00:00
|
|
|
// Inspect lists limited number of items in the cache
|
2019-06-04 12:36:27 +01:00
|
|
|
func (cache *Cache) Inspect(ctx context.Context) (_ storage.Keys, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-15 16:08:45 +00:00
|
|
|
// TODO: implement inspection tools
|
|
|
|
return nil, errors.New("not implemented")
|
2018-06-13 19:22:32 +01:00
|
|
|
}
|
|
|
|
|
2019-01-30 16:29:18 +00:00
|
|
|
// Paginate returns a list of `limit` nodes starting from `start` offset.
|
2019-04-04 17:34:36 +01:00
|
|
|
func (cache *Cache) Paginate(ctx context.Context, offset int64, limit int) (_ []*NodeDossier, _ bool, err error) {
|
2019-03-23 08:06:11 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-30 16:29:18 +00:00
|
|
|
return cache.db.Paginate(ctx, offset, limit)
|
|
|
|
}
|
|
|
|
|
2019-07-12 15:35:48 +01:00
|
|
|
// PaginateQualified returns a list of `limit` qualified nodes starting from `start` offset.
|
|
|
|
func (cache *Cache) PaginateQualified(ctx context.Context, offset int64, limit int) (_ []*pb.Node, _ bool, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
return cache.db.PaginateQualified(ctx, offset, limit)
|
|
|
|
}
|
|
|
|
|
2018-09-11 05:52:14 +01:00
|
|
|
// Get looks up the provided nodeID from the overlay cache
|
2019-04-04 17:34:36 +01:00
|
|
|
func (cache *Cache) Get(ctx context.Context, nodeID storj.NodeID) (_ *NodeDossier, err error) {
|
2019-03-23 08:06:11 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2018-12-17 18:47:26 +00:00
|
|
|
if nodeID.IsZero() {
|
|
|
|
return nil, ErrEmptyNode
|
|
|
|
}
|
2019-01-15 16:08:45 +00:00
|
|
|
return cache.db.Get(ctx, nodeID)
|
2018-04-18 16:34:15 +01:00
|
|
|
}
|
|
|
|
|
2019-04-23 23:45:50 +01:00
|
|
|
// IsOnline checks if a node is 'online' based on the collected statistics.
|
|
|
|
func (cache *Cache) IsOnline(node *NodeDossier) bool {
|
2019-07-10 03:36:09 +01:00
|
|
|
return time.Now().Sub(node.Reputation.LastContactSuccess) < cache.preferences.OnlineWindow ||
|
2019-04-23 23:45:50 +01:00
|
|
|
node.Reputation.LastContactSuccess.After(node.Reputation.LastContactFailure)
|
|
|
|
}
|
|
|
|
|
2019-03-23 08:06:11 +00:00
|
|
|
// FindStorageNodes searches the overlay network for nodes that meet the provided requirements
|
2019-06-04 12:36:27 +01:00
|
|
|
func (cache *Cache) FindStorageNodes(ctx context.Context, req FindStorageNodesRequest) (_ []*pb.Node, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-03-23 08:06:11 +00:00
|
|
|
return cache.FindStorageNodesWithPreferences(ctx, req, &cache.preferences)
|
|
|
|
}
|
|
|
|
|
|
|
|
// FindStorageNodesWithPreferences searches the overlay network for nodes that meet the provided criteria
|
2019-04-23 16:23:51 +01:00
|
|
|
func (cache *Cache) FindStorageNodesWithPreferences(ctx context.Context, req FindStorageNodesRequest, preferences *NodeSelectionConfig) (nodes []*pb.Node, err error) {
|
2019-03-23 08:06:11 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-31 18:49:00 +00:00
|
|
|
|
|
|
|
// TODO: add sanity limits to requested node count
|
|
|
|
// TODO: add sanity limits to excluded nodes
|
2019-03-23 08:06:11 +00:00
|
|
|
reputableNodeCount := req.MinimumRequiredNodes
|
2019-01-31 18:49:00 +00:00
|
|
|
if reputableNodeCount <= 0 {
|
2019-03-23 08:06:11 +00:00
|
|
|
reputableNodeCount = req.RequestedCount
|
2019-01-31 18:49:00 +00:00
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
excludedNodes := req.ExcludedNodes
|
2019-04-23 16:23:51 +01:00
|
|
|
|
|
|
|
newNodeCount := 0
|
|
|
|
if preferences.NewNodePercentage > 0 {
|
|
|
|
newNodeCount = int(float64(reputableNodeCount) * preferences.NewNodePercentage)
|
|
|
|
}
|
|
|
|
|
|
|
|
var newNodes []*pb.Node
|
|
|
|
if newNodeCount > 0 {
|
2019-04-23 21:47:11 +01:00
|
|
|
newNodes, err = cache.db.SelectNewStorageNodes(ctx, newNodeCount, &NodeCriteria{
|
2019-06-18 18:40:28 +01:00
|
|
|
FreeBandwidth: req.FreeBandwidth,
|
|
|
|
FreeDisk: req.FreeDisk,
|
|
|
|
AuditCount: preferences.AuditCount,
|
|
|
|
ExcludedNodes: excludedNodes,
|
|
|
|
MinimumVersion: preferences.MinimumVersion,
|
|
|
|
OnlineWindow: preferences.OnlineWindow,
|
|
|
|
DistinctIP: preferences.DistinctIP,
|
2019-04-23 16:23:51 +01:00
|
|
|
})
|
|
|
|
if err != nil {
|
2019-07-23 15:28:06 +01:00
|
|
|
return nil, OverlayError.Wrap(err)
|
2019-04-23 16:23:51 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
var excludedIPs []string
|
|
|
|
// add selected new nodes and their IPs to the excluded lists for reputable node selection
|
2019-04-23 16:23:51 +01:00
|
|
|
for _, newNode := range newNodes {
|
2019-05-22 21:06:27 +01:00
|
|
|
excludedNodes = append(excludedNodes, newNode.Id)
|
|
|
|
if preferences.DistinctIP {
|
|
|
|
excludedIPs = append(excludedIPs, newNode.LastIp)
|
|
|
|
}
|
2019-04-23 16:23:51 +01:00
|
|
|
}
|
|
|
|
|
2019-05-07 15:44:47 +01:00
|
|
|
criteria := NodeCriteria{
|
2019-06-18 18:40:28 +01:00
|
|
|
FreeBandwidth: req.FreeBandwidth,
|
|
|
|
FreeDisk: req.FreeDisk,
|
|
|
|
AuditCount: preferences.AuditCount,
|
|
|
|
UptimeCount: preferences.UptimeCount,
|
|
|
|
ExcludedNodes: excludedNodes,
|
|
|
|
ExcludedIPs: excludedIPs,
|
|
|
|
MinimumVersion: preferences.MinimumVersion,
|
|
|
|
OnlineWindow: preferences.OnlineWindow,
|
|
|
|
DistinctIP: preferences.DistinctIP,
|
2019-05-07 15:44:47 +01:00
|
|
|
}
|
|
|
|
reputableNodes, err := cache.db.SelectStorageNodes(ctx, reputableNodeCount-len(newNodes), &criteria)
|
2019-01-31 18:49:00 +00:00
|
|
|
if err != nil {
|
2019-07-23 15:28:06 +01:00
|
|
|
return nil, OverlayError.Wrap(err)
|
2019-01-31 18:49:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
nodes = append(nodes, newNodes...)
|
|
|
|
nodes = append(nodes, reputableNodes...)
|
|
|
|
|
2019-04-23 16:23:51 +01:00
|
|
|
if len(nodes) < reputableNodeCount {
|
2019-05-07 15:44:47 +01:00
|
|
|
return nodes, ErrNotEnoughNodes.New("requested %d found %d; %+v ", reputableNodeCount, len(nodes), criteria)
|
2019-01-31 18:49:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return nodes, nil
|
|
|
|
}
|
|
|
|
|
2019-06-18 23:22:14 +01:00
|
|
|
// KnownOffline filters a set of nodes to offline nodes
|
|
|
|
func (cache *Cache) KnownOffline(ctx context.Context, nodeIds storj.NodeIDList) (offlineNodes storj.NodeIDList, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
criteria := &NodeCriteria{
|
|
|
|
OnlineWindow: cache.preferences.OnlineWindow,
|
|
|
|
}
|
|
|
|
return cache.db.KnownOffline(ctx, criteria, nodeIds)
|
|
|
|
}
|
|
|
|
|
2019-05-10 20:05:42 +01:00
|
|
|
// KnownUnreliableOrOffline filters a set of nodes to unhealth or offlines node, independent of new.
|
2019-05-01 14:45:52 +01:00
|
|
|
func (cache *Cache) KnownUnreliableOrOffline(ctx context.Context, nodeIds storj.NodeIDList) (badNodes storj.NodeIDList, err error) {
|
2019-03-23 08:06:11 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-05-01 14:45:52 +01:00
|
|
|
criteria := &NodeCriteria{
|
2019-06-18 18:40:28 +01:00
|
|
|
OnlineWindow: cache.preferences.OnlineWindow,
|
2018-09-11 05:52:14 +01:00
|
|
|
}
|
2019-05-01 14:45:52 +01:00
|
|
|
return cache.db.KnownUnreliableOrOffline(ctx, criteria, nodeIds)
|
2018-09-11 05:52:14 +01:00
|
|
|
}
|
|
|
|
|
2019-07-08 23:04:35 +01:00
|
|
|
// Reliable filters a set of nodes that are reliable, independent of new.
|
|
|
|
func (cache *Cache) Reliable(ctx context.Context) (nodes storj.NodeIDList, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
criteria := &NodeCriteria{
|
|
|
|
OnlineWindow: cache.preferences.OnlineWindow,
|
|
|
|
}
|
|
|
|
return cache.db.Reliable(ctx, criteria)
|
|
|
|
}
|
|
|
|
|
2019-04-22 10:07:50 +01:00
|
|
|
// Put adds a node id and proto definition into the overlay cache
|
2019-03-23 08:06:11 +00:00
|
|
|
func (cache *Cache) Put(ctx context.Context, nodeID storj.NodeID, value pb.Node) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2018-11-20 16:54:52 +00:00
|
|
|
// If we get a Node without an ID (i.e. bootstrap node)
|
|
|
|
// we don't want to add to the routing tbale
|
2018-12-17 18:47:26 +00:00
|
|
|
if nodeID.IsZero() {
|
2018-11-20 16:54:52 +00:00
|
|
|
return nil
|
|
|
|
}
|
2019-01-15 16:08:45 +00:00
|
|
|
if nodeID != value.Id {
|
|
|
|
return errors.New("invalid request")
|
|
|
|
}
|
2019-05-30 18:35:04 +01:00
|
|
|
if value.Address == nil {
|
|
|
|
return errors.New("node has no address")
|
|
|
|
}
|
2019-06-24 16:33:18 +01:00
|
|
|
// Resolve IP Address Network to ensure it is set
|
|
|
|
value.LastIp, err = GetNetwork(ctx, value.Address.Address)
|
2019-05-30 18:35:04 +01:00
|
|
|
if err != nil {
|
|
|
|
return OverlayError.Wrap(err)
|
|
|
|
}
|
2019-06-20 14:56:04 +01:00
|
|
|
return cache.db.UpdateAddress(ctx, &value, cache.preferences)
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-06-03 15:53:30 +01:00
|
|
|
// IsVetted returns whether or not the node reaches reputable thresholds
|
|
|
|
func (cache *Cache) IsVetted(ctx context.Context, nodeID storj.NodeID) (reputable bool, err error) {
|
2019-05-30 20:52:33 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
criteria := &NodeCriteria{
|
2019-06-18 18:40:28 +01:00
|
|
|
AuditCount: cache.preferences.AuditCount,
|
|
|
|
UptimeCount: cache.preferences.UptimeCount,
|
2019-05-30 20:52:33 +01:00
|
|
|
}
|
2019-06-03 15:53:30 +01:00
|
|
|
reputable, err = cache.db.IsVetted(ctx, nodeID, criteria)
|
2019-05-30 20:52:33 +01:00
|
|
|
if err != nil {
|
|
|
|
return false, err
|
|
|
|
}
|
|
|
|
return reputable, nil
|
|
|
|
}
|
|
|
|
|
2019-03-25 22:25:09 +00:00
|
|
|
// UpdateStats all parts of single storagenode's stats.
|
|
|
|
func (cache *Cache) UpdateStats(ctx context.Context, request *UpdateRequest) (stats *NodeStats, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-06-20 14:56:04 +01:00
|
|
|
|
|
|
|
request.AuditLambda = cache.preferences.AuditReputationLambda
|
|
|
|
request.AuditWeight = cache.preferences.AuditReputationWeight
|
|
|
|
request.AuditDQ = cache.preferences.AuditReputationDQ
|
|
|
|
request.UptimeLambda = cache.preferences.UptimeReputationLambda
|
|
|
|
request.UptimeWeight = cache.preferences.UptimeReputationWeight
|
|
|
|
request.UptimeDQ = cache.preferences.UptimeReputationDQ
|
|
|
|
|
2019-03-25 22:25:09 +00:00
|
|
|
return cache.db.UpdateStats(ctx, request)
|
|
|
|
}
|
|
|
|
|
2019-04-10 07:04:24 +01:00
|
|
|
// UpdateNodeInfo updates node dossier with info requested from the node itself like node type, email, wallet, capacity, and version.
|
|
|
|
func (cache *Cache) UpdateNodeInfo(ctx context.Context, node storj.NodeID, nodeInfo *pb.InfoResponse) (stats *NodeDossier, err error) {
|
2019-03-25 22:25:09 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-04-10 07:04:24 +01:00
|
|
|
return cache.db.UpdateNodeInfo(ctx, node, nodeInfo)
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// UpdateUptime updates a single storagenode's uptime stats.
|
|
|
|
func (cache *Cache) UpdateUptime(ctx context.Context, nodeID storj.NodeID, isUp bool) (stats *NodeStats, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-06-20 14:56:04 +01:00
|
|
|
lambda := cache.preferences.UptimeReputationLambda
|
|
|
|
weight := cache.preferences.UptimeReputationWeight
|
|
|
|
uptimeDQ := cache.preferences.UptimeReputationDQ
|
|
|
|
|
|
|
|
return cache.db.UpdateUptime(ctx, nodeID, isUp, lambda, weight, uptimeDQ)
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2018-12-22 04:51:42 +00:00
|
|
|
// ConnFailure implements the Transport Observer `ConnFailure` function
|
|
|
|
func (cache *Cache) ConnFailure(ctx context.Context, node *pb.Node, failureError error) {
|
2019-03-23 08:06:11 +00:00
|
|
|
var err error
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-06-20 14:56:04 +01:00
|
|
|
lambda := cache.preferences.UptimeReputationLambda
|
|
|
|
weight := cache.preferences.UptimeReputationWeight
|
|
|
|
uptimeDQ := cache.preferences.UptimeReputationDQ
|
|
|
|
|
2018-12-22 04:51:42 +00:00
|
|
|
// TODO: Kademlia paper specifies 5 unsuccessful PINGs before removing the node
|
|
|
|
// from our routing table, but this is the cache so maybe we want to treat
|
|
|
|
// it differently.
|
2019-06-20 14:56:04 +01:00
|
|
|
_, err = cache.db.UpdateUptime(ctx, node.Id, false, lambda, weight, uptimeDQ)
|
2018-12-22 04:51:42 +00:00
|
|
|
if err != nil {
|
2019-03-25 22:25:09 +00:00
|
|
|
zap.L().Debug("error updating uptime for node", zap.Error(err))
|
2018-12-22 04:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// ConnSuccess implements the Transport Observer `ConnSuccess` function
|
|
|
|
func (cache *Cache) ConnSuccess(ctx context.Context, node *pb.Node) {
|
2019-03-23 08:06:11 +00:00
|
|
|
var err error
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
err = cache.Put(ctx, node.Id, *node)
|
2018-12-22 04:51:42 +00:00
|
|
|
if err != nil {
|
2019-03-25 22:25:09 +00:00
|
|
|
zap.L().Debug("error updating uptime for node", zap.Error(err))
|
2018-12-22 04:51:42 +00:00
|
|
|
}
|
2019-06-20 14:56:04 +01:00
|
|
|
|
|
|
|
lambda := cache.preferences.UptimeReputationLambda
|
|
|
|
weight := cache.preferences.UptimeReputationWeight
|
|
|
|
uptimeDQ := cache.preferences.UptimeReputationDQ
|
|
|
|
|
|
|
|
_, err = cache.db.UpdateUptime(ctx, node.Id, true, lambda, weight, uptimeDQ)
|
2018-12-22 04:51:42 +00:00
|
|
|
if err != nil {
|
2019-03-25 22:25:09 +00:00
|
|
|
zap.L().Debug("error updating node connection info", zap.Error(err))
|
2018-12-22 04:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
2019-05-16 14:49:10 +01:00
|
|
|
|
|
|
|
// GetMissingPieces returns the list of offline nodes
|
|
|
|
func (cache *Cache) GetMissingPieces(ctx context.Context, pieces []*pb.RemotePiece) (missingPieces []int32, err error) {
|
2019-06-04 12:36:27 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-05-16 14:49:10 +01:00
|
|
|
var nodeIDs storj.NodeIDList
|
|
|
|
for _, p := range pieces {
|
|
|
|
nodeIDs = append(nodeIDs, p.NodeId)
|
|
|
|
}
|
|
|
|
badNodeIDs, err := cache.KnownUnreliableOrOffline(ctx, nodeIDs)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.New("error getting nodes %s", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, p := range pieces {
|
|
|
|
for _, nodeID := range badNodeIDs {
|
|
|
|
if nodeID == p.NodeId {
|
|
|
|
missingPieces = append(missingPieces, p.GetPieceNum())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return missingPieces, nil
|
|
|
|
}
|
2019-05-30 18:35:04 +01:00
|
|
|
|
2019-06-24 16:33:18 +01:00
|
|
|
func getIP(ctx context.Context, target string) (ip net.IPAddr, err error) {
|
2019-06-04 12:36:27 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-05-30 18:35:04 +01:00
|
|
|
host, _, err := net.SplitHostPort(target)
|
|
|
|
if err != nil {
|
2019-06-24 16:33:18 +01:00
|
|
|
return net.IPAddr{}, err
|
2019-05-30 18:35:04 +01:00
|
|
|
}
|
|
|
|
ipAddr, err := net.ResolveIPAddr("ip", host)
|
2019-06-24 16:33:18 +01:00
|
|
|
if err != nil {
|
|
|
|
return net.IPAddr{}, err
|
|
|
|
}
|
|
|
|
return *ipAddr, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetNetwork resolves the target address and determines its IP /24 Subnet
|
|
|
|
func GetNetwork(ctx context.Context, target string) (network string, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
addr, err := getIP(ctx, target)
|
2019-05-30 18:35:04 +01:00
|
|
|
if err != nil {
|
|
|
|
return "", err
|
|
|
|
}
|
2019-06-24 16:33:18 +01:00
|
|
|
|
|
|
|
// If addr can be converted to 4byte notation, it is an IPv4 address, else its an IPv6 address
|
|
|
|
if ipv4 := addr.IP.To4(); ipv4 != nil {
|
|
|
|
//Filter all IPv4 Addresses into /24 Subnet's
|
|
|
|
mask := net.CIDRMask(24, 32)
|
|
|
|
return ipv4.Mask(mask).String(), nil
|
|
|
|
}
|
|
|
|
if ipv6 := addr.IP.To16(); ipv6 != nil {
|
|
|
|
//Filter all IPv6 Addresses into /64 Subnet's
|
|
|
|
mask := net.CIDRMask(64, 128)
|
|
|
|
return ipv6.Mask(mask).String(), nil
|
|
|
|
}
|
|
|
|
|
|
|
|
return "", errors.New("unable to get network for address " + addr.String())
|
2019-05-30 18:35:04 +01:00
|
|
|
}
|