Practical Rateless Set Reconciliation
<|reference_start|>Practical Rateless Set Reconciliation: Set reconciliation, where two parties hold fixed-length bit strings and run a protocol to learn the strings they are missing from each other, is a fundamental task in many distributed systems. We present Rateless Invertible Bloom Lookup Tables (Rateless IBLT), the first set reconciliation protocol, to the best of our knowledge, that achieves low computation cost and near-optimal communication cost across a wide range of scenarios: set differences of one to millions, bit strings of a few bytes to megabytes, and workloads injected by potential adversaries. Rateless IBLT is based on a novel encoder that incrementally encodes the set difference into an infinite stream of coded symbols, resembling rateless error-correcting codes. We compare Rateless IBLT with state-of-the-art set reconciliation schemes and demonstrate significant improvements. Rateless IBLT achieves 3--4x lower communication cost than non-rateless schemes with similar computation cost, and 2--2000x lower computation cost than schemes with similar communication cost. We show the real-world benefits of Rateless IBLT by applying it to synchronize the state of the Ethereum blockchain, and demonstrate 5.6x lower end-to-end completion time and 4.4x lower communication cost compared to the system used in production.<|reference_end|>
@article{yang2024practical,
    title={Practical Rateless Set Reconciliation},
    author={Lei Yang, Yossi Gilad, Mohammad Alizadeh},
    journal={In ACM SIGCOMM 2024 Conference, August 4-8, 2024, Sydney, NSW,
  Australia. ACM, New York, NY, USA, 18 pages (2024)},
    year={2024},
    doi={10.1145/3651890.3672219},
    archivePrefix={arXiv},
    eprint={2402.02668},
    primaryClass={cs.DC cs.NI}
}