论文标题
设置对帐问题的汇率兼容解决方案
A rate-compatible solution to the set reconciliation problem
论文作者
论文摘要
我们考虑了一个集合的对帐设置，在该设置中，两个方拥有相似的集合，特别是他们想和解的集合，我们将重点放在基于可逆的Bloom查找表（IBLTS）基于设置的对帐上，这是一种受Bloom过滤器启发的概率数据结构，但允许更复杂的操作。基于IBLT的集合对帐方案具有表现出较低复杂性的优势，但是，文献中可用的方案在沟通复杂性（架空）方面远非最佳。基于IBLT的集合对帐的效率低下可以归因于两个事实。首先，它需要估算集合之间集差的基数，这意味着开销增加。其次，为了应对上述差异差异估计中的错误，文献中的IBLT方案是最坏的假设并超大数据结构，从而进一步增加了开销。在这项工作中，我们提出了一种基于IBLT的新型集合协议，该协议不需要估计集合差异的基数。我们提出的方案依赖于我们称为多边型（MET）IBLT的计划。本文显示的仿真结果表明，新方案的表现优于以前的基于IBLT的方法来设置对帐
We consider a set reconciliation setting in which two parties hold similar sets which they would like to reconcile In particular, we focus on set reconciliation based on invertible Bloom lookup tables (IBLTs), a probabilistic data structure inspired by Bloom filters but allowing for more complex operations. IBLT-based set reconciliation schemes have the advantage of exhibiting a low complexity, however, the schemes available in literature are known to be far from optimal in terms of communication complexity (overhead). The inefficiency of IBLT-based set reconciliation can be attributed to two facts. First, it requires an estimate of the cardinality of the set difference between the sets, which implies an increase in overhead. Second, in order to cope with errors in the aforementioned estimation of the cardinality of the set difference, IBLT schemes in literature make a worst-case assumption and oversize the data structures, thus further increasing the overhead. In this work, we present a novel IBLT-based set reconciliation protocol that does not require estimating the cardinality of the set difference. The scheme we propose relies on what we term multi-edge-type (MET) IBLTs. The simulation results shown in this paper show that the novel scheme outperforms previous IBLT-based approaches to set reconciliation
