Results 1 - 10
of
685
TABLE III TOP TEN TOP-LEVEL DOMAINS WITH LINUX SLAPPER WORM INFECTED HOSTS ON OCT
Table 9.1 Well-Known Computer Worms and Their Infection Methods Name / Discovered Type Infection Execution Method
Table 3.5: The top three Fortune 100 enterprises and top thre broadband ISPs with worm infections detected by IMS.
2007
Table 5. Comparison between static analysis and AutoFormat results for the unknown protocol used by Slapper worm: The rows marked by * represent those messages exchanged between worm-infected hosts; while other unmarked rows represent the messages exchanged between a worm-infected host and the special master program. (Note P F S H ).
2008
"... In PAGE 13: ... As such, we can statically analyze the source code and manually identify all the message elds, which will be used to verify the AutoFormat results. AutoFormat has identi ed 11 message types and the re- sults are presented in Table5 . It is encouraging that Auto- Format results match our static analysis results well.... ..."
Cited by 1
Table 5: Speed (timesteps to infect 85% of vulnerables) and duration (timesteps for all infected hosts to stop) by percentile of worm epidemics using permutation scanning and other strategies. Address space size A = 232, number of vulnerables N = 217, and per-host scan rate = 4; 000 per timestep.
"... In PAGE 8: ... Additionally, we study the effectiveness of a simple version of partitioned permu- tation scanning, where each infected host stops after scanning its assigned interval. Table5 shows the speed and duration of the per- mutation scanning strategies and their random scanning analogs. When comparing Greedy Permutation to Greedy, we see that permutation scanning provides a slight gain in speed because the Greedy Permutation worms are designed to avoid duplicating scan effort, and hence reach uninfected vulnerables sooner.... ..."
Table 2: Theoretical propagation speeds of a perfect worm
"... In PAGE 6: ...Table 2: Theoretical propagation speeds of a perfect worm As shown in Table2 , with ten infections per second, a target population of one million would be completely infected in under 6 seconds. Higher infection rates will reduce this further, but for all practical purposes, the di erence between 6 seconds and 3 seconds (at 100 infections per second) is negligible, and the return on investment decreases sharply beyond about 10.... ..."
Table 3: Parameters of Four Simulated Worms Simulated Date of BGP # of total Vulnerable # of vulnerable Probing rate Probing
2006
"... In PAGE 22: ... All worms have 25 hosts infected at the beginning of the simulation. Table3 summarizes the parameters of these four simulated worms. Table 3: Parameters of Four Simulated Worms Simulated Date of BGP # of total Vulnerable # of vulnerable Probing rate Probing... ..."
Cited by 2
Table 1: Worm detection time under different scan methods
2004
"... In PAGE 8: ... Ta- ble 1 shows the detail information about the worm de- tection time and corresponding infection percentage of different scan methods using /12 and /16 networks re- spectively. Table1 indicates that the detection perfor- mance of routable worm and Divide-Conquer worm are better than that of random scan worm. The reason is that the random scan worm uses the whole IP V4 space as scan target address, i.... ..."
Cited by 2
Table 1: 5% propagtion time (days) for Temporal + Spa- tial
2004
"... In PAGE 7: ...000034. Table1 shows the time it takes the worm to infect 5% of vulnerable hosts (called 5% propagation time) under var- ious conditions with Temporal + Spatial implemented. De- pending on the size (k and z) of the ISP, the propagation time ranges from 10.... ..."
Cited by 14
Results 1 - 10
of
685