By Topic

Achieving High Availability of Consistent Data in the Presence of Network Partitions

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

1 Author(s)
Tsuchiya, T. ; Grad. Sch. of Inf. Sci. & Technol., Osaka Univ., Suita, Japan

We discuss availability maximization of a networked service that provides data access in a consistent and reliable manner. Majority voting is a common mechanism that implements such a service in the presence of network partitioning. A distinguishing feature of majority voting is that its availability is tunable by means of vote assignment to server nodes. We argue that achieving maximum availability of a voting-based service requires a powerful combinatorial optimization solving method and a new model of networks that can account for failure-repair behaviors observed in real networks. We suggest that the use of SAT/SMT-based optimization solving is a reasonable approach to combinatorial optimization of our interest. We also suggest the possible directions of augmentation of network reliability models.

Published in:

Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC), 2012 9th International Conference on

Date of Conference:

4-7 Sept. 2012