Question

Which data structure allows multiple edge nodes to update a shared state independently without conflicts and merge those updates automatically once the network is restored?

Accepted Answer

The data structure is a Conflict-free Replicated Data Type, commonly abbreviated as CRDT. A CRDT is a specialized data structure designed for distributed systems where multiple users or edge nodes modify data at the same time without needing a central coordinator or complex locking mechanisms. These data structures are mathematically engineered to be commutative, associative, and idempotent. Commutative means the order in which updates are applied does not change the final result. Associative means grouping updates does not affect the outcome. Idempotent means applying the same update multiple times results in the same state as applying it once. Because of these properties, CRDTs can resolve conflicts automatically. When a network partition occurs, nodes continue to accept local updates independently. Once the network is restored, these nodes exchange their local states or operation histories. Because the structure follows specific mathematical rules, the nodes can perform a merge process that always arrives at a consistent state across all replicas without requiring human intervention or manual conflict resolution. A simple example is a grow-only counter, which only permits increments. If two different nodes each increment the counter while disconnected, the final state simply sums these increments when the nodes reconnect, ensuring both updates are preserved correctly.

Home → All Courses → Engineering and Technology Courses → Edge Computing Architecture → Flashcard

Which data structure allows multiple edge nodes to update a shared state independently without conflicts and merge those updates automatically once the network is restored?