#p2p #network #kad #peer-to-peer #kadcast

kadcast

Implementation of the Kadcast Network Protocol

13 unstable releases (3 breaking)

0.4.0-rc.5 Feb 15, 2022
0.4.0-rc.3 Jan 24, 2022
0.3.0 Jan 7, 2022
0.3.0-rc.0 Dec 29, 2021
0.1.0 Nov 2, 2021

#904 in Network programming

Download history 3/week @ 2022-03-03 52/week @ 2022-03-10 64/week @ 2022-03-17 2/week @ 2022-03-24 2/week @ 2022-03-31 15/week @ 2022-04-07 1/week @ 2022-04-21 94/week @ 2022-04-28 68/week @ 2022-05-05 212/week @ 2022-05-12 57/week @ 2022-05-19 74/week @ 2022-05-26 107/week @ 2022-06-02 3/week @ 2022-06-09 2/week @ 2022-06-16

199 downloads per month

MPL-2.0 license

110KB
2.5K SLoC

Kadcast

Implementation of the Kadcast Network layer according to the latest version of the paper to date (2021)

Overlay Construction

Kadcast is an UDP-based peer-to-peer protocol in which peers form a structured overlay.

๐Ÿ’ก The specifications suggest that the protocol can be transport-agnostic, however this implementation uses the canonical choice of UDP.

All peers have an unique ID generated upon joining the network, which is used as an identifier unique to them.

๐Ÿ’ก This implementation uses 128 bits identifiers generated from hashing the <port>|<ip_octects> concatenation truncated to the agreed 16 bytes. The hashing algorithm used is Blake2.

Following the Kademlia's specifications for a structured network, the ID determines the peer position in a binary routing tree.

Each peer mantains the routing state in a set of k-buckets containing the location of the location of each peer. The location is fully determined by the tuple (ip_addr, port, ID).

Each bucket comprises of a list of the K last recently seen peers, located at a given distance in relation to the peer. The distance is calculated as the non-euclidean XOR metric which represents: d(x,y) = (x ^ y).

This implies that i buckets contain K Peers which distance d follow the formula: 2^i <= d < 2^(i +1).

๐Ÿ’ก The factor K is a system-wide parameter which determines the routing state and the lookup complexity.

  • In case a bucket's peer list is full (i.e. k entries are already stored), new entries to that list may be inserted by dropping LRU (Least Recently Used) peers.

  • Before dropping an entry from the list, the peer will check whether the peer to be dropped is still reachable, by sending a PING message and waiting for a PONG response. In case the PONG won't be collected within pre-determined timeout, the check fails and the peer is dropped from the list.

๐Ÿ’ก By following a LRU policy, the protocol inherently is biased toward the older and more stable peers on the network.

Bootstrapping

Upon joining the Kadcast network, a peer retrieves from the so-called bootstrap nodes the locations of other neighbour peers, so to fill its buckets.

๐Ÿ’ก From the specification: When a peer first joins the network, it has to know the address of at least one bootstrapping node. It therefore sends PING messages to known peers to check whether they are actually online. Additionally, PING transmits the sending peerโ€™s routing information to the recipient, thereby distributing its existence in the network.

The bootstrap node will reply with a PONG message which also contains its node info.

Network discovery.

Starts just after the bootstrapping process. The main goal of this phase is to fill up the k-buckets with k different peers.

  • The process starts by sending a FIND_NODE message to the bootstraping nodes that have been added to the k-buckets with the PONG messages received.
  • Then the lookup process starts:
    1. The node looks up the ๐›ผ closest peers regarding the XOR-metric in its own buckets.
    2. It queries this ๐›ผ peers for the ID by sending FIND_NODE messages and wait for the NODES reply.
    3. The queried peers respond with a NODES reply containing the set of k peers they believe are the closest to ID.
    4. Based on the info acquired, the node builds a new set of closest peers and repeats steps 1 to 3 until it no longer gets peers closer to those it got from previous iterations.

โš ๏ธ Note that like the bucket size, ๐›ผ and k are global constants that will determine the redundancy and overhead of the network. The typical values are: k = [20, 100] & ๐›ผ = 3.

Periodic Network Manteinance

Each peer periodically refreshes every bucket with no activity. For each such bucket, it picks a random ID with appropriate distance, performs a look up, and populates its buckets with fresh routing information.

Improving Broadcast Reliability And Performance

Instead of delegating the broadcast to one peer per bucket, we select ฮฒ delegates. This is done to increase the probability of at least one honest peer to receive the message broadcasted. This is a measure intended to help with the inherently lossy nature of the UDP protocol without forcing the use of slow CRC checking procedures.

Since each broadcast process is repeated on every hop (decreasing the height), it is imperative that the peers ignore duplicate CHUNK messages. Moreover, transmission failures have to be considered. Because of these factors, this implementation includes the use of forward error connection schemes based on RaptorQ specifications and related rust library. The FEC overhead factor can be adjusted through the paramenter f = (n-s)/s.

As shown in the benchmarks, we can get full network coverage even assuming a 12% packet-loss ratio with a ฮฒ = 3 & f = 0,15 (Please refer to the benchmarks included with the library documentation).

Security

The specification provides solutions for DOS, Sybil and Eclipse attacks, as well as obstruction of block delivery. All advices have been taken into consideration during the development.

Internal Architecture

For more information related to the internal architecture please check the architecture diagram.

Dependencies

~4โ€“10MB
~173K SLoC