Invertible Bloom Lookup Tables with Listing Guarantees

Author:

Mizrahi Avi1ORCID,Bar-Lev Daniella1ORCID,Yaakobi Eitan1ORCID,Rottenstreich Ori1ORCID

Affiliation:

1. Technion - Israel Institute of Technology, Haifa, Israel

Abstract

The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set representation that supports a listing operation as the recovery of the elements in the represented set. Its applications can be found in network synchronization and traffic monitoring as well as in error-correction codes. IBLT can list its elements with probability affected by the size of the allocated memory and the size of the represented set, such that it can fail with small probability even for relatively small sets. While previous works only studied the failure probability of IBLT, this work initiates the worst case analysis of IBLT that guarantees successful listing for all sets of a certain size. The worst case study is important since the failure of IBLT imposes high overhead. We describe a novel approach that guarantees successful listing when the set satisfies a tunable upper bound on its size. To allow that, we develop multiple constructions that are based on various coding techniques such as stopping sets and the stopping redundancy of error-correcting codes, and Steiner systems as well as new methodologies we develop. We analyze the sizes of IBLTs with listing guarantees obtained by the various methods as well as their mapping memory and runtime overheads. Lastly, we study lower bounds on the achievable sizes of IBLT with listing guarantees and verify the results in the paper by simulations.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Computer Science (miscellaneous)

Reference36 articles.

1. Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables . In Allerton Conference on Communication, Control, and Computing , 2011 . Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables. In Allerton Conference on Communication, Control, and Computing, 2011.

2. Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu. Lossradar : Fast detection of lost packets in data center networks . In ACM International on Conference on emerging Networking EXperiments and Technologies (CoNext) , 2016 . Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Lossradar: Fast detection of lost packets in data center networks. In ACM International on Conference on emerging Networking EXperiments and Technologies (CoNext), 2016.

3. Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu. Flowradar : A better netflow for data centers . In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2016 . Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Flowradar: A better netflow for data centers. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2016.

4. Michael Mitzenmacher and George Varghese . Biff (Bloom filter) codes : Fast error correction for large data sets . In IEEE International Symposium on Information Theory (ISIT) , 2012 . Michael Mitzenmacher and George Varghese. Biff (Bloom filter) codes: Fast error correction for large data sets. In IEEE International Symposium on Information Theory (ISIT), 2012.

5. David Eppstein , Michael T. Goodrich , Frank Uyeda , and George Varghese . What's the difference? : Efficient set reconciliation without prior context . In ACM SIGCOMM , 2011 . David Eppstein, Michael T. Goodrich, Frank Uyeda, and George Varghese. What's the difference?: Efficient set reconciliation without prior context. In ACM SIGCOMM, 2011.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. SoK: Applications of Sketches and Rollups in Blockchain Networks;IEEE Transactions on Network and Service Management;2024-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3