An oblivious observed-reset embeddable replicated counter
An oblivious observed-reset embeddable replicated counter
dc.contributor.author | Weidner,M | en |
dc.contributor.author | Paulo Sérgio Almeida | en |
dc.contributor.other | 5607 | en |
dc.date.accessioned | 2022-05-20T15:20:03Z | |
dc.date.available | 2022-05-20T15:20:03Z | |
dc.date.issued | 2022 | en |
dc.description.abstract | Embedding CRDT counters has shown to be a challenging topic, since their introduction in Riak Maps. The desire for obliviousness, where all information about a counter is fully removed upon key removal, faces problems due to the possibility of concurrency between increments and key removals. Previous state-based proposals exhibit undesirable reset-wins semantics, which lead to losing increments, unsatisfactorily solved through manual generation management in the API. Previous operation-based approaches depend on causal stability, being prone to unbounded counter growth under network partitions. We introduce a novel embeddable operation-based CRDT counter which achieves both desirable observed-reset semantics and obliviousness upon resets. Moreover, it achieves this while merely requiring FIFO delivery, allowing a tradeoff between causal consistency and faster information propagation, being more robust under network partitions. © 2022 Owner/Author. | en |
dc.identifier | P-00W-ANJ | en |
dc.identifier.uri | http://dx.doi.org/10.1145/3517209.3524084 | en |
dc.identifier.uri | https://repositorio.inesctec.pt/handle/123456789/13013 | |
dc.language | eng | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.title | An oblivious observed-reset embeddable replicated counter | en |
dc.type | Publication | en |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- P-00W-ANJ.pdf
- Size:
- 525.96 KB
- Format:
- Adobe Portable Document Format
- Description: