2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) 2018
DOI: 10.1109/aina.2018.00014
|View full text |Cite
|
Sign up to set email alerts
|

Queue State Based Dynamical Routing for Non-geostationary Satellite Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…This algorithm boasts efficiency and flexibility, with congestion avoidance strategies enhancing the reliability and efficiency of data transmission. Li et al [2] proposed a dynamic routing update algorithm based on real-time queue and routing state models to balance traffic loads and ensure the prompt transmission of data packets from each satellite, thereby avoiding congestion at the current node. They employ a load balancing mechanism to achieve equilibrium in information transfer across intranetwork links, facilitating enhanced overall system throughput and congestion avoidance.…”
Section: Global Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm boasts efficiency and flexibility, with congestion avoidance strategies enhancing the reliability and efficiency of data transmission. Li et al [2] proposed a dynamic routing update algorithm based on real-time queue and routing state models to balance traffic loads and ensure the prompt transmission of data packets from each satellite, thereby avoiding congestion at the current node. They employ a load balancing mechanism to achieve equilibrium in information transfer across intranetwork links, facilitating enhanced overall system throughput and congestion avoidance.…”
Section: Global Strategymentioning
confidence: 99%
“…(1) Based on the predictability of satellite networks, the concept of a continuous neighbor set is proposed, which includes nodes that can maintain continuous connections with the predecessor and successor of congested nodes. (2) The MOLM algorithm is used, which employs the multi-objective simulated annealing (MOSA) framework to iteratively derive an optimal element from the continuous neighbor set to replace congested nodes within a specific path, generating the final solution aimed at alleviating network congestion. (3) A comprehensive comparative experiment is conducted to demonstrate the performance of the MOLM algorithm, including comparative experiments under different networking methods and varying satellite constellation densities.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, congestion and queuing delays must be added to the routing scheme for dynamic traffic balancing. In 2019, the work in [104] investigated a new routing update method. The method accurately detects queuing delays and dynamically adjusts routing paths according to queue changes.…”
Section: Traffic Balancing Dynamic Routingsmentioning
confidence: 99%
“…Authors in [27] design a Queue State-based Dynamic Routing (QSDR) for LEO, where the queue state is only estimated from the available number of packets in the satellite queue. The average and instantaneous queue lengths are weighted and combined to provide a reasonable estimate, which needs to be tailored for specific scenarios.…”
Section: State Of the Art Reviewmentioning
confidence: 99%