3 ms·

It might be, but you'd need to be smarter than me.

• ouid 10y ago
  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.
• im3w1l 10y ago
  Maybe the problem is harder than it superficially seems, but assuming the network is not super sparse, sending things in the right geographical direction (GPS is ubiquitous) should be a very good heuristic. Couple it with exact routing information for the "neighborhood" (idk which radius would make sense) of a node, should be able to avoid going down a dead end most of the time.