DocumentCode
2489563
Title
Voting with bystanders
Author
Pâris, Jehan-Francois
Author_Institution
Dept. of Comput. Sci., Houston Univ., TX, USA
fYear
1989
fDate
5-9 Jun 1989
Firstpage
394
Lastpage
401
Abstract
A voting protocol overcoming the usual requirements of a minimum number of three copies to be of any practical use and relatively high number of read and write requests is presented. It provides a significant amount of fault-tolerance with as few as two replicas. This protocol, voting with bystanders (VWB), applies to all networks consisting of local area network segments that are immune to partial failures linked by gateways that might fail. A stochastic analysis of the protocol under general Markovian assumptions is presented showing that VWB provides excellent read availabilities and good write availabilities with as few as two or three replicas
Keywords
Markov processes; fault tolerant computing; local area networks; protocols; fault-tolerance; gateways; general Markovian assumptions; local area network segments; partial failures; read and write requests; replicas; stochastic analysis; voting protocol; voting with bystanders; Availability; Communications technology; Computer science; Equipment failure; File systems; Local area networks; Protection; Protocols; Redundancy; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1989., 9th International Conference on
Conference_Location
Newport Beach, CA
Print_ISBN
0-8186-1953-8
Type
conf
DOI
10.1109/ICDCS.1989.37970
Filename
37970
Link To Document