Skip to main navigation Skip to search Skip to main content

Average message overhead of replica control protocols

  • Debanjan Saha
  • , Sampath Rangarajan
  • , Satish K. Tripathi
  • University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 performance penalty in terms of communication overhead incurred. Though the issue of performance of these schemes from the stand point 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 compare several well known replica management protocols in terms of their average case message overhead.

Original languageEnglish
Title of host publication1993 IEEE 13th International Conference on Distributed Computing Systems
PublisherPubl by IEEE
Pages474-481
Number of pages8
ISBN (Print)0818637706
StatePublished - 1993
Event1993 IEEE 13th International Conference on Distributed Computing Systems - Pittsburgh, PA, USA
Duration: May 25 1993May 28 1993

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Conference

Conference1993 IEEE 13th International Conference on Distributed Computing Systems
CityPittsburgh, PA, USA
Period05/25/9305/28/93

Fingerprint

Dive into the research topics of 'Average message overhead of replica control protocols'. Together they form a unique fingerprint.

Cite this