here's a simple (very bad) example of distributed routing. Addresses are simply bitstrings of some length. If my address is a=a1a2...an, I need to store the f

here's a simple (very bad) example of distributed routing. Addresses are simply bitstrings of some length. If my address is a=a1a2...an, I need to store the first segment of the shortest path to each r_1=a'1a2...an, r_2=a1a'2...an all the way up to r_n=a1a2...a'2, where a'k != ak (i.e. all the addresses with a hamming distance of exactly 1 from me). I then simply route a message with an address b=b1b2...bn to r_i where i is the first non-zero bit of a xor b.