liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Post-Partition Reconciliation Protocols for Maintaining Consistency
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology. (Real-time Systems Laboratory)ORCID iD: 0000-0003-1916-3398
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology. (Real-time Systems Laboratory)
2006 (English)Conference paper, Published paper (Refereed)
Abstract [en]

This paper addresses design exploration for protocols thatare employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects replicated across a network, and whose updates require satisfaction of integrity constraints over multiple objects. Upondetection of a partition, such a network will continue toprovide delivery of services in parallel partitions; but onlyfor updates with non-critical integrity constraints. Once thedegraded mode ends, the parallel network partitions are reconciled to arrive at one partition.Using a formal treatment of the reconciliation process,three algorithms are proposed and studied in terms of theirinfluence on service outage duration. The longer the reconciliation time, the lower is system availability; since theinterval in which no services are provided is longer. However, the reconciliation time in turn is affected by the time toconstruct the post-partition system state. The shorter theconstruction time the higher is the number of updates thattook place in the degraded mode but that will not be takenup in the reconciled partition. This will lead to a longerinterval for rejecting/redoing these operations and therebyincrease reconciliation time.

Place, publisher, year, edition, pages
ACM , 2006.
Keyword [en]
reconciliation protocol, availability, partition, consistency, trade-off
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-72607DOI: 10.1145/1141277.1141439OAI: oai:DiVA.org:liu-72607DiVA: diva2:460373
Conference
The 21st ACM/SIGAPP symposium on Applied computing
Available from: 2011-12-16 Created: 2011-11-30 Last updated: 2015-03-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Asplund, MikaelNadjm-Tehrani, Simin

Search in DiVA

By author/editor
Asplund, MikaelNadjm-Tehrani, Simin
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf