Structured overlays use deterministic algorithms to map keys—and by extension, peers—to positions in a logical namespace. Peer discovery emerges from maintenance of this overlay.

Characteristics

Deterministic placement of node IDs.

Logarithmic routing (O(log N)).

Nodes maintain routing tables for specific regions of the keyspace.

New peers are discovered during join/leave stabilization.

Use Cases

Large-scale content-addressed networks.

Systems requiring predictable lookup performance.

Examples

Kademlia (BitTorrent DHT, IPFS DHT, libp2p DHT)

Chord, Pastry, Tapestry