How do you find a lost friend in a huge city?
Peer-to-peer
How do you find a lost friend in a huge city?
Imagine you're in a big city and you can't find your friend who lives somewhere far away. You need a way to locate them quickly without asking everyone you meet.
Think of the city as a giant map where everyone has a piece of it. If you want to find your friend, you can ask other people for their pieces to piece together the map and locate them. This is like a distributed hash table (DHT).
Example
You ask 10 neighbors, and each one gives you a part of the map that leads you closer to your friend's location.
Remember this
A distributed hash table (DHT) helps you find lost friends in a big city by piecing together information from everyone in the neighborhood.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Related concepts
consistent hashing does: minimizes remapping when nodes join/leave
How can we efficiently share resources without constant reorganization?
consistent hashing solves: minimizes key redistribution when servers are added/removed
Ever wonder why adding or removing servers doesn't mess up your favorite streaming service?
Load balancing (computing)
Load balancing distributes tasks efficiently across resources
Locality-sensitive hashing
Locality-sensitive hashing (LSH) hashes similar items into the same buckets
the lottery ticket hypothesis says: sparse subnetworks can match full network performance
Can a small part of a puzzle fit perfectly into its place by chance?
File system
Can you instantly share a photo from your phone across devices worldwide?
Swipe through 100 ML concepts daily
Open Pocket Polymath