Dependability Evaluation of Cluster-based Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

Dependability Evaluation of Cluster-based Systems


Awerbuch and Scheideler have shown that peer-to-peer overlays 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 investigate adversarial strategies by following specific protocols. Our analysis demonstrates first that an adversary can very quickly subvert distributed hash tables based overlays 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.


Other [cs.OH]
Fichier principal
Vignette du fichier
PI-1947.pdf (425.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00463468 , version 1 (12-03-2010)


  • HAL Id : inria-00463468 , version 1


Emmanuelle Anceaume, Francisco Brasileiro, Romaric Ludinard, Bruno Sericola, Frédéric Tronel. Dependability Evaluation of Cluster-based Systems. [Research Report] PI 1947, 2010, pp.16. ⟨inria-00463468⟩
333 View
54 Download


Gmail Facebook Twitter LinkedIn More