BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR89-142
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: A Comparison of Consistency Control Protocols
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Goldweber, Michael
AUTHOR:: Johnson, Donald B.
AUTHOR:: Raab, Larry
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1989
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR89-142.pdf
ABSTRACT::
	In this paper we analyze three protocols for maintaining the
mutual consistency of replicated objects in a distributed computing
environment and compare their performance with that of an oracle
protocol whose performance is optimal.  We examine these protocols,
two dynamic protocols and the majority consensus protocol, via
simulations using two measures of availability.  The analysis shows
that the dynamic protocols, under realistic assumptions, do not
perform significantly better than the static voting scheme.  Finally
we demonstrate that none of these approaches perform as well as our
oracle protocol which is shown to be an upper bound on availability.
END:: ncstrl.dartmouthcs//TR89-142