Utilization Of Cloud Resources Research Articles

Comprehensive review of load balancing in cloud computing system

Load balancing plays a critical role in optimizing resource utilization and enhancing performance in cloud computing systems. As cloud environments grow in scale and complexity, efficient load balancing mechanisms become increasingly vital. This paper presents a comprehensive review of load balancing techniques in cloud computing systems, with a focus on their applicability, advantages, and limitations. The review encompasses both static and dynamic load balancing approaches, evaluating their effectiveness in addressing the challenges posed by cloud infrastructure, such as heterogeneity, scalability, and variability in workload demands. Furthermore, the review examines load balancing algorithms considering factors such as resource utilization, response time, fault tolerance, and energy efficiency. Additionally, the impact of load balancing on cloud performance metrics, including throughput, latency, and scalability, is analyzed. This review aims to provide insights into the state-of-the-art load balancing strategies and serve as a valuable resource for researchers, practitioners, and system designers involved in the development and optimization of cloud computing systems.

Key Challenges of Cloud Computing Resource Allocation in Small and Medium Enterprises

Although cloud computing offers many benefits, such as flexibility, scalability, and profitability, some small and medium enterprises (SMEs) are still unable to fully utilize cloud resources, such as memory, computing power, storage, and network bandwidth. This reduces their productivity and increases their expenses. Therefore, the central objective of this paper was to examine the key challenges related to the allocation of cloud computing resources in small and medium enterprises. The method used for this study is based upon qualitative research using 12 interviews with 12 owners, managers, and experts in cloud computing in four countries: the United States of America, the United Kingdom, India, and Pakistan. Our results, based on our empirical data, show 11 key barriers to resource allocation in cloud computing that are classified based on the technology, organization, and environment (TOE) framework. Theoretically, this research contributes to the body of knowledge concerning cloud computing technology and offers valuable understanding of the cloud computing resource allocation approaches employed by small and medium enterprises (SMEs). In practice, this research is useful to aid SMEs in implementing successful and sustainable strategies for allocating cloud computing resources.

Blockchain based Quantum Resistant Signature Algorithm for Data Integrity Verification in Cloud and Internet of Everything


 INTRODUCTION: The processing and storage capacities of the Internet of Everything (IoE) platform are restricted, but the cloud can readily provide efficient computing resources and scalable storage. The Internet of Everything (IoE) has expanded its capabilities recently by employing cloud resources in multiple ways. Cloud service providers (CSP) offer storage resources where extra data can be stored. These methods can be used to store user data over the CSP while maintaining data integrity and security. The secure storage of data is jeopardized by concerns like malicious system damage, even though the CSP's storage devices are highly centralized. Substantial security advancements have been made recently as a result of using blockchain technology to protect data transported to networks. In addition, the system's inclusive efficacy is enhanced, which lowers costs in comparison to earlier systems.
 OBJECTIVES: The main objective of the study is to a blockchain-based data integrity verification scheme is presented to provide greater scalability and utilization of cloud resources while preventing data from entering the cloud from being corrupted.
 METHODS: In this paper, we propose a novel method of implementing blockchain in order to enhance the security of data stores in cloud.
 RESULTS: The simulations indicate that the proposed approach is more effective in terms of data security and data integrity. Furthermore, the comparative investigation demonstrated that the purported methodology is far more effective and competent than prevailing methodologies.
 CONCLUSIONS: The model evaluations demonstrated that the proposed approach is quite effective in data security.

Performance enhancement of cloud security with migration algorithm for choosing virtual machines in cloud computing

The management of the hardware as well as software resources entrusted to third-party service suppliers have shown to be extraordinarily remarkable and accessible with Cloud Computing (CC), a potential computing technology for the future. Yet, a major undertaking is characterized by security as well as the use of Virtual Machines (VMs) to perform a request. The main issue with using technology is security worries, which raises the need for a strong security system to safeguard data on the cloud. Thus, to address this problem, a method called Weighted Mean-based Radial Basis Function Network with Advanced Encryption Standard (WMRBFN-AES) is developed to improve cloud security along with the time of execution. Random keys are produced utilizing the Pseudo Random Number Generator (PRNG) technique, and the best keys are created employing the WMRBFN technique. In the WMRBFN technique, randomly generated keys are used as input, and the hidden layers yield an estimate associated with the secret key of the input. The output layer generates the most precise secret keys to encrypt the data. Encryption is carried out using the AES algorithm. The files about the encrypted data are kept in a cloud storage system. Reduced execution times for stakeholder demands (tasks) as well as optimal cloud resource utilization result from the selection of VMs, which significantly improves reliability. The Migration Algorithm (MA) is used in the cloud framework to optimize the selection of VMs to improve resource utilization and performance. The experimental findings of the suggested framework and the state-of-the-art frameworks are compared, and it was found that the new model performed better in terms of cost, resource utilization, service latency, throughput, and execution time.

A hybrid cloud load balancing and host utilization prediction method using deep learning and optimization techniques

Virtual machine (VM) integration methods have effectively proven an optimized load balancing in cloud data centers. The main challenge with VM integration methods is the trade-off among cost effectiveness, quality of service, performance, optimal resource utilization and compliance with service level agreement violations. Deep Learning methods are widely used in existing research on cloud load balancing. However, there is still a problem with acquiring noisy multilayered fluctuations in workload due to the limited resource-level provisioning. The long short-term memory (LSTM) model plays a vital role in the prediction of server load and workload provisioning. This research presents a hybrid model using deep learning with Particle Swarm Intelligence and Genetic Algorithm (“DPSO-GA”) for dynamic workload provisioning in cloud computing. The proposed model works in two phases. The first phase utilizes a hybrid PSO-GA approach to address the prediction challenge by combining the benefits of these two methods in fine-tuning the Hyperparameters. In the second phase, CNN-LSTM is utilized. Before using the CNN-LSTM approach to forecast the consumption of resources, a hybrid approach, PSO-GA, is used for training it. In the proposed framework, a one-dimensional CNN and LSTM are used to forecast the cloud resource utilization at various subsequent time steps. The LSTM module simulates temporal information that predicts the upcoming VM workload, while a CNN module extracts complicated distinguishing features gathered from VM workload statistics. The proposed model simultaneously integrates the resource utilization in a multi-resource utilization, which helps overcome the load balancing and over-provisioning issues. Comprehensive simulations are carried out utilizing the Google cluster traces benchmarks dataset to verify the efficiency of the proposed DPSO-GA technique in enhancing the distribution of resources and load balancing for the cloud. The proposed model achieves outstanding results in terms of better precision, accuracy and load allocation.

Optimizing cloud resource allocation: A long short-term memory and DForest-based load balancing approach

Load balancing is an element that must exist for a cloud server to function properly. Without it, there would be substantial lag and the server won’t be able to operate as intended. In a Cloud computing (CC) establishing, load balancing is the process of dividing workloads and computer resources. The distribution of assets from a data centre involves many different factors, including load balancing of workloads in cloud environment. To make best use each virtual machine’s (VM) capabilities, load balancing needs to be done in a way that ensures that all VMs have balanced loads. Both overloading and underloading are examples of load unbalance, and both of these types of load unbalance could be fixed by using techniques created especially for load balancing. The research that has been done on the subject have not attempted to take into account the factors that affect the problem of load unbalancing. Results indicate that the LSTM and DForest-based load balancing approach significantly improves cloud resource utilization, reduces response times, and minimizes the occurrence of overloading or underloading scenarios. To effectively design those programmes, it is essential to first understand the advantages and disadvantages of current methodologies before developing efficient AI-based load balancing programmes. Compared to existing method the proposed method is high accuracy 0.98, KNN accuracy is 0.97, SVM accuracy is 0.99, and DForest accuracy is 0.987.

Energy efficient virtual machines placement in cloud datacenters using genetic algorithm and adaptive thresholds.

Cloud computing platform provides on-demand IT services to users and advanced the technology. The purpose of virtualization is to improve the utilization of resources and reduce power consumption. Energy consumption is a major issue faced by data centers management. Virtual machine placement is an effective technique used for this purpose. Different algorithms have been proposed for virtual machine placement in cloud environments. These algorithms have considered different parameters. It is obvious that improving one parameter affects other parameters. There is still a need to reduce energy consumption in cloud data centers. Data centers need solutions that reduce energy consumption without affecting other parameters. There is a need to device solutions to effectively utilize cloud resources and reduce energy consumption. In this article, we present an algorithm for Virtual Machines (VMs) placement in cloud computing. The algorithm uses adaptive thresholding to identify over utilized and underutilized hosts to reduce energy consumption and Service Level Agreement (SLA) violations. The algorithm is validated with simulations and comparative results are presented.

Next-Gen Cloud Efficiency: Fault-Tolerant Task Scheduling with Neighboring Reservations for Improved Cloud Resource Utilization

Next-Gen Cloud Efficiency: Fault-Tolerant Task Scheduling with Neighboring Reservations for Improved Cloud Resource Utilization

SMSE: A serverless platform for multimedia cloud systems

SummaryAlong with the rise of domain‐specific computing (ASICs hardware) and domain‐specific programming languages, we envision that the next step is the emergence of domain‐specific cloud platforms. Considering multimedia streaming as one of the most trendy applications in the IT industry, the goal of this study is to develop serverless multimedia streaming engine (SMSE), the first domain‐specific serverless platform for multimedia streaming. SMSE democratizes multimedia service development via enabling content providers (or even end‐users) to rapidly develop their desired functionalities on their multimedia contents. Upon developing SMSE, the next goal of this study is to deal with its efficiency challenges and develop a function container provisioning method that can efficiently utilize cloud resources and improve the users' quality of service. In particular, we develop a dynamic method that provisions durable or ephemeral containers depending on the spatiotemporal and data‐dependency characteristics of the functions. Evaluating the prototype implementation of SMSE under real‐world settings demonstrates its capability to reduce both the containerization overhead, and the makespan time of serving multimedia processing functions (by up to 30%) in compare to the function provision methods that are being used in the general‐purpose serverless cloud systems.

Bulut Hesaplama İçin Evrimsel Algoritma Kullanarak İş Akışı Planlaması

Cloud computing provides powerful, highly scalable, flexible resources for real world applications. It also reduces the cost and operation expenses. Workflow scheduling is important for getting higher performance, reducing cost and using resources more efficiently in cloud computing. Workflow scheduling in cloud systems assigns tasks to resources available in the system and aims to utilize cloud resources by decreasing makespan of the workflow. In this study, an evolutionary algorithm is proposed to solve workflow scheduling problem. The main objective of this work is to minimize the makespan of the schedule. To achieve this goal, problem specific crossover operator and mutation operators are proposed in the evolutionary algorithm. The crossover operator will combine the problem-specific information stored in both parents to create a new individual. The mutation operators will explore neighbor solutions using some intelligent search mechanisms. This unique design of the operators increases the diversity of the search space and the quality of the solutions. As a result, the workflow schedules obtained from the evolutionary algorithm decreases the makespan of the workflow in the cloud system. The performance of the proposed study is measured using well-known scientific workflows and is compared with the algorithms from the literature. The proposed study outperforms all related algorithms in 67% of the test cases and obtains the same results in the remaining test cases.

Dynamic offloading technique for real-time edge-to-cloud computing in heterogeneous MEC–MCC and IoT devices

In the realm of Mobile Cloud Computing (MCC), where mobile environments converge with cloud capabilities to address challenges related to performance, environmental considerations, and security, the complexity of task offloading intensifies with the growing number of cloud providers and application units. While Mobile Edge Computing (MEC) shows promise in enhancing MCC performance, the central research challenge revolves around efficiently determining when to offload computational tasks to the cloud or handle them locally at the edge. It involves finding the optimal balance between utilizing cloud resources and enhancing edge computing performance. This study aims to streamline the decision-making process, seeking a harmonious balance between optimal cloud resource utilization and improved edge computing performance. To this end, we introduce HECOM (Hybrid Edge-to-Cloud Offloading for Heterogeneous Computing), a strategic model that combines three decision-making algorithms and an efficient hybrid computation offloading method. HECOM swiftly identifies optimal offloading servers for individual application units, addressing the challenge of efficient offloading decision-making. Importantly, HECOM provides optimal solutions without waiting for all training processes to conclude. Evaluation results from experiments and simulations affirm that the proposed model exhibits impressive energy efficiency, reducing consumption by 25%, increasing offloading ratio by 30%, and minimizing latency and time delay by 15%, making it ideal for real-time applications. It significantly enhances network resource allocation and achieves a more balanced overall performance profile.

Optimizing Task Scheduling in Cloud Computing Environments using Hybrid Swarm Optimization

Cloud computing has revolutionized the Information Technology (IT) landscape by offering on-demand access to a shared pool of computing resources over the internet. Effective task scheduling is pivotal in optimizing resource utilization and enhancing the overall performance of cloud systems. Tasks are allocated to virtual machines (VMs) based on a server's workload capacity, aiming to minimize traffic congestion and waiting times. Although Particle Swarm Optimization (PSO) is currently the most effective algorithm for task scheduling in cloud environments, this study introduces a Hybrid Swarm Optimization (HSO) algorithm that combines the strengths of PSO and Salp Swarm Optimization (SSO). The proposed hybrid algorithm addresses the challenges associated with task scheduling in cloud computing. The performance of the HSO algorithm is evaluated using the CloudSim simulator and compared against traditional scheduling algorithms. Simulation results indicate that the hybrid PSO-SSO algorithm outperforms existing methods regarding makespan time, cloud throughput, and task execution efficiency. Consequently, the hybrid approach significantly improves resource utilization and overall system performance in cloud computing environments.

An optimized algorithm for resource utilization in cloud computing based on the hybridization of meta-heuristic algorithms

An optimized algorithm for resource utilization in cloud computing based on the hybridization of meta-heuristic algorithms

An efficient load balancing technique using CAViaR-HHO enabled VM migration and replica management in cloud computing

Cloud computing is immense technology that offers distributed resources to a number of users who are present throughout the world. Cloud model is comprised of numerous virtual machines (VMs) and physical machines (PMs) to carry out user tasks effectively in a parallel manner but in some cases, the demand of the users may be high that resulting in the overloading of PMs and this condition deteriorates the performance of cloud network. For achieving effective virtualization in the cloud paradigm, energy and resource utilization are major properties that should be handled effectively and such properties are accomplished through effective management of workload by distributing load equivalently among VMs. By doing so, resource utilization of the network is enhanced and it only requires minimum energy to process the tasks. Numerous load-balancing algorithms have been introduced earlier to maintain load in a cloud environment, nevertheless, they are devoid of mitigating the number of task migrations. Hence, this research proposes an effective load balancing algorithm and replica management method using the proposed Conditional Autoregressive Value at risk by Regression Quantiles-Horse Herd Optimization (CAViaR-HHO) model. Here, the load is computed by considering some factors like Central Processing Unit (CPU), Million Instructions per Second (MIPS), bandwidth, memory, and frequency. VM migration and replica migration is effectively carried out using the proposed CAViaR-HHO model. Meanwhile, the developed method is devised by integration of Conditional Autoregressive Value at risk by Regression Quantiles (CAViaR) with Horse Herd Optimization Algorithm (HOA). However, the proposed CAViaR-HHO has achieved a load with a minimum value of 0.109, capacity with a maximum value of 0.591, resource utilization with a maximum value of 0.467, and minimum cost of 0.344. Using setup-1, when the number of tasks is 500, the capacity of the proposed method is 5.58%, 3.89%, 2.87%, 1.52%, and 0.67% higher when compared to the existing approaches namely, C-FDLA, K-means clustering + LB, Adaptive starvation threshold, EIMORM, and Dynamic replica creation method.

An Efficient Task Scheduling in a Cloud Computing Environment using Hybrid Swarm Optimization

Information technology (IT) services are available on demand over the Internet under the current computing standard known as cloud computing. A work is mapped with an available resource in the cloud environment to get a good result. Cloud computing has emerged as a transformative technology that provides on-demand access to a shared pool of computing resources over the internet. Effective task scheduling plays a crucial role in optimizing resource utilization and improving overall system performance in cloud environments. According to a server's workload capacity, tasks are distributed across its virtual machines (VMs) via task scheduling. The server's workload is planned out to reduce traffic and wait times. The best algorithm currently in use to schedule a work to an existing resource in a cloud setting is particle swarm optimization (PSO). PSO schedules the task for an available resource to cut down on computational costs. In order to address job scheduling challenges in the cloud environment, a hybrid swarm optimizations (HSO) algorithm—a combination of PSO and salp swarm optimization (SSO)—is suggested in this paper. The hybrid algorithm leverages the strengths of both PSO and SSO to achieve better optimization results. The proposed method is evaluated using the CloudSim simulator and compared with traditional scheduling algorithms. Simulation results demonstrate the superiority of the hybrid PSO-SSO algorithm in terms of makespan time, cloud throughput, and task execution efficiency. The findings suggest that the hybrid approach can significantly enhance resource utilization and performance in cloud computing environments.

A Novel Hybrid Model for Docker Container Workload Prediction

The emergence of containers dramatically simplifies and facilitates the development and deployment of applications. More and more enterprises deploy their applications on the container cloud platform. For cloud service providers, an effective container workload prediction method is a must to achieve efficient utilization of cloud resources. However, the existing methods are either rarely based on container load characteristics or cannot make accurate real-time predictions. In this paper, we propose a Docker container workload proactive prediction method using a hybrid model combining triple exponential smoothing and long short-term memory (LSTM), which not only can capture both short-term and long-term dependencies in container resource time series but also smooth the container resource utilization data. In order to improve the prediction accuracy of the hybrid model, those two single models are combined using the mean absolute percentage error (MAPE) method. Besides, we design a real-time Docker workload prediction system for the hybrid model. Our experiments show that the mean absolute percentage error of the hybrid model is decreased by an average of 3.24%, 12.18%, 13.42%, 43.45%, and 50.69% compared with the LSTM, the triple exponential smoothing, ES-ARIMA, Bayesian Ridge Regression and BiLSTM with an acceptable time and computational cost overhead.

DisguisedNets: Secure Image Outsourcing for Confidential Model Training in Clouds

Large training data and expensive model tweaking are standard features of deep learning with images. As a result, data owners often utilize cloud resources to develop large-scale complex models, which also raises privacy concerns. Existing cryptographic solutions for training deep neural networks (DNNs) are too expensive, cannot effectively utilize cloud GPU resources, and also put a significant burden on client-side pre-processing. This article presents an image disguising approach: DisguisedNets, which allows users to securely outsource images to the cloud and enables confidential, efficient GPU-based model training. DisguisedNets uses a novel combination of image blocktization, block-level random permutation, and block-level secure transformations: random multidimensional projection (RMT) or AES pixel-level encryption (AES) to transform training data. Users can use existing DNN training methods and GPU resources without any modification to training models with disguised images. We have analyzed and evaluated the methods under a multi-level threat model and compared them with another similar method—InstaHide. We also show that the image disguising approach, including both DisguisedNets and InstaHide, can effectively protect models from model-targeted attacks.

A fault tolerance aware green IoT workflow scheduling algorithm for multi-dimensional resource utilization in sustainable cloud computing

In recent times, the distributed cloud computing landscape has witnessed a remarkable surge in processing vast amounts of data and the crucial need to maintain service level agreements (SLAs) between providers and consumers. In this dynamic environment, cloud resources are inherently multidimensional, encompassing computing machines and communication connections susceptible to failures and energy-related considerations. However, given two-objective energy and reliability optimization, existing time allocation policies focus primarily on optimizing a single intent, which leads to system degradation in environments that generate problematic constraints from executable processing units. To handle the shortcomings of the application placement policies, we suggest a solution in the form of a three-phase bi-objective workflow scheduling issue called (Bi-OWSP). This three-phase approach aims to optimize workflow scheduling by simultaneously considering energy and reliability as two vital objectives. To achieve this, we employ two distinct algorithms. First is the stepwise dynamic voltage and frequency scale algorithm ensures energy efficiency by calculating optimal frequencies, reducing energy usage, and minimizing task mapping time. The second algorithm is the reliability-conscious heterogeneous fault tolerance approach, which emphasizes avoiding high-deficit servers and communication links to enhance system reliability. Furthermore, we introduce an energy-aware stepwise reliability maximization algorithm, which intelligently selects the best combination of task-server pairs to achieve energy minimization and reliability maximization. Through extensive simulation experiments on artificial and real-world workflow applications, we demonstrate the significance of Bi-OWSP in providing superior energy-reliability compensation solutions compared to competing algorithms.

DBSCAN inspired task scheduling algorithm for cloud infrastructure

Cloud computing in today's computing environment plays a vital role, by providing efficient and scalable computation based on pay per use model. To make computing more reliable and efficient, it must be efficient, and high resources utilized. To improve resource utilization and efficiency in cloud, task scheduling and resource allocation plays a critical role. Many researchers have proposed algorithms to maximize the throughput and resource utilization taking into consideration heterogeneous cloud environments. This work proposes an algorithm using DBSCAN (Density-based spatial clustering) for task scheduling to achieve high efficiency. The proposed DBScan-based task scheduling algorithm aims to improve user task quality of service and improve performance in terms of execution time, average start time and finish time. The experiment result shows proposed model outperforms existing ACO and PSO with 13% improvement in execution time, 49% improvement in average start time and average finish time. The experimental results are compared with existing ACO and PSO algorithms for task scheduling.

Adaptive and Convex Optimization-Inspired Workflow Scheduling for Cloud Environment

Scheduling large-scale and resource-intensive workflows in cloud infrastructure is one of the main challenges for cloud service providers (CSPs). Cloud infrastructure is more efficient when virtual machines and other resources work up to their full potential. The main factor that influences the quality of cloud services is the distribution of workflow on virtual machines (VMs). Scheduling tasks to VMs depends on the type of workflow and mechanism of resource allocation. Scientific workflows include large-scale data transfer and consume intensive resources of cloud infrastructures. Therefore, scheduling of tasks from scientific workflows on VMs requires efficient and optimized workflow scheduling techniques. This paper proposes an optimised workflow scheduling approach that aims to improve the utilization of cloud resources without increasing execution time and execution cost.