Probabilistic Routing Protocol for Intermittently Connected Networks
draft-lindgren-dtnrg-prophet-03

Document Type Expired Internet-Draft (individual)
Authors Anders Lindgren  , Avri Doria 
Last updated 2007-05-29
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) 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-lindgren-dtnrg-prophet-03.txt

Abstract

This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a routing protocol for intermittently connected networks, where there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where the Delay-Tolerant Network architecture[1] is applicable. The document presents an architectural overview followed by the protocol specification.

Authors

Anders Lindgren (dugdale@gmail.com)
Avri Doria (avri@acm.org)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)