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.
Year
2009
URL
Abstract
Summary
The Distributed Overlay Anycast Table (DOAT), a structured overlay for application-layer anycast that lets a peer quickly find the closest other peer belonging to a given group — useful in locality-aware peer-to-peer streaming — combining network delay coordinates, a space-filling curve for locality-aware routing, and Bloom filters to aggregate group membership, shown by simulation to give high accuracy and low query time.
bibtex
@inproceedings{mykoniati2009doat,
author = {Eleni Mykoniati and Lawrence Latif and Raul Landa and Ben Yang and Richard G. Clegg and David Griffin and Miguel Rio},
title = {Distributed Overlay Anycast Tables using Space Filling Curves},
booktitle = {IEEE INFOCOM 2009 Workshops},
year = {2009},
pages = {1--6},
doi = {10.1109/infcomw.2009.5072131}
}
author = {Eleni Mykoniati and Lawrence Latif and Raul Landa and Ben Yang and Richard G. Clegg and David Griffin and Miguel Rio},
title = {Distributed Overlay Anycast Tables using Space Filling Curves},
booktitle = {IEEE INFOCOM 2009 Workshops},
year = {2009},
pages = {1--6},
doi = {10.1109/infcomw.2009.5072131}
}
Venue
IEEE INFOCOM 2009 Workshops, pp. 1-6