Search NASA⌕ Search

SEARCH · Search NASA

Results for “Delay Tolerant Networking (DTN)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Spacecraft data and relay management using delay tolerant networking

NASA’s demonstration of the successful transmission of relay data through the orbiting Mars Odyssey, Mars Global Surveyor, and Mars Express by the Mars Exploration Rovers has shown not only the benefit of using a relay satellite for multiple landed assets in a deep space environment but also the benefit of international standards for such an architecture. As NASA begins the quest defined in the Vision for Exploration with robotic and manned missions to the Moon, continues its study of Mars, and is joined in these endeavors by countries world-wide, landed assets transmitting data through relay satellites will be crucial for completing mission objectives. However, this method of data delivery will result in increased complexity in routing and prioritization of data transmission as the number of missions increases. Also, there is currently no standard method among organizations conducting such missions to return these data sets to Earth given a complex environment. One possibility for establishing such a standard is for mission designers to deploy protocols which fall under the umbrella of Delay Tolerant Networking (DTN). These developing standards include the Bundle Protocol (BP) which provides a standard, secure, store and forward mechanism designed for high latency and asymmetric communication links and the Licklider Transmission Protocol (LTP) which is used to provide a reliable deep space link transmission service.

Torgerson, J. Leigh↗

Networking in Interstellar Dimensions: Communicating with TRAPPIST-1

The recent discovery of potentially habitable planets orbiting the TRAPPIST-1 system intensified interest in interstellar exploration. In these challenging mission concepts, communication protocols would need to cope with unprecedented signal propagation delays. In this work, we propose and explore Delay Tolerant Networking (DTN) technologies and analyze in a case study based on the TRAPPIST-1. Results suggests that DTN protocols features could become a valuable means to achieve data delivery in future interstellar networks.

Burleigh, Scott C.↗

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗

Truncated ARQ Statistical Link Analysis for Dynamic Links

The future deep space links are migrating towards higher frequency bands such as Ka band and optical. These links are susceptible to non Gaussian and non linear effects such as atmospheric turbulence, scintillation, antenna mis-pointing, jitter, etc. These dynamic links thus will experience various degrees of fading loss, and some of these link disruptions cannot be effectively mitigated by forward error correction coding and/or interleaving. One effective way to ensure reliable communication is by using Automatic Repeat Request (ARQ) protocol, where the receiver acknowledges to the transmitter whether or not a data unit is successfully received. If a data unit is not successfully received (such as after a pre-set time-out), the transmitter would then re-transmit the lost data unit to the receiver. In a previous paper, we derived a statistical link analysis method of finding the optimal operating Signal-to-Noise Ratio (SNR) and estimating the latency of an ARQ scheme. In a more recent paper, we demonstrated the above method using the SNR distribution constructed from the Ka-band (32 GHz) flight data. To simplify the discussion, we considered the academic approach that the ARQ scheme allows for an infinite number of retransmissions. In this paper, we consider the more practical case of a truncated ARQ scheme, where there is a limit on the number of retransmissions. We derive the error probability, the optimal SNR setting, and the latency statistics of the correctly received frames of the truncated ARQ schemes. We first discuss the truncated ARQ link analysis principles using the Gaussian assumption for SNR distribution with a large variance. Next, we demonstrate the statistical truncated ARQ link analysis using the SNR distribution constructed from the Ka-band flight data. The results in this paper can be applied in the design of reliable communication systems such as the Consultative Committee for Space Data System (CCSDS) File Transfer Protocol (CFTP) and the Delay Tolerant Network (DTN).

Morabito, David↗

Extending the Licklider Transmission Protocol to Multi-Band Links

Most deep space missions return data to Earth using links operating at a single frequency band. Indeed, their data requirements are low enough that bandwidth regulations do not constrain the system. In contrast, spacecraft such as Kepler or Europa Clipper are transitioning to a new operational paradigm where engineering and science data are transmitted through simultaneous links operating at different frequency bands (henceforth termed multi-band links). This ensures, for instance, that critical data is correctly received using a well characterized X-band link, while science data at a much larger data rate can be returned efficiently (both in terms of bandwidth and energy) through a Ka-band link.Having a spacecraft establish two simultaneous links with a ground station opens a large span of potential improvements for space communications and mission operations. In this paper, we consider the problem of running a Licklider Transmission Protocol (LTP) session over a multi-band link. LTP is an implementation of a selective Automatic Repeat reQuest (ARQ) protocol, i.e. it ensures correct delivery of data over an error prone link with potentially long propagation delays. To maximize its efficiency in deep space environments, LTP operates in deferred-ACK mode and is typically included as one of the core protocols in the Delay Tolerant Networking (DTN) suite.The contributions of this paper are as follows: First, we propose an extension to LTP for multi-band links (denoted MBLTP) and sketch how it can be implemented without modifying the current definition of LTP data units. Next, we develop bounds on the performance of MBLTP when transmitting a single data file over a multi-band link. Three metrics are considered, file expected delivery time, total energy spent and bundle jitter. The results of the analytic model are first benchmarked against simulations to ensure validity, and then compared against the performance of both traditional LTP and Parallel LTP (PLTP).We demonstrate that MBLTP can significantly reduce the latency and jitter with which data products are delivered to destination over a deep space link compared to LTP at moderate energy cost. Similarly, we also demonstrate that MBLTP outperforms PLTP in all considered metrics.

Sanchez Net, Marc↗

Diving into the Data Plane of Delay Tolerant Networks

This presentation details early research towards applying data plane programming and software defined networking (SDN) to delay tolerant networking (DTN). This involved using the Programming Protocol-Independent Packet Processors (P4) language to program the data plane to handle DTN bundles natively in hardware. The results presented include a proof of concept DTN Bundle Protocol (BP) translator network middlebox, the challenges of programming a data plane to process BP, a software-defined DTN (SDDTN) architecture, and potential future applications of SDDTN. It is demonstrated that SDN and the P4 language has high potential for improving the scalability of DTN networks, although further research must be done to enable this.

Dominick Ta↗

Contact Multigraph Routing: Overview and Implementation

In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list of contacts, periods during which two DTN nodes may communicate, is used to construct a contact graph, in which contacts are vertices. A version of Dijkstra’s algorithm can then be used to find paths through this model of the timevarying network. However, since contact graphs may be large compared to the network, potentially growing with the square of the number of network nodes and linearly with the time interval represented, the resulting algorithm does not scale well with the size of the network or time. Any improvement to the routing algorithm will bring significant returns to scale. In a previous paper, we briefly introduced an alternative to the contact graph model for routing. This alternative model is based on a multigraph (a graph in which there may be multiple edges between a pair of vertices) where vertices represent network nodes instead of contacts. A version of Dijkstra’s algorithm in these multigraph models reduces the time needed to perform the same routing computations done in the existing CGR algorithm. Moreover, a modified version of Yen’s algorithm for multigraphs is included. Our variation of CGR, which we call Contact Multigraph Routing (CMR), provides an in-line replacement for the previously used pathfinding algorithms. This paper describes an implementation created based on the CMR approach, and experimental comparisons to traditional CGR are given. In addition, we explore some additional modifications to the routing pipeline traditionally assumed in CGR. These modifications range from the theoretical to the practical in terms of size and scope. We step forward our understanding of sheaftheoretic networking and describe how to model the routing pipeline using sheaves. We detail some enhanced route selection criteria that addresses some of the added complexity of DTNbased systems. We also include a future works section on future improvements and implementations that would be of service to the broader DTN community.

contact graph routing↗

Distributed Spacecraft Mission (DSM) Plume Design Reference Mission (DRM) Inter-Satellite Link Modeling, Analysis and Simulation

NASA Goddard Space Flight Center (GSFC) Radical Innovation Initiative (RI2) plans to focus intently on DSM capability advancements in FY22-24. A DSM mission involves multiple spacecraft, arranged in a constellation, to achieve one or more common goals via the use of inter-satellite links (ISL) between the satellites. Recently, the GSFC Internal Research & Development (IRAD) program established Enceladus as a design reference mission (DRM) for the current DSM effort to foster the conceptual development of communication architecture, requirements, and solutions for future DSM ISL, as well as being able to push other research areas of interest. Enceladus is an icy moon of the planet Saturn. The DRM Enceladus mission concept involves a constellation of 24 small satellites, orbiting Enceladus around 100 km altitude in 3 planes, as observing nodes for science measurement. The mission science data will be sent back to Earth through a relay orbiting Saturn, using the constellation’s inter-satellite links. A QualNet/STK simulation model of the Relay and constellation ISL optical and RF links is developed for the design and optimization of the link and orbital parameters, as well as the inter-networking protocols. Delay Tolerant Networking (DTN) is utilized in the application layer modeling. This paper describes the plume DRM mission concept of an Enceladus constellation to relay science data to Earth and includes the proposed communication architecture and operation concepts. We present details of the QualNet/STK engineering model for this communication scenario to simulate the end-to-end data traffic through multiple layers (physical, data link, networking, transport and application). A link analysis for the constellation’s ISL, constellation to Relay and Direct to Earth (DTE) optical link is provided and discussed. The results of end-to-end traffic simulation for the data throughout/latency evaluation and assessment of the communication architecture are presented. The investigation of the concept of optical multiple access (OMA) for the Plume DRM is discussed. The modeling and simulation methodology developed in this paper is applicable to other DSMs in near Earth and deep space such as Earth-Moon L1/L2 and Lunar regions.

Distributed Spacecraft Mission (DSM) Inter-satelli↗

Space Networking Implementation for Lunar Operations

The High-Rate Delay Tolerant Networking (HDTN) project at NASA has developed a performance optimized and open-source Delay Tolerant Networking (DTN) implementation. The primary goal is to create a scalable networking solution to increase the scientific data return rate of space missions. To reach this goal, HDTN must span multiple edge cases in space networking by including tools and configurations to accommodate a wide range of space systems. Typically, HDTN evaluations are conducted on a laboratory emulation test bed, made up of hardware accelerated x86 based systems capable of data rates over 10 Gbps. HDTN must have an effective implementation process on a wide range of systems to increase the sustainability of the design. One important implementation option is with low-level embedded systems which could be used on small robotic missions. This paper details the implementation process, benchmark testing, and performance results of HDTN in multiple configurations on Raspberry Pi 4 devices. By implementing HDTN on a Raspberry Pi 4, a process for building HDTN onto ARM processors was developed and utilized to conduct benchmark tests in multiple network configurations, achieving a data rate performance exceeding 600 Mbps. Based on these results, HDTN proved to run on small ARM based systems with slight modifications to the build procedure. These results were then extended to evaluating an implementation of the HDTN software parsed across several Raspberry Pi 4 nodes. To test this capability, HDTN was configured in a simplified cut-through setup and distributed among multiple Raspberry Pi 4 processors. This distributed architecture was benchmark tested in a similar fashion to the testing of a singular HDTN implementation. The results from the benchmark testing are used to examine how these implementation options and capabilities can expand the use cases for DTN, and particularly with small robotic missions.

Space Networking↗

Laser Communications Relay Demonstration: Experiments With Delay Tolerant Networking

The Laser Communications Relay Demonstration (LCRD) is a NASA mission that is presently providing a link between two optical ground stations on Earth and geosynchronous orbit; this capability will be extended to include a laser terminal on the International Space Station (ISS). From a practical perspective, LCRD provides a 1Gbps Ethernet link with an anticipated round-trip time of 4 seconds. Delay Tolerant Networking (DTN) is being used to transcend LCRDs capabilities from a point-to-point link to true network connectivity. Indeed, integrating the LCRD link into any network, such as one aboard the ISS, adds new hops and paths. In this paper, we detail DTN experiments conducted using LCRD to demonstrate how DTN and optical capabilities complement each other to enable the next generation of space communication modalities. We conclude with considerations on using LCRD to connect the ISS to the optical ground stations.

Alan Hylton↗

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗

TechEdSat-11: Prototyping Autonomous Communications in Orbit

Cognitive Engine 1 (CE-1) is a state-of-the-art automated system designed to manage routine operations and respond to adverse events without requiring human operator input. CE-1 will optimize scheduling capabilities, detect and react to link failures, and ensure data delivery deadlines are met efficiently. Seamless roaming between government and commercial providers will allow for a robust and cost-effective network. TechEdSat-11 will demonstrate two key components of CE-1: User Initiated Services (UIS) and Delay Tolerant Networking (DTN). The first phase of the experiment will use UIS to automate on-demand scheduling of a commercial S-band ground station. Later phases of the experiment will demonstrate DTN store-and-forward and space internetworking capabilities through the TechEdSat-11 S-band radio. This paper will discuss the CE-1 main components relevant to the experiment, the flight and ground software architecture, experiment concept of operations and preliminary results.

Rachel Dudukovich↗

The International Space Station, Optical Communications, and Delay Tolerant Networking: Towards A Solar System Internet Architecture

As Delay Tolerant Networking (DTN) matures as a software product its use cases have extended to infrastructural and architectural studies, bringing DTN closer to a widespread, operational technology. While it is known that a DTN can be configured, given complete information about a system of nodes, to provision a system with a complete network capability, what remains is to tackle practical considerations such as scalability, networking best practices, and how to establish service providers. In this paper, we document progress towards a scalable DTN architecture that was tested across multiple organizational and project boundaries; our approach was tested across nodes flying on the International Space Station (ISS) connected to a ground network. The network consists of four main network areas: the ISS, the White Sands Complex (WSC), the Mission Cloud Platform (MCP), and NASA’s Huntsville Operations Support Center (HOSC). The connections on the ground (WSC, MCP, and HOSC) are straightforward technically, but represent administrative and non-technical challenges that had to be overcome. The connection from the ISS to WSC was realized through a hybrid optical/RF means. In particular, NASA’s Integrated Laser Communications Relay Demonstration (LCRD) can form a relay from lowEarth-orbit (LEO) to the Earth, and was used in conjunction with the LCRD LEO User Modem and Amplifier Terminal (ILLUMA-T) on the ISS to form a link to one of three geographically diverse ground stations. A major goal was to achieve communications while keeping the ISS nodes unaware of ground station choices and scheduling. These disparate links were networked using High-rate DTN (HDTN), which enabled the desired architecture. The network architecture, tests, HDTN performance metrics, and general observations made are all discussed in detail, including a discussion on the successful utilization of the DTN security standard known as DTN Bundle Protocol Security (BPSec). We conclude with suggestions for next steps, and in particular focus on extending this architecture to the Near Space Network (NSN) and the upcoming LunaNet.

Alan Hylton↗

CNES-NASA Disruption-Tolerant Networking (DTN) Interoperability

Future missions requiring robust internetworking services may use Delay-Disruption-Tolerant Networking (DTN) technology. CNES, NASA, and other international space agencies are committed to using CCSDS standards in their space and ground mission communications systems. The experiment described in this presentation will evaluate operations concepts, system performance, and advance technology readiness for the use of DTN protocols in conjunction with CCSDS ground systems, CCSDS data links, and CCSDS file transfer applications

experiment design↗

A Study of an Optical Lunar Surface Communications Network with High Bandwidth Direct to Earth Link

Analyzed optical DTE (direct to earth) and lunar relay satellite link analyses, greater than 200 Mbps downlink to 1‐m Earth receiver and greater than 1 Mbps uplink achieved with mobile 5‐cm lunar transceiver, greater than 1Gbps downlink and greater than 10 Mpbs uplink achieved with 10‐cm stationary lunar transceiver, MITLL (MIT Lincoln Laboratory) 2013 LLCD (Lunar Laser Communications Demonstration) plans to demonstrate 622 Mbps downlink with 20 Mbps uplink between lunar orbiter and ground station; Identified top five technology challenges to deploying lunar optical network, Performed preliminary experiments on two of challenges: (i) lunar dust removal and (ii)DTN over optical carrier, Exploring opportunities to evaluate DTN (delay-tolerant networking) over optical link in a multi‐node network e.g. Desert RATS.

lunar surface system↗

Deep Space Networking Experiments on the EPOXI Spacecraft

NASA's Space Communications & Navigation Program within the Space Operations Directorate is operating a program to develop and deploy Disruption Tolerant Networking [DTN] technology for a wide variety of mission types by the end of 2011. DTN is an enabling element of the Interplanetary Internet where terrestrial networking protocols are generally unsuitable because they rely on timely and continuous end-to-end delivery of data and acknowledgments. In fall of 2008 and 2009 and 2011 the Jet Propulsion Laboratory installed and tested essential elements of DTN technology on the Deep Impact spacecraft. These experiments, called Deep Impact Network Experiment (DINET 1) were performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. The DINET 1 software was installed on the backup software partition on the backup flight computer for DINET 1. For DINET 1, the spacecraft was at a distance of about 15 million miles (24 million kilometers) from Earth. During DINET 1 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. The first DINET 1 experiment successfully validated many of the essential elements of the DTN protocols. DINET 2 demonstrated: 1) additional DTN functionality, 2) automated certain tasks which were manually implemented in DINET 1 and 3) installed the ION SW on nodes outside of JPL. DINET 3 plans to: 1) upgrade the LTP convergence-layer adapter to conform to the international LTP CL specification, 2) add convergence-layer "stewardship" procedures and 3) add the BSP security elements [PIB & PCB]. This paper describes the planning and execution of the flight experiment and the validation results.

automated data communication↗