Primary Factor Investigation for Decreasing the Computational Complexity of LAMSTAR DDoS
Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 12)Publication Date: 2017-12-05
Authors : Dhanasekaran R; Balaji P;
Page : 1757-1761
Keywords : Binary Tree Classifier; Gaussian Mixture; Distributed Denial of Service; LAMSTAR; Radial Basis Function;
Abstract
Nowadays the security is very important for our Computer system networks. Here we use Distributed Denial of Services (DDoS) and it act as a second line of defense in a protected network and looking for threats and its data recorded in a computer. We developed LAMSTAR DDoS a neural network used to know methods of normal and intrusive activities, to classify observed system activities and compared the performance of LAMSTAR DDoS with other classification techniques using 5 classes of KDDCup99 data. LAMSTAR DDoS shows performance is better at a rate of high Computational Complexity, Training time and testing time, when compared to other classification techniques (Binary Tree classifier, RBF classifier, and Gaussian Mixture classifier). We reduce the Complexity of LAMSTAR DDoS by defining the dimension of the data using principal component analysis which in turn the training and testing time gets reduced with performance is same.
Other Latest Articles
- Prevalence of IBS among Medical Students in Hail University: A Cross - Sectional Study
- Competencies of Early Childhood Educators in Bangalore According to their Professional Variables
- An Epidemiologic and Microbiologic Profile of Children Aged 0-59 Months Admitted with Suspected Meningitis in VSMMC, Cebu, Philippines
- Enterprising for Rural Transformation in Developing Countries: The Natural Availability Dilemma
- Review on Application of Moving Bed Biofilm Reactor (MBBR) for River Water Purification System
Last modified: 2021-06-30 20:04:56