Publications Conference paper · Delay-tolerant networks · 2023

Enhanced Pathfinding and Scalability with Shortest-Path Tree Routing for Space Networks

Olivier De Jonckère, Juan A. Fraire, and Scott Burleigh

IEEE International Conference on Communications (ICC), pp. 4082–4088, 2023

Abstract

Contact Graph Routing (CGR) is the state-of-the-art deterministic routing approach for scheduled space Delay-tolerant Networks (DTN). Indeed, CGR outlined the Schedule-Aware Bundle Routing (SABR) recommended standard from the Consultative Committee for Space Data Systems (CCSDS). The core approach exploits the predictability of space node mobility patterns and link availability, which is imprinted in time-varying graphs fed to Dijkstra and Yen's algorithms for route computation (pathfinding). This paper addresses the scalability issues CGR faces when computing routes over large-scale contact plans spanning several nodes and long-term planning horizons. After an in-depth analysis of the main CGR computation limitations, we propose multipath-tracking and tree-caching embedded in the Shortest-Path tree routing for Space Networks (SPSN) routing scheme. Simulation results show that SPSN's route computation time does not increase with increasing contact plan horizon while slightly improving on CGR's delivery rate.

Cite

DOI 10.1109/icc45041.2023.10279514

BibTeX

@inproceedings{DBLP:conf/icc/JonckereFB23,
  author    = {Olivier De Jonck{\`{e}}re and Juan A. Fraire and Scott Burleigh},
  title     = {Enhanced Pathfinding and Scalability with Shortest-Path Tree Routing for Space Networks},
  booktitle = {IEEE International Conference on Communications (ICC)},
  pages     = {4082--4088},
  publisher = {{IEEE}},
  year      = {2023},
  doi       = {10.1109/icc45041.2023.10279514}
}

More on delay-tolerant networks

Autonomous Max-Flow Interplanetary Laser Link Scheduling for Martian Exploration Jason Gerard, Andre Ibrahim, Juan A. Fraire, and Sandra Céspedes IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE), 2024
Abstract
New communication technologies like delay and disruption-tolerant networking (DTN) and free-space laser communications are being developed to handle massive planetary telemetry data. However, existing infrastructure cannot meet the scalability and autonomy demands of future space missions, resulting in 95% of data left on the mission planet. Manual scheduling of deep-space laser transmissions by operators is inefficient and error-prone, limiting mission parallelization, while autonomous scheduling, though promising, may limit optimal network routes reducing the network capacity. We hypothesize that autonomously scheduling contact opportunities will enable acquisition, tracking, and pointing (ATP) for free-space lasers and increase the capacity of interplanetary backhaul networks. In this work, we propose the Laser Link Scheduler (LLS), which combines a novel max-flow network capacity model and a decision-making algorithm for contact selection. We define a series of deep-space communication scenarios where data is collected from orbiters around Mars and backhauled to Earth. LLS is evaluated in simulations using contact plans generated based on realistic conditions and orbital dynamics. Our results confirm that autonomous contact scheduling increases network capacity by 1.5-2x, reducing operational costs and enabling highly parallel space exploration missions.

HAL Publisher
Ring Road Networks: Access for Anyone Marius Feldmann, Juan A. Fraire, Felix Walter, and Scott C. Burleigh IEEE Communications Magazine, 2022
Abstract
Several billion people currently lack reliable access to the Internet and thus to a tremendous source of knowledge. In this article, we describe a field-tested communication approach combining CubeSat platforms and delay-tolerant networking (DTN) solutions to provide asynchronous connectivity to populations and regions that are underserved by the Internet. The resulting class of networks is known as ring road networks (RRNs), a networking approach that is built on technology developed for the construction of a solar system Internet. The necessary self-sufficiency of DTN nodes enables network access to be deployed incrementally at low cost, supporting communities that cannot be profitably served by Internet satellite constellations. We present the RRN architecture and evaluate the expected performance by means of simulations. Based on the latter, we discuss µD3TN: a lightweight and open source DTN protocol stack for RRNs and other DTN classes. µD3TN has been flight-tested in ESA's OPS-SAT in low Earth orbit during December 2020 and May 2021. This work discusses the experiment results as we validated the RRN approach in concrete application use cases. The reported outcomes motivate a new application domain.

HAL Publisher
Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks Pedro R. D'Argenio, Juan A. Fraire, Arnd Hartmanns, and Fernando D. Raverta ACM Transactions on Modeling and Computer Simulation, 2025
Abstract
In delay-tolerant networks (DTNs) with uncertain contact plans, the communication episodes and their reliabilities are known a priori . To maximise the end-to-end delivery probability, a bounded network-wide number of message copies are allowed. The resulting multi-copy routing optimization problem is naturally modelled as a Markov decision process with distributed information. In this paper, we provide an in-depth comparison of three solution approaches: statistical model checking with scheduler sampling, the analytical RUCoP algorithm based on probabilistic model checking, and an implementation of concurrent Q-learning. We use an extensive benchmark set comprising random networks, scalable binomial topologies, and realistic ring-road low Earth orbit satellite networks. We evaluate the obtained message delivery probabilities as well as the computational effort. Our results show that all three approaches are suitable tools for obtaining reliable routes in DTN, and expose a tradeoff between scalability and solution quality.

HAL Publisher

Delay-tolerant networks: the topic page All 84 papers on this topic