Search

In this paper a novel collective method for DDoS detection is introduced. The method is distributed and implemented as a multi-agent system, and where local decision is based on an information-based heuristic, namely the entropy. According the calculated entropy a router exchange data with its neighbors aiming at collectively decide if a DDoS is ongoing or not. Most of the works of the literature that are based on the entropy they have used source addresses. The authors' method is based on the entropy of the distances traveled by the packets, so spoofing IP packets will be hard to perform by hackers. Each router combines its decision with those of its neighbors. Such a collective detection allows to apply defense against the attack despite the victim is out of service or cannot perform DDoS mitigation because the traffic is congested in its neighborhood. Conducted experiments using the platform OMNet++ show the potential of the new method for efficient collaborative and distributed detection and mitigation of DDoS attacks.

This paper introduces a collaborative and distributed method for botnet detection in massive networks such as internet of things (IoT) and wide area networks (WAN). The method is model-based and designed as a multi-agent system where the agents are situated on IoT devices. Every agent analyzes the events' entropies, then exchanges its decision with its neighbors aiming at establishing global decision if a botnet is ongoing to be installed within the network or not. Decisions spread over the network where a consensual dominant decision can emerge. In previous similar works, it was necessary to use some central hosts in order to compute global decisions. So, scalability is compromised, and the solution is not suited for massive networks such as IoT. The proposed approach does not require any central control, which allows it to be used in IoT and ad hoc networks. Furthermore, the botnet is detected at the early stage of its life-cycle. Conducted experiments have shown that the proposed approach is well suited for botnet detection in IoT and WAN.

In this work the authors present a new approach based on the cooperation of many variants of metaheuristics in order to solve the large existing benchmark instances of the capacitated vehicle routing problem (CVRP). The proposed method follows the parallel pattern of the generalized island model (GIM). Consequently, the used metaheuristics, namely genetic algorithm (GA), the ant colony optimization (ACO), and the first application of the penguin optimization search (PEO) have been used to handle the large size of the CVRP. These optimization processes have been put over numerous islands that communicate via the process of exchanging solutions. Comparative studies as well as tests over the existing benchmark instances have been reported to prove the efficiency of the proposed approach.

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algorithms have a great tendency to be trapped in local optima particularly when solving complex optimization problems. In this paper, the authors introduce a new efficient population-based technique for binary optimization problems (that we called EABOP). The proposed algorithm can provide an effective search through a new proposed binary mutation operator. The performance of our approach was tested on hard instances of the multidimensional knapsack problem. The obtained results show that the new algorithm is able of quickly obtaining high-quality solutions for most hard instances of the problem.

Negative Selection Algorithm (NSA) is one of the widely used techniques for Intrusion Detection Systems (IDS) designing. In this paper, the proposed is an IDS based on a new model of NSA namely HNSA-IDSA (Hybrid NSA for Intrusion Detection System Adaptation). The proposed system can detect unknown attacks; moreover can be adapted automatically when new profiles' changes of the system are detected. To determine the efficiency of the proposed approach, the standard KDD99 dataset was used for performing experiments. The obtained results show that the authors' mechanism outperforms some literature techniques providing variant important properties as high detection rate, low false positive, adaptability and new attacks detection.

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm. To show the feasibility and the effectiveness of the algorithm, it has used the standard DIMACS benchmark, and the obtained results are very encouraging.