Distributed Overlay Anycast Table using Space filling curves

Paper type: 
Workshop paper
Eleni Mykoniati, Lawrence Latif, Raul Landa, Ben Yang, Richard Clegg, David Griffin and Miguel Rio
Proceedings from IEEE INFOCOM Workshop, Global Internet Symposium
In this paper we present the Distributed Overlay Anycast Table, a structured overlay that implements application-layer anycast, 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.
This paper considers the idea of using fractal space filling curves to locate nearby items in an overlay topology.
@inproceedings{doat_2009, author = {Mykoniati, Eleni and Latif, Lawrence and Landa, Raul and Yang, Ben and Clegg, Richard and Griffin, David and Rio, Miguel}, title = {Distributed Overlay Anycast Tables Using Space Filling Curves}, booktitle = {Proceedings of the 28th IEEE International Conference on Computer Communications Workshops, INFOCOM'09}, year = {2009} pages = {19--24} }