标题： 无速率布隆过滤器：用于具有可变大小元素的分歧副本的集合协调 显示英文标题

标题： Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements

摘要： 设置协调协议通常做出两个关键假设：它们是为固定大小的元素设计的，并且在差异基数d非常小时进行了优化。 当适应可变大小的元素时，当前的做法是同步固定大小元素的摘要。 然而，当差异数量较大时，例如在网络分区之后，这种方法可能效率不高。 我们的解决方案是一种两阶段混合协议，引入了一个初步的布隆过滤器步骤，专门为此情况设计。 然而，这种方法的创新之处在于解决了一个核心的技术挑战：在不知道d的情况下确定最优的布隆过滤器大小。我们的解决方案是无速率布隆过滤器（RBF），一种动态过滤器，可以自然地适应任意对称差异，紧密匹配最优配置静态过滤器的通信复杂度，而无需任何预先参数化。 我们在可变大小元素集合中的评估显示，对于Jaccard指数低于85%的情况，与最先进的方法相比，我们的RBF-IBLT混合协议将总通信成本降低了高达20%以上。 显示英文摘要

摘要： Set reconciliation protocols typically make two critical assumptions: they are designed for fixed-sized elements and they are optimized for when the difference cardinality, d, is very small. When adapting to variable-sized elements, the current practice is to synchronize fixed-size element digests. However, when the number of differences is considerable, such as after a network partition, this approach can be inefficient. Our solution is a two-stage hybrid protocol that introduces a preliminary Bloom filter step, specifically designed for this regime. The novelty of this approach, however, is in solving a core technical challenge: determining the optimal Bloom filter size without knowing d. Our solution is the Rateless Bloom Filter (RBF), a dynamic filter that naturally adapts to arbitrary symmetric differences, closely matching the communication complexity of an optimally configured static filter without requiring any prior parametrization. Our evaluation in sets of variable-sized elements shows that for Jaccard indices below 85%, our RBF-IBLT hybrid protocol reduces the total communication cost by up to over 20% compared to the state-of-the-art.