Worm traffic modeling for network performance analysis

Authors:
Yufeng Chen;Yabo Dong;Dongming Lu;Yunhe Pan;Honglan Lao
Affiliations:
College of Computer Science and Technology, Zhejiang University, Hangzhou, P.R. China;College of Computer Science and Technology, Zhejiang University, Hangzhou, P.R. China;College of Computer Science and Technology, Zhejiang University, Hangzhou, P.R. China;College of Computer Science and Technology, Zhejiang University, Hangzhou, P.R. China;Department of Electrical Engineering, University of Southern California, Los Angeles, CA
Venue:
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Year:
2006

Citing 6
Cited 0

Experimental queueing analysis with long-range dependent packet traffic

IEEE/ACM Transactions on Networking (TON)
Self-Similar Network Traffic and Performance Evaluation

Self-Similar Network Traffic and Performance Evaluation
Inside the Slammer Worm

IEEE Security and Privacy
Simulating realistic network worm traffic for worm warning system design and testing

Proceedings of the 2003 ACM workshop on Rapid malcode
Experiences with worm propagation simulations

Proceedings of the 2003 ACM workshop on Rapid malcode
Worms vs. perimeters: the case for hard-LANs

HOTI '04 Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium

Quantified Score

Hi-index	0.00

Visualization

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.