Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Probabilistic Routing Protocol for Intermittently Connected Networks
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.ORCID iD: 0000-0003-3932-4144
2012 (English)In: RFC Series, ISSN 2070-1721Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Internet Research Task Force , 2012, 6.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24049OAI: oai:DiVA.org:ri-24049DiVA, id: diva2:1043128
Projects
CNSAvailable from: 2016-10-31 Created: 2016-10-31 Last updated: 2023-05-09Bibliographically approved

Open Access in DiVA

fulltext(274 kB)152 downloads
File information
File name FULLTEXT01.txtFile size 274 kBChecksum SHA-512
3b44914a54134a6f3d37a644819fa41568df0476d0c7044974c8c72468dbb9f5d231f48552383f1ac64c00533950ad62b1a5df199eb5d71f3a1e2a5c11e430ff
Type fulltextMimetype text/plain
fulltext(171 kB)233 downloads
File information
File name FULLTEXT02.pdfFile size 171 kBChecksum SHA-512
6d52076bf640ecc8f0f30df249826220c0487ae986d110418d4704e435189a6a563cc6073f8df6909750c860f5fb46d0c42cff2594083f9e61ae2f09305391de
Type fulltextMimetype application/pdf

Other links

http

Authority records

Lindgren, Anders

Search in DiVA

By author/editor
Lindgren, Anders
By organisation
Decisions, Networks and Analytics lab
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 385 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 343 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf