Load balancing strategy and its lookup-table enhancement in deterministic space delay/disruption tolerant networks

Huang, Jinhui; Liu, Wenxiang; Su, Yingxue; Wang, Feixue

doi:10.1016/j.asr.2017.10.045

Cited by 9 publications

(9 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, many researchers have shown that an unfairly distributed load on nodes which are better connected leads to congestion in the network [24,25]. When a path is congested, nodes in that path get rid of messages because there is not enough space in their buffers [26]. To address this problem, the proactive congestion avoidance scheme proposed in Le et al [27] is adopted in our algorithm.…”

Section: Proactive Congestion Avoidancementioning

confidence: 99%

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

Ali¹,

Lenando²,

Chaoui³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Recently, Opportunistic Networks (OppNets) are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices. OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times. Data is forwarded and stored in intermediate nodes until the next opportunity occurs. Therefore, achieving a high delivery ratio in OppNets is a challenging issue. It is imperative that any routing protocol use network resources, as far as they are available, in order to achieve higher network performance. In this article, we introduce the Resource-Aware Routing (ReAR) protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained, stateless and non-social OppNets. The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time. The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator. Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR, Epidemic MaxProp, energy-aware Spray and Wait and energy-aware PRoPHET in terms of message delivery ratio and overhead ratio.

show abstract

Section: Proactive Congestion Avoidancementioning

confidence: 99%

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

Ali¹,

Lenando²,

Chaoui³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…With global information properly synchronized, solutions [11] and [12] further improved the load balancing performance. In [11], the author proposed the hybrid load balancing routing, where they designed a long-distance traffic detour method.…”

Section: Related Workmentioning

confidence: 99%

“…The method can predict the regional and realtime network states that are prone to cascading congestion, according to which the scheme calculates the multipath route. Considering the congestion state and end-to-end delay of local nodes, neighboring nodes, and other relay nodes, the author of [12] combined offline calculation and online adjustment to recalculate the multipath routing table [12].…”

Section: Related Workmentioning

confidence: 99%

A Load Balancing Routing Strategy for LEO Satellite Network

et al. 2020

View full text Add to dashboard Cite

The LEO network composed of massive satellite nodes is a hot research field at present. In such a network, the problem of load balancing should be reconsidered due to the large number of satellite nodes, the frequently changing topology, and the uneven distribution of global ground users. To solve such problem, a selective iterative Dijkstra algorithm (SIDA) is proposed to optimize the path finding process by reducing the reuse frequency of nodes. On the basis of SIDA, a selective split load balancing strategy (SSLB) is proposed to solve the link congestion problem in low latitude LEO network. SSLB is a distributed strategy, which diverts the traffic flow of congestion nodes to neighboring nodes. SSLB reduces the burden of neighbor nodes, which need the less demand of computing resources and signaling interaction. Simulation results show that SIDA reduces the number of congestion links and balances the load distribution, while SSLB can effectively suppress the number of new congestion links after traffic diversion. These algorithms provide a load balancing solution for LEO satellite network.

show abstract

“…In this paper, we use OPNET14.5 to simulate the proposed routing scheme. We use ELB (Explicit Load Balancing) and DSP (Dijkstra Short Path) [4] as comparison routing schemes, and we set α = 3,β = 5,γ = 0.7,λ = 0.6,μ = 0.4. We simulated Iridium satellite constellation, the simulation parameters are presented in TABLE II.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The goal of load-balancing routing is to let the path goes through low traffic load satellite node. The current load-balancing routing scheme includes [4]: Datagram Routing Algorithm (DRA) and Explicit Load Balancing (ELB). The DRA makes full use of the physical characteristics of the polar orbit constellation itself and does not require on-board processing overhead and signaling overhead, but it is not robust enough to handle satellite node failures and link failures.…”

Section: Introductionmentioning

confidence: 99%

Agent-Based Load Balancing and Qos Routing for Leo Satellite Networks

Li¹,

Hu²,

Deng³

et al. 2018

dtcse

View full text Add to dashboard Cite

This paper proposes and evaluates the Agent-based load balancing and QoS routing (ALBQR) in the low earth orbit (LEO) satellite networks. Two kinds of agents are designed. Stationary agents located at the satellites calculate link cost using the sum of propagation and queuing delays, employ FARIMA model to predict the traffic of satellite node, modify the link cost based on the predicted traffic. Mobile agents migrate among satellites to gather link status information, notify stationary agents to update routing tables and reserve resource. Mobile agents carry user's delay, bandwidth and packet loss rate, explore the routing path of satisfy the lowest path cost and QoS constraints. Through simulations on an Iridium satellite network, ALBQR is shown to achieve a balanced traffic distribution among satellites, provide better throughput, decrease packet loss and average end-to-end delay.

show abstract

Load balancing strategy and its lookup-table enhancement in deterministic space delay/disruption tolerant networks

Cited by 9 publications

References 16 publications

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

A Load Balancing Routing Strategy for LEO Satellite Network

Agent-Based Load Balancing and Qos Routing for Leo Satellite Networks

Contact Info

Product

Resources

About