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.
Type de document :
Rapport
[Research Report] RR-2006-34, LIP - ENS Lyon. 2006
Liste complète des métadonnées

https://hal.inria.fr/hal-01430504
Contributeur : Eddy Caron <>
Soumis le : mardi 10 janvier 2017 - 00:42:56
Dernière modification le : mardi 24 avril 2018 - 11:53:54

Identifiants

  • HAL Id : hal-01430504, version 1

Collections

Citation

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. [Research Report] RR-2006-34, LIP - ENS Lyon. 2006. 〈hal-01430504〉

Partager

Métriques

Consultations de la notice

530