go-ethereum/swarm/network/kademlia.go

// Copyright 2017 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.

package network

import (
	"bytes"
	"fmt"
	"strings"
	"time"

	"github.com/ethereum/go-ethereum/log"
	"github.com/ethereum/go-ethereum/p2p/discover"
	"github.com/ethereum/go-ethereum/pot"
)

/*

Taking the proximity order relative to a fix point x classifies the points in
the space (n byte long byte sequences) into bins. Items in each are at
most half as distant from x as items in the previous bin. Given a sample of
uniformly distributed items (a hash function over arbitrary sequence) the
proximity scale maps onto series of subsets with cardinalities on a negative
exponential scale.

It also has the property that any two item belonging to the same bin are at
most half as distant from each other as they are from x.

If we think of random sample of items in the bins as connections in a network of
interconnected nodes than relative proximity can serve as the basis for local
decisions for graph traversal where the task is to find a route between two
points. Since in every hop, the finite distance halves, there is
a guaranteed constant maximum limit on the number of hops needed to reach one
node from the other.
*/

// KadParams holds the config params for Kademlia
type KadParams struct {
	// adjustable parameters
	MaxProxDisplay int // number of rows the table shows
	MinProxBinSize int // nearest neighbour core minimum cardinality
	MinBinSize     int // minimum number of peers in a row
	MaxBinSize     int // maximum number of peers in a row before pruning
	RetryInterval  int // initial interval before a peer is first redialed
	RetryExponent  int // exponent to multiply retry intervals with
	MaxRetries     int // maximum number of redial attempts
	PruneInterval  int // interval between peer pruning cycles
}

// NewKadParams returns a params struct with default values
func NewKadParams() *KadParams {
	return &KadParams{
		MaxProxDisplay: 8,
		MinProxBinSize: 2,
		MinBinSize:     2,
		MaxBinSize:     4,
		//RetryInterval:  42000000000,
		RetryInterval: 420000000,
		MaxRetries:    42,
		RetryExponent: 2,
	}
}

// Kademlia is a table of live peers and a db of known peers
type Kademlia struct {
	*KadParams          // Kademlia configuration parameters
	base       []byte   // immutable baseaddress of the table
	addrs      *pot.Pot // pots container for known peer addresses
	conns      *pot.Pot // pots container for live peer connections
	depth      uint8    // stores the last calculated depth
}

// NewKademlia creates a Kademlia table for base address addr
// with parameters as in params
// if params is nil, it uses default values
func NewKademlia(addr []byte, params *KadParams) *Kademlia {
	if params == nil {
		params = NewKadParams()
	}
	return &Kademlia{
		base:      addr,
		KadParams: params,
		addrs:     pot.NewPot(nil, 0, nil),
		conns:     pot.NewPot(nil, 0, nil),
	}
}

// Notifier interface type for peer allowing / requesting peer and depth notifications
type Notifier interface {
	NotifyPeer(OverlayAddr, uint8) error
	NotifyDepth(uint8) error
}

// OverlayPeer interface captures the common aspect of view of a peer from the Overlay
// topology driver
type OverlayPeer interface {
	Address() []byte
}

// OverlayConn represents a connected peer
type OverlayConn interface {
	OverlayPeer
	Drop(error)       // call to indicate a peer should be expunged
	Off() OverlayAddr // call to return a persitent OverlayAddr
}

// OverlayAddr represents a kademlia peer record
type OverlayAddr interface {
	OverlayPeer
	Update(OverlayAddr) OverlayAddr // returns the updated version of the original
}

// entry represents a Kademlia table entry (an extension of OverlayPeer)
type entry struct {
	OverlayPeer
	seenAt  time.Time
	retries int
}

// newEntry creates a kademlia peer from an OverlayPeer interface
func newEntry(p OverlayPeer) *entry {
	return &entry{
		OverlayPeer: p,
		seenAt:      time.Now(),
	}
}

// Bin is the binary (bitvector) serialisation of the entry address
func (e *entry) Bin() string {
	return pot.ToBin(e.addr().Address())
}

// Label is a short tag for the entry for debug
func Label(e *entry) string {
	return fmt.Sprintf("%s (%d)", e.Bin()[:8], e.retries)
}

// Hex is the hexadecimal serialisation of the entry address
func (e *entry) Hex() string {
	return fmt.Sprintf("%x", e.addr().Address())
}

// String is the short tag for the entry
func (e *entry) String() string {
	return fmt.Sprintf("%s (%d)", e.Hex()[:4], e.retries)
}

// addr returns the kad peer record (OverlayAddr) corresponding to the entry
func (e *entry) addr() OverlayAddr {
	a, _ := e.OverlayPeer.(OverlayAddr)
	return a
}

// conn returns the connected peer (OverlayPeer) corresponding to the entry
func (e *entry) conn() OverlayConn {
	c, _ := e.OverlayPeer.(OverlayConn)
	return c
}

// Register enters each OverlayAddr as kademlia peer record into the
// database of known peer addresses
func (k *Kademlia) Register(peers chan OverlayAddr) error {
	np := pot.NewPot(nil, 0, nil)
	for p := range peers {
		// error if k received, peer should know better
		if bytes.Equal(p.Address(), k.base) {
			return fmt.Errorf("add peers: %x is k", k.base)
		}
		np, _, _ = pot.Add(np, newEntry(p))
	}
	com := k.addrs.Merge(np)
	log.Trace(fmt.Sprintf("%x merged %v peers, %v known, total: %v", k.BaseAddr()[:4], np.Size(), com, k.addrs.Size()))
	return nil
}

// SuggestPeer returns a known peer for the lowest proximity bin for the
// lowest bincount below depth
// naturally if there is an empty row it returns a peer for that
//
func (k *Kademlia) SuggestPeer() (a OverlayAddr, o int, want bool) {
	minsize := k.MinBinSize
	depth := k.Depth()
	// empty := k.FirstEmptyBin()
	// if there is a callable neighbour within the current proxBin, connect
	// this makes sure nearest neighbour set is fully connected
	var ppo int
	k.addrs.EachNeighbour(k.base, func(val pot.Val, po int) bool {
		if po < depth {
			return false
		}
		a = k.callable(val)
		log.Trace(fmt.Sprintf("%x candidate nearest neighbour at %v: %v (%v)", k.BaseAddr()[:4], val.(*entry), a, po))
		ppo = po
		return a == nil
	})
	if a != nil {
		log.Trace(fmt.Sprintf("%x candidate nearest neighbour found: %v (%v)", k.BaseAddr()[:4], a, ppo))
		return a, 0, false
	}
	log.Trace(fmt.Sprintf("%x no candidate nearest neighbours to connect to (Depth: %v, minProxSize: %v) %#v", k.BaseAddr()[:4], depth, k.MinProxBinSize, a))

	var bpo []int
	prev := -1
	k.conns.EachBin(k.base, 0, func(po, size int, f func(func(val pot.Val, i int) bool) bool) bool {
		prev++
		for ; prev < po; prev++ {
			bpo = append(bpo, prev)
			minsize = 0
		}
		if size < minsize {
			bpo = append(bpo, po)
			minsize = size
		}
		return size > 0 && po < depth
	})
	// all buckets are full
	// minsize == k.MinBinSize
	if len(bpo) == 0 {
		log.Debug(fmt.Sprintf("%x: all bins saturated", k.BaseAddr()[:4]))
		return nil, 0, false
	}
	// as long as we got candidate peers to connect to
	// dont ask for new peers (want = false)
	// try to select a candidate peer
	// find the first callable peer
	i := 0
	nxt := bpo[0]
	k.addrs.EachBin(k.base, nxt, func(po, size int, f func(func(pot.Val, int) bool) bool) bool {
		// for each bin we find callable candidate peers
		if i >= depth {
			return false
		}
		if po == nxt {
			i++
			if i < len(bpo) {
				nxt = bpo[i]
			}
		}
		f(func(val pot.Val, j int) bool {
			a = k.callable(val)
			return a == nil && i < len(bpo) && po <= depth
		})
		return false
	})
	// found a candidate
	if a != nil {
		return a, 0, false
	}
	return a, nxt, true
}

// On inserts the peer as a kademlia peer into the live peers
func (k *Kademlia) On(p OverlayConn) {
	e := newEntry(p)
	k.conns.Swap(p, func(v pot.Val) pot.Val {
		// if not found live
		if v == nil {
			// insert new online peer into addrs
			k.addrs.Swap(p, func(v pot.Val) pot.Val {
				return e
			})
			// insert new online peer into conns
			return e
		}
		// found among live peers, do nothing
		return v
	})

	np, ok := p.(Notifier)
	if !ok {
		return
	}

	depth := uint8(k.Depth())
	if depth != k.depth {
		k.depth = depth
	} else {
		depth = 0
	}

	go np.NotifyDepth(depth)
	f := func(val pot.Val, po int) {
		dp := val.(*entry).OverlayPeer.(Notifier)
		dp.NotifyPeer(p.Off(), uint8(po))
		log.Trace(fmt.Sprintf("peer %v notified of %v (%v)", dp, p, po))
		if depth > 0 {
			dp.NotifyDepth(depth)
			log.Trace(fmt.Sprintf("peer %v notified of new depth %v", dp, depth))
		}
	}
	k.conns.EachNeighbourAsync(e, 1024, 255, f, false)
}

// Off removes a peer from among live peers
func (k *Kademlia) Off(p OverlayConn) {
	k.addrs.Swap(p, func(v pot.Val) pot.Val {
		// v cannot be nil, must check otherwise we overwrite entry
		if v == nil {
			panic(fmt.Sprintf("connected peer not found %v", p))
		}
		k.conns.Swap(p, func(_ pot.Val) pot.Val {
			// v cannot be nil, but no need to check
			return nil
		})
		return newEntry(p.Off())
	})
}

// EachConn is an iterator with args (base, po, f) applies f to each live peer
// that has proximity order po or less as measured from the base
// if base is nil, kademlia base address is used
func (k *Kademlia) EachConn(base []byte, o int, f func(OverlayConn, int, bool) bool) {
	if len(base) == 0 {
		base = k.base
	}
	depth := k.Depth()
	k.conns.EachNeighbour(base, func(val pot.Val, po int) bool {
		if po > o {
			return true
		}
		return f(val.(*entry).conn(), po, po >= depth)
	})
}

// EachAddr called with (base, po, f) is an iterator applying f to each known peer
// that has proximity order po or less as measured from the base
// if base is nil, kademlia base address is used
func (k *Kademlia) EachAddr(base []byte, o int, f func(OverlayAddr, int) bool) {
	if len(base) == 0 {
		base = k.base
	}
	k.addrs.EachNeighbour(base, func(val pot.Val, po int) bool {
		if po > o {
			return true
		}
		return f(val.(*entry).addr(), po)
	})
}

// Depth returns the proximity order that defines the distance of
// the nearest neighbour set with cardinality >= MinProxBinSize
// if there is altogether less than MinProxBinSize peers it returns 0
func (k *Kademlia) Depth() (depth int) {
	if k.conns.Size() < k.MinProxBinSize {
		return 0
	}
	var size int
	f := func(v pot.Val, i int) bool {
		size++
		depth = i
		return size < k.MinProxBinSize
	}
	k.conns.EachNeighbour(k.base, f)
	return depth
}

// calleble when called with val,
func (k *Kademlia) callable(val pot.Val) OverlayAddr {
	e := val.(*entry)
	// not callable if peer is live or exceeded maxRetries
	if e.conn() != nil || e.retries > k.MaxRetries {
		log.Trace(fmt.Sprintf("peer %v (%T) not callable", e, e.OverlayPeer))
		return nil
	}
	// calculate the allowed number of retries based on time lapsed since last seen
	timeAgo := time.Since(e.seenAt)
	var retries int
	for delta := int(timeAgo) / k.RetryInterval; delta > 0; delta /= k.RetryExponent {
		retries++
	}

	// this is never called concurrently, so safe to increment
	// peer can be retried again
	if retries < e.retries {
		log.Trace(fmt.Sprintf("%v long time since last try (at %v) needed before retry %v, wait only warrants %v", e, timeAgo, e.retries, retries))
		return nil
	}
	e.retries++
	log.Trace(fmt.Sprintf("peer %v is callable", e))

	return e.addr()
}

// BaseAddr return the kademlia base addres
func (k *Kademlia) BaseAddr() []byte {
	return k.base
}

// String returns kademlia table + kaddb table displayed with ascii
func (k *Kademlia) String() string {
	wsrow := "                                                          "
	var rows []string

	rows = append(rows, "=========================================================================")
	rows = append(rows, fmt.Sprintf("%v KΛÐΞMLIΛ hive: queen's address: %x", time.Now().UTC().Format(time.UnixDate), k.BaseAddr()[:3]))
	rows = append(rows, fmt.Sprintf("population: %d (%d), MinProxBinSize: %d, MinBinSize: %d, MaxBinSize: %d", k.conns.Size(), k.addrs.Size(), k.MinProxBinSize, k.MinBinSize, k.MaxBinSize))

	liverows := make([]string, k.MaxProxDisplay)
	peersrows := make([]string, k.MaxProxDisplay)
	var depth int
	prev := -1
	var depthSet bool
	rest := k.conns.Size()
	k.conns.EachBin(k.base, 0, func(po, size int, f func(func(val pot.Val, i int) bool) bool) bool {
		var rowlen int
		if po >= k.MaxProxDisplay {
			po = k.MaxProxDisplay - 1
		}
		row := []string{fmt.Sprintf("%2d", size)}
		rest -= size
		f(func(val pot.Val, vpo int) bool {
			e := val.(*entry)
			row = append(row, e.String())
			rowlen++
			return rowlen < 4
		})
		if !depthSet && (po > prev+1 || rest < k.MinProxBinSize) {
			depthSet = true
			depth = prev + 1
		}
		row = append(row, wsrow)
		r := strings.Join(row, " ")
		liverows[po] = r[:35]
		prev = po
		return true
	})

	k.addrs.EachBin(k.base, 0, func(po, size int, f func(func(val pot.Val, i int) bool) bool) bool {
		var rowlen int
		if po >= k.MaxProxDisplay {
			po = k.MaxProxDisplay - 1
		}
		if size < 0 {
			panic("wtf")
		}
		row := []string{fmt.Sprintf("%2d", size)}
		// we are displaying live peers too
		f(func(val pot.Val, vpo int) bool {
			row = append(row, val.(*entry).String())
			rowlen++
			return rowlen < 4
		})
		peersrows[po] = strings.Join(row, " ")
		return true
	})

	for i := 0; i < k.MaxProxDisplay; i++ {
		if i == depth {
			rows = append(rows, fmt.Sprintf("============ DEPTH: %d ==========================================", i))
		}
		left := liverows[i]
		right := peersrows[i]
		if len(left) == 0 {
			left = " 0                                          "
		}
		if len(right) == 0 {
			right = " 0"
		}
		rows = append(rows, fmt.Sprintf("%03d %v | %v", i, left, right))
	}
	rows = append(rows, "=========================================================================")
	return "\n" + strings.Join(rows, "\n")
}

// Prune implements a forever loop reacting to a ticker time channel given
// as the first argument
// the loop quits if the channel is closed
// it checks each kademlia bin and if the peer count is higher than
// the MaxBinSize parameter it drops the oldest n peers such that
// the bin is reduced to MinBinSize peers thus leaving slots to newly
// connecting peers
func (k *Kademlia) Prune(c <-chan time.Time) {
	go func() {
		for range c {
			total := 0
			k.conns.EachBin(k.base, 0, func(po, size int, f func(func(pot.Val, int) bool) bool) bool {
				extra := size - k.MinBinSize
				if size > k.MaxBinSize {
					n := 0
					f(func(v pot.Val, po int) bool {
						v.(*entry).conn().Drop(fmt.Errorf("bucket full"))
						n++
						return n < extra
					})
					total += extra
				}
				return true
			})
			log.Trace(fmt.Sprintf("pruned %v peers", total))
		}
	}()
}

// NewPeerPot just creates a new pot record OverlayAddr
func NewPeerPot(kadMinProxSize int, ids ...discover.NodeID) map[discover.NodeID][][]byte {
	// create a table of all nodes for health check
	np := pot.NewPot(nil, 0, nil)
	for _, id := range ids {
		o := ToOverlayAddr(id.Bytes())
		np, _, _ = pot.Add(np, o)
	}
	nnmap := make(map[discover.NodeID][][]byte)

	for _, id := range ids {
		pl := 0
		var nns [][]byte
		np.EachNeighbour(id.Bytes(), func(val pot.Val, po int) bool {
			// a := val.(pot.BytesAddress).Address()
			// nns = append(nns, a)
			a := val.([]byte)
			nns = append(nns, a)
			if len(nns) >= kadMinProxSize {
				pl = po
			}
			return pl == 0 || pl == po
		})
		nnmap[id] = nns
	}
	return nnmap
}

// FirstEmptyBin returns the farthest proximity order (int) that has no peer records
func (k *Kademlia) FirstEmptyBin() (i int) {
	i = -1
	k.conns.EachBin(k.base, 0, func(po, size int, f func(func(val pot.Val, i int) bool) bool) bool {
		if po > i+1 {
			i = po
			return false
		}
		i = po
		return true
	})
	return i
}

// Full returns a bool if the kademlia table is healthy and complete
func (k *Kademlia) Full() bool {
	return k.FirstEmptyBin() >= k.Depth()
}

// Healthy reports the health state of the kademlia connectivity
func (k *Kademlia) Healthy(peers [][]byte) bool {
	return k.gotNearestNeighbours(peers) && k.Full()
}

func (k *Kademlia) gotNearestNeighbours(peers [][]byte) (got bool) {
	pm := make(map[string]bool)
	for _, p := range peers {
		pm[string(p)] = true
	}
	k.EachConn(nil, 255, func(p OverlayConn, po int, nn bool) bool {
		if !nn {
			return false
		}
		_, got = pm[string(p.Address())]
		return got
	})
	return got
}