KadOH routing table

Kademlia routing table implementation roughly extracted from KadOH.

1$ npm install kadoh-routing-table

Basic use

1var RoutingTable = require('kadoh-routing-table');
2var rootID = 'e97750256dc9fd98a1f773448af26292d7ef7e02';
3
4// create a routing table wit rootID as root node
5var table = new RoutingTable(rootID);
6// will starth the timers for 'refresh'
7table.start();
8
9// instanciate a new peer with a given address and given ID
10var peer = new RoutingTable.Peer('173.194.40.96', 'd5496cba6d508edb8f007e8e3325b971866b6002');
11
12// add a peer to the routing table: inside they are sorted into KBuckets
13table.addPeer(peer);
14
15// later, if you see activity of this peer 'touch' it to know
16// that it's still fresh
17peer.touch();
18
19// to get the number of Kbuckets
20table.howManyKBuckets();
21
22// get 3 closest peers to the given id:
23// return a PeerArray
24table.getClosePeers('605f2b13d7a53d4247a1d8bd37418c974c8306e3', 3);
25
26table.on('refresh', function(kbucket) {
27  // the given kbucket is not fresh anymore
28  // you should probably launch find a way to
29  // get in touch with peers from this kBucket range
30  kbucket.getRange()
31});
32
33// stop the routing table
34table.stop();
35
36// other internal stuff, read the code

Todo

• extract iterative lookup arlgorithm implementations: IterativeFindNode and IterativeFindValue based on eventually
• externalize "crypto" stuff: distance, ..
• rename PeerArray into PeerCollection and add lodash magic (a la Backbone Collection)
• refactor implementaion to be light
• use/learn from https://github.com/tristanls/k-bucket
• other features?