Skip to main content

Worm Traffic Modeling for Network Performance Analysis

  • Conference paper
Intelligence and Security Informatics (ISI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3975))

Included in the following conference series:

  • 1828 Accesses

Abstract

Worm research depends on simulation to a large degree due to worm propagation characters. In worm simulation, worm traffic generation is the base to analyze influences of worm traffic on network. The popular Random Constant Spread (RCS) model ignores the burstiness of “latency-limited” worm traffic, which will cause underestimation of the influences. According to worm scan behaviors, the Periodic Burst Scanning (PBS) model is proposed to model “latency-limited” worm traffic. Simulation results show that network performance decreases much more with PBS model than that with RCS model.

This work is supported by a grant from the Zhejiang Provincial Natural Science Foundation (No. Y104437), Science and Technology Program of Zhejiang Province (No. 2005C33034), Science and Technology Program of Hubei Provincial Department of Education (No. D200523007, D200623002). The NLANR CodeRed data used in this paper was collected by the NLANR Measurement and Network Analysis Group (NLANR/MNA) with funding under the National Science Foundation cooperative agreement nos. ANI-0129677 (2002) and ANI-9807479 (1998).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weaver, N., Ellis, D., Staniford, S., Paxson, V.: Worms vs. perimeters: the case for HardLANs. In: Proc. of Hot Interconnects (2004), http://www.icir.org/vern/papers/hardlans.hot-inter04.pdf

  2. Park, K., Willinger, W. (eds.): Self-Similar Network Traffic and Performance Evaluation. John Wiley & Sons, New York (2000)

    Google Scholar 

  3. Erramilli, A., Narayan, O., Willinger, W.: Experimental queueing analysis with long-range dependent packet traffic. IEEE/ACM Transactions on Networking 4(2), 209–223 (1996)

    Article  Google Scholar 

  4. Wagner, A., Dübendorfer, T., Plattner, B., Hiestand, R.: Experiences with worm propagation simulations. In: Proc. of ACM workshop on Rapid Malcode, pp. 34–41 (2003)

    Google Scholar 

  5. Moore, D., Paxson, V., Savage, S., Shannon, C., Staniford, S., Weaver, N.: Inside the slammer worm. IEEE Security and Privacy 1(4), 33–39 (2003)

    Article  Google Scholar 

  6. Liljenstam, M., Nicol, D.M., Berk, V.H., Gray, R.S.: Simulating realistic network worm traffic for worm warning system design and testing. In: Proc. of the ACM Workshop on Rapid Malcode, pp. 24–33 (2003)

    Google Scholar 

  7. Chen, Y., Dong, Y., Lu, D., Pan, Y.: A Simulating Method for TCP Aggregated Traffic of Large Scale Network. Journal on Communications 27(2), 100–106 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Dong, Y., Lu, D., Pan, Y., Lao, H. (2006). Worm Traffic Modeling for Network Performance Analysis. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_60

Download citation

  • DOI: https://doi.org/10.1007/11760146_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34478-0

  • Online ISBN: 978-3-540-34479-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics