kbucket

Documentation

Overview

package kbucket implements a kademlia 'k-bucket' routing table.

Index

• Variables
• func Closer(a, b peer.ID, key u.Key) bool
• type Bucket
  • func (b *Bucket) Split(cpl int, target ID) *Bucket
• type ID
  • func ConvertKey(id u.Key) ID
  • func ConvertPeerID(id peer.ID) ID
• type RoutingTable
  • func NewRoutingTable(bucketsize int, localID ID, latency time.Duration) *RoutingTable
  • func (rt *RoutingTable) Find(id peer.ID) peer.Peer
  • func (rt *RoutingTable) ListPeers() []peer.Peer
  • func (rt *RoutingTable) NearestPeer(id ID) peer.Peer
  • func (rt *RoutingTable) NearestPeers(id ID, count int) []peer.Peer
  • func (rt *RoutingTable) Print()
  • func (rt *RoutingTable) Size() int
  • func (rt *RoutingTable) Update(p peer.Peer) peer.Peer

Variables

var ErrLookupFailure = errors.New("failed to find any peer in table")

Returned if a routing table query returns no results. This is NOT expected behaviour

Functions

func Closer

func Closer(a, b peer.ID, key u.Key) bool

Closer returns true if a is closer to key than b is

Types

type Bucket

type Bucket struct {
	// contains filtered or unexported fields
}

Bucket holds a list of peers.

func (*Bucket) Split

func (b *Bucket) Split(cpl int, target ID) *Bucket

Split splits a buckets peers into two buckets, the methods receiver will have peers with CPL equal to cpl, the returned bucket will have peers with CPL greater than cpl (returned bucket has closer peers)

type ID

type ID []byte

ID for IpfsDHT is in the XORKeySpace

The type dht.ID signifies that its contents have been hashed from either a peer.ID or a util.Key. This unifies the keyspace

func ConvertKey

func ConvertKey(id u.Key) ID

ConvertKey creates a DHT ID by hashing a local key (String)

func ConvertPeerID

func ConvertPeerID(id peer.ID) ID

ConvertPeerID creates a DHT ID by hashing a Peer ID (Multihash)

type RoutingTable

type RoutingTable struct {

	// kBuckets define all the fingers to other nodes.
	Buckets []*Bucket
	// contains filtered or unexported fields
}

RoutingTable defines the routing table.

func NewRoutingTable

func NewRoutingTable(bucketsize int, localID ID, latency time.Duration) *RoutingTable

NewRoutingTable creates a new routing table with a given bucketsize, local ID, and latency tolerance.

func (*RoutingTable) Find

func (rt *RoutingTable) Find(id peer.ID) peer.Peer

Find a specific peer by ID or return nil

func (*RoutingTable) ListPeers

func (rt *RoutingTable) ListPeers() []peer.Peer

ListPeers takes a RoutingTable and returns a list of all peers from all buckets in the table. NOTE: This is potentially unsafe... use at your own risk

func (*RoutingTable) NearestPeer

func (rt *RoutingTable) NearestPeer(id ID) peer.Peer

NearestPeer returns a single peer that is nearest to the given ID

func (*RoutingTable) NearestPeers

func (rt *RoutingTable) NearestPeers(id ID, count int) []peer.Peer

NearestPeers returns a list of the 'count' closest peers to the given ID

func (*RoutingTable) Print

func (rt *RoutingTable) Print()

Print prints a descriptive statement about the provided RoutingTable

func (*RoutingTable) Size

func (rt *RoutingTable) Size() int

Size returns the total number of peers in the routing table

func (*RoutingTable) Update

func (rt *RoutingTable) Update(p peer.Peer) peer.Peer

Update adds or moves the given peer to the front of its respective bucket If a peer gets removed from a bucket, it is returned