Some open problems in P2P routing
Imagine a world where some pairs of whom want to talk to each other—each person has a unique n-bit identity (e.g. 64-bit strings), and wants to send a message to someone with a particular identity. The number of people is ballpark exp(n), I’m imagining ~10 billion. We’ll start with a graph G, where people know how to … More Some open problems in P2P routing