Published Online October 2019 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis.2019.10.01
An Efficiency Optimization for Network
Intrusion Detection System
Mahmoud M. Sakr, Medhat A. Tawfeeq, Ashraf B. El-Sisi
Computer Science Department, Faculty of Computers and Information, Menoufia University, Egypt E-mail: mahmoudsakr@ci.menofia.edu.eg, medhattaw@yahoo.com, ashraf.elsisi@ci.menofia.edu.eg
Received: 28 August 2019; Accepted: 17 September 2019; Published: 08 October 2019
Abstract—With the enormous rise in the usage of monitors and inspects the network activities at the computer networks, the necessity for safeguarding these network level to detect the intrusive patterns of network networks is also increased. Network intrusion detection traffic flow and Distributed based IDS (DIDS) that systems (NIDS) are designed to monitor and inspect the incorporates many HIDS, NIDS or a hybrid of them activities in a network. NIDS mainly depends on the where they're deployed over a large network for features of the input network data as these features give collaboratively observing and checking its activities [3]. information on the behaviour nature of the network traffic. The detection strategies of the IDS are divided into three The irrelevant and redundant network features negatively types: Anomaly-based IDS in which it recognizes the affect the efficacy and quality of NIDS, particularly its intrusions based on any deviation from an acceptable or classification accuracy, detection time and processing normal behaviour, Signature-based IDS in which it complexity. In this paper, several feature selection identifies the intrusions based on known attacks patterns techniques are applied to optimize the efficiency of NIDS. and Hybrid-based IDS in which it incorporates the The categories of the applied feature selection techniques anomaly and signature-based IDS to supply an inclusive are the filter, wrapper and hybrid. Support vector detection ability [4]. NIDS deals with tremendous sizes of machine (SVM) is employed as the detection model to network traffic data, and employees data mining and classify the network connections behaviour into normal machine learning techniques to analyze and classify the and abnormal traffic. NIDS is trained and tested on the behaviour of these data. Network traffic data are benchmark NSL-KDD dataset. The performance of the represented by numbers of connection records which applied feature selection techniques is compared with consist of sets of network features such as the protocol each other and the results are discussed. Evaluation type, service and flags. One of the challenges that are results demonstrated the superiority of the wrapper negatively affecting the learning algorithm efficiency techniques in providing the highest classification during the learning process from the network traffic data accuracy with the lowest detection time and false alarms is the existence of irrelevant and noisy features. Such of the NIDS. these features increase the training time, overfitting, false alarms generation rates, and computation costs. Index Terms—Intrusion Detection System, Network Eliminating such these features are carried by the feature Anomaly Detection, Features Selection, Dimensionality selection process. Network feature selection is performed Reduction, NSL-KDD, Swarm Intelligence. by selecting the most informative features from the network traffic data which are sufficient for better
identification of network traffic behaviour with higher accuracy and in lesser time [5]. The limitation of the I. INTRODUCTION
network feature selection process is removing some
With the rapid progress of the communication industry,
important network features during the reduction process
the technologies utilization has turned into an essential
and therefore losing some of the network data properties.
part of the daily life and the connected devices to the
In this paper, several network feature selection techniques
internet are in continuously raise [1]. Consequently, are applied to study which of them can optimise the unauthorized activities targeting systems of these NIDS classification performance. NSL-KDD dataset is connected devices raised too. Any tries aim to violate the
utilized as the network data source while the SVM
confidentiality, integrity, and availability (CIA) of a
algorithm is adopted for the network traffic classification
system denoted as an intrusion. Intrusion detection
[6]. The rest of this paper is organized as follows. Several
system (IDS) is meant by observing and auditing the literatures related to this study are highlighted in section occurring activities patterns in computer network [2]. II. Section III explains the applied network feature Based on the placement/deployment of the IDS, it divided
selection techniques in detail. Implementation and
into three categories: Host-based IDS (HIDS) which
experimental results are discussed in section IV. Section
observes and audits the host events to detect intrusions
V concludes this paper and presents future directions.
inside the host itself, Network-based IDS (NIDS) which
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
2 An Efficiency Optimization for Network Intrusion Detection System
II. RELATED WORKS
Generally, as shown in Fig. 1, the constructing of the NIDS is performed as follow. The network traffic data is captured and logged from the network devices. These data are mapped and normalized before being processed as it includes many features with varied types and different value ranges. Thereafter, the most informative network features of these data are selected, and a suitable learning algorithm learns its behaviour. Accordingly, building an efficient intrusion detection model that can perfectly recognize the behaviour of the input network traffic. Several criterions are used to evaluate the NIDS performance.
Fig.1. Development Processes Schematic of the Network Intrusion
Detection System (NIDS)
Researchers usually incorporate the methodologies of feature selection with the machines leaning techniques in building the NIDS to achieve an effective classification performance as follows.
In [7], M. Sakr, M.Tawfeeq and A. ElSisy proposed an efficient anomaly based NIDS for the cloud environment. They utilized the particle swarm optimization (PSO) with its two versions (standard and binary based PSO) to enhance the SVM classification model. Standard-based PSO is employed for the SVM control parameters tuning. Binary-based PSO is utilized to obtain mostly informative features from the incoming network traffic before the classification procedure. Performance results proved the NIDS effectiveness in perceiving the nature of incoming network traffic. In [8], Hajimirzaei and Jafari used the fuzzy clustering technique to divide the NSL-KDD intrusion dataset into several subsets to train the multilayer perceptron network (MLP) as the classification model of the proposed NIDS. During the model training phase, the artificial bee colony (ABC) technique employed to optimise the MLP classification model by tunning its weights and biases. They assessed their NIDS performance and the results demonstrated its efficiency in comparison with other related NIDSs. In [9], Khorram and Baykan implemented several evolutionary techniques (Ant Colony Optimization (ACO), ABC and PSO) for the network feature selection of the incoming network traffic for the proposed NIDS. The classification model of NIDS built by the KNN and SVM and tested by the NSL-KDD intrusion dataset. Evaluation results stated that the performance of the ABC technique was superior in providing the highest classification accuracy for their NIDS. In [10], Jabez and Gowri proposed NIDS to detect intrusions in a given network. The procedure of the relevant feature selection of input network traffic is
carried out by the correlation feature selection (CFS) technique. MLP based neural network is employed to train the NIDS classification model and its performance is evaluated on the NSL-KDD dataset. Several varied sizes of the used dataset are utilized to evaluate their NIDS with other machine learning algorithms. Evaluation results stated that their NIDS provided the best performance in terms of the highest attack detection rate with the least execution time. In [11], Aslahi and Rahmani integrated the genetic algorithm (GA) with the SVM algorithm to proposed NIDS for attack detection. NIDS employed GA to perform the feature selection procedure from the network traffic. GA succeed to select the most informative network features as it reduced the entire network traffic features from 45 to 10. Their results assured the necessary of the feature selection process in achieving better classification performance in terms of a high true positive and low false positive. In [12], Anwer and Farouk provided a framework of various filter and wrapper methodologies to optimise the NIDS. Their framework objective is the selection of the minimum features of network traffic which provided the highest classification accuracy. J48 and Naïve Bayes techniques are employed to build the classification model of NIDS. UNSW-NB15 intrusion dataset is utilized to assess each classifier performance under various feature selection strategies of the framework. Results stated that using J48 as a classifier with the filter-based gain ratio (GR) technique achieved the best performance. In [13], Dash and Chakravarty developed NIDS which can recognize both the normal and intrusive network connections. They faced the problem of high curse of dimensionality and solved it by adopting the principal component analysis (PCA) for selecting the most significant features of the input network traffic. They apply two different techniques of ANN, the MLP and the radial basis function (RBF) in the classification process. NSL-KDD dataset adopted to assess the used NIDS. Evaluation results proved that the optimal network feature subset obtained by PCA achieved a lower rate of false alarms and higher classification accuracy than using the whole network features. III. NETWORK FEATURE SELECTION METHODOLOGIES This study aims to employ the strategies of the feature selection in building the NIDS and measures their impact on the intrusion detection process. Network features selection denoted by choosing the most informative features from the incoming network traffic which are sufficient to represent the nature of this traffic efficiently. As a result, leading the NIDS to achieve the best performance to classify this traffic behaviour [14]. Network feature selection process is shown in Fig. 2, where its stopping criteria are determined based on either the fitness function of the feature selection technique such as the classification accuracy, intrusion detection time or intrusion detection error rate, which evaluates the fitness/goodness of each possible features subset from all the network features, or on the generations number of the
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
An Efficiency Optimization for Network Intrusion Detection System 3
features subsets of the network feature space.Three strategies of the feature selection process are implemented in this study: the filter, wrapper and hybrid and each is discussed below.
used classification model 15]. They are randomized population based searching methodologies. Their populations include many possible solutions (individuals) encoded as a binary vector in which if the feature bit is set to 1 is to be selected and to 0 is to be eliminated from the output subset. The classification accuracy of the SVM technique is adopted as the fitness function which evaluates each possible solution during the searching phase. Three popular wrapper approaches are implemented in this paper as follows. 1. Genetic algorithm (GA)
The motivation of the GA was on the basis of the natural selection concept of Darwin’s evolution theory ―survival of the fittest‖ [19]. In the searching space of GA, its population composed of the number of chromosomes which are randomly initialized. Each chromosome represents a possible network feature subset. Using genetic operators like selection, crossover and mutation in generating the chromosomes for optimizing the results. All chromosomes in each generation will compete with each other and only the most successful ones are allowed to produce their offspring. Table 1. describes the pseudocode of the GA algorithm.
Table 1. The Pseudocode of GA Algorithm
Algorithm 1: Genetic Algorithm (GA) Input: Training dataset (Binary encoded based network connection instances), N= number of individuals/chromosomes, M= number of generations/iterations, and D= chromosome dimensionality. Output: Subset of the most informative network features (1) Randomly initialize the binary population (2) (3) While ((t <= M) and (chromosome fitness value < 100)) do (4) Calculate the fitness_value of the population individuals (5) Memorize the best solution so far (6) Selection of the best-fit chromosomes (Parents) (7) Perform the cross over between these selected parents (8) Perform the mutation of the obtained offspring (9) (10) End While
Fig.2. Network Feature Selection Process
A. Filter Methodologies
Filter approaches don’t use any learning algorithm to discard the needless features from the entire feature set. They asses the relevance of features by looking at the intrinsic data characteristics and its primary properties on the basis of particular statistical criterion determined by the used filter approach like distance measure, correlation measures, and consistency measures [15]. In this work, three popular filter approaches are used as follow. 1. Information gain (IG)
IG measures the merit of a feature/attribute by computing its entropy value with respect to the class. Entropy is an information theory concept that measures the uncertainty of network data. According to this value, IG selects the most relevant features from the network data [16].
2. Principal Component Analysis (PCA)
PCA identifies patterns of the data and expressing them to highlight their similarity and variations. The main advantage of the PCA is reducing the network traffic dimensionality without much loss of its information by calculating the principal component variances of the network features and discard the lesser variance [17]. 3. Correlation Feature Selection (CFS)
CFS evaluates the merit of network feature subset depending on two concepts: the feature-classification correlation, and the feature-feature correlation. CFS determines the relevant feature subset which contains the highly correlated features with the class, yet uncorrelated with each other [18]. B. Wrapper Methodologies
Wrapper approaches mainly depend on a classification algorithm to select the subset with the most relevant features on the basis of specific evaluation criteria of the
2. Artificial Bee Colony (ABC)
The Motivation of ABC was based on the nature bees demeanour during locating their food and their measuring mechanisms of its profitability like the nectar amount and its distance from the colony [9]. ABC contains three bees types: worker, onlookers and scout. Scout bees randomly carry out searching processes to locate new food sources. Employee bees explore these food locations and store information about its quality to share it with the onlooker bees which are waiting in the dance region for receiving such information about the located food positions. Then they make a suitable decision for selecting the highest quality food position. In the ABC searching space, its population composed of the number of food locations which are randomly found by the scout bees. Each food location represents a candidate network feature set. The pseudocode of the ABC algorithm is described in Table 2.
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
4 An Efficiency Optimization for Network Intrusion Detection System
Table 3. The Pseudocode of PSO Algorithm
Table 2. The ABC Algorithm Pseudocode
Algorithm 2: Artificial Bee Colony (ABC) Input: Training dataset (Binary encoded based network connection instances), N= number of food sources/employed bees, M= number of generations/iterations, D= Food source dimensionality, and Limit= Maximum limit value for a food source. Output: Subset of the most informative network features (1) Randomly initialize the binary population (2) Calculate the fitness value for the food sources (3) (4) While ((t <= M) and (food source fitness value < 100)) do (5) For each employee bee i do (6) Produce a new food source Vi in the neighborhood by ( ) (1) where is the current employee bee food source, is a random value within [-1: +1] and is a random food source from the population (7) Calculate food source fitness value 𝑓it𝑖 (8) Apply the greedy selection process between them (9) End For (10) Calculate the probability values 𝑝𝑖 of the population by pi ∑ (2) (11) Select the best food source by the onlooker bees based on the maximum 𝑝𝑖 over the population (12) Produce new food source in its neighborhood by equation 1 (13) Calculate its fitness value 𝑓it𝑖 (14) Apply the greedy selection process between them (15) Memorize the best solution so far (16) If there are abandoned food sources in population (17) replace it with a random food source by scout bees (18) (19) End While Algorithm 3: Particle Swarm Optimization (PSO) Input: Training dataset (Binary encoded based network connection instances), N= number of particles, M= number of iterations, D=particle dimensionality, c1=Cognitive learning factor, c2=Social learning factor, r1 & r2= Random value [0-1] and w=Inertial coefficient. Output: Subset of the most informative network features (1) For particle i=0 to N do (2) Randomly initialize the binary position Xid (3) Randomly initialize velocity Vid (4) End For (5) (6) While ((t <= M) and (particle fitness value < 100)) do (7) For each particle i do (8) Calculate particle fitness value (9) If its fitness value > Pbestid (10) Set Pbestid = fitness value (11) End If (12) End For (13) Set Gbest = the best ever fitness value (14) For particle i=0 to N do (15) For feature d=0 to D do (16) ( – ) ( – ) (3) (17) 𝑖 𝑖 ( ) ( 𝑝 (– )) (4) )( (18) 𝑖𝑓 𝑖 𝑖 𝑓 [ ] (19) End For (20) End For (21) (22) End While IV. IMPLEMENTATION AND EXPERIMENTAL RESULTS A. Dataset Description
NSL-KDD is the used dataset for carrying out this experiment as it considered the most benchmark intrusion dataset utilized for assessing the anomaly-based NIDS [20]. Network connection instances of this dataset combined 41 attributes/features which are shown in Table 4. Each network connection record was labelled as normal or attack. The training set connection instances included 22 types of intrusions while the testing set instances combined extra varied 16 intrusions types. All these types of attacks fall under four classes as follows.
1. Denial of Service (DOS): Intruders attempt to exhaust the resources of the target network due to render its services unreachable by its legitimate users. This attack targets the availability.
2. Probe: Intruders try to scan the victim network and to collect details about its systems to carry out attacks on its services. This attack targets the confidentiality.
3. Particle Swarm Optimization (PSO)
The Motivation of PSO was based on the flying birds swarm demeanour during exchanging their knowledge for locating their food where they follow the nearest particle to the food [7]. PSO population composed of many particles that are flying around in its feature space where each particle considered a candidate network feature space. PSO algorithm pseudocode is described in Table 3. C. Hybrid Methodologies
The hybrid approaches combine both the filter and wrapper approaches in the process of feature selection to incorporate their advantages in one approach. The first approach is used to reduce the features space dimensionality by eliminating the irrelevant and noisy features, while the other approach is to find the most informative features from the retained subset of the first approach [15]. The hybrid approach can be applied as two scenarios in the feature selection phase. Either applying the filter approach before the wrapper approach or the vice versa.
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
An Efficiency Optimization for Network Intrusion Detection System 5
3. Remote to Local (R2L): Intruders attempt to get local access to a remote system by sending it packets in a trial of exploiting the target system vulnerabilities. This attack targets the integrity.
4. User to Root (U2R): Intruders attempt to gain the root privileges of the target system by accessing an authentic user account of this system then exploiting its vulnerabilities. This attack targets the integrity.
Table 4. NSL-KDD Network Intrusion Dataset Attributes No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Feature Name Duration Protocol_type Service Flag Src_bytes Dst_bytes Land Wrong_fragment Urgent Hot Num_failed_logins Logged_in Num_compromised Root_shell Su_attempted Num_root Num_file_creations Num_shells Num_access_files Num_outband_cmds İs_hot_login Is_guest_login Count Srv_count Serror_rate Feature Description Connection duration in seconds Type of the protocol used, e.g. TCP and UDP Network service on the destination, e.g. HTTP or telnet Normal or error flag status of the connection Number of data bytes from source to destination Number of data bytes from destination to source 1 if the connection is from/ to the same host/port; 0 otherwise Number of ―wrong‖ fragments Number of urgent packets Number of ―hot‖ indicators in the content such as: entering a system directory Number of failed login attempts 1 if successfully logged in; 0 otherwise Number of ―compromised‖ conditions 1 if the root shell is obtained ; 0 otherwise 1 if ―su root‖ command attempted; 0 otherwise Number of ―root‖ accesses Number of file creation operations Number of logins of normal users Number of operations on access control files Number of outbound commands in FTP session 1 if the login belongs to the ―hot‖ list i.e., root or admin; 0 otherwise 1 if the login is a ―guest‖ login; 0 otherwise Number of connections to the same destination host in the past 2 seconds Sum of connections to the same service in the past 2 seconds % of connections that have ―SYN‖ errors among the connections aggregated in count (23) % of connections that have ―SYN‖ errors among the connections aggregated in srv_count (24) % of connections that have ―REJ‖ errors among the connections aggregated in 28 29 30 31 32 Srv_rerror_rate Same_srv_rate Diff_srv_rate Srv_diff_host_rate Dst_host_count count (23) % of connections that have ―REJ‖ errors among the connections aggregated in srv_count (24) % of connections to the same service % of connections to different services % of connections to different hosts Sum of connections to the same destination IP address Sum of connections to the same 33 Dst_host_srv_count destination port number % of connections that were to the same service, among the 34 Dst_host_same_srv_rate connections aggregated in dst_host_count % of connections that were to different services, among the 35 Dst_host_diff_srv_rate connections aggregated in dst_host_count % of connections that were to the same source port, among the 36 Dst_host_same_src_port_rate connections aggregated in dst_host_srv_count % of connections that were to different destination machines, 37 Dst_host_srv_diff_host_rate among the connections aggregated in dst_host_srv_count % of connections that have activated the flag s0, s1, s2 or s3, 38 Dst_host_serror_rate among the connections aggregated in dst_host_count % of connections that have 39 Dst_host_srv_serror_rate activated the flag s0, s1, s2 or s3, among the connections aggregated in dst_host_srv_count % of connections that have activated the flag REJ, among the 40 Dst_host_rerror_rate connections aggregated in dst_host_count % of connections that have activated the flag REJ, among the 41 Dst_host_srv_rerror_rate connections aggregated in dst_host_srv_count 42 Class label Connection behaviour label B. Experimental setup
Experiments are performed on a machine with CPU: Intel Core i7, Memory: 4 GB and OS: Microsoft Windows 10. The SVM classification model and the wrapper-based network feature selection techniques (PSO, GA and ABC) are implemented in Python language. Their number of individuals and generations were 30 and 40, respectively. The filter-based network feature selection techniques (IG, PCA and CFS) are applied by the WEKA data mining tool with their default values [34]. NSL-KDD dataset is used as the network traffic data source, 20% is selected for training the SVM detection model, while other 80% is used as the testing set for evaluating the detection model performance under the influence of applying the (wrapper, filter and hybrid) feature selection techniques. Network traffic connections behaviour is classified into normal or attack.
26 Srv_serror_rate 27 Rerror_rate Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
6 An Efficiency Optimization for Network Intrusion Detection System
C. Performance Evaluation Metrics
The study of the NIDS performance under the influence of the aforementioned feature selection techniques is performed on many varied evaluation metrics which are computed on the basis of the following measures [7].
True Positive (TP) denoted by the positive/anomalous instances number which is correctly classified as attacks. True Negative (TN) denoted by the negative/benign instances number which is correctly classified as normal. False Positive (FP) denoted by the negative/benign instances number which is wrongly classified as an attack. False Negative (FN) denoted by the positive/anomalous instances number that is wrongly classified as normal. The used evaluation metrics are:
(5)
(6)
(7)
(8)
5. (9)
(10)
(11)
- (12)
∑
𝑖 ,
Where n= number of network connection instances (13)
D. Results and Discussion
To evaluate the proposed work, three experiments are conducted to survey the influence of the aforementioned features selection approaches to optimise the SVM classification model performance and boost its efficiency. For the first experiment, three popular wrapper techniques GA, ABC and PSO are employed in the features selection phase. Their objective was finding the key features from the input network traffic which can sufficiently represent the behaviour of that traffic for the NIDS detection model. The selected network features numbers by the three wrapper techniques GA, ABC and PSO were 30, 22 and 23, respectively as shown in table 5 whereas their impact results on the used detection model are shown in table 6. As the ABC is a faster convergence and has an exploration and exploitation ability than both of GA and PSO. Therefore, its network feature subset achieved higher classification accuracy and lower FPR
and FNR for the detection model than them. Moreover, ABC scored the least time for recognizing the nature of network connections with the least value of mean absolute error which reflected the strength of ABC impact on reinforcing the efficiency of intrusion detection process. Although GA came next to ABC and outperformed PSO in achieving more slighter classification accuracy and attack detection rate. However, the PSO, as expected, scored lower attack detection time than GA because of the lower selected features number in favour of PSO.
For the second experiment, three common filter techniques CFS, IG and PCA are applied to determine the most relevant feature subset which is properly enough for the identification of the network traffic nature. As shown in table 5, the network features numbers obtained by the CFS, IG and PCA are 18, 20 and 20, respectively while their influence results on the used detection model are shown in table 6. As the PCA works on removing the correlated features of network traffic which don't contribute in the classification process. In addition, it retains most of the traffic behaviour information during the dimensionality reduction of network traffic. Therefore, it provided better performance than CFS and IG as it achieved higher classification accuracy, attack detection rate and F-measure. Furthermore, it gave lower detection time than them. CFS is the second best after the PCA and surpassed IG in achieving higher classification accuracy with lower detection time, FPR and FNR. Moreover, CFS scored better precision than them.
For the third experiment, the hybrid approach is performed as two scenarios: (wrapper-filter) and (filter-wrapper). The first scenario denoted by applying a wrapper approach in selecting the most informative network features then refining the retained feature subset with a filter approach while the second scenario is the vice versa. Their obtained feature subsets are shown in table 5 and their evaluation results are shown in table 6. For the (wrapper-filter) scenario, nine hybrid approaches are applied in the most optimal network feature selection. GA-PCA outperformed these approaches through 22 network features as it yielded the highest classification accuracy, precision rate, recall rate and TPR. However, PSO-PCA scored the lowest detection time than them. On the other hand, the second hybrid approach scenario (filter-wrapper) is applied by different nine hybrid approaches. CFS-ABC was the best of them by only 10 network features as it achieved the highest classification accuracy, TPR, TNR, attack detection rate and precision. In addition, it also scored the lowest FPR, FNR, mean absolute error and detection time.
As a summary of the three experimental results analysis, it can be inferred the followings. Firstly, the whole network features of the network traffic didn’t contribute equally to the classification process, as some could contribute much, some could contribute less, and some could not contribute at all. Secondly, the success of any network feature selection technique depends on how much it reduced the network features dimensionality (selecting the most informative features from the whole
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
An Efficiency Optimization for Network Intrusion Detection System 7
network features) in parallel with how the classification performance is optimized as a result of that reduction/selection process. Table 5 details the number of most discriminating network features that are selected by each selection technique, while the performance of the NIDS classification model after applying each selection technique is shown in table 6. As the best network feature selection technique is the one who much reduced the irrelative network features number in parallel with yielding the better classification performance. Therefore, the applied wrapper approaches particularly the ABC clearly outstood all other filter and hybrid approaches in selecting the most optimal network features for the classification model of NIDS. Thirdly, only two-hybrid approaches (GA-PCA) and (CFS-ABC) are yielded remarkable classification results more than all filter approaches. However, the performance of other hybrid approaches was not totally efficient. Therefore, the hybrid feature selection approach must be precisely selected after many implementation trials for studying the effectiveness of the possible combinations of the wrapper and filter techniques.
Table 5. Summary of the Selected Network Features Obtained by Applying the Network Feature Selection Techniques
Hybrid Approaches (Wrapper-Filter) Feature No. ABC-PCA PSO-PCA ABC-CFS PSO-CFS CFS-PSO GA-PCA GA-CFS ABC-IG PSO-IG Wrapper Approaches ABC PSO Filter Approaches PCA CFS Hybrid Approaches (Filter-Wrapper) PCA-ABC * * * * * * * * * * * * * 13 CFS-ABC PCA-PSO * * * * * * * * * * * * 12 PCA-GA * * * * * * * * * * * * * * 14 CFS-GA IG-ABC * * * * * * * * * * 10 IG-PSO * * * * * * * * * * * 11 GA-IG GA 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 30 * * * * * * * * * * * * * * * * * * * * * * 22 * * * * * * * * * * * * * * * * * * 18 IG * * * * * * * * * * * * * * * * * * * * 20 * * * * * * * * * * * * * * * * * * * * 20 * * * * * * * * * 9 * * * * * * * * * * * * * 13 * * * * * * * * * * * * * 13 * * * * * * * * * 9 * * * * * * * * * * * * * * * * * * * * * * 22 * * * * * * * * * * * * * * * * * * * * * * 22 * * * * * * * * * 9 * * * * * * * * * * * * 12 * * * * * * * * * * * * 12 * * * * * * * * * * * 11 * * * * * * * * * * * * * 13 * * * * * * * * * * 10 Total 23 Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
IG-GA * * * * * * * * * * * * * * * 15 8 An Efficiency Optimization for Network Intrusion Detection System
Table 6. NIDS Classification Performance After Applying the Network Feature Selection Techniques
NIDS Performance Evaluation Metrics F-Measure (%) Accuracy (%) Network Feature Selection Technique No. of Selected Features Mean Absolute Error Training Time (sec) Detection Time (sec) FPR FNR TPR TNR Precision (%) ADR (%) PSO Wrapper GA ABC CFS Filter IG PCA PSO-CFS PSO-IG Hybrid (Wrapper-Filter) PSO-PCA GA-CFS GA-IG GA-PCA ABC-CFS ABC-IG ABC-PCA CFS-PSO CFS-GA Hybrid (Filter-Wrapper) CFS-ABC IG-PSO IG-GA IG-ABC PCA-PSO PCA-GA PCA-ABC 23 30 22 18 20 20 9 13 13 9 22 22 9 12 12 11 13 10 11 15 10 12 14 13 97.75 97.87 98.04 95.76 92. 96.20 90.59 90.31 95.93 92.16 94.19 97.67 86.68 73.36 94.65 95.92 95.87 96.12 81.39 90.91 91.23 92.91 95.34 94.9 0.014 0.015 0.014 0.015 0.068 0.020 0.072 0.072 0.014 0.051 0.029 0.020 0.068 0.221 0.014 0.015 0.015 0.014 0.047 0.084 0.086 0.035 0.026 0.022 0.030 0.027 0.024 0.071 0.078 0.056 0.117 0.123 0.069 0.106 0.088 0.025 0.202 0.314 0.095 0.068 0.069 0.0 0.335 0.097 0.088 0.108 0.068 0.082 0.969 0.972 0.975 0.928 0.921 0.943 0.882 0.876 0.930 0.3 0.911 0.974 0.797 0.685 0.904 0.931 0.930 0.935 0.6 0.902 0.911 0.1 0.931 0.917 0.985 0.984 0.985 0.984 0.931 0.979 0.927 0.927 0.985 0.948 0.970 0.979 0.931 0.778 0.985 0.984 0.984 0.985 0.952 0.915 0.913 0.9 0.973 0.977
98.37 98.29 98.37 98.23 92. 97.73 91.84 91.82 98.38 94.09 96.61 97.75 91.51 74.16 98.28 98.27 98.24 98.32 92.86 90.79 90.68 95.88 97.01 97.45 96.94 97.27 97.55 92.87 92.14 94.30 88.29 87.68 93.08 .31 91.12 97.40 79.71 68. 90.46 93.16 93.08 93. 66.44 90.28 91.14 .11 93.18 91.79 97.65 97.78 97.96 95.48 92.34 95.98 90.03 .70 95.65 91. 93.79 97.58 85.21 71.24 94.21 95.65 95.59 95.87 77.46 90.53 90.91 92.37 95.06 94. 0.022 0.021 0.019 0.042 0.073 0.037 0.094 0.096 0.040 0.078 0.058 0.023 0.133 0.266 0.053 0.040 0.041 0.038 0.186 0.090 0.087 0.070 0.046 0.051 5.34 6.11 5.16 7.63 13.35 5.85 9.49 12.38 4.88 8.41 10.99 5.47 17.29 44.23 6.69 5.90 5.63 5.06 31.11 12.53 9.90 7.85 5.56 5.97 11.85 13.91 10.18 15.09 20.40 13.31 19.67 25.76 10.41 17.23 19.08 12.30 27.42 70.66 13.34 12.19 12.31 11.31 43. 23.05 18 15.29 12.38 12.10 Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
An Efficiency Optimization for Network Intrusion Detection System 9
Table 7. NIDS Performance Evaluation with and without Applying the Feature Selection Process
NIDS Performance Evaluation Metrics Accuracy (%) Input Network Features No. of Selected Features F-Measure (%) Precision ADR (%) (%) Mean Absolute Error Training Time (sec) Detection Time (sec) FPR FNR TPR TNR All Network Features Selected Network features by ABC 41 97.44 0.015 0.036 0.963 0.984 98.31 96.35 97.32 0.025 12.69 26.8 22 98.04 0.014 0.024 0.975 0.985 98.37 97.55 97.96 0.019 5.16 10.18 Table 8. Performance Comparison between the Proposed ABC-NIDS and other related NIDSs
Network Intrusion Detection Systems Metrics Proposed [21] Discrete Differential Evolution [22] [23] Symmetrical Uncertainty [24] Linear Discriminant Analysis [25] Deep Belief Network [26] [27] [28] Correlation-Based [29] [30] HG+GA [31] [32] [33] Network Features Selection Technique Selected Features Number Accuracy (%) TPR (%) TNR (%) FPR (%) ADR (%) F-Measure ABC Gain Ratio ABC Fisher Score IG IG Chi-Square PSO 22 98.04 97.5 98.5 1.4 97.55 97.96 16 88.73 99.07 0.93 - - 35 32 4 83.24 - - 4.83 - - 5 90.4 - - - 95.3 91.8 7 97.1 - - 4.5 93.9 - 19 93.95 - - 10.34 95.5 - 17 94.02 - - - - - 25 76. - 97.21 2.79 - - 35 97 - - 0.83 97.14 - 15 - - - 2 97.7 - 22 - - - 2.46 97.78 - 23 - - - 4.01 94.03 - 84.25 85.05 - 97.21 2.79 - - - - 12.2 - - Regarding evaluation the classification performance of NIDS after and without applying feature selection process on the input network traffic data of the NSL-KDD dataset, results of table 7 proved that building the detection model of NIDS on the whole 41 network features considered non-professional technical procedure. As that not only minimizes the TPR, TNR, attack detection rate, and classification accuracy but also maximizes the FPR, FNR, the underlying complexity of the network traffic data processing, and the detection time. Regarding the comparison between the classification performance of our ABC-NIDS and other related NIDSs on the same NSL-KDD testing dataset, evaluation results of table 8 stated that our ABC-NIDS achieved the best classification performance.
Finally, this study assured the necessity of the network feature selection phase for boosting the NIDS effectiveness and optimizing its overall performance.
plays a crucial role in avoiding the overfitting problem and reducing processing computation costs. Therefore, optimizing the NIDS performance and achieving acceptable classification results. In this paper, several feature selection techniques were implemented to discard irrelevant and uninformative features from the network traffic before its classification. SVM detection model is trained and assessed using the benchmark NSL-KDD dataset. Evaluation results clearly demonstrated the superiority of the wrapper approaches over both the filter and hybrid approaches in boosting the NIDS overall performance. Furthermore, a comparison with other NIDS is carried out and our ABC-NIDS outperformed these systems. Adopting other metaheuristic techniques for selecting important network features, employing the deep learning techniques for building the intrusion detection model, and testing the NIDS on real network traffic are our future interests.
REFERENCES
V. CONCLUSION
Provision the network security by the NIDS is considered critical for any computer network. Selection of the most informative features of network traffic data
[1] Statista. IoT - number of connected devices worldwide
2015-2025. https://www.statista.com/statistics/4712/iot-number-of-connected-devices-worldwide/. Accessed: 01-05-2019.
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
10 An Efficiency Optimization for Network Intrusion Detection System
[2] N. Kaja, Adnan Shaout and Di Ma, ―An intelligent
intrusion detection system,‖ Applied Intelligence, pp. 1-13, 2019.
[3] C. Modi, D. Patel, B. Borisaniya, H. Patel, A. Patel and M.
Radaradan, ―A Survey of Intrusion Detection Techniques in Cloud,‖ Journal of Network and Computer Applications, vol. 36, No.1, pp. 42–57, 2013.
[4] G. Fernandes, L. Fernando, J.F. Al-Muhadi and M. Lemes,
―A comprehensive survey on network anomaly detection,‖ Telecommunication Systems, vol.70, no.3, pp. 447-4, 2019.
[5] Prachi, H. Malhotra and P. Sharma, ―Intrusion Detection
using Machine Learning and Feature Selection,‖ International Journal of Computer Network and Information security, vol.11, no.4, pp.43-52, 2019.
[6] M. Awad and R. Khanna, ―Support Vector Machines for
Classification Efficient Learning Machines,‖ Apress, Berkeley, California, pp. 39-66, 2015.
[7] Mahmoud M. Sakr, Medhat A. Tawfeeq and Ashraf B. El-Sisi, ―Network Intrusion Detection System based PSO-SVM for Cloud Computing,‖ International Journal of Computer Network and Information Security, vol.11, no.3, pp.22-29, 2019.
[8] B. Hajimirzaei and N.J. Navimipour, ―Intrusion detection
for cloud computing using neural networks and artificial bee colony optimization algorithm,‖ ICT Express, vol.5, no.1, pp. 56-59, 2019.
[9] T. Khorram and N.A. Baykan, ―Feature selection in
network intrusion detection using metaheuristic algorithms,‖ International Journal of Advanced Research, Ideas and Innovations in Technology, vol.4, no.4, 2018. [10] J. Jabez, S. Gowri, S. Vigneshwari, J.A. Mayan and S.
Srinivasulu, ―Anomaly Detection by Using CFS Subset and Neural Network with WEKA Tools,‖ Proceedings of ICTIS, vol. 2, pp. 675-682, 2018.
[11] B.M. Aslahi-Shahri, R. Rahmani, M. Chizari, A. Maralani,
M. Eslami, M. Golkar and A. Ebrahimi, ―A hybrid method consisting of GA and SVM for intrusion detection system,‖ Neural computing and applications, vol. 27, no. 6, pp. 1669-1676, 2019.
[12] H.M. Anwer, Mohamed Farouk and Ayman Abdel-Hamid,
―A framework for efficient network anomaly intrusion detection with features selection,‖ In 9th IEEE International Conference on Information and Communication Systems, pp. 157-162, 2019.
[13] Nitu Dash, Sujata Chakravarty and Amiya Kumar Ratha,
Intrusion Detection System Based on Principal Component Analysis and Machine Learning Techniques. International Journal of Engineering Development and Research (IJEDR) 2018. Vol.6, No.3.
[14] Jie Ling and Chengzhi Wu, ―Feature Selection and Deep
Learning-based Approach for Network Intrusion Detection,‖ In the 3rd International Conference on Mechatronics Engineering and Information Technology, 2019.
[15] Sofiane Maza and Mohamed Touahria, ―Feature Selection
Algorithms in Intrusion Detection System: A Survey,‖ KSII Transactions on Internet and Information Systems, vol.12, no.10, pp.5079-5099, 2018.
[16] B. Senthilnayaki, K. Venkatalakshmi and K. Arputharaj,
―Intrusion Detection System Using Feature Selection and Classification Technique,‖ In International Journal of Computer Science and Application, vol.3, no.4, pp.145, 2014.
[17] K. Keerthi Vasan and B. Surendiran, ―Dimensionality
reduction using Principal Component Analysis for network intrusion detection,‖ Perspectives in Science,
[18]
[19]
[20]
[21]
[22]
[23]
[24]
[25]
[26]
[27]
[28]
[29]
[30]
[31]
[32]
vol.8, pp. 510-512, 2016.
M.A. Hall and L.A. Smith, ―Feature selection for machine learning: Comparing a correlation-based filter approach to the wrapper,‖ In the 12th international FLAIRS Conference, vol. 1999, pp. 235-239, 1999.
K. Sanjay Desale and Roshani Ade, ―Genetic algorithm based feature selection approach for effective intrusion detection system,‖ In IEEE International Conference on Computer Communication and Informatics, pp 1-6, 2015. L. Dhanabal and S.P. Shantharadah, ―A study on NSLKDD dataset for intrusion detection system based on classification algorithms,‖ International Journal of Advanced Research in Computer and Communication Engineering, vol.4, no.6, pp. 446–452, 2015.
E. Popoola and A. Adewumi, ―Efficient Feature Selection Technique for Network Intrusion Detection System Using Discrete Differential Evolution and Decision,‖ International Journal of Network Security, vol.19, no.5, pp. 660-669, 2017.
T. Pham, E. Foo, S. Suriadi and H. Jeffrey, ―Improving performance of intrusion detection system using ensemble methods and feature selection,‖ Australasian Computer Science Week Multi-Conference, ACM, pp.1-6, 2018. N.K. Kanakarajan and K. Muniasamy, ―Improving the accuracy of intrusion detection using gar-forest with feature selection,‖ Advances in Intelligent Systems and Computing, vol.404, pp. 539-7, 2016.
H.H. Pajouh, G.H. Dastghaibyfard, and S. Hashemi, Two-tier network anomaly detection model: a machine learning approach. Journal of Intelligent Information Systems, 2017. Vol.48, No.1, pp. 61–74.
D. Kwon, H. Kim, J. Kim, S. C. Suh, I. Kim and K. J. Kim, A survey of deep learning-based network anomaly detection. Cluster Computing, 2017. Vol. 4, No. 3, pp. 1-13.
T. Khorram and N.A. Baykan, Feature selection in network intrusion detection using metaheuristic algorithms. International Journal of Advanced Research, Ideas and Innovations in Technology, 2016. Vol.4, No.4, pp.704-710.
P. Kar, S. Banerjee, K.C. Mondal, G. Mahapatra and S. Chattopadhyay, A Hybrid Intrusion Detection System for Hierarchical Filtration of Anomalies. Information and Communication Technology for Intelligent Systems, Springer, Singapore, 2019. pp.417-426.
Kazi Abu Taher, B.MY. Jisan and Md. M Rahman, Network Intrusion Detection using Supervised Machine Learning Technique with Feature Selection. In IEEE International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), pp.3-6, 2019.
Partha Ghosh, A.K. Mandal and Rupesh Kumar, An Efficient Cloud Network Intrusion Detection System. Information Systems Design and Intelligent Applications, Advances in Intelligent Systems and Computing, Springer, 2015. vol. 339, pp. 91-99.
M.G. Raman, N. Somu, K. Kirthivasan, R. Liscano, V.S. Sriram, An efficient intrusion detection system based on hypergraph - genetic algorithm for parameter optimization and feature selection in support vector machine, Knowlege. Based System. Vol.134 (2017) pp. 1–12.
X.Zhang, J.Tian, P.Zhu and J.Zhang, An Effective Semi-Supervised Model for Intrusion Detection Using Feature Selection Based LapSVM, In IEEE International Conference on Computer, Information and Telecommunication Systems (CITS), pp. 283-286, 2017. I.S. Thaseen and Ch.A. Kumar, Intrusion Detection Model
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
An Efficiency Optimization for Network Intrusion Detection System 11
Using Chi Square Feature Selection and Modified Naïve Bayes Classifier, In Proceedings of the 3rd International Symposium on Big Data and Cloud Computing Challenges (ISBCC--16’), pp. 81-91, 2016.
[33] Adriana-Cristina Enache1, V. Sgarciu and A. Petrescu-Ni¸ta, Intelligent Feature Selection Method rooted in Binary Bat Algorithm for Intrusion Detection, In IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics, pp. 517-521, 2015.
[34] Ingrid Russell and Zdravko Markov, ―An introduction to
the Weka data mining system,‖ In Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education, vol.38, no.3, pp. 367-368, 2006.
Authors’ Profiles
Mahmoud M. Sakr received the B.Sc. degree from Menoufia University, Faculty of Computers and Information, Computer Science department in 2014. Currently, he is doing his post-graduation master’s degree studies in the Faculty of Computers and Information, Menoufia University. His main research interests include intrusion
detection systems, revolutionary optimization techniques and artificial intelligence challenges.
Dr. Medhat A. Tawfeeq received the B.Sc. and M.Sc. degrees from Menofia University, Faculty of Computers and Information in 2005 and 2010, respectively and received his PhD degree in Computer Science in 2015. His research interests include cloud computing, smart card security, intelligent systems, distributed system, fault tolerance.
Prof. Dr. Ashraf B. El-Sisi received the B.Sc. and M.Sc. degrees in Electronic Engineering and Computer Science Engineering from Menoufia University, Faculty of Electronic Engineering in 19 and 1995, respectively and received his PhD degree in Computer Engineering & Control from Zagazig University, Faculty
of Engineering in 2001. His current research interests include cloud computing, privacy-preserving data mining, and intelligent systems.
How to cite this paper: Mahmoud M. Sakr, Medhat A. Tawfeeq, Ashraf B. El-Sisi, \"An Efficiency Optimization for Network Intrusion Detection System\International Journal of Computer Network and Information Security(IJCNIS), Vol.11, No.10, pp.1-11, 2019. DOI: 10.5815/ijcnis.2019.10.01
Copyright © 2019 MECS I.J. Computer Network and Information Security, 2019, 10, 1-11
因篇幅问题不能全部显示,请点此查看更多更全内容
Copyright © 2019- shangjiatang.cn 版权所有 湘ICP备2022005869号-4
违法及侵权请联系:TEL:199 1889 7713 E-MAIL:2724546146@qq.com
本站由北京市万商天勤律师事务所王兴未律师提供法律服务