The probability model of peer-to-peer botnet propagation
Version 2 2024-06-03, 22:10Version 2 2024-06-03, 22:10
Version 1 2014-10-28, 09:35Version 1 2014-10-28, 09:35
conference contribution
posted on 2024-06-03, 22:10authored byY Wang, S Wen, W Zhou, Y Xiang
Active Peer-to-Peer worms are great threat to the network security since they can propagate in automated ways and flood the Internet within a very short duration. Modeling a propagation process can help us to devise effective strategies against a worm's spread. This paper presents a study on modeling a worm's propagation probability in a P2P overlay network and proposes an optimized patch strategy for defenders. Firstly, we present a probability matrix model to construct the propagation of P2P worms. Our model involves three indispensible aspects for propagation: infected state, vulnerability distribution and patch strategy. Based on a fully connected graph, our comprehensive model is highly suited for real world cases like Code Red II. Finally, by inspecting the propagation procedure, we propose four basic tactics for defense of P2P botnets. The rationale is exposed by our simulated experiments and the results show these tactics are of effective and have considerable worth in being applied in real-world networks.
History
Pagination
470-480
Location
Melbourne, Victoria
Start date
2011-10-24
End date
2011-10-26
ISSN
0302-9743
ISBN-13
9783642246500
ISBN-10
3642246508
Language
eng
Publication classification
E1 Full written paper - refereed
Copyright notice
2011, Springer-Verlag
Extent
42
Editor/Contributor(s)
Xiang Y, Cuzzocrea A, Hobbs M, Zhou W
Title of proceedings
Algorithms and Architectures for Parallel Processing Conference
Event
Algorithms and Architectures for Parallel Processing. Conference (11th : 2011 : Melbourne, Victoria)