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 network for a given sequence join leave operations. In this paper we investigate adversarial strategies by following specific protocols. Our analysis demonstrates first an adversary very quickly subvert distributed hash tables based simply never triggering We then show when all (honest ones) imposed on limited lifetime, system eventually reaches stationary regime where ratio polluted clusters is bounded, independently from initial amount corruption in system.