Aug 2026· Concurrency and Computation· Vol 38· 0 citations· 48 references
TL;DR
The article presents the Average‐Based Load Balancing and Resource Allocation Mechanism (ALBRAM), which identifies suitable nodes and dynamically allocates resources to maintain the load balance among all the servers to provide fairness, optimal resource utilisation, and balanced workloads.
Abstract
Today, with the rapid growth of the Internet of Things (IoT), the volume of data generated and processed has increased significantly, and there is an urgent need to handle tasks quickly and efficiently in real‐time applications. Existing cloud‐based models are not capable of meeting these demands due to their deployment model that adds latency. The separation of the control and data planes has the potential to provide a solution to Software‐Defined Networking (SDN) that offers centralised control, programmability, and dynamic network management. However, efficient scheduling of activities and workloads among the different edge servers is one of the imperative issues since an inefficient allocation of the resources may lead to server congestion, high latency rates, and resource wastages. To overcome this, the article presents the Average‐Based Load Balancing and Resource Allocation Mechanism (ALBRAM), which identifies suitable nodes and dynamically allocates resources to maintain the load balance among all the servers. It recommends a three‐layer SDN‐based edge computing architecture providing a bridge between the IoT devices, middle nodes, and the edge servers, considering both the communication and computation time. The strategy uses a least‐load server selection mechanism to provide fairness, optimal resource utilisation, and balanced workloads. The results of the evaluation indicate that ALBRAM decreases the Makespan, total completion time and latency and increases resource utilization, and the efficiency of load‐balancing in comparison to existing methods.
A lightweight, QoS-aware service placement algorithm that evaluates latency, bandwidth, and node load in real time is introduced that yields reduced latency and more consistent wait times relative to heuristic and genetic baselines.
Anshul Atre, K. Singh, Brijesh Kumar Chaurasia et al.· Journal of Circuits, Systems...· 0 citations
Compute and memory resources in cloud environments are strictly managed and isolated by the control plane; in contrast, network resources lack equivalent management and isolation mechanisms. This best-effort treatment of networking leads to significant challenges for modern AI workloads, which have diverse and bandwidth-intensive communication patterns. Without fine-grained network resource control, these workloads suffer from interference, unpredictable throughput, and suboptimal cluster utilization. To address these issues, this paper demonstrates how network bandwidth can be elevated to a first-class, schedulable, and enforceable resource within Kubernetes, the de facto standard for cloud-native orchestration. We introduce a new scheduling capability that models network interfaces as allocatable resources and regulates bandwidth sharing through the Dynamic Resource Allocation (DRA) framework, with enforcement implemented using the Hierarchical Token Bucket (HTB) mechanism. We evaluate the system using multitenant AI workloads derived from real-world communication characteristics with a simulation-based approach and validate the proposed enforcement strategy in a real cluster. Results show that the proposed two-level bandwidth allocation improves tenant performance predictability and satisfaction while maintaining packed cluster utilization.
A structured review of optimization models in cloud and data center environments using a Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guided methodology covering literature from 2016 to 2025 reveals that the adaptive methods can improve throughput, reduce latency, and enhance energy efficiency under specific datasets, simulation settings, traffic models, and network configurations.
S. Alanazi· Journal of Advances in Infor...· 0 citations
The rapid proliferation of Internet of Things (IoT) devices has intensified demands for low-latency, resource-efficient task scheduling at the network edge. Conventional policies such as Round-Robin and First-Come-First-Serve (FCFS) fail to satisfy the Quality-of-Service (QoS) requirements of Industrial-IoT and autonomous-vehicle workloads. This paper presents Multi-Queue Priority-Based Scheduling (MQPBS), a lightweight algorithm that classifies tasks into three dynamic priority queues (High, Medium, Low) using deadline-aware heuristics, applies Shortest-Job-First (SJF) intra-queue ordering, and employs an aging mechanism to prevent starvation. Extensive simulation over task sets of 200–1000 tasks demonstrates that MQPBS reduces average waiting time by up to 17.6%, improves throughput by up to 10.8%, lowers energy consumption by 20%, and cuts the Deadline Miss Ratio (DMR) compared with the Priority-Aware Task-Scheduling (PaTS) baseline. Ablation experiments confirm the independent contribution of each algorithmic component. Scalability and sensitivity analyses further validate the robustness of MQPBS under heterogeneous arrival patterns and varying load intensities. The results establish MQPBS as a scalable, reliable scheduler for next-generation edge infrastructures.
Shibang Maity, Roshan Panda, M. Tanisha et al.· International Conference on...· 0 citations
The rapid growth of Internet-of-Things (IoT) devices has increased the need for computing support close to end users, particularly for applications that cannot tolerate long processing delays or excessive energy consumption. Fog computing has emerged as a practical extension of the cloud to address these requirements, yet real deployments often involve a mix of devices with different processing abilities, communication characteristics, and power constraints. These differences make it difficult to decide when and where tasks should be offloaded.
This study introduces a task-offloading approach that adapts to changing conditions in a heterogeneous fog environment. The method continuously observes factors such as processor utilization, task size, communication delay, and the remaining energy of participating devices. Using this information, the system determines whether a task should run on the originating device, a nearby fog node, or the cloud. The approach aims to limit unnecessary transfers while striking a balance between energy use and execution delay.
Simulation experiments conducted in iFogSim indicate that the proposed strategy consistently improves performance over conventional static or energy-unaware schemes. The results show notable reductions in overall energy usage and significant improvements in task-completion success under varying network loads. These findings suggest that integrating real-time monitoring with adaptive decision-making can strengthen the efficiency and responsiveness of fog-based IoT systems.
Ashish Bagla, Deepak Dagar, Pratik Srivastava· International Journal For Mu...· 0 citations
The study concludes that intelligent edge computing architectures will play a vital role in supporting future real-time applications and next-generation 6G-enabled digital ecosystems.
Alan Bundy· International Journal of Mod...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
