Extensions of Probabilistic Routing Protocol for Intermittently Connected Networks
draft-softgear-dtnrg-eprophet-02
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Seok-Kap Ko , Ilkyun Park , Seung-Hun Oh , Byoung-Tak Lee , Yun Won Chung | ||
Last updated | 2012-09-12 (Latest revision 2012-03-11) | ||
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 defines extensions of PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. The document presents two extensions of current PRoPHET draft-09. The first extension is to apply the contact duration to calculate the delivery predictability. The other is to provide a forward strategy which can alleviate the bundle starving problem by considering expiration of bundles.
Authors
Seok-Kap Ko
Ilkyun Park
Seung-Hun Oh
Byoung-Tak Lee
Yun Won Chung
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)