Scalable eventually consistent counters over unreliable networks

DOI10.1007/s00446-017-0322-2zbMath1451.68034arXiv1307.3207OpenAlexW1855509919MaRDI QIDQ1733394

Carlos Baquero, Paulo Sérgio Almeida

Publication date: 21 March 2019

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3207

zbMATH Keywords

eventual consistencyconflict-free replicated data typesdistributed counters

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Uses Software

• Cassandra
• Dynamo

Cites Work

• Unnamed Item
• Unnamed Item
• The counting pyramid: an adaptive distributed counting scheme
• Connection management without retaining information
• The impossibility of implementing reliable communication in the face of crashes
• Counting networks

This page was built for publication: Scalable eventually consistent counters over unreliable networks