Load Balanced Routing Research Articles

Load-balanced Routing Heuristics for Bandwidth Allocation of AVB Flow in TSN

Time-Sensitive Networking (TSN) is a new technology developed from Ethernet that guarantees deterministic transmission of various types of flows, such as Time-triggered (TT) flows and Audio-video-bridging (AVB) flows, in the same network. Currently, Time-aware Shaping (TAS) and Credit-based Shaping (CBS) are widely used for scheduling hybrid flows, where the credit value in CBS is directly linked to the logical bandwidth value idleSlope , which affects the real-time performance of AVB flows. However, as the network scale increases, existing bandwidth allocation methods result in higher computation times and lower allocation success rates. In this paper, the aforementioned problem is addressed by two-step: first, we design a load-balanced routing heuristic (LBRH) to improve the allocation success rate; second, we accelerate the CBS bandwidth allocation by using unified bandwidth allocation scheme, which integrates LBRH and further improves the allocation success rate. Performance evaluation in multiple test cases shows that LBRH can improve the success rate of bandwidth allocation, and the unified bandwidth allocation scheme integrating LBRH significantly reduces the overall execution time while improving the success rate of bandwidth allocation, which is more suitable for large-scale TSN networks with complex routing.

A Comprehensive Survey of Load Balancing Techniques in Multipath Energy-Consuming Routing Protocols for Wireless Ad hoc Networks in MANET

As technology progresses, networking undergoes continuous evolution to align with contemporary trends. Mobile Ad hoc Networks (MANETs) have emerged as a pivotal technology facilitating communication among mobile nodes sans a central administering node. MANETs find diverse applications spanning communication networks to battlefield scenarios. Nonetheless, MANETs encounter various challenges, including load balancing, energy efficiency, packet loss, and connection failures. Routing, among these challenges, assumes a pivotal role in defining network performance and connectivity capacity within MANETs. Moreover, the energy consumption of mobile nodes, often reliant on batteries with limited rechargeability, presents a significant concern in MANETs. This paper delves into diverse techniques devised to tackle the issues of energy efficiency and load balancing in MANETs. Additionally, it offers a comparative analysis to consolidate the survey findings. The outcomes of this study enrich our comprehension of energy-efficient and load-balanced routing protocols in MANETs, thereby facilitating the design and deployment of efficient networking solutions.

Adaptive Time-Varying Routing for Energy Saving and Load Balancing in Wireless Body Area Networks

Routing plays an essential role in ensuring normal and lasting operation of wireless body area networks (WBANs). However, existing routing schemes cause inefficient and unbalanced energy dissipation, which contributes to premature death of some nodes and high temperature within a small area of the body. In this article, we propose an adaptive time-varying routing (ATVR) protocol to address these issues. Unlike in conventional routing solutions, in our protocol a node may act as different roles (source node or relay node) and select different paths in disparate periods. This dynamic routing pattern helps to achieve a globally optimal routing solution. In ATVR, a node evaluation function and a path evaluation function are designed to reflect the node state and the path state respectively. Then, the path selection problem is transformed into a Hitchcock transportation problem, in which the nodes with worse node state act as source nodes (i.e., producers) and the nodes with better node state act as relay nodes (i.e., consumers). Then, this Hitchcock transportation problem is addressed by the AlphaBeta algorithm, in which the paths with less energy consumption and less path loss are selected to forward data. The experimental results show that our protocol has better performance in terms of energy consumption, network lifetime, and node temperature.

Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks

Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks

Load-Balancing Routing for LEO Satellite Network with Distributed Hops-Based Back-Pressure Strategy.

With the expansion of user scale in LEO satellite networks, unbalanced regional load and bursty network traffic lead to the problem of load disequilibrium. A distributed hops-based back-pressure (DHBP) routing is proposed. DHBP theoretically derives a fast solution for the minimum end-to-end propagation hops between satellite nodes in inclined-orbit LEO satellite networks; hence, link weights are determined based on remaining hops between the next hop and destination satellites. In order to control the number of available retransmission paths, the permitted propagation region is restricted to a rectangular region consisting of source-destination nodes to reduce the propagation cost. Finally, DHBP is designed distributedly, to realize a dynamic selection of the shortest link with low congestion and balanced traffic distribution without obtaining the whole network topology. Network simulation results demonstrate that DHBP has higher throughput and lower delay under high load conditions compared with state-of-the-art routing protocols.

Load-balancing routing algorithms for service congestion avoidance in LEO optical satellite networks

The low-Earth-orbit optical satellite network (LOSN) is an attractive solution to realize the end-to-end service quality of large-scale services, and it is the basis of establishing the 6G mobile network with high throughput and high reliability. However, the current LOSN is practically unable to achieve such high throughput for global service access. First, the centralized deployment of ground gateways will cause a heavy traffic load in the space segment of the LOSN, which becomes the bottleneck constraining the further growth of network throughput. Second, the high-speed movement of LEO satellites will cause continuous movement of traffic load, which will affect the scalability of routing computing. In this paper, two routing algorithms are proposed to increase the throughput in the dynamic LOSN topology. The congestion-aware load balancing (CALB) algorithm is proposed to address the inter-satellite link congestion in the dynamic LOSN topology. Then, a load-balancing routing algorithm based on satellite–ground cooperation (SGC-LB) is proposed to further reduce the impact of the network bottleneck. To evaluate the performance of the proposed routing algorithm, extensive simulations were performed on a 288-satellite Walker-Star constellation with inter-satellite links. The service blockage rate and network bandwidth utilization rate are evaluated showing the effectiveness of the proposed routing algorithm. The network using the SGC-LB algorithm can accommodate 60.00%, 56.00%, 42.22%, and 33.33% more services than using the Shortest Path algorithm, Sway algorithm, CALB algorithm, and Anycast algorithm, respectively, with zero service congestion during the simulation. The SGC-LB also gains a 6.04%, 5.00%, 5.04%, and 0.77% higher network utilization rate than the Shortest Path, Sway, CALB, and Anycast algorithms, respectively.

DRL assisted multi-objective algorithm for multicast scheduling in elastic optical network

Multicasting, as a main transmission mode for most of the current applications in elastic optical network, has attracted more and more research attention. In this paper, we investigate multicast scheduling model and solving algorithm. First, we model the multicast scheduling problem as a multi-objective optimization problem (MOP) by minimizing the bandwidth resources and maximizing the user service quality, and then, we propose a deep reinforcement learning assisted multi-objective algorithm for the model (DRL-MM), in which we design source node selection strategy, routing scheme, modulation scheme and spectrum assignment scheme for each multicast session. To identify the superiority of the proposed DRL-MM, we conduct the experiments and compare DRL-MM with an approximation based Steiner tree algorithm (STA-RSA) and a load-balancing routing tree-based algorithm (LD-RSA) through the experiments. The results show that DRL-MM outperforms STA-RSA and LD-RSA in terms of both bandwidth resource usage and user service quality.

A Load Balance Routing Algorithm for Medical IoT Based on Link Quality

A Load Balance Routing Algorithm for Medical IoT Based on Link Quality

Adaptive Load Balancing for Dual-Mode Communication Networks in the Power Internet of Things

As an important part of the power Internet of Things, the dual-mode communication network that combines the high-speed power line carrier (HPLC) mode and high-speed radio frequency (HRF) mode is one of the hot directions in current research. Since non-uniform transmission demands for power consumption information can lead to link congestion among nodes, improving the network load-balancing performance becomes a critical issue. Therefore, this paper proposes a load-balancing routing algorithm for dual-mode communication networks, which is achieved in dual-mode communication networks by adding alternate paths and proxy coordinator (PCO) node election mechanism. Simulation results show that the proposed algorithm achieves the load-balanced distribution of power consumption information transmission. The proposed scheme reduces the delay and packet loss rate, as well as improving the throughput of dual-mode communication compared to existing routing algorithms.

DRL-Based Load-Balancing Routing Scheme for 6G Space–Air–Ground Integrated Networks

Due to the rapid development of the space–air–ground integrated network (SAGIN), a satellite communication system has the advantages of wide coverage and low requirements for a geographical environment and is gradually becoming the main competitive technology for 6G. The low-earth-orbit (LEO) satellite network has the characteristics of low transmission delay, small propagation loss, and global coverage, and its exploration has become the main research object of contemporary satellite communications. However, traditional routing algorithms cannot adapt to the characteristics of the high dynamics and load-balancing requirements of LEO satellite networks. In this paper, a load-balancing routing algorithm for LEO satellites based on Deep Q-Network (DQN-LLRA) is proposed by using deep reinforcement learning. Making use of the model obtained by the DQN training, satellite nodes can select the best routing results according to the delay, bandwidth, and queue utilization of the surrounding satellite nodes. The simulation and analysis show that the path load obtained by the proposed algorithm is low. Compared with the Q-learning-based algorithm, this algorithm reduces the maximum queue utilization rate of the routing path by 5%, reduces the average queue utilization rate of the routing path by 13%, and effectively balances the load in the network.

Energy‐efficient multipath clustering with load balancing routing protocol for wireless multimedia sensor networks

AbstractWireless multimedia sensor networks (WMSNs) has the capability of collecting scalar information, as well as multi‐media events like moving object tracking and traffic fatalities. Because energy in WMSNs is a constrained resource, several researchers offered cluster routing approaches, and most protocols generally do not offer an average resource usage of the network that is balanced and minimised. To address this issue, this paper proposes an Energy‐Efficient Multipath Clustering with Load Balancing Routing Protocol for WMSNs (EEMCL) to prolong the network lifetime. The suggested protocol, which segments the network into layers of clusters, would be implemented using multi‐hop. Sensing data from the sensor is transmitted to the sink by the main cluster heads in each layer, cooperating with the cluster heads in the upper layers. The proposed protocol improves energy dissipation, network life‐times, and network stability according to simulation results when compared with SEP, SEP‐E, and SEPFL protocols. The last node dead for the proposed protocol is at round 5833, 4027 for SEPFL, 2828 for SEP‐E, and 2325 for SEP.

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.

Demand-oblivious routing in complex networks under uncertainty

Real-world communication networks are complex networks, but designing load-balancing routing strategies in complex networks is not an easy task, especially when the traffic demand is under uncertainty. To hedge against such uncertainty, we propose a demand-oblivious routing strategy in complex networks (DOR-CN). Unlike traditional optimization-model-based methods, DOR-CN decouples the routing calculation with traffic demand by a randomized routing algorithm following the oblivious routing paradigm, and is able to achieve load-balancing without knowing the accurate traffic demand. In order to avoid the embedding distortion of complex networks, DOR-CN transfers the metric space of classical oblivious routing into the hyperbolic space. Theoretical derivation can prove that for arbitrary traffic demand matrix, the network congestion of DOR-CN routing strategy is under guaranteed. Experimental results demonstrate that DOR-CN can not only reduce network congestion, but also achieve better load-balancing performance and lower risk of route failures.

STALB: A Spatio-Temporal Domain Autonomous Load Balancing Routing Protocol

Due to vehicle mobility, the topology of Vehicle Ad-hoc Networks (VANETs) may change dynamically. High mobility, limited bandwidth, and dynamic network topology pose challenges for communication in the Internet of Vehicles (IoVs). Literature works have attempted to promote efficient (e.g., lower end-to-end latency) message forwarding. However, due to the uncertain direction of message forwarding and vehicle mobility, they suffer from unreachable destinations and unstable connections. This paper explores the efficient method of message forwarding to alleviate network congestion in IoVs. We propose a Spatio-Temporal domain Autonomous Load Balancing (STALB) routing protocol. Specifically, STALB is a trajectory-based method for controlling the direction of message forwarding. STALB can significantly reduce the end-to-end latency and overload ratio, since it considers the local status of network relay devices (i.e., buffer score, congestion status) from the spatio-temporal domain. Then, we present a path reconstruction mechanism, which ensures that messages are forwarded to destinations within limited Time-To-live (TTL). Extensive simulation results show that STALB significantly outperforms other baseline methods (BSaW, TDOR, and TBHGR) regarding overhead ratio, average delivery latency, and average buffer time. Especially, the delivery rate of STALB can reach 99.9% under the sparse network scenario (4,500 messages), at least 0.7% higher than other baseline methods. Similarly, the average delivery delay of STALB is at least 84.31% lower than that of other baseline methods under the dense network scenario (18,000 messages).

An evolutionary routing protocol for load balancing and QoS enhancement in IoT enabled heterogeneous WSNs

Energy awareness is a key concern of recent advances in the Internet of Things (IoT) enabled wireless sensor networks (WSNs), and many optimization approaches to reduce energy consumption have been proposed. The most widely used routing technique for achieving energy efficiency in WSNs is the clustering hierarchy. Data transmission over long distances has a negative impact on network efficiency in terms of stability period, network lifetime, and QoS due to the selection of inadequate Cluster Heads (CHs). This paper describes a new Evolutionary Gateway-based Load-Balanced Routing (E-GLBR) algorithm for efficiently selecting appropriate CHs. The proposed algorithm is based on the genetic algorithm optimization method with a new fitness function that takes into account four major parameters to achieve the following goals: improving the CH selection process, reducing energy transmission range, increasing network stability and lifetime, and improving WSN coverage. A comparison simulation with the most recent related methods in MATLAB simulator is performed to evaluate the performance of our proposed algorithm. The simulation findings demonstrate that applying the developed evolutionary approach reduces the network’s energy consumption rate and increases the wireless network throughput. In various network scenarios, our suggested approach surpasses all other examined methods, extending the network coverage and prolonging the stability periods of Evolutionary Routing Protocol (ERP), Energy-Efficient Weighted Clustering (EEWC), Distance Incorporated Modified Stable Election Protocol (D-MSEP), and Energy dependent cluster formation (EDCF) by 55%, 43%, 26%, and 12% respectively.

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

A Novel Gradient Boosted Energy Optimization Model (GBEOM) for MANET

Mobile Ad Hoc Network (MANET) is an infrastructure-less network that is comprised of a set of nodes that move randomly. In MANET, the overall performance is improved through multipath multicast routing to achieve the quality of service (quality of service). In this, different nodes are involved in the information data collection and transmission to the destination nodes in the network. The different nodes are combined and presented to achieve energy-efficient data transmission and classification of the nodes. The route identification and routing are established based on the data broadcast by the network nodes. In transmitting the data packet, evaluating the data delivery ratio is necessary to achieve optimal data transmission in the network. Furthermore, energy consumption and overhead are considered essential factors for the effective data transmission rate and better data delivery rate. In this paper, a Gradient-Based Energy Optimization model (GBEOM) for the route in MANET is proposed to achieve an improved data delivery rate. Initially, the Weighted Multi-objective Cluster-based Spider Monkey Load Balancing (WMC-SMLB) technique is utilized for obtaining energy efficiency and load balancing routing. The WMC algorithm is applied to perform an efficient node clustering process from the considered mobile nodes in MANET. Load balancing efficiency is improved with a higher data delivery ratio and minimum routing overhead based on the residual energy and bandwidth estimation. Next, the Gradient Boosted Multinomial ID3 Classification algorithm is applied to improve the performance of multipath multicast routing in MANET with minimal energy consumption and higher load balancing efficiency. The proposed GBEOM exhibits ∼4% improved performance in MANET routing.

Distance-Based Back-Pressure Routing for Load-Balancing LEO Satellite Networks

Featuring wide coverage and high data rate, LEO satellite networks will be an important supplement to the traditional terrestrial networks, enabling the space-air-ground integrated network service. However, effective load balancing routing strategies for LEO satellite networks need to be designed, due to the bursty characteristic of the network traffic and imbalanced regional communication load. To achieve that, we propose a Distance-based Back-Pressure Routing (DBPR) strategy for LEO satellite networks. DBPR calculates the link weights based on a novel distance-based metric, which can select uncongested short-distance paths to the destinations and distribute network traffic dynamically with low delay. To control the number of forwardings in the network, we restrict the transmission range to a rectangle region between each source-destination pair. We design DBPR in the distributed fashion without collecting the global network load information, which is suitable for LEO satellite networks with limited resources, long propagation delay, dynamic topology, etc. We analyze the network stability and prove the throughput optimality of DBPR. Simulation results demonstrate that DBPR can achieve higher throughput and lower delay, compared with the state-of-the-art strategies, especially in the environments with limited cache resource.

Equilibrium Allocation Approaches of Quantum Key Resources With Security Levels in QKD-Enabled Optical Data Center Networks

In this article, the network performance of equilibrium allocation of quantum key resources was investigated in quantum key distribution (QKD)-enabled optical data center networks. To effectively use quantum key resources, we propose three novel efficient load balancing routing, wavelength, and time-slot assignment (LB-RWTA) approaches, including LB-RWTA with flexible security level (LB-RWTA-FSL), LB-RWTA with specific security level (LB-RWTA-SSL), and LB-RWTA without security level (LB-RWTA-NSL). Particularly, the proposed LB-RWTA-FSL approach is uniquely featured by adaptive security level classification (ASLC) and load balancing (LB), aiming to demarcate the security level (SL) and reduce the overall network congestion. We introduce an existing routing, wavelength, and time-slot assignment (E-RWTA) approach without SL, called E-RWTA, for comparison. Simulation results show the effectiveness of our proposed approaches in terms of much higher quantum key resource efficiency and thus much higher network security performance than the state-of-the-art quantum key resource allocation approaches compared with the E-RWTA approach in QKD-enabled optical data center networks.