Probabilistic Routing Protocol for Intermittently Connected Networks
draft-irtf-dtnrg-prophet-09
The information below is for an old version of the document |
Document |
Type |
|
Active Internet-Draft (individual)
|
|
Last updated |
|
2012-05-21
(latest revision 2011-04-03)
|
|
Stream |
|
IRTF
|
|
Intended RFC status |
|
Experimental
|
|
Formats |
|
plain text
pdf
html
bibtex
|
Stream |
IRTF state
|
|
(None)
|
|
Consensus Boilerplate |
|
Unknown
|
|
Document shepherd |
|
None
|
IESG |
IESG state |
|
Approved-announcement sent
|
|
Telechat date |
|
|
|
Responsible AD |
|
Adrian Farrel
|
|
IESG note |
|
IRTF Submission. Stephen Farrell (stephen.farrell@cs.tcd.ie) is the document shepherd.
|
|
Send notices to |
|
andersl@sics.se, avri@acm.org, elwynd@folly.org.uk, samo.grasic@ltu.se, draft-irtf-dtnrg-prophet@tools.ietf.org, stephen.farrell@cs.tcd.ie
|
DTN Research Group A. Lindgren
Internet-Draft SICS
Intended status: Experimental A. Doria
Expires: October 5, 2011 Consultant
E. Davies
Folly Consulting
S. Grasic
Lulea University of Technology
April 3, 2011
Probabilistic Routing Protocol for Intermittently Connected Networks
draft-irtf-dtnrg-prophet-09
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 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.
Status of this Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
Lindgren, et al. Expires October 5, 2011 [Page 1]
Internet-Draft PRoPHET April 2011
material or to cite them other than as "work in progress."
This Internet-Draft will expire on October 5, 2011.
Copyright Notice
Copyright (c) 2011 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Lindgren, et al. Expires October 5, 2011 [Page 2]
Internet-Draft PRoPHET April 2011
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 5
1.1. Relation to the Delay Tolerant Networking architecture . 7
1.2. Applicability of the protocol . . . . . . . . . . . . . . 8
1.3. PRoPHET as Compared to Regular Routing Protocols . . . . 10
1.4. Requirements notation . . . . . . . . . . . . . . . . . . 11
2. Architecture . . . . . . . . . . . . . . . . . . . . . . . . 12
2.1. PRoPHET . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.1.1. Characteristic Time Interval . . . . . . . . . . . . 12
2.1.2. Delivery Predictability Calculation . . . . . . . . . 13
2.1.3. Optional Delivery Predictability Optimizations . . . 17
2.1.4. Forwarding Strategies and Queueing Policies . . . . . 18
2.2. Bundle Agent to Routing Agent Interface . . . . . . . . . 19
2.3. PRoPHET Zone Gateways . . . . . . . . . . . . . . . . . . 20
2.4. Lower Layer Requirements and Interface . . . . . . . . . 21
3. Protocol Overview . . . . . . . . . . . . . . . . . . . . . . 23
3.1. Neighbor Awareness . . . . . . . . . . . . . . . . . . . 23
3.2. Information Exchange Phase . . . . . . . . . . . . . . . 23
3.2.1. Routing Information Base Dictionary . . . . . . . . . 26
Show full document text