DocumentCode
3548080
Title
Metaheuristic algorithms based Flow Anomaly Detector
Author
Jadidi, Zahra ; Muthukkumarasamy, Vallipuram ; Sithirasenan, E.
Author_Institution
Sch. of Inf. & Commun. Technol., Griffith Univ., Gold Coast, QLD, Australia
fYear
2013
fDate
29-31 Aug. 2013
Firstpage
717
Lastpage
722
Abstract
Increasing throughput of modern high-speed networks needs accurate real-time Intrusion Detection System (IDS). A traditional packet-based Network IDS (NIDS) is time-intensive as it inspects all packets. A flow-based anomaly detector addresses scalability issues by monitoring only packet headers. This method is capable of detecting unknown attacks in high speed networks. An Artificial Neural Network (ANN) is employed in this research to detect anomalies in flow-based traffic. Metaheuristic optimization algorithms have the potential to achieve global optimal solution. In this paper, two metaheuristic algorithms, Cuckoo and PSOGSA, are examined to optimize the interconnection weights of a Multi-Layer Perceptron (MLP) neural network. This optimized MLP is evaluated with two different flow-based data sets. We then compare the performance of these algorithms. The results show that Cuckoo and PSOGSA algorithms enable high accuracy in classifying benign and malicious flows. However, the Cuckoo has lower training time.
Keywords
computer network security; multilayer perceptrons; optimisation; Cuckoo; PSOGSA; artificial neural network; flow anomaly detector; flow-based traffic; global optimal solution; high-speed networks; metaheuristic algorithm; metaheuristic optimization algorithm; multilayer perceptron neural network; packet-based network IDS; real-time intrusion detection system; Accuracy; Classification algorithms; Detectors; High-speed networks; Optimization; Reactive power; Training; Flow-based anomaly detection; Metaheuristic algorithm; Multi-layer Perceptron;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (APCC), 2013 19th Asia-Pacific Conference on
Conference_Location
Denpasar
Print_ISBN
978-1-4673-6048-7
Type
conf
DOI
10.1109/APCC.2013.6766043
Filename
6766043
Link To Document