Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Reconfiguring self-stabilizing publish/subscribe systems
DSOM'06 Proceedings of the 17th IFIP/IEEE international conference on Distributed Systems: operations and management
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |
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 nmachines.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 _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 b\log _b N. A self-stabilizing peer-to-peer system based on the HyperTree is presented.