-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathREADME
More file actions
34 lines (25 loc) · 1.2 KB
/
Copy pathREADME
File metadata and controls
34 lines (25 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
*************************************************************
README
*************************************************************
Given a time series data of <time stamp> <# service requests>,
figure out if there is a possibility of DDoS attack.
------------------------------------------------------------
Algorithm
------------------------------------------------------------
K-Means Clustering Algorithm is used to solve this problem.
To utilize the power of k-means, the problem is considered as
an instance of unsupervised clustering. Here, k = 2, i.e.
one cluster for "normal" epochs and one for epochs" that suggest
DDoS attacks (characterized by abruptly high service requests)
However, the inputs may cause biasing towards one cluster and
some points may be falsely classified. To deal with this, we used
a logarithmic function to "normalize" the input points before
porceeding to k-means clustering.
Let,
minPoint = minimum service request value
maxPoint = maximum service request value
point = service request at a ith epoch
normalizedPoint = log(minPoint) + log(1+point)/log(1+maxPoint)
Maximum Iterations = 10. One can change it as per the convenience.
Input format:
<timestamp> <# service requests>