An analysis of the average message overhead in replica control protocols

The performance of several replica control protocols was evaluated via a comparison of their average case message overhead in the presence of node failures. The comparison also considered the trade-off between system availability and communication overhead of the majority voting, tree, grid, hierarchical quorum consensus and RST protocols. The implications of the results for designing replicated databases were also discussed.