Location Based Services (LBS) are information services accessible with mobile devices through the mobile network and utilizing the ability to make use of the location of the mobile device. Location-based services offer many opportunities for Business, Social or Informational purpose. Information of users can be misused thereby raising the issues of security both for the personal privacy and national security. Our project deals with the ongoing problems and possible solutions to PRIVACY in LBS which have become a major concern, looking from the end user’s point of view. We proposed an Obfuscation Operators to protect the privacy of users consists in decreasing the accuracy of location information according to their preferences (location obfuscation).The right of individuals to decide how, when, and for which purposes their location information can be released to other parties.

System Requirement Specification:-
DOMAIN : Transactions on Depentable And Secure Computing
SOFTWARE : Operating System: Windows xp, Platform: JAVA, DataBase: MySQL Protocal: UDP
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

               In recent years, a number of commercial peer-to-peer (P2P) systems for live streaming have been introduced. Here we have zattoo website which have the zattoo server. If a peer wants to get live television means first they have to register here, the request will be sent from peer to server, the service will then initiated. Peer division multiplexing technique used to get the nearest neighbor which are utilizing the same channel. IOB used to get the streams from multi peers to destined peer. The median channel join delay remained less than 2-5 s. It remains advantageous than previous bit-torrent and VOD.

System Requirement Specification:-
DOMAIN : Transactions on Networking
SOFTWARE : Operating System: windows xp, Platform: J2EE, Database : MySQL
Application server : Tomcat 5.0, Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

             In this paper we present the recognition of human actions under view changes. here we Deploy an automotive visual surveillance system to detect abnormal behavior patterns and recognize the normal ones. If a person enters a room, video of him is captured and stored(both side view and the top view) then it is given to the training module here the video is checked if it is a normal behavior splited image is taken, whenever the action is recognized blob images are saved, and the frame counts are taken . In case, the anomaly is detected the red color will be displayed. The abnormal behavior is achieved by keep tracking the videos and blob frames and checking each frame values.

System Requirement Specification:-
DOMAIN :Transactions on Pattern Analysis and Machine intelligence,
SOFTWARE : Operating System: windows xp, Platform: JAVA, Database : MySQL
Special Tool : Java Media Framework, Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 As the internet services spread all over the world, many kinds and large number of security threats are increasing. We describe a novel fuzzy class- association- rule mining method based on Genetic Network Programming (GNP) for detecting network intrusions. GNP is a evolutionary optimization technique, which uses directed graph structures instead of stings in genetic algorithm or trees in genetic programming. Alert aggregation is an important subtask of intrusion detection. Our main goal is to identify and to cluster different alerts. Meta-alerts can be generated for the clusters that contain all the relevant information whereas the amount of data (i.e., alerts) can be reduced substantially. Meta-alerts may then be the basis for reporting to security experts or for communication within a distributed intrusion detection system. We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation.

System Requirement Specification:-
DOMAIN : ACM TRANSACTIONS ON NETWORKING
SOFTWARE : Operating System: windows xp, Platform: JAVA
Database : My SQL 4.0, Algorithm: Fuzzy Class-Association -Rule Mining Using GNP
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

                     Cloud computing has been envisioned as the next generation architecture of IT enterprise becoming domain in IT organizations, as an elastic, flexible, and variable-cost way to deploy their service platforms using outsourced resources. In this paper, we deploy a computing cluster on the top of a multicloud infrastructure, for solving loosely coupled Many-Task Computing (MTC) applications. By this way, the cluster nodes can be provisioned with resources from different clouds to improve the cost effectiveness of the deployment, or to implement high availability strategies. We prove the viability of this kind of solutions by evaluating the scalability, performance and cost of different configurations of a single cluster, deployed on a multicloud infrastructure spanning a local data centre and other different cloud sites.

System Requirement Specification:-
DOMAIN : Transactions on Parallel and Distributed Systems
SOFTWARE : Operating System: windows xp, Platform: J2EE
Protocol : TCP, Application server : Tomcat 5.0, Database : MySQL
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB, HDD: 80 GB

            Peer-to-peer (P2P) networks have been emerging as one of the most promising approaches to improve the calability of video-on-demand (VoD) service over Internet. Although a number of architectures and streaming protocols have been proposed in pastyears, there is few work to study the practical performance of P2P-based VoD service especially considering the real user behaviorwhich actually has significant impact on the system scalability. Therefore, in this paper, we first characterize the user behavior byanalyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com.Then, we examine the practical scalability of P2P-based VoD service through extensive trace-driven simulation under a general system framework. The results show that P2P networks scale well in providing VoD service under real user behavior by saving a considerable percentage of server bandwidth. Moreover, it is observed that adopting hard cache at client side achieves much better system scalability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insightful light on the understanding of practical scalability of P2P-based VoDservice and be helpful to future system design and optimization.

System Requirement Specification:-

DOMAIN         : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS         
SOFTWARE     : Operating System: windows xp      Platform: JAVA/J2EE                              HARDWARE     :  Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

              We propose a novel unsupervised learning framework to model activities and interactions in crowded and complicated scenes. Under our framework, hierarchical Bayesian models are used to connect three elements in visual surveillance: low-level visual features, simple atomic activities, and interactions. Atomic activities are modeled as distributions over low-level visual features; andmultiagent interactions are modeled as distributions over atomic activities. These models are learned in an unsupervised way. Given along video sequence, moving pixels are clustered into different atomic activities and short video clips are clustered into different interactions. In this paper, we propose three hierarchical Bayesian models: the Latent Dirichlet Allocation (LDA) mixture model, the Hierarchical Dirichlet Processes (HDP) mixture model, and the Dual Hierarchical Dirichlet Processes (Dual-HDP) model. They advance existing topic models, such as LDA [1] and HDP [2]. Directly using existing LDA and HDP models under our framework, only moving pixels can be blustered into atomic activities. Our models can cluster both moving pixels and video clips into atomic activities and into interactions. The LDA mixture model assumes that it is already known how many different types of atomic activities and interactions occur in the scene. The HDP mixture model automatically decides the number of categories of atomic activities. The Dual-HDP automatically decides the numbers of categories of both atomic activities and interactions. Our data sets are challenging video sequences from crowded traffic scenes and train station scenes with many kinds of activities co-occurring. Without tracking and human labeling effort, our framework completes many challenging visual surveillance tasks of broad interest such as: 1) discovering and providing a summary of typical atomic activities and interactions occurring in the scene, 2) segmenting long video sequences into different interactions, 3) segmenting motions into different activities, 4) detecting abnormality, and 5) supporting high-level queries on activities and interactions. In our work, these surveillance problems are formulated in a transparent, clean, and probabilistic way compared with the ad hoc nature of many existing approaches.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON PATTERN ANALYSYS AND MACHINE INTELLIGENCE     SOFTWARE    :  Operating System: windows xp      Platform: JAVA/J2EE     TOOL: JMF         HARDWARE     : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  The resource sharing nature of Simultaneous Multithreading (SMT) processors and the presence of long latency instructions from concurrent threads make the instruction scheduling window (IW), which is a primary shared component among key pipeline structures in SMT, a performance bottleneck. Due to the tight constraints on its physical size, the IW faces more severe pressure to handle the instructions from various threads while attempting to avoid resource monopolization by some low-ILP threads. It is particularly challenging to optimize the efficiency and fairness in IW utilization to fulfill the affordable performance by SMT under the shadow of long latency instructions. Most of the existing optimization schemes in SMT processors rely on the fetch policy to control the instructions that are allowed to enter the pipeline, while little effort is put to control the long latency instructions that are already located in the IW. In this paper, we propose streamline buffers to handle the long latency instructions that have already entered the pipeline and clo the IW, while the controlling fetch policies take time to react. Each streamline buffer extracts from IW and holds a chain of instructions from a thread that are stalled by dependency on a long latency load. When the load value returns, the streamline buffer then serves these instructions directly to in-order execution, avoiding any instruction replay. This is done in supplement to the conventional IW that serves in parallel the other instructions for out-of-order (o-o-o) execution. Analysis of SPEC2000 integer and FP benchmarks reveals that instructions dependent on long latency loads, typically have their first source operand ready within 5 percent-15 percent of their total wait time in the IW. Our scheme is able to utilize this asymmetry in source operands' ready time to achieve a complexity effective design. As compared to the baseline SMT architecture, our design when working in conjunction with earlier propose- - d ICOUNT.2.8 fetch policy for 4-threads effectively reduces the IW full rate by 9.4 percent (11 percent for 2-thread), improves average IPC for MIXED workloads by 9.6 percent (8 percent for MEM workloads and 4.4 percent for CPU workloads), and fairness by 7.56 percent (7.24 percent for 2-thread). Similar enhancements are observed when run in conjunction with an RR.2.8 fetch policy.

System Requirement Specification:-

DOMAIN     : TRANSACTIONS ON PATTERN ANALYSYS AND MACHINE INTELLIGENCE
SOFTWARE : Operating System: windows xp      Platform: JAVA
HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  Current research trend towards mobile computing emphasizes the need for distribution of data among various clients in wireless environment. Sharing the data in J2ME opens the data to be accessible for all MIDLETs present on the device, hence creating a number of vulnerabilities to the confidential information that is intended to be shared with specific MIDLETs, e.g. a malicious MIDLET can delete, copy or move the Shared Record Store, in J2ME based application. This project aims at overcoming record store sharing problem through the concept of Multi- Agent System by providing a shared storage with explicit access to authenticated & authorized MIDLETs. With this mechanism data can be shared among specific MIDLETs. The implementation uses the SAGE-Lite framework as a solution to our proposed work.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON MOBILE APPLICATION
SOFTWARE : Operating System:windows xp, Platform:JAVA/J2ME, MOBILE AGENT:SAGE_LITE 
HARDWARE  : Processor:  Pentium-IV Speed: 1.8 GHZ  ,   RAM: 512 MB   ,  HDD: 80 GB

                Operating on a frequency band occupying several on-overlapping channels, IEEE 802.11 is now widely used in Wireless Mesh Networks (WMNs). Many multi-channel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlappingchannels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that wean switch between different channels freely. Although simulations show that great improvements on network throughput cane observed in both cases, two fundamental questions remain:(1) Can we really use multiple non-overlapping channels freely in wireless mesh networks? (2)
                  If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attemptto answer these questions. We find that in spite of interferencebetween both overlapping and non-overlapping channels, we canstill use multi-channel in mesh networks under crtain conditions, but with care. We also show that the channel switching costis actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms and those channel assignment algorithms selecting one channel for each packet is not really beneficial.

System Requirement Specification:-

DOMAIN       : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE    : Operating System: windows xp,   Platform: JAVA/J2EE,   Protocal: MAC
HARDWARE   : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  In this paper, we propose a new data broadcast mechanism with network coding in heterogeneous wireless networks. Our mechanism adaptively clusters the mobile costs in fewer cells to minimize the bandwidth consumption. In addition, we adaptively code he data according to the data temporarily stored in each mobile host with a distributed manner. Our mechanism allows each delivered message to be coded from only a subset of data to further reduce the number of required messages. We formulate the cell selection and broadcast coding problem with integer programming and prove that the problem is NP-hard. We design a distributed algorithm based on Lagrange an relaxation. Our algorithm needs no server to record the location, queried, and stored information of receivers. Moreover, our algorithm is adaptive to the dynamic group membership, mobility, queried, and stored
data of receivers.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS MOBILE COMPUTING                                             
SOFTWARE : Operating System: windows xp,  Platform: JAVA, Algorithm: COBOP, DB: MySQL  
HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average ownload time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.

System Requirement Specification:-

DOMAIN        : TRANSACTION ON NETWORKING                                                                SOFTWARE    :OperatingSystem:windowsxp,Platform:JAVA,Method:EPD,RCBS,RPS                     
HARDWARE    : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  Multiparty voice over ip (MVoIP)services allow a group of people to freely communicate with each other via the internet, which have many important applications such as online gaming and teleconferencing. In this paper, we present peer-to-peer MVoIP system called peer Talk. Compared to Traditional approaches such as server-based mixing.peerTalk achieves better scalability and failure resilience by dynamically distributing the stream processing workload among different peers particularly.peerTalk decouples the MvoIP services delivery into two phases: mixing phases and distribution phase. The decoupled model allows us to explore the asymmetric property of MVoIP services (for example distinct speaking/listening activities and unequal inbound/outbound bandwidths) so that the system can better adapt to distinct stream mixing and distribution requirements. To overcome arbitrary peer departures/failures. Peer Talk provides lightweight backup schemes to achieve fast failure recovery. We have implemented a prototype of the peerTalk system and evaluated its performance using both a large simulation testbed and a real intenet environment.Our initial implementation demonstrates the feasiblility of our approach and show promising results.peer Talk can outperform existing approaches such as P2P overlay multicast and coupled distributed processing for providing MvOIP Services.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS                             
SOFTWARE   :Operating System: windows xp, Platform: JAVA,  Tool: JMF, 
PROTOCOL   : VOIP, Sw:  PNS Client
HARDWARE   : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                 The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how the profitability can be increased while maintaining good service qualities as the network scales up. In this work, we seek to understand the fundamental issues on the "interplay" (or interaction) between ISPs at different tiers. Although the local ISPs (which we term peers) can communicate with each other by purchasing the connectivity from transit ISPs, there stands an opportunity for them to set up private peering relationships. Under this competitive framework, we explore the issues on 1) the impact of peering relationship; 2) resource distribution; 3) revenue maximization; and 4) condition for network upgrade. First, a generalized model is presented to characterize the behaviors of peers and the transit ISP, in which their economic interests are reflected. We study how a peer can distributive determine its optimal peering strategy. Furthermore, we show how a transit ISP is able to utilize the available information to infer its optimal pricing strategy, under which a revenue maximization is achieved. Two distributed algorithms are proposed to help ISPs to provide a fair and efficient bandwidth allocation to peers, avoiding a resource monopolization of the market. Last, we investigate the above issues in a "many-peers region," that is, when we scale up the network. We provide insightful evidence to show that the ISPs can still gain profits as they upgrade the network infrastructures. Extensive simulations are carried out to support our theoretical claims.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS                         
SOFTWARE  : Operating System: windows xp, Platform: JAVA,  DB: MySQL                   
HARDWARE   : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                 This paper aims to address of modeling video behavior captured in surveillance video for the applications of online normal behavior recognition and anomaly detection. A novel framework is developed for automatic behavior profiling and online anomaly sampling detection with out any manual labeling of the training data set. The frame work consists of the following key components: 1) A compact and effective behavior representation method is developed based on discrete scene event detection. The similarity between behavior patterns is measured based on modeling each pattern using Dynamic Bayesian Network (DBN). 2) The natural grouping of behavior patterns is discovered through novel spectral clustering algorithm with unsupervised model selection and future selection on the eigenvectors of a normalized affinity matrix. 3) A composite generative behavior model is constructed that is capable of generalizing from a small training set to accommodate variations in unseen normal behavior patterns.4) A runtime accumulative anomaly measure is introduced to detect abnormal behavior, where as normal behavior patterns are recognized when sufficient visual evidence has become available based on online Likelihood Ratio Test(LRT) method. This ensures robust and reliable anomaly detection and normal behavior recognition at the shortest possible time. The effectiveness and robustness of our approach is demonstrated through experiments using noisy and sparse data sets collected from both indoor and outdoor surveillances scenarios. In particular, it is shown that a behavior model trained using unlabeled data set is superior to those trained using same but labeled data set in detecting anomaly from an unseen video. The experiments also suggest that our online LRT-based behavior recognition is advantageous over the commonly used maximum Likelihood (ML) method in differentiating ambiguities among different behavior classes observed on line.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON PATTERN ANALYSYS AND MACHINE INTELLIGENCE          
SOFTWARE     : Operating System: windows xp, Platform: JAVA,  DB: MySQL                       
HARDWARE    : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                 In this paper, we propose a new mechanism to elect the cells and the wireless technologies for layer-encoded video multicasting in the heterogeneous wireless networks. Different from the previous mechanisms, each mobile host in our mechanism can select a different cell with a different wireless technology to subscribe each layer of a video stream, and each cell can deliver only a subset of layers of the video stream to reduce the bandwidth consumption. We formulate the Cell and Technology Selection Problem (CTSP) to multicast each layer of a video stream as an optimization problem. We use Integer Linear Programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on LaGrange an relaxation and a protocol based on the proposed algorithm. Our mechanism requires no change of the current video multicasting mechanisms and the current wireless network infrastructures. Our algorithm is adaptive not only to the change of the subscribers at each layer but also the change of the locations of each mobile host.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON MOBILE COMPUTING                                    
SOFTWARE  :Operating System: windows xp      Platform: JAVA, TooI: JMF 

HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                 Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard. Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit. The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularly large in more challenging scenarios, such as higher access frequency and smaller memory.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON MOBILE COMPUTING                                                  
SOFTWARE : Operating System: windows xp: Platform: JAVA,                                             Algorithm:Distributed Greedy algorithm 
HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

             This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a commonaccess point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP NewReno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender bysetting the TCP receiver' s advertised window limit, and this allows the scheduler to allocate bandwidth fairlybetween the users.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON MOBILE COMPUTING                                         
SOFTWARE  : Operating System: windows xp, Platform: JAVA, Protocal: CLAMP              
HARDWARE   :   Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                The conditional access system (CAS) is an essential part of digital pay-TV systems for controlling access to the program services. Conventionally, due to the restrictions of bandwidth and computational capability, a CAS only supprts period subscription services that are charged on a monthly basis. In this paper, based on the concept of hierarchical key assignment, we propose three key distribution schemes for the access control of pay-TV systems. With these schemes, a CAS can support more charging strategies for service providers, such as adopting a smaller charging unit and allowing a subscription of any subset of channels with little communication and computational overhead. In addition, the piracy management problem can also be dealt with easily.

System Requirement Specification:-

DOMAIN        :TRANSACTIONS ON MULTIMEDIA                               
SOFTWARE   : Operating System: windows xp, Platform: JAVA, Protocol: RTP, TooI: JMF   
HARDWARE  : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

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