Downloads: 107 | Views: 252

Review Papers | Computer Science & Engineering | India | Volume 6 Issue 12, December 2017 | Popularity: 6.6 / 10

Rate This Article!      

Primary Factor Investigation for Decreasing the Computational Complexity of LAMSTAR DDoS

Dhanasekaran R, Balaji P

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.

Keywords: Binary Tree Classifier, Gaussian Mixture, Distributed Denial of Service, LAMSTAR, Radial Basis Function

Edition: Volume 6 Issue 12, December 2017

Pages: 1757 - 1761

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles