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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations


    Contributors:

    Conference:

    SpaceOps 2008 ; 2008 ; Heidelberg, Germany


    Publication date :

    2008-05-14


    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English