首页> 外文期刊>Computer networks >In-packet Bloom filters: Design and networking applications
【24h】

In-packet Bloom filters: Design and networking applications

机译:数据包内布隆过滤器:设计和联网应用

获取原文
获取原文并翻译 | 示例
           

摘要

The Bloom filter (BF) is a well-known randomized data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of the limitations of current network architectures, some recent proposals rely on including small BFs in packet headers for routing, security, accountability or other purposes that move application states into the packets themselves. In this paper, we consider the design of such in-packet Bloom filters (iBF). Our main contributions are exploring the design space and the evaluation of a series of extensions (1) to increase the practicality and performance of iBFs, (2) to enable false-negative-free element deletion, and (3) to provide security enhancements. In addition to the theoretical estimates, extensive simulations of the multiple design parameters and implementation alternatives validate the usefulness of the extensions, providing for enhanced and novel iBF networking applications.
机译:布隆过滤器(BF)是一种众所周知的随机数据结构,它以某种误报的概率回答集合成员查询。为了解决当前网络体系结构的许多局限性,一些最近的提议依赖于在报头中包括小的BF,以进行路由,安全性,问责制或其他将应用程序状态移入报文本身的目的。在本文中,我们考虑了此类分组内布隆过滤器(iBF)的设计。我们的主要贡献是探索设计空间和一系列扩展的评估(1)以提高iBF的实用性和性能,(2)启用无假阴性元素删除,以及(3)增强安全性。除了理论上的估计之外,对多个设计参数和实施方案的广泛仿真还验证了扩展的有用性,从而为增强型和新颖的iBF网络应用程序提供了条件。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号