2011
DOI: 10.1016/j.comnet.2010.12.005
|View full text |Cite
|
Sign up to set email alerts
|

In-packet Bloom filters: Design and networking applications

Abstract: 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 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 inpacket Bloom filters (iBF). Our main contributio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(14 citation statements)
references
References 26 publications
0
14
0
Order By: Relevance
“…Purposes Gains Scenarios Purposes Gains Caching [9] Content summarization CQ, AR Akamai [14] Content summarization CQ, AR Wireless ad hoc [38] Content summarization CQ, AR Wireless net. [39] Content summarization CQ, AR IP lookup [40] [41] Representing routing table CQ, SS Multicast [42] Representing multicast tree CQ, SS MANETs [46] [47] Representing topology info. CQ, SS NDN [44] [45] Representing content names CQ, SS Wireless NDN [2] Data dissemination CQ, SS WSNs [49] Routing packets CQ, SS Cog.…”
Section: Scenariosmentioning
confidence: 99%
“…Purposes Gains Scenarios Purposes Gains Caching [9] Content summarization CQ, AR Akamai [14] Content summarization CQ, AR Wireless ad hoc [38] Content summarization CQ, AR Wireless net. [39] Content summarization CQ, AR IP lookup [40] [41] Representing routing table CQ, SS Multicast [42] Representing multicast tree CQ, SS MANETs [46] [47] Representing topology info. CQ, SS NDN [44] [45] Representing content names CQ, SS Wireless NDN [2] Data dissemination CQ, SS WSNs [49] Routing packets CQ, SS Cog.…”
Section: Scenariosmentioning
confidence: 99%
“…Consider k number of hash functions, m as the bloom filter size (16bit in Fig. 1) and maximum number of elements in D is P [16].…”
Section: Constructing Bloom Filtersmentioning
confidence: 99%
“…A distributed algorithm is used to encode provenance in an in-packet bloom filter [16], and a centralized algorithm is used by the base station to decode the provenance [10]. A unique sequence identification number is attached to the forwarded packet along with data value and an in-packet bloom filter which holds the provenance also transmitting the provenance graph vertices over an in-packet bloom filter.…”
Section: Provenance Collection and Encodingmentioning
confidence: 99%
“…Under the CAPTRA scheme, when a node n i sends a packet p to n j , such information is not only recorded by n i and n j , but by the nearby nodes too. All nodes use the Bloom Filter [19] data structure to compactly store such provenance and provenance witness information. The provenance information is stored at the nodes in the packet path; the provenance witness information is recorded by the nearby nodes who have witnessed the packet transmission at some nodes in the packet path.…”
Section: Captramentioning
confidence: 99%