Signature Analysis of UDP Streams for Intrusion Detection using Data Mining Algorithms
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 7
Abstract
with the increased use of internet for a wide range of activity from simple data search to online commercial transactions, securing the network is extremely important for any organization. Intrusion detection becomes extremely important to secure the network. Conventional techniques for intrusion detection have been successfully deployed, but predictive action can help in protecting the system in the long run. Data mining techniques are being increasingly used to study the data treams and good results have been achieved over time. In this paper we propose to extract unique signatures from UDP data stream, apply existing mining techniques and compare results. We have used the KDD cup 1999 dataset which contains a wide variety of intrusion attacks simulated in a military environment.
Authors and Affiliations
R. Sridevi , DR. K. Lakshmi
Keywords
Related Articles
- EP ID EP91899
- DOI -
- Views 120
- Downloads 0
Global Chaos Synchronization of Four-Scroll and Four-Wing Attractors by Active Nonlinear Control
This paper investigates the global chaos synchronization of identical four-scroll attractors (Liu and Chen, 2004), identical four-wing attractors (Liu, 2009) and non-identical four-scroll and four-wing attractors by acti...
A Comparative Study for Deblured Average Blurred Images
This paper attempts to undertake the study of Restored Average Blurred Images. by using three types of techniques of deblurring image as Wiener filter, Regularized filter and Lucy Richardson deconvlutoin algorithm with a...
Centrality measures with a new index called E-User (Effective User) Index for determiningthe most effective user in Twitter Online Social Network
In this study, we considered the issue of determination of the most effective user in the twitter online social network. We worked on asocial network graph which have relationships (edges) between users who posteda tweet...
Cheapest Paths in Multi-Interface Networks A Distributed Approach
Let G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces , according to activating the common interface rule at each node. Every Interface can b...
Rebroadcasting for Routing Reduction based upon Neighbor coverage in Ad Hoc Networks
Cause of nodes high mobility in mobile ad hoc networks (MANETs), there are frequent link breakages exist which escort to frequent route discoveries and path failures. The route discovery procedure cannot be ignored. In a...