Probabilistic Routing Protocol for Intermittently Connected Networks
| Document type: | Miscellaneous |
|---|---|
| Author(s): | Avri Doria, Anders Lindgren |
| Title: | Probabilistic Routing Protocol for Intermittently Connected Networks |
| Type of publication: | Internet Engineering Task Force (IETF) Internet-Draft |
| Year: | 2007 |
| Organization: | Blekinge Institute of Technology |
| Department: | School of Technoculture, Humanities and Planning (Sektionen för teknokultur, humaniora och samhällsbyggnad) School of Technoculture, Humanities and Planning S-371 79 Karlskrona +46 455 38 50 00 http://www.tks.bth.se/ |
| Authors e-mail: | avri@acm.org |
| Language: | English |
| 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. |
| Subject: | Technoscience Studies\General Telecommunications\General |
