In this paper, we present a dynamic replication algorithm, DYVO, which could provide an optimal cost for operating replicas according to a read/write pattern of transactions. Unlike previous algorithms for dynamic replication, in which read one and write all available approach is used for preserving consistency of replicas, DYVO basically uses quorum approach for managing replicas. The quorum approach is basically able to encompass a large class of failures. Moreover, the quorum approach simplifies considerably the task maintaining the consistency of replicated data. As a result, DYVO is fault-tolerant to all kinds of failures and gives a way that minimizes overload for managing a replication algorithm.