A Markov Decision Process for Routing in Space DTNs with Uncertain Contact Plans

Raverta, Fernando D.; Demasi, Ramiro; Madoery, Pablo G.; Fraire, Juan A.; Finochietto, Jorge M.; DrArgenio, Pedro R.

doi:10.1109/wisee.2018.8637330

Cited by 10 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the presented work has been focused on the contact plan construction, a study has to be performed regarding how this iterative process can connect with the Contact Graph Routing protocol. Additionally, due to the little level of accuracy uncertainity, this solution could be evaluated as an integration of routing protocols that take in consideration this situation, such as in [35]- [37].…”

Section: Discussionmentioning

confidence: 99%

Assessment of Satellite Contacts Using Predictive Algorithms for Autonomous Satellite Networks

et al. 2020

View full text Add to dashboard Cite

Upcoming Low Earth Orbit Satellite Networks will provide low-latency and high downlink capacity necessary for future broadband communications and Earth Observation missions. This architecture was proposed at the beginning of the 90's, although it has just recently re-gained popularity thanks to the so-called Mega-Constellations. This network is composed of satellites that have Inter-Satellite Links (ISL) to communicate between them. Due to the satellite motion, an ISL is a temporal contact between two satellites characterized by a lifetime in which the communication remains feasible. The determination of a route between distant satellites is a challenging problem in this context. However, the satellite follows a well-known deterministic orbit trajectory, being feasible the prediction of its position by propagating a trajectory model over time. The Contact Graph Routing protocol uses this feature to determine the evolution of the routes by pre-computing on-ground a planning of the satellite contacts. This centralized grounddependent solution cannot be directly applied in the Internet of Satellites paradigm, which proposes the autonomous deployment of heterogeneous satellite networks without pre-assuming any specific satellite system architecture. Following this concept, the present work proposes a distributed algorithm by which a satellite predicts neighbor contacts, and generates a global contact plan without trajectory propagation. To achieve this solution, an ISL has been modeled as a ''close approach'' between two satellites, which is characterized by their relative motion. The present work details the predictive algorithm, and evaluates its performance in two scenarios with a hybrid satellite constellation and a mega-constellation.INDEX TERMS Satellite networks, satellite communications, predictive algorithms, federated satellite systems, Internet of Satellites, inter-satellite link.

show abstract

Section: Discussionmentioning

confidence: 99%

Assessment of Satellite Contacts Using Predictive Algorithms for Autonomous Satellite Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Recent studies have proposed formal methods to model these probabilistic routing and copy-based forwarding questions [90]. The probabilistic contact plan may be modeled as a Markov Decision Process (MDP), from which optimal copybased routing policies can be obtained [91].…”

Section: B Resiliencementioning

confidence: 99%

Routing in the Space Internet: A contact graph routing tutorial

Fraire

Jonckère

Burleigh

2021

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

“…In this paper, we present Routing under Uncertain Contact Plans (RUCoP), a comprehensive framework to execute reliable routing under uncertain contact plans. RUCoP embraces single copy [36] and extends it to multiple-copy routing in an overcoming MDP model expression. As the fact of considering multiple copies renders the focus of [36] unsuitable, we propose a novel MDP formulation accompanied by a specific resolution algorithm.…”

Section: Contributionsmentioning

confidence: 99%

“…RUCoP embraces single copy [36] and extends it to multiple-copy routing in an overcoming MDP model expression. As the fact of considering multiple copies renders the focus of [36] unsuitable, we propose a novel MDP formulation accompanied by a specific resolution algorithm. The fact of using MDP arises naturally since the Markov kernel corresponds to probabilistically quantified uncertainty on the contacts while the decisions (or the non-determinism) of the MDP correspond to the possibilities of routing decisions of each node at a given time.…”

Section: Contributionsmentioning

confidence: 99%

“…These papers essentially showed that existing routing schemes only perform well on their respective domains (perfectly scheduled or fully opportunistic), while significant room for improvement was identified for scenarios with uncertain schedules. In order to evaluate the potential improvement, the authors in [36] have approached the problem with a first theoretical formulation based on probabilistic model checking techniques [37,38,39], where the contact plan with its respective fault probabilities is modelled as a Markov Decision Process (MDP). Although this first approach provided a compelling optimal solution for single-copy routing, replication-based heuristics remained an open topic.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Routing in Delay-Tolerant Networks under Uncertain Contact Plans

Raverta¹,

Fraire²,

Madoery³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Delay-Tolerant Networks (DTN) enable store-carry-and-forward data transmission in networks challenged by frequent disruptions and high latency. Existing classification distinguishes between scheduled and probabilistic DTNs, for which specific routing solutions have been developed. In this paper, we uncover a gap in-between where uncertain contact plans can be exploited to enhance data delivery in many practical scenarios described by probabilistic schedules available a priori. Routing under uncertain contact plans (RUCoP) is next formulated as a multiple-copy Markov Decision Process and then exported to local-knowledge (L-RUCoP) and Contact Graph Routing extensions (CGR-UCoP) which can be implemented in the existing DTN protocol stack. RUCoP and its derivations are evaluated in a first extensive simulation benchmark for DTNs under uncertain contact plans comprising both random and realistic scenarios. Results confirm that RUCoP and L-RUCoP closely approach the ideal delivery ratio of an oracle, while CGR-UCoP improves state-of-the-art DTN routing schemes delivery ratio up to 25%.

show abstract

A Markov Decision Process for Routing in Space DTNs with Uncertain Contact Plans

Cited by 10 publications

References 12 publications

Assessment of Satellite Contacts Using Predictive Algorithms for Autonomous Satellite Networks

Assessment of Satellite Contacts Using Predictive Algorithms for Autonomous Satellite Networks

Routing in the Space Internet: A contact graph routing tutorial

Routing in Delay-Tolerant Networks under Uncertain Contact Plans

Contact Info

Product

Resources

About