Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their enormously adverse impact on the Internet. Ths, there is great interest in the research community in modeling the spread of worms and in providing adequate defense mechanisms against them. In this paper, we present a (stochastic) branching process model for characterizing the propagation of Internet worms. The model is developed for uniform scanning worms and then extended to preference scanning worms. This model leads to the development of an automatic worm containment strategy that prevents the spread of a worm beyond its early stage. Specifically, for uniform scanning worms, we are able to 1) provide a precise condition that determines whether the worm spread will eventually stop and 2) obtain the distribution of the total number of hosts that the worm infects. We then extend our results to contain preference-scanning worms. Our strategy is based on limiting the number of scans to dark-address space. The limiting value is determined by our analysis. Our automatic 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.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON DEPENDABLE SECURE COMPUTING
SOFTWARE : Operating System: windows xp,   Platform: JAVA,  Protocol: UDP
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

               Security has become one of the major issues for data comunication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

System Requirement Specification:-
DOMAIN    :TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
SOFTWARE :Operating System: Windows XP, Platform: DOTNET, Back End :SQL SERVER 
                 Protocol :UDP
HARDWARE :Processor: Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB,HDD: 80 GB