By Topic

Use of shrinking quorums to improve efficiency of replication protocols

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)
Tariq, Q.-u.-A.I. ; Comput. & Inf. Syst. Eng. Dept., NED Univ., Pakistan

Quorums is a well-known concept extensively used in designing distributed algorithms requiring coordination among a number of nodes to ensure i) consistency of replicated data/perceived events/computed results etc. and ii) availability of the hosted service. Quorum is a subset of nodes present in a replicated server system satisfying some conditions. A lot of research has been done proposing various strategies to carefully engineer construction of quorums for efficient solutions. However, size of a quorum is dependent on the total number of nodes and is mostly defined as a constant parameter at system start. We propose a novel concept of variable quorum size, shrinking as the system encounters node failures while moving through different stages of its life. It is believed that such a construction can contribute to reduced message traffic and better performance results. We incorporate this concept in a total order protocol developed earlier and present the modified version as an example application.

Published in:

Computer Symposium (ICS), 2010 International

Date of Conference:

16-18 Dec. 2010