Please use this identifier to cite or link to this item:
Title: Modeling and analysis of self-stopping BT worms using dynamic hit list in P2P networks
Authors: Luo, J
Xiao, B 
Liu, G
Xiao, Q
Zhou, S
Keywords: Invasive software
Peer-to-peer computing
Program diagnostics
Issue Date: 2009
Publisher: IEEE
Source: IEEE International Symposium on Parallel & Distributed Processing, 2009 : IPDPS 2009, 23-29 May 2009, Rome, p. 1-8 How to cite?
Abstract: Worm propagation analysis, including exploring mechanisms of worm propagation and formulating effects of network/worm parameters, has great importance for worm containment and host protection in P2P networks. Previous work only focuses on topological worm propagation where worms search a hosts neighbor-list to find new victims. In BitTorrent (BT) networks, the information from servers or trackers, however, could be fully exploited to design effective worms. In this paper, we propose a new approach for worm propagation in BT-like P2P networks. The worm, called Dynamic Hit-List (DHL) worm, locates new victims and propagates itself by requesting a tracker to build a dynamic hit list, which is a self-stopping BT worm to be stealthy. We construct an analytical model to study the propagation of such a worm: breadth-first propagation and depth-first propagation. The analytical results provide insights of the worm design into choosing parameters that enable the worm to stop itself after compromising a large fraction of vulnerable peers in a P2P network. We finally evaluate the performance of DHL worm through simulations. The simulation results verify the correctness of our model and show the effectiveness of the worm by comparing it with the topological worm.
ISBN: 978-1-4244-3751-1
978-1-4244-3750-4 (E-ISBN)
ISSN: 1530-2075
DOI: 10.1109/IPDPS.2009.5161239
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 29, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.