Discover published sets by community

Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A Chord node efficiently locates the node that stores a particular piece of data.

Kademlia is a distributed hash table for decentralized peer-to-peer computer networks. It uses XOR metric for distance between nodes and ensures that messages are delivered in O(log N) steps.

CAN is a distributed, decentralized P2P network protocol based on a multi-dimensional Cartesian coordinate space. It partitions the space among the nodes and efficiently routes content.

Symphony is a DHT that connects nodes in a small-world network. It uses a probabilistic algorithm for network connection and routing with an expected path length of O(log^2 N).

Pastry is a scalable, distributed object location and routing system for large-scale peer-to-peer networks. It can reliably route to the closest peer in O(log N) hops.

Viceroy is a distributed hash table that uses a butterfly network topology. It arranges nodes in levels and ensures constant degree and logarithmic dilation.

Tapestry is a peer-to-peer overlay network that provides a distributed hash table, routing, and multicasting infrastructure. It is similar to Pastry, with location independent object identifiers.