Quorum consensus protocols for the client server architecture

In a client-server architecture, replicated copies of an object are assigned to different servers (possibly client sites) in order to increase the availability of the database in case some but not all servers fail. The aim of this work is to introduce a new highly efficient, highly reliable quorum consensus protocol, the Quorum Rings (QR) protocol, specifically designed to take advantage of the client-server architecture. We will also introduce an algorithm that modifies existing quorum consensus protocols to work efficiently and reliably with the client-server architecture. The high resiliency of the QR and the modified QC protocols is achieved at a very low cost in communication messages. More specifically, the number of communication messages required for a Read or Write operation is O(1) in normal mode (when there are no failures in the system), and only O($\sqrt{N})$ (for the QR protocol) in failure mode when some but not all servers with replicated objects are faulty. Finally, the QR protocol exhibits the property of graceful degradation--more communication cost is incurred only when the number of failures increases in the system.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Soufi, Khaled Saadi

Contributors dc:contributor

• Belford, Geneva G.

• Computer Science

Statement dc:rights

• Copyright 1994 Soufi, Khaled Saadi

Language dc:language

eng

Identifier

AAI9512556
(UMI)AAI9512556

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22382