SODA

Probabilistic Routing Protocol for Intermittently Connected Networks

Lindgren, Anders and Doria, Avri and Davies, Elwyn and Grasic, Samo (2012) Probabilistic Routing Protocol for Intermittently Connected Networks. RFC Series . ISSN 2070-1721

[img]Plain Text (RFC6693 - Probabilistic Routing Protocol for Intermittently Connected Networks) - Published Version
274Kb
[img]
Preview
PDF (RFC6693 - Probabilistic Routing Protocol for Intermittently Connected Networks) - Published Version
170Kb

Official URL: http://www.rfc-editor.org/rfc/rfc6693.txt

Abstract

This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best-case routing capabilities of epidemic routing. It is intended for use in sparse mesh networks where there is no guarantee that a fully connected path between the source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where there is a disparity between the latency requirements of applications and the capabilities of the underlying network (networks often referred to as delay and disruption tolerant). The document presents an architectural overview followed by the protocol specification.

Item Type:Article
ID Code:5289
Deposited By:Anders Lindgren
Deposited On:05 Sep 2012 15:15
Last Modified:05 Sep 2012 15:15

Repository Staff Only: item control page