Network Latency Research Articles

Accurate and fast congestion feedback in MEC-enabled RDMA datacenters

Mobile edge computing (MEC) is a novel computing paradigm that pushes computation and storage resources to the edge of the network. The interconnection of edge servers forms small-scale data centers, enabling MEC to provide low-latency network services for mobile users. Nowadays, Remote Direct Memory Access (RDMA) has been widely deployed in such data centers to reduce CPU overhead and network latency. Plenty of congestion control mechanisms have been proposed for RDMA data centers, aiming to provide low-latency data delivery and high throughput network services. However, our fine-grained experimental analysis reveals that existing congestion control mechanisms still have performance limitations due to inappropriate congestion notifications and the long congestion feedback cycle. In this paper, we propose Mercury, which is an accurate and fast congestion feedback mechanism. Mercury comprises two key components: (1) the state-driven congestion detection and (2) the window-based congestion notification. Specifically, the state-driven congestion detection monitors the queue length and the number of packets received at the switch egress port when the PFC is triggered. It determines the states of egress ports and identifies flows that really contribute to congestion. Then, window-based congestion notification calculates the window sizes for congested flows and rapidly returns Congestion Notification Packets (CNPs) with the window information to the sender. It facilitates the rate adjustment of congested flows. Mercury is compatible with existing RDMA CC mechanisms and can be easily implemented in switches. We employ real-world data sets and conduct both micro-benchmark and large-scale simulations to evaluate the performance of Mercury. The results indicate that, thanks to the accurate and fast congestion feedback, Mercury achieves a reduction in the 99th tail flow completion time by up to 45.1%, 41.8%, 38.7%, 30.9%, and 37.9% compared with Timely, DCQCN, DCQCN+TCD, PACC, and HPCC, respectively.

Enhancing IoT Network Security Through Digital Object Architecture-Based Approaches

The Internet of Things (IoT) encompasses a network of different devices, both stationary and mobile, that may interact with the physical world. Ensuring the security of the Internet of Things (IoT) is of utmost importance in a world where devices are interconnected at various levels, including wearables, home automation, smart cities, industrial sectors, and more. Ensuring the security of this interconnected network of "things" and devices is imperative, leaving no space for mistakes or inadequacies. The purpose of this article is to present an approach that utilizes Digital Object Architecture (DOA) to identify Internet of Things (IoT) devices and applications within communication networks. This study investigates various methodologies for incorporating the DOA identifier into Internet of Things (IoT) devices that are equipped with a range of wireless data transmission modules. Furthermore, this study presents a security model that aims to strengthen the resolution system based on data transmission security. The objective is to reduce the number of service messages exchanged between internetwork parts and decrease network latency. The essay finishes by examining some strategies for modernizing DOA in order to improve the quality of service.

Optical communication enhanced IDMBOC for maximizing backhaul-effect & maintaining optimum cell sizes

Abstract The increasing need for high data rates and low latency in optical communication networks necessitates innovative solution for system efficiency enhancements. With the persistent increase in data demand and the emergence of diverse applications in 5G networks, minimizing the backhaul-effect while maintaining optimal cell sizes has become a formidable obstacle. Existing methods are incapable of achieving a comprehensive optimization of network parameters, resulting in degraded performance metrics. To address these constraints, our proposed approach integrates optical communication infrastructure into IDMBOC systems which maximizes backhaul-effect and preserves optimal cell sizes. This work is primarily motivated by the need to improve the efficiency and quality of 5G networks in the face of rising data traffic. Existing methods frequently struggle to optimize concurrently multiple 5G network aspects, such as carrier aggregation, dynamic spectrum sharing, packet prioritization, network function virtualization, frequency planning, HetNets deployments, and network slicing process. As a result, these methods are incapable of delivering robust and scalable solutions. To solve these issues, we present an Iterative dual metaheuristic method that combines ant lion optimization (ALO) and grey wolf optimization (GWO) in a synergistic manner for 5G deployments. The proposed method is functionally superior to existing models. By capitalizing on the strengths of both ALO and GWO, our approach achieves superior performance metrics in comparison to recently proposed methods for maximizing backhaul-effect and maintaining optimal cell sizes. The preliminary results reveal a remarkable 8.3 % reduction in bit error rate (BER), 4.9 % reduction in energy consumption, 8.5 % increase in throughput, and 4.5 % reduction in communication delay. The achieved results demonstrate the revolutionary potential of our 5G network optimization approach and pave the way for future research and advancements in the field for different scenarios. These enhancements will revolutionize optical communication networks in order to accommodate the requirements of 5G, IoT, and other contemporary applications.

An Analysis 5G Network Latency for Upload and Download: Case Study of 5G Network in Medan City

An Analysis 5G Network Latency for Upload and Download: Case Study of 5G Network in Medan City

Privacy-Preserving Wireless Sensor Networks for E-Healthcare Applications

Wireless sensor networks (WSNs) are a powerful support system for the fundamental infrastructure that is required to monitor physiological and activity parameters (WSN). Wearable devices, which are also referred to as wireless nodes in the scientific world, are what are used in order to measure one or more of the user’s vital signs. Each and every wireless node is a teeny-tiny device that is meant to be supplied with enough amounts of storage space, power, and transmission capability. The loss of data packets may occur during the transmission of data via a wireless medium for a number of reasons. These reasons include interferences, improper deployment circumstances, distance, and inadequate signal strength. The monitoring of a user’s physiological information and postural activity information in various applications, such as home care and hospital care, is the primary emphasis of this study. In this work, the WSN was shown thanks to the introduction of wireless sensor nodes that were created locally. These wireless sensor nodes are used in the process of analyzing many aspects of a network, such as the received signal strength, transmission offset, packet delivery ratio (PDR), and signal-to-noise interference. The work significantly improves the capabilities of conventional WSN by implementing a variety of alternative communication approaches, such as network-coded cooperative communication (NC-CC) and cooperative communication (CC). The system that is being shown makes it feasible to localize the user’s approximate position inside an indoor setting without making use of any camera network connections. This is made possible by the system’s ability to determine the user’s location via triangulation. This is one of the benefits that the system provides. A hospital sensor network, an example of which is being shown here, is capable of doing real-time monitoring of a patient’s postural activity as well as their general health. The method is being promoted in order to ensure that the patient will get assistance in a timely manner that is adequate to his/her needs. Involving NC-CC enables the effective sharing of real-time data among the group of privileged duty nurses while simultaneously minimizing the amount of network traffic, latency, and throughput. This is possible because of NC-CC protocol. The findings of the experiments showed that the proposed method of communication, which is known as dynamic retransmit/rebroadcast decision control, is a significant advancement in the network coding approach that is presently being utilized. This was demonstrated by the fact that the method was shown to be significantly more effective.

A framework for offloading and migration of serverless functions in the Edge–Cloud Continuum

Function-as-a-Service (FaaS) has emerged as an evolution of traditional Cloud service models, allowing users to define and execute pieces of codes (i.e., functions) in a serverless manner, with the provider taking care of most operational issues. With the unending growth of resource availability in the Edge-to-Cloud Continuum, there is increasing interest in adopting FaaS near the Edge as well, to better support geo-distributed and pervasive applications. However, as the existing FaaS frameworks have mostly been designed with Cloud in mind, new architectures are necessary to cope with the additional challenges of the Continuum, such as higher heterogeneity, network latencies, limited computing capacity.In this paper, we present an extended version of Serverledge, a FaaS framework designed to span Edge and Cloud computing landscapes. Serverledge relies on a decentralized architecture, where each FaaS node is able to autonomously schedule and execute functions. To take advantage of the computational capacity of the infrastructure, Serverledge nodes also rely on horizontal and vertical function offloading mechanisms. In this work we particularly focus on the design of mechanisms for function offloading and live function migration across nodes. We implement these mechanisms in Serverledge and evaluate their impact and performance considering different scenarios and functions.

HR‐DO: High reliable–delay optimized controller placement in software‐defined networking

SummaryCurrently, networking technologies are pivoting towards software‐defined networking (SDN) due to its easy management and centralized control system. The SDN network metrics, such as latency, scalability, robustness, and reliability largely depends on controller placement in the network domain. In view of betterment and best progression of network quality, the above mentioned network metrics need to be laid more emphases by considering controller placement. To achieve better network quality, an HR‐DO (high reliable–delay optimized controller placement) is proposed. Fuzzy C‐means, a meta‐heuristic optimization algorithm, is used to optimize the number of controllers required in the network due to its effectiveness in cluster selection. It also eases the network latency. In addition, a minimal cut set‐based Boolean logic approach and natural connectivity metric are used to improve the reliability and robustness of SDN with minimum worst‐case latency. To check the performance, the proposed HR‐DO is implemented on a topology‐zoo network data set (OS3E and Chinanet). For comparison purposes, OCPA and K‐means algorithms are taken into the account of latency, reliability, and robustness as parameters. The performance of the HR‐DO approach outperforms over K‐means and OCPA with respect to latency, reliability, and robustness.

Performance analysis of congestion-aware Q-routing algorithm for network on chip

<p>A network on chip’s performance is greatly impacted by network congestion due to the substantial increase in latency and energy utilized. Designing routing strategies that keep the network informed of the status of traffic is made easier by machine learning techniques. In this work, a reinforcement-based congestion-aware Q-routing (CAQR) technique has been presented. The proposed algorithm performed better in comparison to the conventional XY routing method tested against the SPEC CPU2006 benchmark suite in the gem5 NoC simulator tool. The suite used has 4 benchmarks, namely, namd, lbm, leslie3d and bzip2 which can be used for the cores in the network in any combination. The tests were run with 16 cores on a 44 network with the maximum instruction count supported by the system (here 5,000). The proposed Q-routing algorithm showed an average of 19% reduction for benchmark simulation as compared to the Dimension-ordered (X-Y) routing for readings of average packet latency which is a crucial factor in determining a network’s efficiency. The analysis also shows an average reduction of 24%, 10%, 23% and 47% in terms of average packet network latency, average flit latency, average flit network latency and average energy consumption across various benchmarks.</p>

Intelligent task processing using mobile edge computing: processing time optimization

<p>The fast-paced development of the internet of things led to the increase of computing resource services that could provide a fast response time, which is an unsatisfied feature when using cloud infrastructures due to network latency. Therefore, mobile edge computing became an emerging model by extending computation and storage resources to the network edge, to meet the demands of delaysensitive and heavy computing applications. Computation offloading is the main feature that makes Edge computing surpass the existing cloud-based technologies to break limitations such as computing capabilities, battery resources, and storage availability, it enhances the durability and performance of mobile devices by offloading local intensive computation tasks to edge servers. However, the optimal solution is not always guaranteed by offloading computation, therefore, the offloading decision is a crucial step depending on many parameters that should be taken in consideration. In this paper, we use a simulator to compare a two tier edge orchestrator architecture with the results obtained by implementing a system model that aims to minimize a task’s processing time constrained by time delay and the limited device’s computational resource and usage based on a modified version.</p>

Resource-aware fog service placement using deferred acceptance in edge computing

Fog computing aims at reducing network latency, bandwidth and processing delay by bringing computation resources closer to the data sources. Modern IoT applications, such as smart surveillance systems, remote health monitoring applications, ambient-aware applications etc., are time-critical and computationally intensive. For such applications, it is ideal to consider an intermediate layer of processing i.e a fog layer in addition to cloud. However, processing the workload of such IoT applications with an intermediate layer of fog nodes has several challenges. The significant challenges include the mobility of end-user nodes, dynamic patterns of workload generation leading to highly-variant resource requirements and sensitive quality of service (QOS) requirements. Hence a dynamic approach is required to precisely map the service requests from end-user devices to a suitable fog node. The optimality of a fog node for service placement depends on several factors, including location, resource utilization rates such as CPU, Memory and Disk utilization % and energy consumption. Several meta-heuristic techniques and evolutionary algorithms have been proposed in the past for optimal service placement among fog nodes. This paper investigates the applicability of a game theory-based approach called Deferred acceptance (DA) for the same. The DA algorithm, originally designed as a stable matching mechanism for the marriage market is adapted for service placement problems in fog-based IoT systems. The effectiveness of optimized service placement through the DA approach is validated experimentally. The experiment is carried out by creating a test bed that mimics a fog computing-based intelligent traffic management application. The proposed approach's performance is evaluated through parameters such as the startup time for the DA approach to produce outcomes, total execution time and handshake latency. The numerical results of the DA approach are compared with those of a simple scheduling algorithm ( FIFO) and a basic genetic algorithm-based approach. The DA approach appears to perform on par with the genetic algorithm in terms of start-up time, but exceeds the genetic algorithm with respect to stability of the outcomes produced.

Voltage angle‐based coherency identification in power system

AbstractCoherency detection in power system is vital step for controlled‐islanding. Model‐based slow‐coherency method is the traditional method of detecting coherent areas, which suffers from computational burdens. With the implementation of a wide‐area measurement system (WAMS) in power systems, coherent areas can be detected early after a disturbance that helps to ensure quick separation or remedial action. In this study, a novel Synchrophasor‐based coherency identification method has been proposed with bus voltage angle measurement. A new algorithm is proposed based on the first and second derivatives of the bus voltage phase angle using hierarchical clustering method for coherency detection. The proposed approach leverages hierarchical clustering method and the dynamics reflected in the bus voltage phase angle behavior to achieve automatic and accurate coherency identification. Real time simulation results demonstrate the ability of the proposed algorithm to detect the coherency with three consecutive PMU data from all the system buses and showcase coherent area boundaries. Case studies show robustness of the proposed method and is least affected by the latency in communication network compared to conventional methods. The proposed algorithm has been mathematically formulated and evaluated with different benchmark systems in OPAL‐RT real‐time simulation environment with HYPERSIM platform.

A robust optimization approach for placement of applications in edge computing considering latency uncertainty

Edge computing brings computing and storage resources close to end-users to support new applications and services that require low network latency. It is currently used in a wide range of industries, from industrial automation and augmented reality, to smart cities and connected vehicles, where low latency, data privacy, and real-time processing are critical requirements. The latency of accessing applications in edge computing must be consistently below a threshold of a few tens of milliseconds to maintain an acceptable experience for end-users. However, the latency between users and applications can vary considerably depending on the network load and mode of wireless access. An application provider must be able to guarantee that requests are served in a timely manner by their application instances hosted in the edge despite such latency variations. This article focuses on the placement and traffic allocation problem faced by application providers in determining where to place application instances on edge nodes such that requests are served within a certain deadline. It proposes novel formulations based on robust optimization to provide optimal plans that protect against latency variations in a configurable number of network links. The robust formulations are based on two different types of polyhedral uncertainty sets that offer different levels of protection against variations in latency. Extensive simulations show that our robust models are able to keep the number of chosen edge nodes low while reducing the number of latency violations as compared to a deterministic optimization model that only considers the average latency of network links.

Democratizing LEO Satellite Network Measurement

Low Earth Orbit (LEO) satellite networks are quickly gaining traction with promises of impressively low latency, high bandwidth, and global reach. However, the research community knows relatively little about their operation and performance in practice. The obscurity is largely due to the high barrier of entry for measuring LEO networks, which requires deploying specialized hardware or recruiting large numbers of satellite Internet customers. In this paper, we introduce HitchHiking, a methodology that democratizes global visibility into LEO satellite networks. HitchHiking builds on the observation that Internet-exposed services that use LEO Internet can reveal satellite network architecture and performance, bypassing the need for specialized hardware. We evaluate HitchHiking against ground truth measurements and prior methods, showing that it provides more coverage and accuracy. With HitchHiking, we complete the largest study to date of Starlink network latency, measuring over 2,400 users across 27 countries. We uncover unexpected patterns in latency that surface how LEO routing is more complex than previously understood. Finally, we conclude with recommendations for future research on LEO networks.

Hybrid learning based service migration for cost minimization with deadlines in multi-user mobile edge computing systems

Mobile edge computing, a new computing model, aims to reduce network latency and improve user experience by placing computing resources closer to the users. However, when users move away from the current service areas, the quality of services will decline. To guarantee the quality of services, service migration technique is proposed and studied. Due to the wireless resource contention among users, there is service migration decision-making coupling among multiple users. Meanwhile, making real-time service migration decisions for multiple users to minimize service cost with application deadlines remains an open challenge because of the huge state space. In this paper, we formalize the service migration problem with deadlines as a Markov decision process (MDP) and propose a hybrid learning based service migration strategy. The proposed approach integrates Monte Carlo method and DQN learning, which adopts online training without Q-values and neural network approximation to generate service migration decisions for multiple users. Experimental results demonstrate that the proposed hybrid learning based service migration strategy outperforms the existing migration strategies in terms of service success ratio and service cost.

A Temporal Deep Q Learning for Optimal Load Balancing in Software-Defined Networks.

With the rapid advancement of the Internet of Things (IoT), there is a global surge in network traffic. Software-Defined Networks (SDNs) provide a holistic network perspective, facilitating software-based traffic analysis, and are more suitable to handle dynamic loads than a traditional network. The standard SDN architecture control plane has been designed for a single controller or multiple distributed controllers; however, a logically centralized single controller faces severe bottleneck issues. Most proposed solutions in the literature are based on the static deployment of multiple controllers without the consideration of flow fluctuations and traffic bursts, which ultimately leads to a lack of load balancing among controllers in real time, resulting in increased network latency. Moreover, some methods addressing dynamic controller mapping in multi-controller SDNs consider load fluctuation and latency but face controller placement problems. Earlier, we proposed priority scheduling and congestion control algorithm (eSDN) and dynamic mapping of controllers for dynamic SDN (dSDN) to address this issue. However, the future growth of IoT is unpredictable and potentially exponential; to accommodate this futuristic trend, we need an intelligent solution to handle the complexity of growing heterogeneous devices and minimize network latency. Therefore, this paper continues our previous research and proposes temporal deep Q learning in the dSDN controller. A Temporal Deep Q learning Network (tDQN) serves as a self-learning reinforcement-based model. The agent in the tDQN learns to improve decision-making for switch-controller mapping through a reward-punish scheme, maximizing the goal of reducing network latency during the iterative learning process. Our approach-tDQN-effectively addresses dynamic flow mapping and latency optimization without increasing the number of optimally placed controllers. A multi-objective optimization problem for flow fluctuation is formulated to divert the traffic to the best-suited controller dynamically. Extensive simulation results with varied network scenarios and traffic show that the tDQN outperforms traditional networks, eSDNs, and dSDNs in terms of throughput, delay, jitter, packet delivery ratio, and packet loss.

Hybrid Crow Search and RBFNN: A Novel Approach to Medical Data Classification

The Radial Basis Function Neural Network (RBFNN) is frequently employed in artificial neural networks for diverse classification tasks, yet it encounters certain limitations, including issues related to network latency and local minima. To tackle these challenges, researchers have explored various algorithms to enhance learning performance and alleviate local minima problems. This study introduces a novel approach that integrates the Crow Search Algorithm (CSA) with RBFNN to augment the learning process and address the local minima issue associated with RBFNN. The study evaluates the performance of this innovative model by comparing it to state-of-the-art models like Flower-pollination-RBNN (FP-NN), Artificial Neural Network (ANN), and the conventional RBFNN. To assess the efficacy of the proposed model, the study employs specific datasets, such as the Breast Cancer and Thyroid Disease datasets from the UCI Machine Repository. The simulation results illustrate that the proposed model surpasses other models in terms of accuracy, exhibiting lower Mean Squared Error (MSE) and Mean Absolute Error (MAE) values. Specifically, for the Breast Cancer dataset, the proposed model attains an accuracy of 99.9693%, MSE of 0.000307024, and MAE of 0.00789449. Likewise, for the Thyroid Disease dataset, the proposed model achieves an accuracy of 99.9535%, along with MSE of 0.000464932 and MAE of 0.0057098. For the diabetes dataset, the proposed model demonstrates an accuracy of 98.8073%, MSE of 0.003024, and MAE of 0.009449. In summary, this analysis underscores the enhanced accuracy and effectiveness of the proposed model when compared to traditional approaches.

Optimizing workload distribution in Fog-Cloud ecosystem: A JAYA based meta-heuristic for energy-efficient applications

Fog-integrated Cloud has emerged as a novel computing paradigm that brings Cloud computing services to the network's edge in real-time, though with limited capabilities. Despite its advantages, there are several challenges including workload distribution, energy consumption, computational time, and network latency, that require attention. The workload of IoT applications can be distributed over the Fog or Cloud devices based on their priority, deadline, and latency restrictions. In this work, we introduce a novel population-based metaheuristic called MAYA, a modified variant of the JAYA algorithm, to address the Energy-Efficient Workload Distribution of Sensors (EEWDS) in the Fog-Cloud ecosystem. The workload distribution of IoT applications depends on several factors such as request deadlines, the energy consumed during transmission, and needed computation. The performance of the proposed model for the energy consumption, computation time, CO2 emission, fairness index, and the convergence rate, is evaluated through simulation experiments. The results are compared in two scenarios: one concerning to methodology, where the performance is compared with JAYA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO) techniques. The other scenario is based on the environment, where we examine Cloud-only, Fog-only, and Fog-Cloud integrated environments. Compared to JAYA, GA, PSO and ACO, the proposed MAYA technique demonstrates significant improvements, including reduction in energy consumption by 34.76%, 88.92%, 85.36% and 93.84%; decrease in computation time by 37.64%, 85.07%, 87.22%, and 91.08%; decrease in CO2 emissions by 23.46%, 76.24%, 97.17%, and 99.02%; and increase in fairness index by 9.62%, 3.72%, 16.90%, and 15.26% respectively.

FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol

Currently, integrating partially synchronous Byzantine-fault-tolerant protocols into asynchronous protocols as fast lanes represents a trade-off between robustness and efficiency, a concept known as optimistic asynchronous protocols. Existing optimistic asynchronous protocols follow a fixed path order: they execute the fast lane first, switch to the slow lane after a timeout failure, and restart the fast lane after the slow lane execution is completed. However, when confronted with prolonged network fluctuations, this fixed path sequence results in frequent failures and fast lane switches, leading to overhead that diminishes the efficiency of optimistic asynchronous protocols compared with their asynchronous counterparts. In response to this challenge, this article introduces FlexBFT, a novel and flexible optimistic asynchronous consensus framework designed to significantly enhance overall consensus performance. The key innovation behind FlexBFT lies in the persistence of slow lanes. In the presence of persistent network latency, FlexBFT can continually operate round after round within the slow lane—the current optimal path—until the network conditions improve. Furthermore, FlexBFT offers the flexibility to combine consensus modules adaptively, further enhancing its performance. Particularly in challenging network conditions, FlexBFT’s experimental outcomes highlight its superiority across a range of network scenarios compared with state-of-the-art algorithms. It achieves a performance with 31.6% lower latency than BDT, effectively merging the low latency characteristic of deterministic protocols with the robustness inherent in asynchronous protocols.

WHOOPH: whale optimization-based optimal placement of hub node within a WBAN

Biosensor nodes of a wireless body area network (WBAN) transmit physiological parameter data to a central hub node, spending a substantial portion of their energy. Therefore, it is crucial to determine an optimal location for hub placement to minimize node energy consumption in data transmission. Existing methods determine the optimal hub location by sequentially placing the hub at multiple random locations within the WBAN. Performance measures like link reliability or overall node energy consumption in data transmission are estimated for each hub location. The best-performing location is finally selected for hub placement. Such methods are time-consuming. Moreover, the involvement of other nodes in the process of hub placement results in an undesirable loss of network energy. This paper shows the whale optimization algorithm (WOA)-based hub placement scheme. This scheme directly gives the best location for the hub in the least amount of time and with the least amount of help from other nodes. The presented scheme incorporates a population of candidate solutions called "whale search agents". These agents carry out the iterative steps of encircling the prey (identifying the best candidate solution), bubble-net feeding (exploitation phase), and random prey search (exploration phase). The WOA-based model eventually converges into an optimized solution that determines the optimal location for hub placement. The resultant hub location minimizes the overall amount of energy consumed by the WBAN nodes for data transmission, which ultimately results in an elongated lifespan of WBAN operation. The results show that the proposed WOA-based hub placement scheme outperforms various state-of-the-art related WBAN protocols by achieving a network lifetime of 8937 data transmission rounds with 93.8% network throughput and 9.74 ms network latency.

Load Balancing using Weight Based scheme in AWS

This paper presents research on load balancing methods for cloud computing platforms. Load balancing is an important element of cloud systems since it allows for optimal resource utilization and consistent performance levels. The study investigates several load balancing technologies and evaluates their effectiveness in coping with the dynamic and heterogeneous nature of cloud workloads. The study conducts experiments and analyses to discover significant parameters influencing load balancing performance, such as workload allocation, server capacity, and network latency. With the weight-based technique, different servers are dynamically given requests based on their weights, which are determined by the processing capacities of the servers. By distributing the work proportionately, this approach aims to decrease user request response times and avoid server overload. The effectiveness of the proposed approach is evaluated via simulations, demonstrating its potential to improve system performance and scalability relative to traditional load balancing methods. Generally speaking, this paper presents an optimized load distribution approach that raises the efficiency and stability of cloud computing systems. The findings enable to improve load balancing methods matched to the particular requirements and issues of cloud computing, eventually enhancing system scalability, reliability, and user