Scuttlebutt Reconciliation in the paper “Efficient Reconciliation and Flow Control for Anti-Entropy Protocols”
Posted
by
soulmachine
on Programmers
See other posts from Programmers
or by soulmachine
Published on 2012-05-17T02:08:35Z
Indexed on
2012/11/08
17:23 UTC
Read the original article
Hit count: 192
cassandra
I am reading the paper "Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"! , I couldn't clearly understand Section 3.2 "Scuttlebutt Reconciliation". Here I extract out some sentences from the paper, which especially confuse me.
If gossip messages were unlimited in size, then the sets contains the exact differences,just like with precise reconciliation.
Scuttlebutt requires that if a certain delta (r; k; v; n) is omitted, then all the deltas with higher version numbers for the same r should be omitted as well.
Scuttlebutt satises the global invariant C(p;q) for any two processes p and q:
© Programmers or respective owner