Cone: Augmenting DHTs to Support Distributed Resource Discovery

Ranjita Bhagwan, George Varghese and Geoffrey M. Voelker University of California, San Diego Cone Data Structure Project Overview Distributed Hash Tables (DHTs) can be used to perform exact-match searches. However, important applications require stronger search semantics. * Distributed computing (Find a machine with CPU speed > 1 GHz) * Anycast-style applications (Find the least loaded server in a server pool) A more powerful search interface, such as supporting queries of the form, "Find a resource with size > X" is required. Instead of designing new DHT variant, augment DHTs to perform this operation (like augmented binary search trees). Cone is a scalable, distributed data structure that can support queries of this form. In general, Cone supports queries that use any n-ary associative operators. For example, max, min, sum, union and intersection. Using the max or min operator, Cone can support open-ended range queries.

[1]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[2]  Ian Foster,et al.  On Fully Decentralized Resource Discovery in Grid Environments , 2001, GRID.

[3]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[4]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[5]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[6]  David R. Karger,et al.  INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery , 2002, Pervasive.

[7]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[8]  Jing Zhu,et al.  SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT , 2003, IPTPS.

[9]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[10]  Timothy L. Harris,et al.  XenoSearch: distributed resource discovery in the XenoServer open platform , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[11]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[12]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[13]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[14]  G. Weikum.  Querying the Internet with PIER , 2005 .