Detection of DDoS Vulnerability in Cloud Computing Using the Perplexed Bayes Classifier

Cloud computing provides the computational machines as a support of the clients utilizing cloud organize. In cloud computing, the user inputs are executed with required machines to convey the administrations. Numerous task scheduling methods are utilized to plan the client tasks to the machines. In this paper, another successful hybrid task scheduling is proposed to minimize the total execution time using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithms. In hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm, PSO helped GA to obtain better results compare to a standard genetic algorithm, Min-Min, and Max-Min algorithms results.

Feature selection based on rough sets and particle swarm optimization

Cloud computing facilitates the users with on-demand services over the Internet. The services are accessible from anywhere at any time. Despite the valuable services, the paradigm is, also, prone to security issues. A Distributed Denial of Service (DDoS) attack affects the availability of cloud services and causes security threats to cloud computing. Detection of DDoS attacks is necessary for the availability of services for legitimate users. The topic has been studied by many researchers, with better accuracy for different datasets. This article presents a method for DDoS attack detection in cloud computing. The primary objective of this article is to reduce misclassification error in DDoS detection. In the proposed work, we select the most relevant features, by applying two feature selection techniques, i.e., the Mutual Information (MI) and Random Forest Feature Importance (RFFI) methods. Random Forest (RF), Gradient Boosting (GB), Weighted Voting Ensemble (WVE), K Nearest Neighbor (KNN), and Logistic Regression (LR) are applied to selected features. The experimental results show that the accuracy of RF, GB, WVE, and KNN with 19 features is 0.99. To further study these methods, misclassifications of the methods are analyzed, which lead to more accurate measurements. Extensive experiments conclude that the RF performed well in DDoS attack detection and misclassified only one attack as normal. Comparative results are presented to validate the proposed method.

Cloud computing has spread fast because of its high performance distributed computing. It offers services and access to shared resources to internet users through service providers. Efficient performance of task scheduling in clouds is one of the most important research issues which needs to be focused on. Various task scheduling algorithms for cloud based on metaheuristic techniques have been examined and showed high performance in reasonable time such as scheduling algorithms based on Ant Colony Optimization (ACO), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). In this paper, we propose a new task-scheduling algorithm based on Lion Optimization Algorithm (LOA), for cloud computing. LOA is a nature-inspired population-based algorithm for obtaining global optimization over a search space. It was proposed by Maziar Yazdani and Fariborz Jolai in 2015. It is a metaheuristic algorithm inspired by the special lifestyle of lions and their cooperative characteristics. The proposed task scheduling algorithm is compared with scheduling algorithms based on Genetic Algorithm and Particle Swarm Optimization. The results demonstrate the high performance of the proposed algorithm, when compared with the other algorithms.

Cloud computing has become a crucial paradigm for large-scale data-intensive applications, but it also brings challenges like energy consumption, execution time, heat, and operational costs. Improving workflow scheduling in cloud environments can address these issues and optimize resource utilization, leading to significant ecological and financial benefits. As data centres and networks continue to expand globally, efficient scheduling becomes even more critical for achieving better performance and sustainability in cloud computing. Schedulers mindful of energy and deadlines will assign resources to jobs in a way that consumes the least energy while upholding the task’s quality standards. Because this scheduling involves a Non-deterministic Polynomial (NP)-hard problem, the schedulers are able to minimize complexity by utilizing metaheuristic techniques. This work has developed methods like Artificial Bee Colony (ABC), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO) for optimizing the scheduler. Local search and exploration are respectably supported by heuristic algorithms. The algorithm’s exploration and exploitation features must also be balanced. The primary objective is to optimize computation-intensive workflows in a way that minimizes both energy consumption and execution time while maximizing throughput. This optimization should be achieved without compromising the Quality of Service (QoS) guarantee provided to users. The focus is on striking a balance between energy efficiency and performance to enhance the overall efficiency and cost-effectiveness of cloud computing environments. According to the simulation findings, the suggested ABC has a higher guarantee ratio for 5000 jobs when compared to the GA, PSO, GA with the longest processing time, and GA with the lowest processing time, by 7.14 percent, 4.7 percent, 3.5 percent, and 2.3 percent, respectively. It is observed that the proposed ABC possesses qualities like high flexibility, great robustness, and quick convergence leading to good performance.

Distributed Denial of Service (DDoS) attacks have emerged as one of the most pervasive and damaging threats to network security, disrupting services and incurring substantial financial costs. Machine learning (ML) has been widely explored as a potential solution to enhance DDoS detection and mitigation. This systematic review evaluates the effectiveness of ML techniques in detecting DDoS attacks, synthesizing findings from studies published between 2004 and 2024. The review analyzes models such as Random Forest, Support Vector Machines (SVM), and K-Nearest Neighbors (K-NN) based on key performance metrics like accuracy, precision, recall, and F1-score. A comprehensive search of multiple databases, including Web of Science, IEEE, Scopus, ScienceDirect, and Google Scholar, resulted in 19 studies that met inclusion criteria. The findings show that ensemble methods, particularly Random Forest, consistently outperformed other models in terms of detection rates, mainly due to their ability to handle large feature sets and reduce overfitting. Support Vector Machines also performed well in specific scenarios. However, their effectiveness was sometimes limited by computational complexity and the dataset size. K-Nearest Neighbors showed mixed results, depending on the nature of the attack patterns. This review emphasizes the potential of ensemble learning approaches for DDoS detection, demonstrating their robustness in dynamic environments. The review identifies key gaps in the existing research, including the need for better feature selection and exploring deep learning techniques to enhance DDoS detection accuracy and adaptability further. This study contributes valuable insights into the strengths and limitations of ML-based DDoS detection models, offering a foundation for future advancements in the field. It underscores the importance of continued research into hybrid and deep learning models to address the evolving and increasingly sophisticated nature of DDoS attacks in real-world applications.

Cloud computing and big data: Technologies and applications

The problem examined in this study is about the user’s trust in using digital learning applications that are downloaded on playstore. Many reviews are given by the public about the application that has been downloaded on playstore. This review is very influential on their trust in using the application. The purpose of this study is to classify data according to labels and find out the best choice between the classification method and the proposed selection feature as a consideration in determining the use of digital learning applications. This study compares the classification method, the Naïve Bayes algorithm and the genetic algorithm (GA) as feature selection with the Naïve Bayes algorithm classification method and the particle swarm optimization (PSO) as feature selection to categorize the reviews in the playstore. The experimental results show that the Naïve Bayes algorithm and PSO as feature selection is the best model between the two models proposed in this study. Reviews can be classified into positive and negative labels well. The accuracy is 98.00%. The results of the classification are expected to help in making decisions when going to use digital learning application.

This paper explores the nature of threats posed by Distributed Denial of Service (DDoS) attacks on large networks, such as the Internet, emphasizing the need for effective detection and response mechanisms. These mechanisms must be implemented not only at the network edge but also within its core. The paper introduces methods to detect DDoS attacks by analyzing entropy and frequency-sorted distributions of specific packet attributes. Anomalies in these attributes' characteristics serve as indicators of potential DDoS attacks. The proposed methods are evaluated for detection accuracy and performance using live traffic traces collected from diverse network environments, including core Internet nodes and edge networks. Results demonstrate the effectiveness of these methods against current DDoS attacks and provide insights into improving detection capabilities for more sophisticated, stealthier threats. Additionally, the paper describes a detection-response prototype and discusses how the detection system can be extended to support effective response decision-making.

Hybrid design of PID controller for four DoF lower limb exoskeleton

In recent years, smart grid-based Electric Vehicle (EV) charging systems have increasingly faced vulnerabilities to Distributed Denial of Service (DDoS) attacks, especially through malicious authentication failures. These attacks typically involve monopolizing the Grid Server (GS), thereby hindering the authentication process for legitimate EVs. Despite the severity of this issue, no research (to the best of our knowledge) has focused on detecting DDoS attacks exploiting weaknesses in EV authentication. This study introduces a DDoS attack detection model specifically designed for EV authentication. The approach involves developing a machine learning model involving unique feature selection and combination. The proposed approach has been evaluated using a new DDOS attack dataset. The model is engineered to optimize feature combination, aiming for high sampling resolution, minimal information loss, and robust performance under 16 distinct attack scenarios. The feature combination used in this study shows improved accuracy over traditional DDoS detection methods based on access time variation while minimizing information loss.

The complexity of embedded system design increase as the technology keeps evolving from day to day. Hardware software partitioning has been a promising approach to solve this design problem of complexity in the embedded systems, by providing a solution that automatically decides the partitioning. A lot of research has been done to automate the partitioning which focusing on exact and heuristic algorithm. Then due to the slow performance of the exact algorithms, the study focus shift to heuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). In this research the performance of both PSO algorithm and GA are analyzed in the application of the partitioning. In order to get the best among these two algorithms, hybrid combination across the two algorithms is designed. The best cost and their average time to achieve it are compared among PSO, GA and hybrid design. As a result, the graph obtained from the hybrid GA-GA-PSO required a smaller number of iterations to reach best cost. Compared to previous work, GA-GA-PSO obtained a smooth as the successive PSO graph. In conclusion, a new idea of hybrid across PSO and GA has been introduced and it results into a better solution for Hardware Software Partitioning.

In this paper, we present a comprehensive and in-depth investigation on the optimization of Proportional-Integral (PI) controller tuning for achieving stability and desired overshoot in the step response. The main objective of this study is to compare the effectiveness of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) techniques in finding the optimal parameters for the PI controller. The PI controller is a widely used control algorithm that plays a crucial role in many industrial processes. Its tuning greatly affects the system's performance, particularly in terms of stability and overshoot. Therefore, finding the optimal tuning parameters is of utmost importance. To address this optimization problem, we propose the utilization of two popular metaheuristic algorithms, GA and PSO. These algorithms are known for their ability to efficiently search through large solution spaces and find near-optimal solutions. By applying these algorithms to the PI controller tuning problem, we aim to determine which technique yields better results in terms of stability and overshoot tuning. In our comparative study, we provide a detailed explanation of both GA and PSO algorithms, focusing on their working principles and mathematical formulations. We also describe how these algorithms can be applied to the PI controller tuning problem. Furthermore, we highlight the key differences between GA and PSO, shedding light on their strengths and weaknesses. To assess the performance of GA and PSO, we conduct several experiments using different benchmark functions and step response models. We measure the stability and overshoot metrics for various parameter settings obtained through GA and PSO. By thoroughly analyzing the obtained results, we draw meaningful conclusions regarding the effectiveness of each technique. Our findings demonstrate that both GA and PSO exhibit promising results in optimizing PI controller tuning. These observations provide valuable insights and guidelines for choosing the appropriate algorithm based on specific control requirements. In conclusion, this comparative study is thought to contribute to the field of control systems engineering by offering a comprehensive analysis of GA and PSO techniques in the context of PI controller tuning. By highlighting their strengths and weaknesses, it is aimed to provide researchers and practitioners with valuable information for making informed decisions when optimizing control parameters for stability and overshoot reduction purposes.

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing’s performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments.

General Election is one of the characteristics of a democratic country. One of the countries that embrace the democratic system is the state of Indonesia. Elections are a party of democracy in Indonesia to elect representatives of the people who will sit in parliament and provide great opportunities for the people of Indonesia to compete to appoint themselves to become members of the legislature. Research related to the election has been done by researchers is by using decision tree method or by using neural network. each method has its own weaknesses and advantages, but neural network methods can cover the weaknesses of the decision tree. The result of research using neural network method in predicting election result has accurate result value is still less accurate. In this research, we create neural network algorithm model and optimization with particle swarm optimization algorithm to increase attribute weight to all attributes or variables used, select attributes, and feature selection. whereas the Genetic Algorithm for predicting the performance of generalizations based on static properties of networks such as activation function and hidden neurons will be strong enough to find solutions. After testing with neural network algorithm to produce accurate value of 98.50% and AUC value of 0.982, further optimization done with particle swarm optimization obtained an accuracy of 98.85% and AUC value of 0.996. and then done the optimization testing with genetic algorithm obtained an accuracy value of 96.56% and AUC value of 0.925 So that both methods have a difference of accuracy that is equal to 0,35% and difference of AUC value equal to 0,14.