Set Reconciliation in Two Rounds of Communication

Abstract : In this work, we propose an approach, known as the C2SS-BF method, to synchronizing similar sets of data that uses an Invertible Bloom Filter (IBF). The C2SS-BF method builds on previous work by Epstein et al. in [6]. By allowing two rounds of communication, we show that in many cases the proposed approach requires substantially less throughput than the algorithm proposed in [6]. The C2SS-BF compares favorably to the work by Guo and Li in [9], and, in particular, it requires less computational complexity and throughput.

[1]  George Varghese,et al.  What's the difference?: efficient set reconciliation without prior context , 2011, SIGCOMM.

[2]  Michael T. Goodrich,et al.  Invertible bloom lookup tables , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  A. Trachtenberg,et al.  Practical Set Reconciliation , 2002 .

[4]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[5]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[6]  Yaron Minsky,et al.  Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.

[7]  Mark G. Karpovsky,et al.  Data verification and reconciliation with generalized error-control codes , 2003, IEEE Transactions on Information Theory.

[8]  Richard J. Lipton,et al.  Efficient Checking of Computations , 1990, STACS.

[9]  Mo Li,et al.  Set Reconciliation via Counting Bloom Filters , 2013, IEEE Transactions on Knowledge and Data Engineering.