The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2005)
Monterey, Californi
June 1, 2005 to June 3, 2005
ISSN: 1087-4097
ISBN: 0-7695-2383-8
pp: 262-269
Jun Li , University of Oregon
Geoff Kuenning , Harvey Mudd College
Toby Ehrenkranz , University of Oregon
Peter Reiher , University of California at Los Angeles
<p>Future network intruders will probably use an organized army of malicious nodes (here called "malnodes", or collectively a "malnet") to deliver many different attacks, rather than recruiting a disorganized set of compromised nodes per attack. However, partly due to the lack of understanding of the resiliency and efficiency a malnet can have, countering malnets has been ineffective.</p> <p>This paper begins to address this deficiency. Through calculation and simulation for three representative malnets — random, small-world, and Gnutella-like — we show that extremely resilient malnets can be formed to deliver attack code quickly. In particular, we show that disconnecting malnets is possible, but extremely naive approaches such as randomly disinfecting malnodes will not suffice, and effective defenses must either happen very quickly during a second-wave attack, or take effect prior to it.</p>
Jun Li, Geoff Kuenning, Toby Ehrenkranz, Peter Reiher, "Simulation and Analysis on the Resiliency and Efficiency of Malnets", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 262-269, 2005, doi:10.1109/PADS.2005.29
97 ms
(Ver 3.3 (11022016))