A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Merkle Search Trees: Efficient State-Based CRDTs in Open Networks
2019
2019 38th Symposium on Reliable Distributed Systems (SRDS)
Most recent CRDT techniques rely on a causal broadcast primitive to provide guarantees on the delivery of operation deltas. Such a primitive is unfortunately hard to implement efficiently in large open networks, whose membership is often difficult to track. As an alternative, we argue in this paper that pure state-based CRDTs can be efficiently implemented by encoding states as specialized Merkle trees, and that this approach is well suited to open networks where many nodes may join and leave.
doi:10.1109/srds47363.2019.00032
dblp:conf/srds/AuvolatT19
fatcat:hwdhqukarzhtpockj6kmpd4beq