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.
Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations
SpaceOps 2008 ; 2008 ; Heidelberg, Germany
2008-05-14
Miscellaneous
No indication
English
NTRS | 2003
|