2018
DOI: 10.4108/eai.19-6-2018.155865
|View full text |Cite
|
Sign up to set email alerts
|

Preventing DDoS using Bloom Filter: A Survey

Abstract: Distributed Denial-of-Service (DDoS) is a menace for service provider and prominent issue in network security. Defeating or defending the DDoS is a prime challenge. DDoS make a service unavailable for a certain time. This phenomenon harms the service providers, and hence, causes loss of business revenue. Therefore, DDoS is a grand challenge to defeat. There are numerous mechanism to defend DDoS, however, this paper surveys the deployment of Bloom Filter in defending the DDoS attack. The Bloom Filter is a proba… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 23 publications
(18 citation statements)
references
References 47 publications
0
18
0
Order By: Relevance
“…They extend the approach in Reference to distribute the Bloom filters close to the routers. For a recent survey on the usage of of Bloom Filter for DDoS mitigation we refer the reader to Reference . To put it in a nutshell, although there is a stream of history‐based approaches in the literature such as References , , and , those approaches rely merely on distance between IP addresses ignoring actual geographical proximity.…”
Section: Related Workmentioning
confidence: 99%
“…They extend the approach in Reference to distribute the Bloom filters close to the routers. For a recent survey on the usage of of Bloom Filter for DDoS mitigation we refer the reader to Reference . To put it in a nutshell, although there is a stream of history‐based approaches in the literature such as References , , and , those approaches rely merely on distance between IP addresses ignoring actual geographical proximity.…”
Section: Related Workmentioning
confidence: 99%
“….. Article [4] defines false positive, true positive, false negative, and true negative as follows-• False positive: If K j ∈ S and Bloom Filter returns K j ∈ B, then the result of Bloom Filter is a false positive.…”
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%
“…To solve this issue, we identify two approaches that provide quick reaction time through the efficient and scalable use of the limited size of flow tables: Bloom Filters (BFs) and Wildcard Rules. Applying BFs for attack detection seems to be a promising solution since it has a good space and time complexity . BF is a probabilistic data structure used for membership query, that is, to check the presence of an element in a set by returning true or false.…”
Section: Introductionmentioning
confidence: 99%