2016
DOI: 10.1109/tc.2015.2444850
|View full text |Cite
|
Sign up to set email alerts
|

New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 52 publications
(23 citation statements)
references
References 14 publications
0
23
0
Order By: Relevance
“…If a system can tolerate negligible overhead, then Bloom Filter can enhance a performance of a system. Therefore, Bloom Filter is deployed to various domains, namely, Big Data [9], Deduplication [10], [11], [12], Network Security [4], [13], Network Traffic control [14], Name Lookup [15], [16], IP address lookup [17], [18], Biometric [19], [20], Bioinformatics [21], [22], File System [23], Indexing, and many more. However, Bloom Filter is not suitable in case of correct query-answer requirements.…”
Section: Bloom Filtermentioning
confidence: 99%
“…If a system can tolerate negligible overhead, then Bloom Filter can enhance a performance of a system. Therefore, Bloom Filter is deployed to various domains, namely, Big Data [9], Deduplication [10], [11], [12], Network Security [4], [13], Network Traffic control [14], Name Lookup [15], [16], IP address lookup [17], [18], Biometric [19], [20], Bioinformatics [21], [22], File System [23], Indexing, and many more. However, Bloom Filter is not suitable in case of correct query-answer requirements.…”
Section: Bloom Filtermentioning
confidence: 99%
“…The destination IP address of the packet is used for IP address lookup [15]. Each prefix length is associated with a W boom filter [16]. They are then grouped according to their prefix length.…”
Section: Adaptive Filterin/g:-mentioning
confidence: 99%
“…In the Bloom filter chaining approach proposed by Mun et al [15], an on-chip Bloom filter is programmed for each node in a trie and is sequentially queried as increasing the trie level. For a specific length of a given input, if a negative result is produced, it means that no node appears at the current level and at longer levels for the path of the input.…”
Section: Bloom Filtermentioning
confidence: 99%
“…The WBSL-BF and LBSL-BF are algorithms proposed in [9], in which a Bloom filter is added to Waldvogel's binary search on trie levels (WBSL) [13] and to Lim's binary search on trie levels (LBSL) [14], respectively. The Chaining-PC and the Chaining-LP are the algorithms proposed in [15], which perform linear querying to the Bloom filter programmed for nodes in a BMP pre-computed (PC) trie and a leaf-pushing While every node in a trie is programmed to the Bloom filter for other algorithms, prefixes only are programmed in our proposed algorithms. Since each location of the Bloom filter is a vector storing an output port, the memory requirement for a Bloom filter is greater in our proposed algorithm.…”
Section: Performance Evaluationmentioning
confidence: 99%