Abstract
The management of replicated data in distributed database systems is a classic problem with great practical importance. Quorum consensus is one of the popular methods, combined with eager replication, for managing replicated data. In this paper we investigate the problems of delay-optimal quorum consensus. Firstly, we show that the problem of minimizing the total delay (or mean delay) restricted to a ring can be solved in a constant time in contrast to the existing approximation results. Secondly, we show that the problem of minimizing the total delay (or mean delay) is NP-hard. Thirdly, we present an approximate algorithm with an approximate ratio 2; and the approximate algorithm can guarantee the exact solutions for some specific network topology, such as trees and meshes. Finally, we present an improvement on the existing algorithm to solve the problem of minimizing the maximal delay; this reduces the time complexity from O(n 3 log n) to O(n 3) where n is the number of nodes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, X. Delay Optimization in Quorum Consensus. Algorithmica 38, 397–413 (2004). https://doi.org/10.1007/s00453-003-1066-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1066-x