DocumentCode :
3196539
Title :
Voting with regenerable volatile witnesses
Author :
Pâris, Jehan-François ; Long, Darrell D E
Author_Institution :
Dept. of Comput. Sci., Houston Univ., TX, USA
fYear :
1991
fDate :
8-12 Apr 1991
Firstpage :
112
Lastpage :
119
Abstract :
Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. It is proposed to replace some of these replicas with volatile witnesses that have no data and require no stable storage, and to regenerate them instead of waiting for recovery. The small size of volatile witnesses allows them to be regenerated much easier than full replicas. Regeneration attempts are also much more likely to succeed since volatile witnesses can be stored on diskless sites. It is shown that under standard Markovian assumptions two full replicas and one regenerable volatile witness managed by a two-tier dynamic voting protocol provide a higher data availability than three full replicas managed by majority consensus voting or optimistic dynamic voting provided site failures can be detected significantly faster than they can be repaired
Keywords :
database management systems; protocols; Markovian assumptions; consistency; optimistic dynamic voting; regenerable volatile witnesses; regeneration; replicas; replicated objects; voting protocols; Availability; Computer science; Costs; Fault tolerance; Fault tolerant systems; File systems; Protocols; Redundancy; Steady-state; Voting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 1991. Proceedings. Seventh International Conference on
Conference_Location :
Kobe
Print_ISBN :
0-8186-2138-9
Type :
conf
DOI :
10.1109/ICDE.1991.131458
Filename :
131458
Link To Document :
بازگشت