2019 IEEE International Conference on Space Mission Challenges for Information Technology (SMC-IT) 2019
DOI: 10.1109/smc-it.2019.00009
|View full text |Cite
|
Sign up to set email alerts
|

CGR-SPI: A New Enhanced Contact Graph Routing for Multi-source Data Communication in Deep Space Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…In 2018, route table management strategies were also analyzed by Fraire et al in [92]. It was from this contribution that Yen's algorithm became the default routing management approach for CGR in ION as described in Section V. In 2019, a spanning-tree formulation was proposed as a CGR alternative to compute routes to several destinations [93], and a partial queue information sharing was introduced in [94]. In that same year, the Schedule Aware Bundle Routing (SABR) recommended standard (blue book) was released by CCSDS recommending CGR as the routing procedure for the Solar System Internet [17].…”
Section: Contact Graph Routingmentioning
confidence: 99%
See 1 more Smart Citation
“…In 2018, route table management strategies were also analyzed by Fraire et al in [92]. It was from this contribution that Yen's algorithm became the default routing management approach for CGR in ION as described in Section V. In 2019, a spanning-tree formulation was proposed as a CGR alternative to compute routes to several destinations [93], and a partial queue information sharing was introduced in [94]. In that same year, the Schedule Aware Bundle Routing (SABR) recommended standard (blue book) was released by CCSDS recommending CGR as the routing procedure for the Solar System Internet [17].…”
Section: Contact Graph Routingmentioning
confidence: 99%
“…It is worth mentioning that we (and ION) assume that the queuing status of remote nodes is not available, as timely access to such information cannot be guaranteed in a DTN. Note, though, that works such as[67],[68],[94] have exploited this knowledge at forwarding time in non-delayed networks to affect the computation of effective transmission times of the bundle at remote nodes.…”
mentioning
confidence: 99%
“…In addition to this, other improvements include congestion mitigation techniques [10], route table management strategies and the incorporation of Yen's algorithm [11]. Furthermore, the incorporation of opportunistic [12] and probabilistic contacts [13], the design of new schemes to enhance the scalability [14], a spanningtree formulation to compute routes to several destinations [15], and a partial queue information sharing [16], as well as many other contributions.…”
mentioning
confidence: 99%