Mykoniati, E and Latif, L and Landa, R and Yang, B and Clegg, R and Griffin, D and Rio, M (2009) Distributed Overlay Anycast Tables using Space Filling Curves. In: IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS. (pp. 19 - 24). IEEE
![[img]](/style/images/fileicons/application_pdf.png)
| PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 823Kb |
Abstract
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.
| Type: | Proceedings paper |
|---|---|
| Title: | Distributed Overlay Anycast Tables using Space Filling Curves |
| Event: | IEEE INFOCOM Conference 2009 |
| Location: | Rio de Janeiro, BRAZIL |
| Dates: | 2009-04-19 - 2009-04-25 |
| ISBN-13: | 978-1-4244-3968-3 |
| Open access status: | An open access version is available from UCL Discovery |
| UCL classification: | UCL > School of BEAMS > Faculty of Engineering Science > Electronic and Electrical Engineering |
View download statistics for this itemArchive Staff Only: edit this record