TY - GEN
T1 - HyperTree for self-stabilizing peer-to-peer systems
AU - Dolev, Shlomi
AU - Kat, Ronen I.
PY - 2004/12/1
Y1 - 2004/12/1
N2 - 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 logb 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 logb N. A self-stabilizing peer-to-peer system based on the HyperTree is presented.
AB - 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 logb 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 logb N. A self-stabilizing peer-to-peer system based on the HyperTree is presented.
UR - http://www.scopus.com/inward/record.url?scp=18844461675&partnerID=8YFLogxK
U2 - 10.1109/NCA.2004.1347757
DO - 10.1109/NCA.2004.1347757
M3 - Conference contribution
AN - SCOPUS:18844461675
SN - 0769522424
SN - 9780769522425
T3 - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
SP - 25
EP - 32
BT - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
T2 - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
Y2 - 30 August 2004 through 1 September 2004
ER -