An anti-worm with balanced tree based spreading strategy

Authors:
Yi-xuan Liu;Xiao-chun Yun;Bai-ling Wang;Hai-bin Sun
Affiliations:
Harbin Institute of Technology;Harbin Institute of Technology;Harbin Institute of Technology;The Chinese University of Hong Kong
Venue:
ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
Year:
2005

Citing 8
Cited 0

Computers and epidemiology

IEEE Spectrum
Code red worm propagation modeling and analysis

Proceedings of the 9th ACM conference on Computer and communications security
An Analysis of the Slapper Worm

IEEE Security and Privacy
Measuring and Modeling Computer Virus Prevalence

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Inside the Slammer Worm

IEEE Security and Privacy
Approaching Zero

IEEE Security and Privacy
The top speed of flash worms

Proceedings of the 2004 ACM workshop on Rapid malcode
WORM vs. WORM: preliminary study of an active counter-attack mechanism

Proceedings of the 2004 ACM workshop on Rapid malcode

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional prevention methods of anti-virus software cannot provide a safe network against malicious worms. In this paper, we research an anti-worm mechanism that actively distributes the anti-worm code to the authorized hosts. We propose a Balanced Tree based Propagation strategy(BTP) for an anti-worm strategy with a mathematic model. By varying the model parameters, the impacts can be studied. Some simulation results show us that the new strategy is effective and feasible.