Publications Journal article · Delay-tolerant networks · 2018

On route table computation strategies in Delay-Tolerant Satellite Networks

Juan A. Fraire, Pablo G. Madoery, Amir Charif, and Jorge M. Finochietto

Elsevier Ad Hoc Networks, vol. 80, pp. 31–40, 2018

Abstract

Delay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path computation over large and highly-dynamic yet predictable topologies of such networks requires complex algorithms such as Contact Graph Routing (CGR) to calculate route tables, which can become extremely large and limit forwarding performance if all possible routes are considered. In this work, we discuss these issues in the context of CGR and propose alternatives to the existing route computation scheme: first-ending, first-depleted, one-route, and per-neighbor strategies. Simulation results over realistic DTSN constellation scenarios show that network flow metrics and overall calculation effort can be significantly improved by adopting these novel route table computation strategies.

Cite

DOI 10.1016/j.adhoc.2018.07.002

BibTeX

@article{DBLP:journals/adhoc/FraireMCF18,
  author  = {Juan A. Fraire and Pablo G. Madoery and Amir Charif and Jorge M. Finochietto},
  title   = {On route table computation strategies in Delay-Tolerant Satellite Networks},
  journal = {Elsevier Ad Hoc Networks},
  volume  = {80},
  pages   = {31--40},
  year    = {2018},
  doi     = {10.1016/j.adhoc.2018.07.002}
}

More on delay-tolerant networks

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations Juan A. Fraire, Pablo G. Madoery, Scott C. Burleigh, Marius Feldmann, Jorge M. Finochietto, Amir Charif, Nacer-Eddine Zergainoh, and Raoul Velazco Journal of Computer Networks and Communications, 2017
Abstract
Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performance and robustness of Contact Graph Routing (CGR) algorithm, the state-of-the-art routing scheme for space-based DTNs. To this end, after a thorough description of CGR, two appealing satellite constellations are proposed and evaluated by means of simulations. Indeed, the DtnSim simulator is introduced as another relevant contribution of this work. Results enabled the authors to identify existing CGR weaknesses and enhancement opportunities.

Publisher
Delay Tolerant Satellite Networks Juan A. Fraire, Jorge M Finochietto, and Scott C Burleigh Artech House, 2017
Abstract
This cutting-edge resource provides a comprehensive treatment of applying delay-tolerant networking (DTN) principles to satellite-based network communications. Detailed models and analytical tools are used to evaluate performance and provide guidance in the field. This book presents the state-of-the-art in existing on-board and ground technologies that support satellite applications, such as communications protocols, algorithms, and security procedures. Readers gain key insight into the fundamental concepts of DTN applied to satellite networks (DTSNs) and case studies are provided. This book presents an authoritative introduction to the methods for computing metrics for satellite network modeling. Satellite communications are examined, including satellite links, communication protocols, and distributed multiple access schemes, such as time division, code division, and frequency division. This book focuses on ways in which DTN might make terrestrial communication and observation via earth orbiting satellites less expensive and more robust. The fundamental concepts and analysis of the Ring Road Architecture are explored. Unique analyses on the motivating factors of using Inter-Satellite Links (ISL) to form networks in disruptive environments in space are discussed. This book explores the limits of larger and complex DTSNs as the number of satellites increase and different orbital formations become possible. As satellite networks become larger in upcoming years this book provides a guide for readers to stay informed about standard protocols such as DTN that will allow seamless interoperation, cost reduction, and risk mitigation.
Routing in the Space Internet: A contact graph routing tutorial Juan A. Fraire, Olivier De Jonckère, and Scott C. Burleigh Elsevier Journal of Network and Computer Applications, 2021
Abstract
A Space Internet is possible, as long as the delay and disruption challenges imposed by the space environment are properly tackled. Because these conditions are not well addressed by terrestrial Internet, more capable Delay-Tolerant Networking (DTN) protocols and algorithms are being developed. In particular, the principles and techniques for routing among ground elements and spacecraft in near-Earth orbit and deep-space are enacted in the Contact Graph Routing (CGR) framework. CGR blends a set of non-trivial algorithm adaptations, space operations concepts, time-dynamic scheduling, and specific graph models. The complexity of that framework suggests a need for a focused discussion to facilitate its direct and correct apprehension. To this end, we present an in-depth tutorial that collects and organizes first-hand experience on researching, developing, implementing, and standardizing CGR. Content is laid out in a structure that considers the planning, route search and management, and forwarding phases bridging ground and space domains. We rely on intuitive graphical examples, supporting code material, and references to flight-grade CGR implementations details where pertinent. We hope this tutorial will serve as a valuable resource for engineers and that researchers can also apply the insights presented here to topics in DTN research.

HAL Publisher

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