Practical Rateless Set Reconciliation
CoRR(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要