2016
DOI: 10.1007/978-981-10-0129-1_16
|View full text |Cite
|
Sign up to set email alerts
|

UDP Flooding Attack Detection Using Information Metric Measure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…Boro et al [47] considered two detection features for UDP flooding attacks targeted to a particular destination: (i) the count of total destination port changes for non-spoofed source addresses with random destination ports, and (ii) the count of source addresses changes for randomly spoofed source addresses. A KD-Tree that each node represents a unique source address is used to record information of incoming traffic.…”
Section: A Detection Methods Against Network/transport Layer Ddos Flmentioning
confidence: 99%
“…Boro et al [47] considered two detection features for UDP flooding attacks targeted to a particular destination: (i) the count of total destination port changes for non-spoofed source addresses with random destination ports, and (ii) the count of source addresses changes for randomly spoofed source addresses. A KD-Tree that each node represents a unique source address is used to record information of incoming traffic.…”
Section: A Detection Methods Against Network/transport Layer Ddos Flmentioning
confidence: 99%
“…UDP does not require the source and destination to build the three-way handshaking like TCP. Moreover, it is not crucial for an end-to-end connection [26]. The minor of the authentication mechanism and end-to-end connections make UDP vulnerable to attacks.…”
Section: Udp Flooding Attackmentioning
confidence: 99%
“…Nam et al [27] combined KNN with SOM to deal with DDoS flooding. Because Linear KNN has high time consuming [28], K-Dimensional tree (KD tree) stores training points in a tree structure for fast query of KNN [29], [30]. But, KD tree has to build an index chain for all training entities [31], if the training entity changes, it will affect detection accuracy.…”
Section: Related Workmentioning
confidence: 99%