Search

In the realm of heterogeneous computing, the efficient allocation of resources is pivotal for optimizing system performance. However, user-submitted tasks are often complex and have varied resource demands. Moreover, the dynamic nature of resource states in such platforms, coupled with variations in resource types and capabilities, results in significant intricacy of the system environment. To this end, we propose a scheduling algorithm based on hierarchical reinforcement learning, namely MD-HRL. Such an algorithm could simultaneously harmonize task completion time, device power consumption, and load balancing. It contains a high-level agent (H-Agent) for task selection and a low-level agent (L-Agent) for resource allocation. The H-Agent leverages multi-hop attention graph neural networks (MAGNA) and one-dimensional convolutional neural networks (1DCNN) to encode the information of tasks and resources. Kolmogorov–Arnold networks is then employed for integrating these representations while calculating subtask priority scores. The L-Agent exploits a double deep Q network to approximate the best strategy and objective function, thereby optimizing the task-to-resource mapping in a dynamic environment. Experimental results demonstrate that MD-HRL outperforms several state of the art baselines. It reduces makespan by 12.54%, improves load balancing by 5.83%, and lowers power consumption by 6.36% on average compared with the suboptimal method. [ABSTRACT FROM AUTHOR]

In optical data center networks, the utilization of several software-defined network controllers has been implemented to enhance scalability and reliability. However, during dynamic variations in network traffic, static controller deployment often leads to load imbalance among the controllers. Previous studies have proposed dynamic switch migration as a solution to realize controller load balancing. However, the effectiveness of existing switch migration methods remains insufficient. The load balancing performance of controllers demonstrates limited enhancement following migration, and the migration operations themselves result in supplementary costs. As a result, the issue of switch migration efficiency remains unresolved. To tackle controller load balancing, this research introduces the intelligent controller load balancing (ICLB). ICLB incorporates multiple load metrics to evaluate controller load and selects the ideal target controller based on available resources, leading to enhanced load balancing effectiveness. Moreover, it selects switches while the minimizing migration process, effectively reducing supplementary expenses. Additionally, ICLB can simultaneously manage the workload of multiple controllers during a switch migration process, resulting in enhanced migration efficiency. The outcomes of simulations provide evidence that ICLB offers substantial improvements in controller load balancing performance, along with reduced migration expenses compared to existing solutions. [ABSTRACT FROM AUTHOR]

A scheduling method based on equipment load balancing rules is proposed to solve the problem of unbalanced load of each observing device in traditional space target monitoring resource scheduling. In this paper, the visibility of space targets is taken as the mathematical basis, STK software package is used to forecast the visibility of tracking arcs of space targets, the equipment load balancing scheduling rules are integrated into the traditional scheduling process, and the observation requirements are respectively 3 laps, 4 laps and 5 laps as the input for experimental simulation. The generated scheduling scheme is presented in the form of Gantt chart. Finally, the constructed evaluation index is used to evaluate the value. The experimental results show that the scheduling rules based on equipment load balancing can well achieve the balance of the working time of each observation equipment, and can realize the tracking and monitoring of more space targets. [ABSTRACT FROM AUTHOR]

The distributed energy power system needs to provide sufficient and flexible computing power on demand to meet the increasing digitization and intelligence requirements of the smart grid. However, the current distribution of the computing power and loads in the energy system is unbalanced, with data center loads continuously increasing, while there is a large amount of idle computing power at the edge. Meanwhile, there are a large number of real-time computing tasks in the distributed energy power system, which have strict requirements on execution deadlines and require reasonable scheduling of multi-level heterogeneous computing power to meet real-time computing demands. Based on the aforementioned background and issues, this paper studies the real-time service scheduling problem in a multi-level heterogeneous computing network of distributed energy power systems. Specifically, we consider the divisibility of tasks in the model. This paper presents a hierarchical real-time task-scheduling framework specifically designed for distributed energy power systems. The framework utilizes an orchestrating agent (OA) as the execution environment for the scheduling module. Building on this, we propose a hierarchical selection algorithm for choosing the appropriate network layer for real-time tasks. Further, we develop two scheduling algorithms based on greedy strategy and genetic algorithm, respectively, to effectively schedule tasks. Experiments show that the proposed algorithms have a superior success rate in scheduling compared to other current algorithms. [ABSTRACT FROM AUTHOR]

Network function virtualization (NFV) has been proposed to enable flexible management and deployment of the network service in cloud. In NFV architecture, a network service needs to invoke several service functions (SFs) in a particular order following the service chain function. The placement of SFs has significant impact on the performance of network services. However, stochastic nature of the network service arrivals and departures as well as meeting the end-to-end Quality of Service(QoS) makes the SFs placement problem even more challenging. In this paper, we firstly provide a system architecture for the SFs placement of cloud service with end-to-end QoS deadline. We then formulate the end-to-end service placement as a Markov decision process (MDP) which aims to minimize the placement cost and the end-to-end delay. In our MDP, the end-to-end delay of active services in the network is considered to be the state of the system, and the placement (nonplacement or placement) of SF is considered as the action. Also, we discuss the rationality of our analytical model by analyzing the Markov stochastic property of the end-to-end service placement. To obtain the optimal placement policy, we then propose an algorithm (Algorithm 1) for dynamic SFs placement based on our model and use successive approximations, i.e. |$\epsilon $| -iteration algorithm (Algorithm 2) to obtain action distribution. Finally, we evaluate the proposed MDP by comparing our optimal method with DDQP, DRL-QOR, MinPath and MinDelay for QoS optimization, including acceptance probability, average delay, resource utilization, load-balancing and reliability. [ABSTRACT FROM AUTHOR]

Task scheduling in a process where the cloud has attained substantial attention because of an enhanced demand for computing resources and services. Various load balancing approaches are developed for allocating the tasks and Virtual Machines (VMs) according to the task's priority and execution. However, there are some problems faced in the identification of the best tasks for allocation and to classify the relevant tasks based on the load. In this research, Fuzzy Logic (FL) and Cosine Similarity based Golden Jackal Optimization (CSGJO) algorithm is proposed for solving the problem of load balancing and task scheduling in CC. The FL optimally distributes the tasks based on their fuzzy rules, whereas the CSGJO improves fuzzy rule sets and identifies the optimal resource allocation, minimizing the response time even when handling large number of tasks. The Longest Job to Fastest Processor (LJFP) and Minimum Completion Time (MCT) approaches are the heuristic approaches used to initialize CSGJO. The multiobjective functions of Makespan, Degree of Imbalance (DOI), Execution Time, Energy Consumption and Resource Utilization for validating the proposed method's effectiveness. The CSGJO consumes a minimum makespan of 1.9s, as opposed to Particle Swarm Optimization (PSO) and Enhanced Sunflower Optimization (ESFO). [ABSTRACT FROM AUTHOR]

Summary: The rapid expansion of IoT systems has caused network congestion and delays in task placement and resource provisioning as usually the tasks are executed at a far location in the cloud. Fog computing reduces the computing burden of cloud data centers as well as the communication burden of the internet as fog resources are placed near the data generation points. Within Fog computing, an important challenge is the optimal task placement which is an NP‐class problem. This work applies machine learning for task clustering and addresses the task placement problem in a fog computing environment using a hybrid of two recent metaheuristics; Jaya and gray wolf optimization (GWO). The hybrid method considers optimizing the total number of active fog nodes, load balancing in fog nodes, and average response time of the tasks. The performance of the proposed method is evaluated on a real‐time LCG dataset and is compared with reinforcement learning fog scheduling (RLFS), genetic algorithm (GA), dynamic resource allocation mechanism (DRAM), load balancing and scheduling algorithm (LBSSA), and particle swarm optimization with simulated annealing (PSO‐SA) algorithms. The results demonstrate the superiority of the suggested method over the baseline techniques in terms of average improvement of 51.04% in load balance variance, 30.25% in average response time, 24.16% in execution time, and 47.10% in the number of devices used. [ABSTRACT FROM AUTHOR]

In this paper, a modern classification of load balancing strategies in cloud computing is presented that can help researchers and practitioners to better understand and select the most appropriate algorithms for their specific needs. Our classification covers three main types of load balancing algorithms including static heuristics, dynamic heuristics, and metaheuristic algorithms. We thoroughly evaluate each type of techniques and identify their respective benefits and drawbacks. Static heuristics are easy to implement and require minimal computational resources, but may yield suboptimal allocations due to significant workload variations. Dynamic heuristics are more adaptable but may incur higher overhead costs due to frequent updates. Metaheuristic algorithms offer highly optimized solutions but may be computationally expensive and not always guarantee optimal results. In addition to offering a framework for understanding various load balancing algorithms, our classification can help researchers and practitioners select the most suitable algorithm for their specific needs and constraints. By taking into account factors such as workload variability, resource availability, and computational limitations, users can choose an algorithm that optimally addresses their requirements, while simultaneously minimizing overhead costs and enhancing efficiency. [ABSTRACT FROM AUTHOR]

Ensuring optimal load balancing is imperative for maintaining reliability and upholding quality of service as specified in service-level agreements (SLAs) for cloud computing providers. This research addresses the most common shortcomings of existing state-of-the-art methods, which often lack responsiveness and struggle to adapt to exponentially increasing demand, especially in the era of the internet of things (IoT). The proposed hybrid approach surpasses current literature approaches in performance metrics such as makespan, response time, number of cloudlet migrations, and SLA violations. It operates on two levels, initially employing a k-means clustering algorithm to group servers within each datacenter based on similar utilization rates. Subsequently, a round-robin method allocates task groups sequentially to non-overloaded clusters, and within each cluster, a genetic algorithm optimally assigns tasks to servers. This multilayered approach facilitates hot-deployment and scalability in operational cloud environments while promoting strong interoperability and decoupling of core mechanisms missions. Simulation experiments conducted on CloudSim Plus validate the superiority of our method, positioning it as a robust solution for enhancing load balancing and tasks scheduling in cloud environments, especially in the face of rapidly increasing IoT-related demands. [ABSTRACT FROM AUTHOR]

This work presents a performance-oriented study of a heterogeneous application developed with Intel OneAPI to solve two well-known diffusion problems: heat diffusion and image denoising. We have explored CPU+iGPU and CPU+FPGA schemes, applying dynamic load balancing and conducting experiments on Intel DevCloud. The results demonstrate that the CPU+iGPU scheme outperforms the execution times achieved by the fastest device when the problem is sufficiently computationally demanding. We also found that the performance of the CPU+FPGA scheme is heavily affected by bandwidth limitations and specific strategies to manage memory efficiently are required. Moreover, it was demonstrated that dynamic workload balancing is crucial due to possible performance fluctuations in any of the implicated devices. In conclusion, Intel OneAPI provides a helpful tool for multi-platform development using a unique high-level language, DPC++. However, developing specific code for each platform is necessary to achieve optimal performance. [ABSTRACT FROM AUTHOR]

Summary: Flying ad hoc network (FANET) is a technology that has seen tremendous growth in the past years due to its application in various military and civil developments. Conventional topology‐aided routing schemes are not suitable for large‐scale FANETs. This is because of the higher mobility rate in UAVs with the architecture differences. Hence, several path entries in routing become invalid and the neighboring nodes can be occupied before the interruption. Hence, it is very important to solve the afore‐explained issues in FANET. Initially, the task is assigned to the UAVs. These tasks are performed by satisfying the demands such as timing, congestion, and energy to attain the effective load‐balancing performance. Then, the optimal clustering and cluster head (CH) selection are performed using the developed Percentage of Circle Search and Spotted Hyena Optimizer (PCSSHO) in the communication path. Here, the feature selection is done based on constraints like position, speed, moving direction, height variation, link quality, and inter‐ and intra‐cluster distance. Then, the developed PCSSHO model performs routing by considering different constraints such as "end‐to‐end delay, delivery ratio, power consumption, and link quality." Thus, the recommenced load balancing model in FANET secures an enhanced performance rate than the conventional load balancing frameworks. [ABSTRACT FROM AUTHOR]

In practical applications, an engineer is sometimes expected to execute the step test for tuning the controller without waiting much for the steady-state or a low level of disturbances. Hence, knowing that the initial settings may not be quite reliable, he/she detunes the controller by reducing its gain as a precaution against possible poor behaviour of the closed-loop system. It is up to their experience to choose by how much to detune. Therefore, the development of a practically oriented approach that would assist the engineer to choose the degree of gain reduction is the goal of this paper. The approach assumes that process parameters are determined by the least-squares approximation of the step response. Accuracy of the approximation is evaluated by a relative approximation error involving integrals of the error and the process response itself. The SIMC tuning rules are applied to choose the initial controller settings. The approach relies on detecting by simulation the worst case that may happen when the step response is triggered at any time. Detuning nomograms specify by how much to reduce the initial gain for PI-FOPTD and PID-SOPTD designs, given the relative approximation error. Two long-lasting lab experiments involving temperature control identify a plant, verify the load disturbance model through multiple step tests and demonstrate usage of the approach in the closed-loop system. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) infrastructure has to be balanced for maintaining the Quality of Service (QoS) in the network. However, load balancing technology is complex for meeting the requirements of high flexibility and adaptability due to the conventional WSN architecture. The major complication for developing distributed techniques for these models is load balancing that is the major aim of this study. These distributed methodologies use routing decisions that must be efficient without the need for more information about the system, where one of the efficient techniques is probabilistic routing. This paper plans to conduct a critical literature review on a diverse centralised server for controlling the load balancing in the cloud and routing strategies in WSN as well as linked with an IoT systems. This study reviews a set of contributions regarding load balancing in the cloud and routing strategies in WSN with clear algorithmic analysis. The simulation tools and recorded performance measures are also analysed and sorted out. Finally, the existing research gaps and the future directions are expedited that to be adaptable to attain better protocol performance with a centralised server in balancing node traffic, load balancing in the cloud and improving the throughput of the entire network. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Load balancing is crucial in distributed systems like fog computing, where efficiency is paramount. Offloading with different approaches is the key to balancing the load in distributed environments. Static offloading (SoA) falls short in heterogeneous networks, necessitating dynamic offloading to reduce latency in time-sensitive tasks. However, prevalent dynamic offloading (PoA) solutions often come with hidden costs that impact sensitive applications, including decision time, networks congested and distance offloading. This paper introduces the Hybrid Offloading (HybOff) algorithm, which substantially enhances load balancing and resource utilization in fog networks, addressing issues in both static and dynamic approaches while leveraging clustering theory. Its goal is to create an uncomplicated low-cost offloading approach that enhances IoT application performance by eliminating the consequences of hidden costs regardless of network size. Experimental results using the iFogSim simulation tool show that HybOff significantly reduces offloading messages, distance, and decision-offloading consequences. It improves load balancing by 97%, surpassing SoA (64%) and PoA (88%). Additionally, it increases system utilization by an average of 50% and enhances system performance 1.6 times and 1.4 times more than SoA and PoA, respectively. In summary, this paper tries to introduce a new offloading approach in load balancing research in fog environments. [ABSTRACT FROM AUTHOR]

Avionics systems are a crucial part of aircraft, and the heterogeneity of resources also leads to load differentials within these systems. Inefficient load balancing technology faces the dual challenge of over-utilization and under-utilization of resources, which results in the decline of service performance (in the case of over-utilization) or the waste of resources (in the case of under-utilization). However, it is necessary to control avionics systems via an efficient load balancing method under time constraints and resource states. Therefore, this paper proposes a load balancing method for avionics systems using both artificial bee colony and simulated annealing algorithms. First, the load balancing model of avionics systems is established; this model can reflect the demands of the tasks for the resources in detail. Then, the load balancing of avionics systems is realized by artificial bee colony and simulated annealing algorithms, the hybrid algorithm not only retains the advantages of simple and easy implementation of ABC algorithm, but also utilizes the probability jump of SA algorithm to jump out of the local extreme and achieve the effect of global optimization. Finally, compared with the existing algorithms, the experimental results show that the algorithm proposed in this paper produces a good and stable load balance performance. [ABSTRACT FROM AUTHOR]

Heterogeneous wireless sensor networks with mobile supernodes consist of n sensors and m mobile supernodes. Disjoint paths are used in these networks to enhance fault tolerance, improve the network lifetime, and implement an effective load distribution. The network topology is disrupted because disjoint paths disappear when a supernode changes its location to improve the network lifetime and avoid the death of adjacent nodes. This paper proposes a distributed method for finding disjoint paths from ordinary sensors to mobile supernodes when supernodes move to new locations. The proposed algorithm will have a message complexity of O(n²∆) and an execution time of O(n²∆²), in which n denotes the number of nodes, and ∆ indicates the highest node degree. According to evaluation results, mobile supernodes led to a 96% longer lifetime than static supernodes, and the network fault tolerance with mobile supernodes was 7.1 times higher than the fault tolerance with static supernodes. [ABSTRACT FROM AUTHOR]

With due span of time, Cloud computing has grown phenomenally as it is a best approach for using the scalable shared pool of resources at economical cost. Though it seems easy but distribution of the jobs assigned to various Virtual Machines (VMs) is a cumbersome task for the Data Centre (DC) Controller. Various techniques have been proposed from time-to-time for balancing the load on distinct VMs available in the DCs. The primarily used load balancing techniques are Round Robin, Equal Spread Current Execution and Throttled. The major thrust for using the aforementioned techniques is to improve the performance parameters such as Overall Response Time (ORT), Data Center Processing Time (DCPT) and Cost. In this manuscript, a new algorithm named Pragmatic Load Balancing (PLB) has been designed and developed for optimization of afore-said parameters and various simulation scenarios have also been created for the evaluation of these parameters. In the given Scenarios created by using Cloud Analyst Simulator, different number of VMs like 20, 40, 60, 80 and 100 have been allotted with distinct number of DCs from 1 to 5 to the application at each Cloud Configuration and the divulged that the value of the performance parameters have been improved by using the PLB Algorithm in comparison to other available Load Balancing Algorithms. [ABSTRACT FROM AUTHOR]

INTRODUCTION: In present days, Automation of everything has become essential. Internet of things (IoT) play an important role among all medical advances of IT. In this paper, feasible solutions are discussed to compare and design better healthcare systems. A thorough investigation and survey of suitable approaches were done to select IoT based systems in hospitals consisting of various high precision sensors. OBJECTIVES: The challenge healthcare system face is to manage the real time patient’s data with high accuracy. Second challenge is at fog devices level to manage the load distribution to all sensors with limited availability of bandwidth. METHODS: This paper summarizes the selection criterions of suitable load balancing algorithms to reduce energy consumption and computational cost of fog devices and increase the network usage that are supposed to be used in IoT based healthcare systems. According to the survey BNBKnapack algorithm has been selected as best suitable approach to analyze the overall performance of fog devices and results are also verify the same. RESULTS: Comparative analysis of Overall performance of fog devices has been proposed with using SJF algorithm and Adaptive BNBKnapsack algorithm. It has been observed by analysing system performance, which is found as best among other load balancing algorithm Adaptive BNBKnapsack is successfully reduce the energy consumption by (99.29%), computational cost by (98.34%) and increase the network usage by (99.95%) of system CONCLUSION: It has been observed by analysing system performance, Adaptive BNBKnapsack Load balancing is successfully able to reduce the computational cost and energy consumption also increase the network usage of the fog network. The performance of the system is found best among other load balancing algorithm. [ABSTRACT FROM AUTHOR]

Resource allocation plays a pivotal role in Cloud Computing (CC), significantly impacting its overall performance. In order to fairly spread workload among servers, network ports, and hard drives, task scheduling is a critical module of CC. Cloud computing experiences request overloading as a result of dynamic computing over the internet. To address this challenge, a novel Cloud based Load balancing using Quantum artificial bee colony Optimization Algorithm has been proposed for task scheduling that can significantly enhance the effectiveness of cloud computing operations. The technique focuses on two important aspects of cloud computing: resource allocation and task scheduling. By achieving load balancing between servers, the proposed CLUQOA (Cloud based Load balancing Using Quantum artificial bee colony Optimization Algorithm) improves reliability and lowers expenses, latency, and response times. To show how effective it is, key performance parameters including makespan, resource usage, task migration, task execution time, and response time are assessed. The results of comparative comparisons with other approaches, such as HUNTER (Holistic resoUrce maNagemenT technique for Energy-efficient cloud computing using aRtificial intelligence), FPNSO (Flower Pollination based Non-dominated Sorting Optimization), and ProHPA (Proactive Hybrid Pod Autoscaling), demonstrate the superiority of CLUQOA in terms of improving resource utilization (35.6%, 26.4%, and 13.9%, respectively) and reducing makespan (11.02%, 9.6%, and 10.4%, respectively). [ABSTRACT FROM AUTHOR]

The resilient concept of cloud computing (CC) enables individuals and businesses to access the necessary services following their requirements. The methodology presents various functionalities like storage solutions, deployment platforms, convenient admittance to online services, and more. A significant issue in CC is load balancing (LB), which reduces the performance and effectiveness of the resources. The LB can be attained through (Task / Virtual Machine) scheduling and allocation. This research considers virtual machine (VM) allocation, which allocates VM to a suitable physical machine (PM). Implementing an efficient VM allocation approach is essential for mitigating energy consumption (EC) and service level agreement (SLA) breaches. This study presents an effectual LB model for CC based on state and randomization. Based on host utilization, the proposed approach first identifies the PM's current state (high, medium, and low). Next, select the suitable PM for VM allocation using a randomization approach. The Cloudsim toolkit is employed for simulating the suggested technique, and the PlanetLab workload is used to evaluate the performance regarding EC and SLA violations. The proposed approach is compared with MFPED (Medium-Fit Power Efficient Decreasing) and HVMAP (Hybrid VM Allocation and Placement). The experimental outcome shows that the proposed technique significantly lowers EC by 40.81% and 39.76% and SLA violation by 96.81% and 95.58% for MFPED and HVMAP methods. [ABSTRACT FROM AUTHOR]

Residue-level coarse-grained (CG) molecular dynamics (MD) simulation is widely used to investigate slow biological processes that involve multiple proteins, nucleic acids, and their complexes. Biomolecules in a large simulation system are distributed non-uniformly, limiting computational efficiency with conventional methods. Here, we develop a hierarchical domain decomposition scheme with dynamic load balancing for heterogeneous biomolecular systems to keep computational efficiency even after drastic changes in particle distribution. These schemes are applied to the dynamics of intrinsically disordered protein (IDP) droplets. During the fusion of two droplets, we find that the changes in droplet shape correlate with the mixing of IDP chains. Additionally, we simulate large systems with multiple IDP droplets, achieving simulation sizes comparable to those observed in microscopy. In our MD simulations, we directly observe Ostwald ripening, a phenomenon where small droplets dissolve and their molecules redeposit into larger droplets. These methods have been implemented in CGDYN of the GENESIS software, offering a tool for investigating mesoscopic biological processes using the residue-level CG models. Here, the authors report the development of heterogeneous domain decomposition with load balancing for large biological molecular dynamics simulations using residue-level coarse-grained models. [ABSTRACT FROM AUTHOR]

Vehicular edge computing (VEC) effectively reduces the computational burden on vehicles by offloading tasks from resource-constrained vehicles to edge nodes. However, non-uniformly distributed vehicles offloading a large number of tasks cause load imbalance problems among edge nodes, resulting in performance degradation. In this paper, we propose a deep reinforcement learning-based decision scheme for task offloading and load balancing with the optimization objective of minimizing the system cost considering the split offloading of tasks and the load dynamics of edge nodes. First, we model the mutual interaction between mobile vehicles and Mobile Edge Computing (MEC) servers using a Markov decision process. Second, the optimal task-offloading and resource allocation decision is obtained by utilizing the twin delayed deep deterministic policy gradient algorithm (TD3), and server load balancing is achieved through edge collaboration using a server selection algorithm based on the technique for order preference by similarity to the ideal solution (TOPSIS). Finally, we have conducted extensive simulation experiments and compared the results with several other baseline schemes. The proposed scheme can more effectively reduce the system cost and increase the system resource utilization. [ABSTRACT FROM AUTHOR]

To perform a set of tasks in a robotic network cloud system as fast as possible, it is recommended to use a scheduling approach that minimizes the makespan. The makespan is defined as the time between the start of the first scheduled task and the completion of all scheduled tasks. Load balancing is a technique to distribute incoming tasks across processing units in a way that the resource utilization is optimized and the makespan is minimized. Robotic network cloud systems can be conceptualized as graphs, with nodes representing hardware with independent computing power and edges representing data transmissions between the nodes. The initial scheduler assigns a set of newly arrived tasks to the processing units capable of performing them. To reduce the response time we can replicate some of the tasks and assign them to different processing units. This results in some tasks becoming redundant. Assigning redundant tasks refers to determining which processing unit should receive the replicated tasks. Load balancing for redundant allocation can be viewed as assigning tasks to multiple processing units with different resource sizes so that the load is evenly distributed among the units. We propose a technique for load balancing, the ordered balancing algorithm, to minimize the makespan in the redundant allocation and scheduling problem. We prove theoretically the correctness of the proposed algorithm and illustrate with simulations, using R version 4.0.3, the obtained results that outperform other recent load balancing proposals. [ABSTRACT FROM AUTHOR]

The aim of this study is to propose an image processing device based on load balancing algorithm, which can realize efficient and accurate data processing in physical fitness detection. The characteristics of optical sensor image processing equipment and the demand of physical fitness detection are studied and analyzed. Then, according to the principle and strategy of load balancing, a load balancing algorithm suitable for iot optical sensor image processing equipment is designed. The algorithm can automatically adjust the task allocation according to the load of the device and ensure the load balance of each device. Finally, the experiment is carried out in the actual scene, and the comparison with the traditional method is analyzed. The experimental results show that the iot optical sensor image processing equipment based on load balancing algorithm has excellent performance in the physical fitness detection. It can effectively reduce the load pressure of the equipment and improve the speed and accuracy of data processing. The application potential of the equipment is huge, and it can play an important role in sports training, health monitoring and other fields. [ABSTRACT FROM AUTHOR]

Mobile edge computing is an important element in ensuring the efficiency of the 5G network as a whole, as it enables data storage and computing at the network edge. Existing solutions do not fully address the issues of load distribution between computing nodes, and most solutions do not offer methods for verifying computations and controlling errors. Accordingly, this paper aims to develop an approach to the organization of mobile edge computing in a 5G mobile network that would authenticate distribution servers and computing nodes, manage the process of distributing computing nodes, have a procedure for verifying the correctness of calculations, and take into account the parameters of computing nodes during distribution. To achieve this goal, we propose to use the developed method. The method of load balancing and selection of computing nodes for edge computing via 5G allows for identifying available nodes and distributing computing blocks among them. It also provides mutual authentication of elements and includes a method of data verification and error detection for the MEC system. The provided solution allows for controlling errors during calculations and protecting the server from incorrect data. These methods are optimized according to minimum network resources and computing time criteria. These improvements increase the efficiency of mobile edge computing in a 5G network [ABSTRACT FROM AUTHOR]

Fog computing has emerged as a viable concept for expanding the capabilities of cloud computing to the periphery of the network allowing for efficient data processing and analysis from internet of things (IoT) devices. Load balancing is essential in fog computing because it ensures optimal resource utilization and performance among distributed fog nodes. This paper proposed an ensemble-based load-balancing approach for fog computing environments. An advanced ensemble load balancing approach (AELBA) uses real-time monitoring and analysis of fog node metrics, such as resource utilization, network congestion, and service response times, to facilitate effective load distribution. Based on the ensemble's collective decision-making, these metrics are fed into a centralized load-balancing controller, which dynamically adjusts the load distribution across fog nodes. Performance of the proposed ensemble load-balancing approach is evaluated and compared it to traditional load-balancing techniques in fog using extensive simulation experiments. The results demonstrate that our ensemble-based approach outperforms individual load-balancing algorithms regarding response time, resource utilization, and scalability. It adapts to dynamic fog environments, providing efficient load balancing even under varying workload conditions. [ABSTRACT FROM AUTHOR]

With the development of intelligent vehicles, the vehicle image processing system has put forward increasing demand for computing resource utilization efficiency and real-time processing. However, the traditional information processing method that binds software and hardware severely restricts the efficient use of image processing resources. In order to solve this problem, this paper proposes a resource reconstruction scheme based on a load balancing strategy, which can realize unified management and dynamic allocation of image processing resources by establishing a system resource view. Then, this paper builds a physical verification platform and constructs a comparative verification experiment to verify the effectiveness of the resource reconstruction scheme. Experimental results prove that this resource reconstruction scheme can effectively improve the resource utilization efficiency of multi-core digital signal processing (DSP), realize software-defined hardware functions, and optimize the real-time performance of parallel processing. [ABSTRACT FROM AUTHOR]

Cloud computing has become one of the key technologies used for big data processing and analytics. User management on cloud platforms is a growing challenge as the number of users and the complexity of systems increase. In light of the user-management system provided by major cloud service providers, which cannot manage multiple types of user systems, this article proposed scale-out automated expansion user management for authorization synchronization to improve the efficiency and scalability of user management on cloud platforms. Three modules for user-automated expansion were designed and implemented to synchronize the authentication information from the cloud platform resource user to the data-processing user. Additionally, an optimized dynamically weighted load-balancing algorithm in Nginx is presented in this article that adjusts the weight according to load information such as CPU and memory usage, and a better load balance can be achieved. The effectiveness of the proposed user-management system is substantiated by comparing it with two existing infrastructures, including multiple data centers and the Huawei cloud platform. The experimental results validate the finding that scale-out automated expansion user management across the Huawei cloud platform can effectively synchronize data accessing authority with cloud resource utilizing authority. Furthermore, the optimized weighted load-balancing algorithm is also valuable for massive concurrent user registration based on limited cloud resources. In the future, this scale-out user-management system could be applied to other cloud platforms and extended by database synchronization to satisfy the needs of data sharing among multiple types of users belonging to different cloud platforms. [ABSTRACT FROM AUTHOR]

The Internet of things (IoT) paradigm has emerged to connect the number of devices using the Internet resulting in the deployment of smart cities. Cloud computing has been applied to execute the computational demands of IoT devices by collecting data from the physical environment of a smart city. However, cloud computing could not become a proper choice for latency-sensitive applications because of remote cloud data centers. To overcome this challenge, fog computing has emerged to deal with the inherent limitations of cloud computing environment through provision of computing to the edge of a network. However, resource allocation of IoT service requests among fog nodes is considered as an NP-hard problem, which should be addressed in the fog computing environment. In this paper, an efficient optimization approach based on improved binary particle swarm optimization (IBPSO) algorithm has been provided for resource allocation of IoT requests in the hybrid fog–cloud computing environment. The proposed method aims to reduce the service request latency with ensuring load balancing among fog nodes. The performance of the proposed algorithm has been compared by the binary genetic algorithm (BGA), binary particle swarm optimization (BPSO), binary grey wolf optimization (BGWO)-based, and ranked-based resource allocation methods in terms of latency, missed deadline requests, run time, and load balancing. The results show that the proposed algorithm outperformed with an average of around 11 % , 22 % , 21 % , and 22 % percent in the IBPSO-based method rather than the BGA-based, BPSO-based, BGWO-based, and ranked-based resource allocation methods, respectively. Moreover, the resource allocation based on IBPSO achieved around 11 % , 28 % , 27 % , and 25 % decline in total latency compared to the BGA-based, BPSO-based, BGWO-based, and ranked-based resource allocation methods. Furthermore, the run time of the proposed algorithm could enhance by 45 % , 9 % , and 8 % compared to the BGA-based, BPSO-based, and BGWO-based resource allocation methods. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have emerged as a one of the most fascinating areas of lookup in the past few years principally due to its massive quantity of workable applications. However limited energy, node deployment strategy, routing techniques has considerable impact on the overall performance of network. This paper proposes sustainable honey bee ratel based hybrid wireless sensor network (SHHWSN) layering framework for improving load balancing and scalability issues in network. In SHHWSN tessellated hexagonal shape clusters are formed to cover entire geographical region without any gaps. Hybrid routing schema constrained with redundant data identification policy used in this, seeks to optimize energy utilization. The proposed SHHWSN was evaluated and validated by simulation, and the results were compared with earlier schematics where mostly one sided stochastic node deployments were followed. The experimental results show that SHHWSN has superior performance in terms of network alive nodes, delay, energy and throughput. The proposed SHHWSN obtained values of 50 nodes is 3, 0.061, 0.14, 0.89, 100 nodes is 3,0.037, 0.19, 0.551, 150 nodes is 13, 0.081, 0.23, 0.415, and 200 nodes is 23, 1.01, 0.25, 0.356, which is significantly more effective than current techniques. [ABSTRACT FROM AUTHOR]

As the internet data centers are mushrooming, the energy consumption and carbon emission of data centers are increasing rapidly. To cut down the electricity cost and carbon emission of the data centers, we proposed an optimization method to reduce the electricity cost and carbon emission in geo-distributed multiple data centers. In the proposed method, the carbon tax is considered in the overall operation cost to optimize the carbon emission. The spatial and temporal flexibility of computational workload is fully utilized by considering the difference in renewable energy power output, local electricity and carbon emission of multiple geo-distributed data centers to achieve a better performance. Furthermore, the nonlinear characteristics of the power loss of uninterruptible power supply (UPS) are considered in the optimization. To verify the proposed optimization method, simulation of six cases is carried out with realistic data, and results have proved the proposed method can reduce the operational costs by 4.93%-12.7% and decrease carbon emissions by up to 10%. [ABSTRACT FROM AUTHOR]

With the surge in cyber attacks, there is a pressing need for more robust network intrusion detection systems (IDSs). These IDSs perform at their best when they can monitor all the traffic coursing through the network, especially within a software-defined network (SDN). In an SDN configuration, the control plane and data plane operate independently, facilitating dynamic control over network flows. Typically, an IDS application resides in the control plane, or a centrally located network IDS transmits security reports to the controller. However, the controller, equipped with various control applications, may encounter challenges when analyzing substantial data, especially in the face of high traffic volumes. To enhance the processing power, detection rates, and alleviate the controller's burden, deploying multiple instances of IDS across the data plane is recommended. While deploying IDS on individual switches within the data plane undoubtedly enhances detection rates, the associated costs of installing one at each switch raise concerns. To address this challenge, this paper proposes the deployment of IDS chains across the data plane to boost detection rates while preventing controller overload. The controller directs incoming traffic through alternative paths, incorporating IDS chains; however, potential delays from retransmitting traffic through an IDS chain could extend the journey to the destination. To address these delays and optimize flow distribution, our study proposes a method to balance flow assignments to specific IDS chains with minimal delay. Our approach is validated through comprehensive testing and evaluation using a test bed and trace-based simulation, demonstrating its effectiveness in reducing delays and hop counts across various traffic scenarios. [ABSTRACT FROM AUTHOR]

The adoption of edge infrastructure in 5G environments stands out as a transformative technology aimed at meeting the increasing demands of latency-sensitive and data-intensive applications. This research paper presents a comprehensive study on the intelligent orchestration of 5G edge computing infrastructures. The proposed Smart 5G Edge-Cloud Management Architecture, built upon an OpenNebula foundation, incorporates a ONEedge5G experimental component, which offers intelligent workload forecasting and infrastructure orchestration and automation capabilities, for optimal allocation of virtual resources across diverse edge locations. The research evaluated different forecasting models, based both on traditional statistical techniques and machine learning techniques, comparing their accuracy in CPU usage prediction for a dataset of virtual machines (VMs). Additionally, an integer linear programming formulation was proposed to solve the optimization problem of mapping VMs to physical servers in distributed edge infrastructure. Different optimization criteria such as minimizing server usage, load balancing, and reducing latency violations were considered, along with mapping constraints. Comprehensive tests and experiments were conducted to evaluate the efficacy of the proposed architecture. [ABSTRACT FROM AUTHOR]

Cloud Computing has the ability to provide on-demand access to a shared resource pool. It has completely changed the way businesses are managed, implement applications, and provide services. The rise in popularity has led to a significant increase in the user demand for services. However, in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization. This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms. Specifically, metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic. In a cloud-based context, this paper describes load balancing measurements, including the benefits and drawbacks associated with the selected load balancing techniques. It also summarizes the algorithms based on implementation, time complexity, adaptability, associated issue(s), and targeted QoS parameters. Additionally, the analysis evaluates the tools and instruments utilized in each investigated study. Moreover, comparative analysis among static, traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed. Finally, the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed. [ABSTRACT FROM AUTHOR]

Cloud computing has gained significant recognition due to its ability to provide a broad range of online services and applications. Nevertheless, existing commercial cloud computing models demonstrate an appropriate design by concentrating computational assets, such as preservation and server infrastructure, in a limited number of large-scale worldwide data facilities. Optimizing the deployment of virtual machines (VMs) is crucial in this scenario to ensure system dependability, performance, and minimal latency. A significant barrier in the present scenario is the load distribution, particularly when striving for improved energy consumption in a hypothetical grid computing framework. This design employs load-balancing techniques to allocate different user workloads across several virtual machines. To address this challenge, we propose using the twin-fold moth flame technique, which serves as a very effective optimization technique. Developers intentionally designed the twin-fold moth flame method to consider various restrictions, including energy efficiency, lifespan analysis, and resource expenditures. It provides a thorough approach to evaluating total costs in the cloud computing environment. When assessing the efficacy of our suggested strategy, the study will analyze significant metrics such as energy efficiency, lifespan analysis, and resource expenditures. This investigation aims to enhance cloud computing techniques by developing a new optimization algorithm that considers multiple factors for effective virtual machine placement and load balancing. The proposed work demonstrates notable improvements of 12.15%, 10.68%, 8.70%, 13.29%, 18.46%, and 33.39% for 40 count data of nodes using the artificial bee colony-bat algorithm, ant colony optimization, crow search algorithm, krill herd, whale optimization genetic algorithm, and improved Lévy-based whale optimization algorithm, respectively. [ABSTRACT FROM AUTHOR]

With the rapid development of cloud computing, load balancing technology in cloud services has become a critical component in ensuring service quality and system stability. Traditional load balancing methods, often relying on static parameters and preset rules, face challenges in flexibly responding to the dynamic changes in cloud service demands. Recent studies have begun to explore the application of machine learning algorithms to optimize load balancing, aiming to enhance the system's adaptive adjustment capabilities. This study proposes an innovative approach, applying the solution of the heat conduction equation to the optimization of cloud service load balancing issues. It simulates and analyzes the dynamic changes in load distribution, proposing corresponding optimization strategies. The first part of this research focuses on designing a model that integrates genetic algorithms and neural networks to solve the inverse problem of the twodimensional nonlinear heat conduction equation, namely, the accurate prediction of thermal physical parameters. By simulating the heat conduction process, this model can reflect the dynamic distribution characteristics of server loads and guide the adjustment strategy of weights. Furthermore, an adaptive dynamic load balancing strategy algorithm is proposed. By optimizing the existing engine x (Nginx) weighted least connections algorithm, an efficient adaptive algorithm is designed and implemented. This algorithm adjusts server weights dynamically based on real-time load data, enabling cloud services to respond more flexibly and efficiently to different service requests. The findings of this research not only enhance the processing capability and resource utilization rate of cloud services but also provide more scientific and precise theoretical support for load balancing through the introduction of new algorithmic models. Additionally, the proposed adaptive dynamic load balancing strategy algorithm has demonstrated good performance in practical deployment, offering new perspectives and technical paths for the research and practice of cloud service load balancing. [ABSTRACT FROM AUTHOR]

With the successful implementation of Software‐Defined Networking (SDN) in data center networking, the way forward for its deployment in the ISP/Telco network is becoming prominent. Small and medium‐sized networks may easily adopt SDN. The research on SDN deployment and implementation for a large‐scale network is continuing. This paper properly presents the current research status of Controller Placement Problem (CPP) and Multi‐CPP (MCPP) over SDN with their specific challenges and provides a comprehensive review of the major performance metrics, that is, latency, and controller load balancing techniques. This survey highlights the use of network partitioning‐based CPP and clustering approaches and their benefits in the context of SDN deployment. Moreover, this paper highlights the importance of implementing SDN and SDN security issues into ISP/Telco networks. Finally, we provide some key areas of ongoing research and discuss the future research direction regarding the various SDN‐based Controller Placement (CP) issues in the next‐generation IP and advanced networking technologies. [ABSTRACT FROM AUTHOR]

The increasing wafer yield and shrinking size pose challenges for real-time defect inspection using a single computer. To address this, we propose enhancing real-time performance by increasing computing devices. However, uneven load distribution due to device performance or defects variations can reduce inspection efficiency. We introduce computer cluster load balancing to solve this, utilizing a load-balancing model and an objective function. We propose the adaptive discrete quantum particle swarm optimization algorithm (ADQPSO) for efficient load balancing and implement the adaptive dynamic smooth weighted round-robin algorithm based on ADQPSO. Experimental results demonstrate that our algorithm achieves the fastest execution speed and up to a 24% improvement in performance. Our approach significantly improves real-time performance and efficiency in wafer surface defect inspection. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Processing of data gathered from new communication devices, such as Internet of Things (IoT)-based technology, has grown dramatically in the past decade. Resource management plays a vital role in cloud/fog-based platforms' efficiency. Alternatively, a deadline-based workflow scheduling mechanism is an approach to resource management that increases cloud/fog computing efficiency. However, most proposed methods may overload some resources and underload others. Consequently, adopting a proper load-balancing approach has a major impact on optimizing Quality of Service (QoS) and improving customer satisfaction. This paper presents a 4-layer software architecture for analyzing workflows and dynamic resources in cloud/fog/IoT environments to address such a problem. This approach also considers workload and presence prediction of IoT nodes as dynamic resources. Moreover, the 4 + 1 architectural view models represent architecture layers, components, and significant interactions. Architecture components are ultimately proposed to meet quality attributes such as availability, reliability, performance, and scalability. The proposed architecture evaluation is according to the Architecture Tradeoff Analysis Method (ATAM) as a scenario-based technique. Compared with previous works, various scenarios, and more quality attributes are discussed within this evaluation, in addition to analyzing and predicting workload and the presence prediction of dynamic resources. [ABSTRACT FROM AUTHOR]

As the volume of data and data-generating equipment in healthcare settings grows, so do issues like latency and inefficient processing inside healthmonitoring systems. The Internet of Things (IoT) has been used to create a wide variety of health monitoring systems. Most modern health monitoring solutions are based on cloud computing. However, large-scale deployment of latency-sensitive healthcare applications is hampered by the cloud’s design, which introduces significant delays during the processing of vast data volumes. By strategically positioning servers close to end users, fog computing mitigates latency issues and dramatically improves scaling on demand, resource accessibility, and security. In this work, we describe a new load-balancing strategy based on the Strength Pareto Evolutionary Algorithm 2 (SPEA2) for distributing work among fog nodes in a large-scale health monitoring system. We ran comprehensive simulations in the iFogSim toolkit to verify the efficacy of the proposed method, comparing the results to the cloud-only implementation, the Fog Node Placement Algorithm (FNPA), the Load Balancing (LAB) scheme, and the Load Balancing Scheme (LBS) in terms of latency and network utilization. The proposed health monitoring system deployment drastically decreases latency and network use in comparison to cloud-only, FNPA, LAB, and LBS schemes. [ABSTRACT FROM AUTHOR]

Considering several fundamental needs of network performance, the Routing and Media Access Control (MAC) layers are crucially checked out for their operations. Sometimes, MAC protocol faces difficulties in modifying the situations over underwater communication which are specifically considered to be dynamic. The nodes in water tend to remain unstable and network fluctuations are made depending upon the number of competitors. The existing hybrid MAC protocol does not possess dynamic network loads. It also involves a lack of modification in access control approaches which provide variations in network loads. Finally, it leads to delayed network performance. The routing layer focus on some difficult parameters like increased packet loss, restricted bandwidth with substantial energy incursion, reduced network lifetime, increased propagation delay, less remaining energy, consistent data transfer, and energy organization which are considered to be the most important research issues in Underwater Acoustic Sensor Networks (UWASNs). In MAC and routing layers, a Cross-layer approach involves some techniques which are discussed and implemented using Ns3 simulation to obtain the performance report. It is also proposed to compare the algorithm with existing techniques to provide accurate results. Reinforcement Learning (RL) in the MAC layer for SINR-based time slot allocation and Integrated Artificial Fish Swarm with Bacterial Foraging Algorithm (IAFSBFA) for energy-aware QoS reliable routing in the network layer are used in this system. In this cross-layer approach, load balancing in the MAC layer and efficient routing using a hybrid algorithm gives out better performance in the underwater network. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), sensor nodes were considered to be an integral part of IoT (Internet of Things) for sensing and monitoring the environment. The IoT-based applications need to be optimized regarding the changing requirements of users as everything is connected via the internet. In today's era, where every day new technologies were rebuilt where sensor nodes plays an important role on it. In every field, whether it is healthcare, smart agriculture, smart home appliances, smart traffic, or smart city sensors were deployed for sensing their environment, collecting data from them, and forwarding it to the servers. These sensor nodes were made up of non-rechargeable power batteries, as a fact efficient energy consumption of these batteries becomes vital. In WSN, efficient energy consumption is still an issue, and its solutions were given by many researchers among them, clustering is considered to be more effective in this domain. For efficient energy consumption, multi-attributes of cluster head selection need to be considered and proper coordination among the conflicting nature of multi-attributes needs to be done. In this paper, we have proposed PROMETHEE II and modified AHP together for cluster heads selection by considering multi-attributes. Twenty-one attributes were considered including connectivity, distance to the base station, residual energy, member nodes, and many more. Being conflicting in nature, proper coordination among these attributes has been done and optimal cluster heads were selected modified for data transmissions. In this paper, modified AHP has been compared with our proposed modified PROMETHEE II and AHP for understanding the significance of this integration. Results is evaluated in terms of energy consumption, network lifetime, and load balancing and it also validate that our proposed approach outperforms with modified AHP and other existing algorithms. Our proposed algorithm enriches network lifetime by balancing the load among sensor nodes which leads to efficient energy consumption. [ABSTRACT FROM AUTHOR]