2014
DOI: 10.17487/rfc7242
|View full text |Cite
|
Sign up to set email alerts
|

Delay-Tolerant Networking TCP Convergence-Layer Protocol

Abstract: This document describes the protocol for the TCP-based convergence layer for Delay-Tolerant Networking (DTN). It is the product of the IRTF's DTN Research Group (DTNRG).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0
1

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 49 publications
(33 citation statements)
references
References 6 publications
(10 reference statements)
0
32
0
1
Order By: Relevance
“…In particular, routes with the latest transmission time ( ) in the past, an arrival time later than the bundle deadline, a capacity less than the bundle size, and a proximate node within the excluded nodes, or that require a local outbound queue that is depleted, are ignored. Remaining routes are then considered suitable, and the corresponding proximate node in the list is either replaced by a better route (Algorithm 2, lines (15) to (24)) or directly added to the list (Algorithm 2, lines (26) and (27)). The replacement criteria is coherent with Algorithm 1: best arrival time is considered first and then route hop count.…”
Section: Contact Graph Routingmentioning
confidence: 99%
See 2 more Smart Citations
“…In particular, routes with the latest transmission time ( ) in the past, an arrival time later than the bundle deadline, a capacity less than the bundle size, and a proximate node within the excluded nodes, or that require a local outbound queue that is depleted, are ignored. Remaining routes are then considered suitable, and the corresponding proximate node in the list is either replaced by a better route (Algorithm 2, lines (15) to (24)) or directly added to the list (Algorithm 2, lines (26) and (27)). The replacement criteria is coherent with Algorithm 1: best arrival time is considered first and then route hop count.…”
Section: Contact Graph Routingmentioning
confidence: 99%
“…After clearing the working area (Algorithm 3, lines (35) to (38)), a new search is executed, now with the limiting contact detached from the contact graph. As soon as the first route without the anchor contact as the first contact is found, the anchored search ends suppressing the anchor contact and the normal search continues (Algorithm 3, lines (15) to (24)). The search ends when no more routes can be found in the contact graph.…”
Section: Contact Graph Routingmentioning
confidence: 99%
See 1 more Smart Citation
“…The convergence layer allows for any set of lower protocols to be used to reliably transfer a bundle between two DTN nodes. For example the TCP/IP convergence layer [22] uses a TCP connection between two DTN nodes to transfer bundles. That TCP connection can be established via the Internet.…”
Section: A Architecture and Standardsmentioning
confidence: 99%
“…It is responsible for discovering nearby nodes, opening communication links, and implementing store-carry-forward networking that enables the asynchronous multi-hop messaging service between nodes. The implementation follows the DTNRG networking architecture and protocol specifications [3,22,4] with some extensions. The communication services offered to applications include unicast messaging, publish/subscribe services, and probabilistic geo-tagged content sharing (Floating Content [10]).…”
Section: Opportunistic Networking and The Liberouter Frameworkmentioning
confidence: 99%