A distributed hash table for computational grids

Summary form only given. We present and analyze a distributed hash table-based supervised peer-to-peer system that allows an even distribution of and efficient lookup for objects (e.g. data or tasks) stored in the system. A supervised peer-to-peer system is a system that is formed by a supervisor but in which all other activities can be performed on a peer-to-peer basis without involving the supervisor. Our system has average constant degree and can distribute objects evenly among the peers up to a constant factor in expectation. The supervised peer-to-peer approach makes the system particularly useful for computational grids. As an example, we discuss the use of our structure for recursively defined algorithms such as dynamic programming and distributed tree searches, and practical problems such as Web crawling; our structure distributes tasks randomly and prevents repeated computations to optimize parallel efficiency.

[1]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

[2]  Christian Scheideler,et al.  Efficient, distributed data placement strategies for storage area networks (extended abstract) , 2000, SPAA '00.

[3]  Phil Hontalas,et al.  Distributed Simulation and the Time Wrap Operating System. , 1987, SOSP 1987.

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

[5]  Brian Beckman,et al.  Time warp operating system , 1987, SOSP '87.

[6]  Christian Scheideler,et al.  Survivable Monitoring in Dynamic Networks , 2006, IEEE Transactions on Mobile Computing.

[7]  Pierre Fraigniaud,et al.  D2B: A de Bruijn based content-addressable network , 2006, Theor. Comput. Sci..

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

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

[10]  C. Scheideler,et al.  Guaranteed broadcasting using SPON: supervised P2P overlay network , 2004, International Zurich Seminar on Communications, 2004.

[11]  Pierre Fraigniaud,et al.  The content-addressable network d2b , 2003 .

[12]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[13]  Peter L. Reiher.  Parallel simulation using the Time Warp Operating System , 1990, 1990 Winter Simulation Conference Proceedings.

[14]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[15]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  William Aiello,et al.  Tree Search on an Atomic Model for Message Passing , 2001, SIAM J. Comput..