Securing a Network by Modeling and Containment of Worms Using Preference Scanning
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2013, Vol 2, Issue 10
Abstract
Self-propagating codes, called worms. In this paper, we present an inclination branching process model for characterizing the propagation of Internet worms. Basically user knows the name and the definition of worms, but sometimes due to the validity of the worm containment system, system cannot find the worms. The model is developed for preference scanning worms and then extended to inclination scanning worms. This model leads to the development of an inclination worm containment strategy that prevents the spread of a worm beyond its early stage. Specifically, for preference scanning worms, we are able to provide a precise condition that determines whether the worm spread will eventually stop and obtain the distribution of the total number of hosts that the worm infects. We then extend our results to contain inclination scanning worms. Our strategy is based on limiting the number of scans to dark-address space. Our inclination worm containment schemes effectively contain both uniform scanning worms and local preference scanning worms, and it is validated through simulations and real trace data to be nonintrusive. We also show that our worm strategy, when used with traditional firewalls, can be deployed incrementally to provide worm containment for the local network and benefit the Internet.
Authors and Affiliations
Rohitkumar R. Wagdarikar, Ramkrushna C. Maheshwar, Manik A. Raichurakar
Keywords
Related Articles
- EP ID EP27692
- DOI -
- Views 262
- Downloads 4
A Glance At Malicious Attacks In Web
Web usage is one of the great important to all users in this era. For each and every need internet or web is made use of. Users make use of the area as a medium for searching information, performing business transacti...
An Energy Balanced Routing Method Based On Adaptive Heed for Wireless Sensor Networks
We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximit...
Loss less Data Compression using DCT to Optimize the compression Ratio
This work studies of the problem and demonstrates the viability of the suggested methodology with simulation runs onthe International Symposium on Circuits and Systems (ISCAS) 85 combinational and ISCAS 89 full-scan...
An Optimal and Secure Ranking Search Over out Sourced Cloud Databases
Considering top k multi keywords from the out sourced information files is still an intriguing examination issue in light of the fact that out sourced information over cloud can be scrambled for secrecy .In this pape...
Review on Algorithms and Techniques of Reversible Data Hiding
Nowadays, with the rapid development of information technology more and more images and data are available on the internet..So there is a need to provide some kind of authentication to such important data. With the i...