Contact Graph Routing
draft-burleigh-dtnrg-cgr-01
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Scott Burleigh | ||
Last updated | 2010-07-08 | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)