TY - JOUR
T1 - HyperTree for self-stabilizing peer-to-peer systems
AU - Dolev, Shlomi
AU - Kat, Ronen I.
N1 - Funding Information:
This work was partially supported by IBM Faculty Award, NSF Grant 0098305, the Israeli Ministry of Trade and Industry, the Rita Altura Trust Chair in Computer Sciences and the Lynne and William Frankel Center for Computer Sciences. The work was done while Ronen I. Kat was a PhD student at Ben-Gurion University of the Negev. An preliminary version was published in the proceedings of the third IEEE International Symposium on Network Computing and Applications (NCA’04).
PY - 2008/2/1
Y1 - 2008/2/1
N2 - Peer-to-peer systems are prone to faults; Therefore, it is extremely important to design peer-to-peer systems that automatically regain consistency or, in other words, are self-stabilizing. In order to achieve the above, we present a deterministic structure that defines the entire (IP) pointers structure among the machines, for every n machines; i.e., defines 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 supports the peer-to-peer procedures while ensuring that the out-degree and the in-degree (the number of outgoing/ incoming pointers) are b log b n where n is the actual number of machines and b is an integer parameter greater than 1. Moreover, the HyperTree ensures that the maximal number of hops involved in each procedure is bounded by log b n. A self-stabilizing peer-to- peer distributed algorithm based on the HyperTree is presented.
AB - Peer-to-peer systems are prone to faults; Therefore, it is extremely important to design peer-to-peer systems that automatically regain consistency or, in other words, are self-stabilizing. In order to achieve the above, we present a deterministic structure that defines the entire (IP) pointers structure among the machines, for every n machines; i.e., defines 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 supports the peer-to-peer procedures while ensuring that the out-degree and the in-degree (the number of outgoing/ incoming pointers) are b log b n where n is the actual number of machines and b is an integer parameter greater than 1. Moreover, the HyperTree ensures that the maximal number of hops involved in each procedure is bounded by log b n. A self-stabilizing peer-to- peer distributed algorithm based on the HyperTree is presented.
KW - Overlay networks
KW - Peer-to-peer
KW - Self-stabilization
UR - http://www.scopus.com/inward/record.url?scp=38949151123&partnerID=8YFLogxK
U2 - 10.1007/s00446-007-0038-9
DO - 10.1007/s00446-007-0038-9
M3 - Article
AN - SCOPUS:38949151123
SN - 0178-2770
VL - 20
SP - 375
EP - 388
JO - Distributed Computing
JF - Distributed Computing
IS - 5
ER -