In-Packet Bloom Filters: Design and Networking Applications

Free registration required

Executive Summary

The Bloom Filter (BF) is a well-known space-efficient data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of the limitations of current inter-networking architectures, some recent proposals rely on including small Bus in packet headers for routing, security, accountability or other purposes that move application states into the packets themselves. In this paper, the authors consider the design of such in-packet Bloom Filters (if). The main contributions are exploring the design space and the evaluation of a series of extensions to increase the practicality and performance of ibis, to enable false-negative-free element deletion, and to provide security enhancements.

  • Format: PDF
  • Size: 317.21 KB