Simulating and optimising worm propagation algorithms

@inproceedings{Vogt2004SimulatingAO,
  title={Simulating and optimising worm propagation algorithms},
  author={Thomas M. Vogt},
  year={2004}
}
This paper describes a series of simulations run to estimate various worm growth patterns and their corresponding propagation algorithms. It also tests and verifies the impact of various improvements, starting from a trivial simulation of worm propagation and the underlying network infrastructure to more refined models, it attempts to determine the theoretical maximum propagation speed of worms and how it can be achieved. It also estimates the impact a malicious worm could have on the overall… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Stealing the Network An overview of scanrand including this number is on page 225

  • Stealing the Network An overview of scanrand including this number is on page 225
  • 2003

As detailed in http://arbornetworks.com/downloads/dark address space

  • As detailed in http://arbornetworks.com/downloads/dark address space

Thanks to Armin Krack <armin.krack@nruns.com> for his help with the math in this part

  • Thanks to Armin Krack <armin.krack@nruns.com> for his help with the math in this part

http://www.caida.org/analysis/security/code-red/coderedv2 analysis

  • http://www.caida.org/analysis/security/code-red/coderedv2 analysis