Wired Geometric Routing
Click here to download now
Overview: Routing substrates for overlay networks are an important building block for large distributed applications. This research paper examines the problem of building a locality-aware routing substrate on top of a locality-based coordinate system, where the distance between coordinates approximates network latencies. This paper presents a practical locality-aware routing substrate that takes advantages of recent advances in algorithms for routing in a Euclidean plane. It addressed important challenges, such as routing table construction under imperfect knowledge, maintenance protocols for new nodes, and the support for nearest neighbor queries.