By Topic

Distributed integrity checking for systems with replicated data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. P. Ziwich ; Dept. Informatics, Fed. Univ. of Parana, Curitiba, Brazil ; E. P. Duarte ; L. C. P. Albini

This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with replicated data, for instance, detecting unauthorized Web page modifications. Fault-free nodes running Hi-Dif send a task to two other nodes and the task results are compared. If the comparison produces a match, the two nodes are classified in the same set. On the other hand, if the comparison results in a mismatch, the two nodes are classified in different sets, according to their task results. One of the sets always contains all fault-free nodes. One fundamental difference of the proposed model to previously published models is that the new model allows the task outputs of two faulty nodes to be equal to each other. Considering a system of N nodes, we prove that the algorithm has latency equal to log2N testing rounds in the worst case; that the maximum number of tests required is O(N2); and, that the algorithm is (N-1)-diagnosable. Experimental results obtained by simulation and by the execution of a tool implemented applied to the Web are presented.

Published in:

11th International Conference on Parallel and Distributed Systems (ICPADS'05)  (Volume:1 )

Date of Conference:

20-22 July 2005