Seguridad contra ataques DDoS en los entornos SDN con Inteligencia Artificial

Las redes definidas por software (SDN), representan la innovación, porque combinan la administración central y la capacidad de programar la red, SDN centraliza la gestión a través de un controlador , separa el plano de control y el datos, pero al tener un único punto de control la hace vulnerable especialmente a los ataques de Denegación de Servicio Distribuido(DDoS), en la actualidad existe muchas investigaciones orientadas a mitigar este tipo de ataques a través de técnicas donde interviene la inteligencia artificial y sus diversas áreas. Este estudio describe las SDN, la inteligencia artificial, los ataques DDoS y realiza una revisión de la intervención de la inteligencia artificial para mitigar este tipo de ataques

Спосіб забезпечення безпеки в мобільних SDN мережах

В бакалаврському дипломному проєкті проведений аналіз засобів забезпечення безпеки у мобільних SDN мережах. Виявлені головні недоліки існуючих реалізацій. Запропоновано власний спосіб забезпечення захисту мереж від DDoS атак. Проведене моделювання атак на мережу для оцінки ефективності запропонованого способу. Реалізований запропонований спосіб для забезпечення безпеки у SDN мережах.In this project for a Bachelor's Degree was made an analysis of means of safety in mobile SDN networks. The main shortcomings of existing implementations are revealed. An own way to protect networks from DDoS attacks is proposed. The simulation of network attacks to evaluate the effectiveness of the proposed method. Implemented the proposed method for security in SDN networks

Learning Feature Weights for Density-Based Clustering

K-Means is the most popular and widely used clustering algorithm. This algorithm cannot recover non-spherical shape clusters in data sets. DBSCAN is arguably the most popular algorithm to recover arbitrary shape clusters; this is why this density-based clustering algorithm is of great interest to tackle its weaknesses. One issue of concern is that DBSCAN requires two parameters, and it cannot recover widely variable density clusters. The problem lies at the heart of this thesis is that during the clustering process DBSCAN takes all the available features and treats all the features equally regardless of their degree of relevance in the data set, which can have negative impacts. This thesis addresses the above problems by laying the foundation of the feature weighted density-based clustering. Specifically, the thesis introduces a densitybased clustering algorithm using reverse nearest neighbour, DBSCANR that require less parameter than DBSCAN for recovering clusters. DBSCANR is based on the insight that in real-world data sets the densities of arbitrary shape clusters to be recovered within a data set are very different from each other. The thesis extends DBSCANR to what is referred to as weighted DBSCANR, WDBSCANR by exploiting feature weighting technique to give the different level of relevance to the features in a data set. The thesis extends W-DBSCANR further by using the Minkowski metric so that the weight can be interpreted as feature re-scaling factors named MW-DBSCANR. Experiments on both artificial and realworld data sets demonstrate the superiority of our method over DBSCAN type algorithms. These weighted algorithms considerably reduce the impact of irrelevant features while recovering arbitrary shape clusters of different level of densities in a high-dimensional data set. Within this context, this thesis incorporates a popular algorithm, feature selection using feature similarity, FSFS into bothW-DBSCANR andMW-DBSCANR, to address the problem of feature selection. This unsupervised feature selection algorithm makes use of feature clustering and feature similarity to reduce the number of features in a data set. With a similar aim, exploiting the concept of feature similarity, the thesis introduces a method, density-based feature selection using feature similarity, DBFSFS to take density-based cluster structure into consideration for reducing the number of features in a data set. This thesis then applies the developed method to real-world high-dimensional gene expression data sets. DBFSFS improves the clustering recovery by substantially reducing the number of features from high-dimensional low sample size data sets