arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.05972cs.ITcs.DSmath.IT
收藏

具有列表保证的IBLT编码

Coding for IBLTs with Listing Guarantees

Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion, Ori Rottenstreich, Eitan Yaakobi

AI总结:

本文针对可逆布隆查找表(IBLT)的列表失败问题,提出更通用的IBLT方案,在保持成功列表保证的同时减少内存,并探讨了基于线性码和\(B_h\)-序列的时间-内存权衡。

摘要:

可逆布隆查找表(IBLT)是一种用于集合表示的概率数据结构,在网络和流量监控中有应用。它以能够列出其元素而闻名,对于足够大的表,该操作以高概率成功。然而,即使对于相对较小的集合,列表也可能失败。本文扩展了最近关于IBLT最坏情况分析的工作,该分析保证了所有特定大小集合的成功列表,通过引入更通用的IBLT方案。这些方案允许在插入、删除和列表操作的实现中有更大的自由度,并证明可以在保持成功列表保证的同时减少IBLT内存。本文还探讨了这些方案的时间-内存权衡,其中一些方案基于有限域上的线性码和\(B_h\)-序列。

英文摘要:

The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structure for set representation, with applications in network and traffic monitoring. It is known for its ability to list its elements, an operation that succeeds with high probability for sufficiently large table. However, listing can fail even for relatively small sets. This paper extends recent work on the worst-case analysis of IBLT, which guarantees successful listing for all sets of a certain size, by introducing more general IBLT schemes. These schemes allow for greater freedom in the implementation of the insert, delete, and listing operations and demonstrate that the IBLT memory can be reduced while still maintaining successful listing guarantees. The paper also explores the time-memory trade-off of these schemes, some of which are based on linear codes and \(B_h\)-sequences over finite fields.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑