BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR90-145
ENTRY:: January 28, 2008
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: A Bound of Data Availability when Networks Partition
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Goldweber, Michael
AUTHOR:: Johnson, Donald B.
DATE:: March 1990
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/TR90-145.pdf
ABSTRACT:: 
Many consistency or replication control schemes that increase data availability in distributed systems exist, and the search for improvements continues, though there have been no good nontrivial upper bound demonstrating how much improvement is possible.  We present a new upper bound for data availability under replication for general networks.  In addition we also describe a new technique that yields near optimal levels of data availability with respect to this bound.
END:: ncstrl.dartmouthcs//TR90-145