The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes from the standpoint of availability of the system has been well addressed, the issue of message overhead has been limited to the analysis of worst case and best case message bounds. In this paper we derive expressions for computing the <it>average message overhead</it> of several well known replica control protocols and provide a comparative study of the different protocols with respect to both average message overhead and system availabilities.</p>
Replica control, quorum consensus, replicated databases, message overhead, availability, update synchronization.

D. Saha, S. Rangarajan and S. K. Tripathi, "An Analysis of the Average Message Overhead in Replica Control Protocols," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 1026-1034, 1996.
92 ms
(Ver 3.3 (11022016))