Distributed overlay anycast tables using space filling curves

Authors:
Eleni Mykoniati;Lawrence Latif;Raul Landa;Ben Yang;Richard Clegg;David Griffin;Miguel Rio
Affiliations:
Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London;Department of Electronic and Electrical Engineering, University College London
Venue:
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Year:
2009

Citing 12
Cited 0

A framework for scalable global IP-anycast (GIA)

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Application-layer anycasting: a server selection architecture and use in a replicated Web service

IEEE/ACM Transactions on Networking (TON)
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
King: estimating latency between arbitrary internet end hosts

ACM SIGCOMM Computer Communication Review
Application-Layer Anycasting

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Vivaldi: a decentralized network coordinate system

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Towards a global IP anycast service

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stable and Accurate Network Coordinates

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Minimizing churn in distributed systems

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding churn in peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Donnybrook: enabling large-scale, high-speed, peer-to-peer games

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Network coordinates in the wild

NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation

Quantified Score

Hi-index	0.00

Visualization

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.