A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
[chapter]
2011
Handbook of Optimization in Complex Networks
Preserved Fulltext
As people are more likely to open and download content that they receive from friends, this social relationship graph is representative of the most likely propagation path of a mobile worm. ...
This paper proposes a countermechanism to contain the propagation of a mobile worm at the earliest stage by patching an optimal set of selected phones. ...
Although the work by Fleizach et al [11] models the mobile worm propagation, it is only based on US census data and estimated address book degree distribution. ...
doi:10.1007/978-1-4614-0857-4_17
fatcat:twslipoo4vgtpggmadmzwdliiu
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
2009
IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
As people are more likely to open and download content that they receive from friends, this social relationship graph is representative of the most likely propagation path of a mobile worm. ...
This paper proposes a countermechanism to contain the propagation of a mobile worm at the earliest stage by patching an optimal set of selected phones. ...
Although the work by Fleizach et al [11] models the mobile worm propagation, it is only based on US census data and estimated address book degree distribution. ...
doi:10.1109/infcom.2009.5062064
dblp:conf/infocom/ZhuCZRN09
fatcat:wbhkmxgpgrgvvpj6u6cdi2orwq
Epidemic profiles and defense of scale-free networks
2003
Proceedings of the 2003 ACM workshop on Rapid Malcode - WORM'03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the defensibility of large scale-free networks against malicious rapidly self-propagating code such as worms and viruses. ...
Based on these profiles and large-scale network percolation studies, we investigate features of networks that render them more or less defensible against worms. ...
In the extreme case of truly disconnected networks, worms cannot propagate from one partition of the network to another (never mind that many network partitions claimed to be "airgapped" suffered from ...
doi:10.1145/948187.948200
dblp:conf/worm/BriesemeisterLP03
fatcat:iwe72obe55ctpnkuszhamsza7y
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
2008
2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Memory balancing is complicated by (i) the difficulty of estimating the peak memory consumption of a group of nodes during network partitioning-a consequence of per-node peak memory not being synchronized-and ...
Performance evaluation is carried out using benchmark applications with varying traffic characteristics-BGP routing, worm propagation under local and global scanning, and distributed client/server system-on ...
This research was supported in part by grants from DARPA (AFRL F30602-01-2-0539), ETRI, and NSF (EIA-9972883). ...
doi:10.1109/mascot.2008.4770570
fatcat:u4fxpxs6dbg7jj46cidyiicika
Self-stopping worms
2005
Proceedings of the 2005 ACM workshop on Rapid malcode - WORM '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that such "self-stopping" capabilities are trivial to add to existing worms, and can be efficiently implemented without any explicit coordination or additional network traffic. ...
Modern network worms spread with tremendous speed-potentially covering the planet in mere seconds. ...
ASSUMPTIONS AND MODEL For the purposes of this paper, the goal of a self-stopping worm is to stop propagating when the total number of infected hosts has reached a target population. ...
doi:10.1145/1103626.1103630
dblp:conf/worm/MaVS05
fatcat:jp3zqr4dyffp5jwtmp7ywvwjki
Self-Propagate Mal-Packets in Wireless Sensor Networks: Dynamics and Defense Implications
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, based on our proposed mal-packet self-propagation models in wireless sensor networks, we use TOSSIM to study their propagation dynamics. ...
Specifically, based on random graph theory and percolation theory, we propose the immunization of the highly-connected nodes in order to partition the network into as many separate pieces as possible, ...
[9] propose a topologically-aware worm propagation model (TWPM) for WSNs. By incorporating MAC and network layer considerations, TWPM captures both time and space propagation dynamics. ...
doi:10.1109/glocom.2008.ecp.949
dblp:conf/globecom/SunSYX08
fatcat:p5eohkmzxvenhp2qe7eav3nu4i
Modeling and Simulations of TCP MANET Worms
2007
21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Our simulation studies show that under many cases, due to the resource constrained nature of the MANET and its underlying wireless layers, the TCP-based worms rapidly become selfthrottling. ...
We develop analytical models for the spread of TCP worms in the MANET environment that account for payload-size, bandwidth-sharing, radio range, nodal density, packet discards and several other parameters ...
Fu for his help in explaining the results in [5] and for other clarifying discussions. ...
doi:10.1109/pads.2007.25
dblp:conf/pads/AbdelhafezRCP07
fatcat:xcbsdyyjqndw7m4hdpxoam2vbm
The Probability Model of Peer-to-Peer Botnet Propagation
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Firstly, we present a probability matrix model to construct the propagation of P2P worms. ...
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. ...
Theoretical Propagation Model In this section we present a probability propagation model used to estimate the optimized patch strategy.
A. ...
doi:10.1007/978-3-642-24650-0_41
fatcat:pdazzaimozaz3a5yyfveuhh5ba
The monitoring and early detection of Internet worms
2005
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
After many Internet-scale worm incidents in recent years, it is clear that a simple self-propagating worm can quickly spread across the Internet and cause severe damage to our society. ...
Then, based on the idea of "detecting the trend, not the burst" of monitored illegitimate traffic, we present a "trend detection" methodology to detect a worm at its early propagation stage by using Kalman ...
This model captures the basic mechanism of the propagation of a random-scan worm, especially for the initial stage of a worm's propagation when the effect of human counteractions and network congestion ...
doi:10.1109/tnet.2005.857113
fatcat:4savbhtmozcujjtore2lvcmsam
Optimal worm-scanning method using vulnerable-host distributions
2007
International Journal of Security and Networks (IJSN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
An analytical model is developed to relate the infection rate of worms with the importancescanning strategies. ...
Based on parameters chosen from Witty and Code Red worms, the experimental results show that an importance-scanning worm can spread much faster than either a random-scanning worm or a routing worm. ...
ACKNOWLEDGEMENTS The authors would like to thank Colleen Shannon at CAIDA and Shubho Sen at AT&T labs for kind help. The authors also thank CAIDA for making the Witty dataset available. ...
doi:10.1504/ijsn.2007.012826
fatcat:jtsvak2l2zedhgepzoosp5muy4
Monitoring and early warning for internet worms
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The fast spreading nature of worms calls for a worm monitoring and early warning system. ...
Based on epidemic model and observation data from the monitoring system, by using the idea of "detecting the trend, not the rate" of monitored illegitimated scan traffic, we propose to use a Kalman filter ...
ACKNOWLEDGEMENTS This work is supported in part by ARO contract DAAD19-01-1-0610; by DARPA under Contract DOD F30602-00-0554; by NSF under grant EIA-0080119, ANI9980552, ANI-0208116, and by Air Force Research ...
doi:10.1145/948134.948136
fatcat:fw62654m6zebxobcdjuounbete
Monitoring and early warning for internet worms
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The fast spreading nature of worms calls for a worm monitoring and early warning system. ...
Based on epidemic model and observation data from the monitoring system, by using the idea of "detecting the trend, not the rate" of monitored illegitimated scan traffic, we propose to use a Kalman filter ...
ACKNOWLEDGEMENTS This work is supported in part by ARO contract DAAD19-01-1-0610; by DARPA under Contract DOD F30602-00-0554; by NSF under grant EIA-0080119, ANI9980552, ANI-0208116, and by Air Force Research ...
doi:10.1145/948109.948136
dblp:conf/ccs/ZouGGT03
fatcat:6nqtt6pqing5hi7b2x2szvnrnu
Internet Epidemics: Attacks, Detection and Defenses, and Trends
[chapter]
2011
Intrusion Detection Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Hence, we can combine Darknet observations with the worm propagation model and the statistical model to detect the worm appearance (42; 2) and infer the worm characteristics (e.g., the number of infected ...
The AAWP model applies a discrete-time mathematical difference equation to describe the spread of RS and has been extended to model the propagation of other advanced scanning methods. ...
a practical application and results obtained for existing networks as well as results of experiments confirming efficacy of a synergistic analysis of anomaly detection and signature detection, and application ...
doi:10.5772/13811
fatcat:jwadoo3hdnactfz3o7nyjwmfku
Self-propagating mal-packets in wireless sensor networks: Dynamics and defense implications
2009
Ad hoc networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on our proposed mal-packet self-propagation models, we use TOSSIM, a simulator for wireless sensor networks, to study their propagation dynamics. ...
Our goal is to partition the network into as many separate pieces as possible, thus preventing or slowing down the mal-packet propagation. ...
[26] proposed a graph-partitioning approach to contain the propagation of a mobile worm in the context of cellular networks. ...
doi:10.1016/j.adhoc.2009.04.003
fatcat:w7gofneofvdxjbrwm4nxqoeg7u
Experiments on Light Vertex Matching Algorithm for Multilevel Partitioning of Network Topology
2012
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using the partition result in experiments of worm propagation simulation system shows good performance too. . ...
experiments were done to verify the efficiency of Light Vertex matching algorithm for multilevel partitioning network topologies. ...
Experimental environment and load estimation method Partitioning network simulation task is actually partitioning the network topology. ...
doi:10.1016/j.proeng.2012.01.378
fatcat:7vkyz4iav5ek7eumqk5iks2mqu
« Previous
Showing results 1 — 15 out of 2,636 results