Publications Journal article · Delay-tolerant networks · 2017

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, vol. 2017, pp. 2830542:1–2830542:18, 2017

Publisher’s versionfree

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.

Contact plans are generated from orbits and radio models, distributed to the satellites, and used by contact graph routing to build route tables — Figure CC BY 4.0

Cite

DOI 10.1155/2017/2830542

BibTeX

@article{DBLP:journals/jcnc/FraireMBFFCZV17,
  author  = {Juan A. Fraire and Pablo G. Madoery and Scott C. Burleigh and Marius Feldmann and Jorge M. Finochietto and Amir Charif and Nacer{-}Eddine Zergainoh and Raoul Velazco},
  title   = {Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations},
  journal = {Journal of Computer Networks and Communications},
  volume  = {2017},
  pages   = {2830542:1--2830542:18},
  year    = {2017},
  doi     = {10.1155/2017/2830542}
}

More on delay-tolerant networks

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.
Design challenges in contact plans for disruption-tolerant satellite networks Juan A. Fraire and Jorge M. Finochietto IEEE Communications Magazine, 2015
Abstract
During the past 20 years, space communications technologies have shown limited progress in comparison to Internet-based networks on Earth. However, a brand new working group of the IETF with focus on DTN promises to extend today's Internet boundaries to embrace disruptive communications such as those seen in space networks. Nevertheless, several challenges need to be overcome before operative DTNs can be deployed in orbit. We analyze the state of the art of effective design, planning, and implementation of the forthcoming network communications opportunities (contacts). To this end, different modeling techniques, system constraints, selection criteria, and methods are reviewed and compared. Finally, we discuss the increasing complexity of considering routing and traffic information to enrich the planning procedure, yielding the need to implement a contact plan computation element to support space DTN operation.

HAL Publisher
Routing-aware fair contact plan design for predictable delay tolerant networks Juan A. Fraire and Jorge M. Finochietto Elsevier Ad Hoc Networks, 2015
Abstract
Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks.

CONICET Digital Publisher

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