The triangular lattice protocol: a highly fault tolerant and highly efficient protocol for replicated data
The triangular lattice protocol: a highly fault tolerant and highly efficient protocol for replicated data
复制标题
三角格协议：一种高容错且高效的复制数据协议
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
G. Belford
中科院分区：
文献类型：
--
作者：
Chienwen Wu;G. Belford
引入了一种用于管理复制数据的协议，其中数据副本被组织为三角网格。最小仲裁大小为 O( 平方根 N)，其中 N 是数据副本的数量，目前认为对于完全分布式环境来说是最佳的。该协议具有优雅降级的特性。随着数据复制失败的增加，仲裁大小逐渐增加。该协议还具有渐近高可用性的特性，即，如果数据副本可用的概率大于 0.5，则随着数据副本数量趋于无穷大，可用性趋近于 1。<<ETX>>
A protocol for managing replicated data in which data copies are organized as a triangular lattice is introduced. The smallest quorum size is O( square root N), where N is the number of data copies, which is currently considered optimal for a fully distributed environment. The protocol has the property of graceful degradation. The quorum sizes increase gradually as data copy failures increase. The protocol also has the property of asymptotically high availability, i.e., the availability approaches 1 as the number of data copies goes to infinity if the probability that a data copy available is greater than 0.5.<<ETX>>