A New Friendly Worm Propagation Strategy Based on Diffusing Balance Tree

Wang Bailing; Fang Binxing; Yun Xiaochun; Zhang Hongli; Chen Bo; Liu Yixuan

Journal of Computer Research and Development > 2006 > 43(9): 1593-1602.

Wang Bailing, Fang Binxing, Yun Xiaochun, Zhang Hongli, Chen Bo, Liu Yixuan. A New Friendly Worm Propagation Strategy Based on Diffusing Balance Tree[J]. Journal of Computer Research and Development, 2006, 43(9): 1593-1602.

Citation:

PDF (891 KB)

A New Friendly Worm Propagation Strategy Based on Diffusing Balance Tree

1(Research Center of Computer Network and Information Security Technology, Harbin Institute of Technology, Harbin 150001) 2(Institate of Computing Technology, Chinese Academy of Sciences, Beijing 100080)

More Information

Published Date: September 14, 2006

Graphical Abstract

Abstract

Abstract

Worms is a serious and growing threat to network and the traditional anti-virus technologies don't currently scale to deal with the worm threat. Friendly worm becomes a new active countermeasure. A diffusing balance-tree-based friendly worm propagation strategy is proposed, and the auto-generation rules and survivability enhancements are also given to account for the expansibility and the stability. As a case study, a simulation on worms cross-spreading is given. The results prove that the balance-tree-based propagation strategy is much more effective. Compared with the traditional ones, it accelerates the propagation speed and reduces the traffic impact on network.
- network security,
- friendly worm,
- active countermeasure,
- spreading strategy

FullText(HTML)

References (0)

[1]	Hou Bowen, Guo Hongbin, Shi Leyi. File Covert Transfer Strategy Based on End Hopping and Spreading[J]. Journal of Computer Research and Development, 2020, 57(11): 2283-2293. DOI: 10.7544/issn1000-1239.2020.20200420
[2]	Wang Jian, Zhao Guosheng, Zhao Zhongnan, Li Ke. Formal Modeling and Factor Analysis for Vulnerability Propagation Oriented to SDN[J]. Journal of Computer Research and Development, 2018, 55(10): 2256-2268. DOI: 10.7544/issn1000-1239.2018.20180447
[3]	Yang Hailu, Zhang Jianpei, and Yang Jing. Community-Based Bidirectional Feedback System for Hybrid Worm Containment in Mobile Internet[J]. Journal of Computer Research and Development, 2014, 51(2): 311-324.
[4]	Ge Xin, Zhao Hai, Zhang Jun. Degree Correlation and Its Features of Spreading on Networks[J]. Journal of Computer Research and Development, 2013, 50(4): 741-749.
[5]	Wu Weining, Liu Yang, Guo Maozu, and Liu Xiaoyan. Advances in Active Learning Algorithms Based on Sampling Strategy[J]. Journal of Computer Research and Development, 2012, 49(6): 1162-1173.
[6]	Guo Chi, Wang Lina, Guan Yiping, Zhang Xiaoying. A Network Immunization Strategy Based on Dynamic Preference Scan[J]. Journal of Computer Research and Development, 2012, 49(4): 717-724.
[7]	Chen Feng, Liu Dehui, Zhang Yi, Su Jishu. A Hierarchical Evaluation Approach for Network Security Based on Threat Spread Model[J]. Journal of Computer Research and Development, 2011, 48(6): 945-954.
[8]	Jiao Jian, Yao Shan, Li Xiaojian. Research on Network Bidirectional Topology Discovery Based on Measurer by Spreading[J]. Journal of Computer Research and Development, 2010, 47(5): 903-910.
[9]	Ji Junzhong, Huang Zhen, and Liu Chunnian. An Ant Colony Optimization Algorithm Based on Mutation and Pheromone Diffusion for the Multidimensional Knapsack Problems[J]. Journal of Computer Research and Development, 2009, 46(4): 644-654.
[10]	Zhou Hanxun, Zhao Hong. Modeling and Analysis of Active-Benign Worms and Hybrid-Benign Worms[J]. Journal of Computer Research and Development, 2007, 44(6): 958-964.