HyperTree for self-stabilizing peer-to-peer systems

Peer-to-peer systems are prone to faults, thus it is vitally important to design peer-to-peer systems to automatically regain consistency, namely to be self-stabilizing. Toward this goal, we present a deterministic structure that defines for every n the entire (IP) pointers structure among the n machines. Namely, the next hop for the insert, delete and search procedures of the peer-to-peer system. Thus, the consistency of the system is easily defined, monitored, verified and repaired. We present the HyperTree (distributed) structure which support the peer-to-peer procedures while ensuring that the out-degree and in-degree (the number of outgoing/incoming pointers) are b log/sub b/ N where N in the maximal number of machines and b is an integer parameter greater than 1. In addition the HyperTree ensures that the maximal number of hops involved in each procedure is bounded by log/sub b/ N. A self-stabilizing peer-to-peer system based on the HyperTree is presented.

[1]  Shlomi Dolev,et al.  Self-stabilizing distributed file systems , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

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

[3]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

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

[5]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[6]  David Peleg,et al.  Bubbles: adaptive routing scheme for high-speed dynamic networks , 1995, STOC '95.

[7]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

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

[9]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Yossi Azar,et al.  A generic scheme for building overlay networks in adversarial scenarios , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[11]  Hagit Attiya,et al.  Connection Management Without Retaining Information , 1995, Inf. Comput..

[12]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[13]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[14]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[15]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .

[16]  Jennifer L. Welch,et al.  Crash Resilient Communication in Dynamic Networks , 1997, IEEE Trans. Computers.

[17]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[18]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[19]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[20]  Shlomi Dolev,et al.  Communication Adaptive Self-Stabilizing Group Membership Service , 2001, IEEE Trans. Parallel Distributed Syst..

[21]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[22]  Wolfgang Nejdl,et al.  HyperCuP - Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks , 2002, AP2PC.

[23]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[24]  Shlomi Dolev,et al.  Communication Adaptive Self-Stabilizing Group Membership Service , 2001, WSS.

[25]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..