Distributed Overlay Anycast Tables Using Space Filling Curves
Eleni Mykoniati, Lawrence Latif, Rául Landa, Ben Bo Yang, Richard G. Clegg, David P. Griffin, Miguel Rio · 2009
In this paper we present the distributed overlay anycast table, a structured overlay that implements application-layer any cast, allowing the discovery of the closest host that is a member of a given group. One application is in locality-aware peer-to-peer networks, where peers need to discover low-latency peers participating in the distribution of a particular file or stream. The DOAT makes use of network delay coordinates and a space filling curve to achieve locality-aware routing across the overlay, and bloom filters to aggregate group identifiers. The solution is designed to optimise both accuracy and query time, which are essential for real-time applications. We simulated DOAT using both random and realistic node distributions. The results show that accuracy is high and query time is low.