Skip to Main content Skip to Navigation
Conference papers

A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems

Abstract : Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.
Complete list of metadata
Contributor : Eddy Caron Connect in order to contact the contributor
Submitted on : Monday, January 9, 2017 - 2:32:58 PM
Last modification on : Friday, October 8, 2021 - 4:28:04 PM

Links full text




Eddy Caron, Frédéric Desprez, Charles Fourdrignier, Franck Petit, Cédric Tedeschi. A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. HiPC 2006 - 13th International Conference on High Performance Computing., Dec 2006, Bangalore, India. pp.171-182, ⟨10.1007/11945918_21⟩. ⟨hal-01430039⟩



Record views