1
On the Effectiveness of Distributed Worm Monitoring
Moheeb Abu Rajab Fabian Monrose Andreas Terzis
Computer Science Department Johns Hopkins University
On the Effectiveness of Distributed Worm Monitoring Moheeb Abu - - PowerPoint PPT Presentation
On the Effectiveness of Distributed Worm Monitoring Moheeb Abu Rajab Fabian Monrose Andreas Terzis Computer Science Department Johns Hopkins University 1 Monitoring Internet Threats Threat monitoring techniques: Intrusion detection
1
Computer Science Department Johns Hopkins University
2
Threat monitoring techniques:
Intrusion detection systems monitoring active
Monitoring routable unused IP space [ Moore et al,
Monitoring unused address space is attractive
No legitimate traffic Forensic analysis and early warning
CAIDA deployed the first /8 telescope
3
/8
Worm Scans DoS Attack
DoS Attack DoS Backscatter Worm Scans
4
5
/8
Worm Scans DoS Attack
Non-uniform scanner
6
7
Problem and Motivation A Worm Propagation Model
Population Distribution Extended worm model
Distributed Worm Monitoring
Distributed Telescope Model Design parameters
Summary
8
Previous worm models assumed that the
Sources of non-uniformity in population
Un-allocated address space Highly-clustered allocated space Usage of the allocated space
9
The distribution of Vulnerable population over the IP space is far from uniform Best fits a Log-normal distribution DShield dataset CAIDA’s dataset (Witty Worm)
10
11
216 28 - 216 232 - 28 P16 P8 P0
32 16 24 16 ) 8 (/ 8 16
i i j i j i
ni bi
(/8)
bi vi
12
+
j i
k j i i j i j i
16 1
= + =
16
2 1 1 j j i i
Vulnerable non- infected hosts
13
N= 106 hosts uniformly distributed Over the IP space Number of Infected hosts vs time, for a Nimda-like worm s= 100 scans/time tick, P16= 0.5, P8=0.25, P0 = 0.25 N= 620,000 hosts extracted from DShield data set
14
Problem and Motivation Better Worm Model
Population Distribution Extended worm model
Distributed Worm Monitoring
Distributed monitoring system model Design parameters
Summary
15
16
17
/0 /16 /8 MB MC MB MC /8 MA M
S(/8) = MB+ MC S(/0) = M + MA+ MB+ MC
MA P16 P8 P0
S(/16) = MC
18
19
Random Monitor placement Pr= 0.999, s= 10 scans/time tick Nimda-like scanning
/8 940 time ticks 512 /17 230 time ticks with only 40 hosts per /16, 7100 more scans will cause infecting 2 victims before being detected
20
Monitors deployed in top populated prefixes
512 /17 9 time ticks /8 940 time ticks
21
512 /17 33 time ticks /8 940 time ticks
Monitors deployed randomly over the 5000 most populated /16 prefixes (contain 90% of the vulnerable population) Example: 512 monitors with 2048 IP addresses/monitor 160 time ticks
22
Monitors will be deployed at different
How many domains are needed to deploy these
Mapping the monitors to AS space, only 130
23
Population distribution has a profound impact on worm
Distributed Monitoring provides an improved detection
Even partial knowledge of the population distribution can
Effective distributed monitoring is possible with
24