Dependability Evaluation of Cluster-based Distributed Systems - Université de Rennes Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2011

Dependability Evaluation of Cluster-based Distributed Systems

Résumé

Awerbuch and Scheideler have shown that peer-to-peer overlay networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topology of the network for a given sequence of join and leave operations. In this paper we inves- tigate adversarial strategies by following speci c protocols. Our analysis demonstrates rst that an adversary can very quickly subvert overlays based on distributed hash tables by simply never triggering leave operations. We then show that when all nodes (honest and malicious ones) are imposed on a limited lifetime, the system eventually reaches a stationary regime where the ratio of polluted clusters is bounded, independently from the initial amount of corruption in the system.
Fichier principal
Vignette du fichier
IJFCS.pdf (391.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00650086 , version 1 (09-12-2011)

Identifiants

Citer

Emmanuelle Anceaume, Francisco Brasiliero, Romaric Ludinard, Bruno Sericola, Frédéric Tronel. Dependability Evaluation of Cluster-based Distributed Systems. International Journal of Foundations of Computer Science, 2011, 22 (5), pp.1123-1142. ⟨10.1142/S0129054111008593⟩. ⟨hal-00650086⟩
349 Consultations
168 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More