Presentation given at IETF 118: <a href="https://datatracker.ietf.org/meeting/118/materials/slides-118-dispatch-the-r5n-distributed-hash-table-00.pdf" rel="nofollow">https://datatracker.ietf.org/meeting/118/materials/slides-11...</a>
I'm curious about two things. I don't really understand how the randomized addressing helps with data locality. Is it just saying that XOR gives random results, and so adding random hops before doing lookups gives a higher statistical percentage of reaching nodes?<p>Also how does this compare to something like libp2p w/ DCUtR for NAT traversal? Is the NAT problem circumvented by the randomized walk routing?