2016 IEEE 13th International Conference on Signal Processing (ICSP) 2016
DOI: 10.1109/icsp.2016.7878015
|Get access via publisher |Cite
|
Sign up to set email alerts

SADR: Network status adaptive QoS dynamic routing for satellite networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…In terms of inter-satellite transmission strategy, Jiang et al proposed a load-aware routing algorithm, which can adapt to the changing network load, avoid blocking paths and effectively improve the throughput of the entire satellite network [16]. Yan et al proposed a state adaptive QoS dynamic routing algorithm based on ant colony optimization [17]. The algorithm collects the QoS state information of nodes and links in satellite network, including path delay, bandwidth utilization and link packet loss rate, then calculates the optimal path and balances the load.…”
Section: A Qos Routing Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In terms of inter-satellite transmission strategy, Jiang et al proposed a load-aware routing algorithm, which can adapt to the changing network load, avoid blocking paths and effectively improve the throughput of the entire satellite network [16]. Yan et al proposed a state adaptive QoS dynamic routing algorithm based on ant colony optimization [17]. The algorithm collects the QoS state information of nodes and links in satellite network, including path delay, bandwidth utilization and link packet loss rate, then calculates the optimal path and balances the load.…”
Section: A Qos Routing Methodsmentioning
confidence: 99%
“…], [? ], [9]- [17]. Trusted nodes can be defined as a network resource set, which can provide continuous transmission for service requests without being affected by external factors.…”
Section: Introductionmentioning
confidence: 99%
“…Wen et al [17], Houtian et al [18], and Dong et al [19] consider the optical LEO satellite network and present the corresponding ant-colony algorithms for routing and wavelength assignment. Liu et al [20], Cheng et al [21], and Yan et al [22] introduce kinds of optimizations on routing problem of the LEO network. This type of research focuses on network efficiency or load balancing.…”
Section: Related Workmentioning
confidence: 99%
“…In order to check the advantages of ACO-EFPC, we choose one of the compared algorithms named SADR [22], and another parallel algorithm which is Dijkstra algorithm with considering the same factors (latency, wavelength fragmentation, elastic bandwidth, allocated bandwidth) as ACO-EFPC to form a new metric. As the it is hard to precalculate the variance and norm of each transport path for Dijkstra algorithm, we use value of allocated bandwidth as the load balancing factor of Dijkstra algorithm.…”
Section: Aco-efpc Perfermancementioning
confidence: 99%
“…(3) Best effort service. Such services have no special requirements for delay, bandwidth, packet loss rate and so on [24].…”
Section: Multi Topology Routing Algorithmmentioning
confidence: 99%