Securing a Network by Modeling and Containment of Worms Using Preference Scanning

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

Implementation of Grid Based Distributed 3P4W System Using ANFIS Control

The increase in global energy demand and load demand, the Renewable Energy Sources (RES) are increasingly connected in the distribution systems which utilises power electronics Converters/Inverters. This paper sugges...

A Novel Approach for Reducing Routing Overhead In Mobile Ad hoc Network

The Mobile Adhoc Networks(MANET) are the examples of infrastructure less networks and are having frequent occurrence of route discoveries. In MANET, the routing has been performed with the help of neighbouring infor...

Data Security in Cloud Computing using RSA Algorithm

Cloud Computing is an emerging paradigm which has become today’s hottest research area due to its ability to reduce the costs associated with computing. In today’s era, it is most interesting and enticing technology whi...

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...

Design Of A Rceat Architecture For Detecting Multi- Bit Error In RFID

Radio Frequency Identification (RFID) plays an important role in Warehouse Management, especially during the automatic identification of items. Unfortunately, a warehouse environment has electromagnetic interferences...

Download PDF file
  • EP ID EP27692
  • DOI -
  • Views 261
  • Downloads 4

How To Cite

Rohitkumar R. Wagdarikar, Ramkrushna C. Maheshwar, Manik A. Raichurakar (2013). Securing a Network by Modeling and Containment of Worms Using Preference Scanning. International Journal of Research in Computer and Communication Technology, 2(10), -. https://www.europub.co.uk/articles/-A-27692