Juan A. Fraire

Researcher in Space Networking and Informatics

Inria CONICET Saarland University

Publications Conference paper · Delay-tolerant networks · 2026

IR-CGR: Time-Aware Inter-Region Contact Graph Routing for Scalable Space DTNs

Shota Suzuki, Juan A. Fraire, and Keisuke Uehara

IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE), Space-Terrestrial Internetworking Workshop (STINT), 2026

ShareLinkedInXBlueskyEmail

Abstract

Regionalization techniques scale Contact Graph Routing (CGR) in space Delay-Tolerant Networks by partitioning the network into routing regions, but existing local-knowledge schemes treat inter-region routing as a time-static problem: the set of viable passageways (nodes bridging two regions) is fixed at plan-derivation time. In orbital environments where passageway availability changes continuously, a statically selected passageway may have no contact left to carry a bundle onward by its arrival time, causing delivery failures. We propose IR-CGR, an Inter-Region Contact Graph Routing algorithm that constructs a time-aware Inter-Region Contact Plan (IRCP) over passageway nodes and applies contact-graph Dijkstra hierarchically at both intra- and inter-region levels, with a sampling parameter Δt that trades IRCP size against temporal resolution. Evaluations on a synthetic scaling model and the realistic Lunar Ring Road scenario show that IR-CGR sustains 100% delivery ratio, matching full-knowledge CGR, on sparse-relay lunar configurations where the static-vent baseline collapses to 53–72%. On the largest synthetic networks, IR-CGR reduces per-bundle computational cost to 7–29% of the full-knowledge baseline at its default sampling interval (Δt = 3600 s). Delivery delay remains within ∼1.9× of the full-knowledge reference on most sparse-relay configurations, with larger penalties confined to dense synthetic networks and degenerate lunar partitions.

Cite

BibTeX
@inproceedings{suzuki2026ircgr,
  author    = {Suzuki, Shota and Fraire, Juan A. and Uehara, Keisuke},
  title     = {{IR-CGR}: Time-Aware Inter-Region Contact Graph Routing for Scalable Space {DTNs}},
  booktitle = {IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE), Space-Terrestrial Internetworking Workshop (STINT)},
  year      = {2026}
}

More on delay-tolerant networks

  1. 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.

  2. 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.

  3. 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.