Explore the vast range of titles available.

Big Data applications require extensive resources and environments to store, process and analyze this colossal collection of data in a distributed manner. Containerization with cloud computing provides a pertinent remedy to accommodate big data requirements, however requires a precise and appropriate load-balancing mechanism. The load on servers increases exponentially with increased resource usage thus making load balancing an essential requirement. Moreover, the adjustment of containers accurately and rapidly according to load as per services is one of the crucial aspects in big data applications. This study provides a review relating to containerized environments like Docker for big data applications with load balancing. A novel scheduling mechanism of containers for big data applications established on Docker Swarm and Microservice architecture is proposed. The concept of Docker Swarm is utilized to effectively handle big data applications' workload and service discovery. Results shows that increasing workloads with respect to big data applications can be effectively managed by utilizing microservices in containerized environments and load balancing is efficiently achieved using Docker Swarm. The implementation is done using a case study deployed on a single server and then scaled to four instances. Applications developed using containerized microservices reduces average deployment time and continuous integration.

Fog computing (FC) designates a decentralized computing structure placed among the devices that produce data and cloud. Such flexible structure empowers users to place resources to increase performance. However, limited resources and low delay services obstruct the application of new virtualization technologies in the task scheduling and resource management of fog computing. Scheduling and load balancing (LB) in the cloud computing have been widely studied. However, countless efforts in LB have been proposed in the fog architectures. This presents some enticing challenges to solve the problem of how tasks are routed between different physical devices between fog nodes and cloud. Within fog, due to its mass and heterogeneity of devices, the scheduling is very difficult. There are still few studies that have been conducted. LB is a very interesting and important study area in FC as it aims to achieve high resource utilization. There are various challenges in LB such as security and fault tolerance. The main objective of this paper is to introduce an effective dynamic load balancing technique (EDLB) using convolutional neural network and modified particle swarm optimization, which is composed of three main modules, namely: (i) fog resource monitor (FRM), (ii) CNN-based classifier (CBC), and (iii) optimized dynamic scheduler (ODS). The main purpose of EDLB is to achieve LB in FC environment via dynamic real-time scheduling algorithm. This paper studies the FC architecture for Healthcare system applications. The FRM is responsible for monitoring each server resource and save the server's data into table called fog resources table. The CNN-based classifier (CBC) is responsible for classifying each fog server to suitable or not suitable. The optimized dynamic scheduler (ODS) is responsible for assigning the incoming process to the most appropriate server. Comparing EDLB with other previous LB algorithms, it reduces the response time and achieves high resource utilization. Hence, it is an efficient way to ensure the continuous service. Accordingly, EDLB is simple and efficient in real-time systems in fog computing such as in the case of healthcare system. Although several methods in LB for FC have been introduced, they have many limitations. EDLB overcomes these limitations and achieves high performance in various scenarios. It achieved better makespan, average resource utilization and load balancing level as compared to previously mentioned LB algorithms.

The increasing dependence on cloud computing as a cornerstone of modern technological infrastructures has introduced significant challenges in resource management. Traditional load-balancing techniques often prove inadequate in addressing cloud environments’ dynamic and complex nature, resulting in suboptimal resource utilization and heightened operational costs. This paper presents a novel smart load-balancing strategy incorporating advanced techniques to mitigate these limitations. Specifically, it addresses the critical need for a more adaptive and efficient approach to workload management in cloud environments, where conventional methods fall short in handling dynamic and fluctuating workloads. To bridge this gap, the paper proposes a hybrid load-balancing methodology that integrates feature selection and deep learning models for optimizing resource allocation. The proposed Smart Load Adaptive Distribution with Reinforcement and Optimization approach, SLADRO , combines Convolutional Neural Networks (CNN) and Long Short-Term Memory (LSTM) algorithms for load prediction, a hybrid bio-inspired optimization technique—Orthogonal Arrays and Particle Swarm Optimization (OOA-PSO)—for feature selection algorithms, and Deep Reinforcement Learning (DRL) for dynamic task scheduling. Extensive simulations conducted on a real-world dataset called Google Cluster Trace dataset reveal that the SLADRO model significantly outperforms traditional load-balancing approaches, yielding notable improvements in throughput, makespan, resource utilization, and energy efficiency. This integration of advanced techniques offers a scalable and adaptive solution, providing a comprehensive framework for efficient load balancing in cloud computing environments.

Load balancing is a serious problem in cloud computing that makes it challenging to ensure the proper functioning of services contiguous to the Quality of Service, performance assessment, and compliance to the service contract as demanded from cloud service providers (CSP) to organizations. The primary objective of load balancing is to map workloads to use computing resources that significantly improve performance. Load balancing in cloud computing falls under the class of concerns defined as \"NP-hard\" issues due to vast solution space. Therefore it requires more time to predict the best possible solution. Few techniques can perhaps generate an ideal solution under a polynomial period to fix these issues. In previous research, Metaheuristic based strategies have been confirmed to accomplish accurate solutions under a decent period for those kinds of issues. This paper provides a comparative analysis of various metaheuristic load balancing algorithms for cloud computing based on performance factors i.e., Makespan time, degree of imbalance, response time, data center processing time, flow time, and resource utilization. The simulation results show the performance of various Meta-heuristic Load balancing methods, based on performance factors. The Particle swarm optimization method performs better in improving makespan, flow time, throughput time, response time, and degree of imbalance.

SDN is a new networking method that uses software controllers and physical infrastructure to guide network traffic. Due to its larger size, the network often experiences severe traffic congestion; load balancers improve network efficiency. Previous works used proactive or reactive load balancing, which caused substantial packet loss or shambolic data plane load balancing. In this research, we addressed previous concerns and introduced the Triple Tier model, a triple-tier architecture for intellectual edge aided Multi-controller Load Balancing utilizing AI. Three sequential processes—user selection, sensitivity-based flow categorization, and hybrid multi-controller load balancing—are presented. First, Interval Type-II Hesitant Fuzzy Entropy Measure (IT-II-HFE) method selects energy-efficient participants for service, avoiding abundant flows. We maintained the D-Plane device threshold level to improve reaction time and calculation. For sensitivity-aware processing, the Non-Deep Lightweight Parallel Network (ND-LPN) classifies arriving flows as delay-sensitive or non-delay-sensitive and prioritizes them for controller processing. Then, the global controller enabled proactive and reactive load balancing (PLB and RLB) for hybrid multi-controller load balancing (MCLB). The PLB is performed using Dual Agent-based Geometric Actor-Critic Algorithm (DAGAC) for flow engineer prediction-based load balancing. Finally, event-based Hybrid Leader Optimization Algorithm (HLO) is used for RLB, resulting in successful load balancing. The suggested AI-MLB model is tested in Network Simulator-3.26 and outperforms previous works in total load, packet loss rate, reaction time, number of migration, and network load.

In many computing and networking applications, arriving tasks have to be routed to one of many servers, with the goal of minimizing queueing delays. When the number of processors is very large, a popular routing algorithm works as follows: select two servers at random and route an arriving task to the least loaded of the two. It is well known that this algorithm dramatically reduces queueing delays compared to an algorithm, which routes to a single randomly selected server. In recent cloud computing applications, it has been observed that even sampling two queues per arriving task can be expensive and can even increase delays due to messaging overhead. So there is an interest in reducing the number of sampled queues per arriving task. In this paper, we show that the number of sampled queues can be dramatically reduced by using the fact that tasks arrive in batches (called jobs). In particular, we sample a subset of the queues such that the size of the subset is slightly larger than the batch size (thus, on average, we only sample slightly more than one queue per task). Once a random subset of the queues is sampled, we propose a new load-balancing method called batch-filling to attempt to equalize the load among the sampled servers. We show that, asymptotically, our algorithm dramatically reduces the sample complexity compared to previously proposed algorithms.

Cloud computing provides an opportunity to gain access to the large-scale and high-speed resources without establishing your own computing infrastructure for executing the high-performance computing (HPC) applications. Cloud has the computing resources ( i.e ., computation power, storage, operating system, network, and database etc .) as a public utility and provides services to the end users on a pay-as-you-go model. From past several years, the efficient utilization of resources on a compute cloud has become a prime interest for the scientific community. One of the key reasons behind inefficient resource utilization is the imbalance distribution of workload while executing the HPC applications in a heterogenous computing environment. The static scheduling technique usually produces lower resource utilization and higher makespan, while the dynamic scheduling achieves better resource utilization and load-balancing by incorporating a dynamic resource pool. The dynamic techniques lead to increased overhead by requiring a continuous system monitoring, job requirement assessments and real-time allocation decisions. This additional load has the potential to impact the performance and responsiveness on computing system. In this article, a dynamic enhanced resource-aware load balancing algorithm (DE-RALBA) is proposed to mitigate the load-imbalance in job scheduling by considering the computing capabilities of all VMs in cloud computing. The empirical assessments are performed on CloudSim simulator using instances of two scientific benchmark datasets ( i.e ., heterogeneous computing scheduling problems (HCSP) instances and Google Cloud Jobs (GoCJ) dataset). The obtained results revealed that the DE-RALBA mitigates the load imbalance and provides a significant improvement in terms of makespan and resource utilization against existing algorithms, namely PSSLB, PSSELB, Dynamic MaxMin, and DRALBA. Using HCSP instances, the DE-RALBA algorithm achieves up to 52.35% improved resources utilization as compared to existing technique, while more superior resource utilization is achieved using the GoCJ dataset.

Increasing and heterogeneous service demands have led to traffic increase, and load imbalance challenges among network entities in the Internet of Things (IoT) environments. It can affect Quality of Service (QoS) parameters. By separating the network control layer from the data layer, Software-Defined Networking (SDN) has drawn the interest of many researchers. Efficient data flow management and better network performance can be reachable through load-balancing techniques in SDN and improve the quality of services in the IoT network. So, the combination of IoT and SDN, with conscious real-time traffic management and load control, plays an influential role in improving the QoS. To give a complete assessment of load-balancing strategies to enhance QoS parameters in SDN-based IoT networks (SD-IoT), a systematic review of recent research is presented here. In addition, the paper provides a comparative analysis of the relevant publications, trends, and future areas of study that are particularly useful for the community of researchers in the field.

Cloud-edge-end (CEE) computing is a hybrid computing paradigm that converges the principles of edge and cloud computing. In the design of CEE systems, a crucial challenge is to develop efficient offloading strategies to achieve the collaboration of edge and cloud offloading. Although CEE offloading problems have been widely studied under various backgrounds and methodologies, load balance, which is an indispensable scheme in CEE systems to ensure the full utilization of edge resources, is still a factor that has not yet been accounted for. To fill this research gap, we are devoted to developing a dynamic load balance -aware CEE offloading strategy. First, we propose a load evolution model to characterize the influences of offloading strategies on the system load dynamics and, on this basis, establish a latency model as a performance metric of different offloading strategies. Then, we formulate an optimal control model to seek the optimal offloading strategy that minimizes the latency. Second, we analyze the feasibility of typical optimal control numerical methods in solving our proposed model, and develop a numerical method based on the framework of genetic algorithm. Third, through a series of numerical experiments, we verify our proposed method. Results show that our method is effective.

Fog computing minimizes latency and bandwidth consumption by processing data near the source, but it has the challenge of workload balancing across the dynamic and resource limited fog nodes. Uneven task assignment can result in bottlenecks, idle resources, and lowered Quality of Service (QoS) standards. In this work, we introduce a hybrid metaheuristic load balancing algorithm for fog computing by combining the Bacterial Colony Optimization (BCO) and the Particle Swarm Optimization (PSO) techniques to enhance load balancing. BCO has good solution space exploration capabilities, whereas PSO has the advantage of quick convergence; the hybrid takes advantage from both to achieve reduced makespan with better VM usage. The proposed algorithm has been developed in the Python language, with original BCO and hybrid modules, along with a standard PSO executable. The program has been tested on a synthetic offline task–VM dataset generated by CloudSim 6.0 with size ranges from 100 to 10,000 tasks and poison distribution of variety of tasks arriving, with identical experiment settings. The results indicate the hybrid BCO–PSO to exhibit significant makespan reduction with increased VM utilization compared to the individual BCO, PSO, as well as the Adaptive Inertia Weight Particle Swarm Optimization (AIW–PSO) algorithms for most test scenarios, with faster convergence for high workload scenarios. In the high-load cases, the hybrid reduced makespan by 32.76% compared to AIW–PSO for 5000 tasks and by 35.79% compared to AIW–PSO for 10000 tasks. These experimental results indicate that the proposed hybrid algorithm can be an effective, adaptive solution for task allocation in fog-inspired computational scheduling scenarios. This evaluation focuses on computation-side task scheduling using a synthetic task–VM model and keeping network-level factors such as latency or bandwidth idle.