Contact Graph Routing
draft-burleigh-dtnrg-cgr-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2010-07-08 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
This Internet-Draft is no longer active. A copy of
the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-burleigh-dtnrg-cgr-01.txt
https://www.ietf.org/archive/id/draft-burleigh-dtnrg-cgr-01.txt
Abstract
This document describes Contact Graph Routing (CGR), a procedure for computing efficient Delay-Tolerant Networking (DTN) bundle forwarding routes between source and destination endpoints when connectivity between pairs of neighboring bundle protocol agents in the network is scheduled and episodic rather than continuous.
Authors
Scott Burleigh (Scott.C.Burleigh@jpl.nasa.gov)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)