By Topic

A Byzantine fault-tolerant mutual exclusion algorithm and its application to Byzantine fault-tolerant storage systems

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
$31 $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

2 Author(s)
Joong Man Kim ; Inf. & Commun. Univ., Daejeon, South Korea ; Manabe, Y.

This paper presents a new distributed mutual exclusion protocol that can tolerate Byzantine faults. We use the protocol to create Byzantine fault-tolerant storage systems. We show a necessary and sufficient condition to achieve distributed Byzantine fault-tolerant mutual exclusion. The condition is n ≥ 3f+1 where n is the number of servers and f is the number of Byzantine failure servers, which is just the result as yielded by Martin et al.'s Byzantine fault-tolerant storage algorithm. The message complexity of Martin et al.'s algorithm is 3n for write operations and 3n+cn for read operations, where c is the number of concurrent writes to the read operations. Our protocol requires (3+3c') (n+3f+1)/2 messages for read or write operations, where c' is the number of concurrent conflicting operations, c' is at most one for read requests. Thus, when the number of concurrent operations to write requests is small and the number of faults is small, our protocol is more efficient than that of Martin et al.

Published in:

Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference on

Date of Conference:

6-10 June 2005