Mykoniati, E; Latif, L; Landa, R; Yang, B; Clegg, R; Griffin, D; Rio, M; (2009) Distributed Overlay Anycast Tables using Space Filling Curves. In: IEEE INFOCOM 2009, IEEE Conference on Computer Communications Workshops: 19-25 April 2009, Rio de Janeiro, Brazil. (pp. 19 - 24). IEEE: Piscataway, US.
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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.
|Title:||Distributed Overlay Anycast Tables using Space Filling Curves|
|Location:||Rio de Janeiro, BRAZIL|
|Dates:||2009-04-19 - 2009-04-25|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||(c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Electronic and Electrical Engineering|
View download statistics for this item
Activity - last month
Activity - last 12 months
Archive Staff Only: edit this record