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
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1916-3398
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.
Instituto Tecnolgico Informtica Universidad Politcnica de Valencia, Spain.
Instituto Tecnolgico Informtica Universidad Politcnica de Valencia, Spain.
2007 (English)In: Dependable Systems and Networks, DSN 2007, IEEE Computer Society, 2007, 656-665 p.Conference paper, Published paper (Refereed)
Abstract [en]

Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution independently. This availability gain is traded against consistency, since several replicas of the same objects could be updated separately. Once partitioning terminates, divergences in the replicated state needs to be reconciled. One way to reconcile the state consists of letting the application manually solve inconsistencies. However, there are several situations where automatic reconciliation of the replicated state is meaningful. We have implemented replication and automatic reconciliation protocols that can be used as building blocks in a partition-tolerant middleware. The novelty of the protocols is the continuous service of the application even during the reconciliation process. A prototype system is experimentally evaluated to illustrate the increased availability despite network partitions.

Place, publisher, year, edition, pages
IEEE Computer Society, 2007. 656-665 p.
Series
International Conference on Dependable Systems and Networks. Proceedings, ISSN 1530-0889
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-39264DOI: 10.1109/DSN.2007.62ISI: 000248519500068Local ID: 47692ISBN: 0-7695-2855-4 (print)OAI: oai:DiVA.org:liu-39264DiVA: diva2:260113
Conference
37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2007), 25-28 June 2007, Edinburgh, UK
Available from: 2009-10-10 Created: 2009-10-10 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
RTSLAB - Real-Time Systems LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 124 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