Search NASA⌕ Search
Home/Archive/NASA NTRS

NASA NTRS · 20150014822

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Burleigh, Scott
View original source ↗Export metadata ↓

Abstract

Computational self-sufficiency - the making of communication decisions on the basis of locally available information that is already in place, rather than on the basis of information residing at other entities - is a fundamental principle of Delay-Tolerant Networking. Contact Graph Routing is an attempt to apply this principle to the problem of dynamic routing in an interplanetary DTN. Testing continues, but preliminary results are promising.

Explore related subjects

CGRDTNcontact graph routing

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Burleigh, Scott. 2008-05-14. Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations. https://ntrs.nasa.gov/citations/20150014822

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

NASA NTRS2008

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

CGR↗