An efficient optimal algorithm for minimizing the overall communication cost in replicated data management

Abstract

Quorum consensus methods have been widely applied to managing replicated data. In this paper, we study the problem of vote and quorum assignments for minimizing the overall communication cost of processing the typical demands of transactions. This problem is left open, even restricted to a uniform network, and we shall show that it can be solved by an efficient polynomial time algorithm.