DeepAI AI Chat
Log In Sign Up

Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)

by   Long Gong, et al.

Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitcoins, files, records, etc.) are stored respectively at two different network-connected hosts, which we name Alice and Bob respectively. Alice and Bob communicate with each other to learn AΔ B, the difference between A and B, and as a result the reconciled set A⋃ B. Current set reconciliation schemes are based on either Invertible Bloom Filters (IBF) or Error-Correction Codes (ECC). The former has a low computational complexity of O(d), where d is the cardinality of AΔ B, but has a high communication overhead that is several times larger than the theoretical minimum. The latter has a low communication overhead close to the theoretical minimum, but has a much higher computational complexity of O(d^2). In this work, we propose Parity Bitmap Sketch (PBS), an ECC- based set reconciliation scheme that gets the better of both worlds: PBS has both a low computational complexity of O(d) just like IBF-based solutions and a low communication overhead of roughly twice the theoretical minimum. A separate contribution of this work is a novel rigorous analytical framework that can be used for the precise calculation of various performance metrics and for the near-optimal parameter tuning of PBS.


page 1

page 2

page 3

page 4


A rate-compatible solution to the set reconciliation problem

We consider a set reconciliation setting in which two parties hold simil...

Solving the large syndrome calculation problem in steganography

In error correction code based image steganography, embedding using larg...

A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access

This article introduces a novel communication scheme for the uncoordinat...

Optimization-Based Decoding Algorithms for LDPC Convolutional Codes in Communication Systems

In a digital communication system, information is sent from one place to...

Limited-Fronthaul Cell-Free Hybrid Beamforming with Distributed Deep Neural Network

Cell-free massive MIMO (CF-mMIMO) systems represent a promising approach...

Computational Intractability of Julia sets for real quadratic polynomials

We show that there exist real parameters c for which the Julia set J_c o...

Low Complexity Sequential Search with Measurement Dependent Noise

This paper considers a target localization problem where at any given ti...