Delay-tolerant networking

Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Examples of such networks are those operating in mobile or extreme terrestrial environments, or planned networks in space.

Recently, the term disruption-tolerant networking has gained currency in the United States due to support from DARPA, which has funded many DTN projects. Disruption may occur because of the limits of wireless radio range, sparsity of mobile nodes, energy resources, attack, and noise.

History
Further information: History of delay-tolerant networking

In the 1970s, spurred by the decreasing size of computers, researchers began developing technology for routing between non-fixed locations of computers. While the field of ad hoc routing was inactive throughout the 1980s, the widespread use of wireless protocols reinvigorated the field in the 1990s as mobile ad hoc networking (MANET) and vehicular ad hoc networking became areas of increasing interest.

Concurrently with (but separate from) the MANET activities, DARPA had funded NASA, MITRE and others to develop a proposal for the Interplanetary Internet (IPN). Internet pioneer Vint Cerf and others developed the initial IPN architecture, relating to the necessity of networking technologies that can cope with the significant delays and packet corruption of deep-space communications. In 2002, Kevin Fall started to adapt some of the ideas in the IPN design to terrestrial networks and coined the term delay-tolerant networking and the DTN acronym. A paper published in 2003 SIGCOMM conference gives the motivation for DTNs.[1] The mid-2000s brought about increased interest in DTNs, including a growing number of academic conferences on delay and disruption-tolerant networking, and growing interest in combining work from sensor networks and MANETs with the work on DTN. This field saw many optimizations on classic ad hoc and delay-tolerant networking algorithms and began to examine factors such as security, reliability, verifiability, and other areas of research that are well understood in traditional computer networking.

Routing
Further information: Routing in delay-tolerant networking

The ability to transport, or route, data from a source to a destination is a fundamental ability all communication networks must have. Delay and disruption-tolerant networks (DTNs), are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In these challenging environments, popular ad hoc routing protocols such as AODV[2] and DSR[3] fail to establish routes. This is due to these protocols trying to first establish a complete route and then, after the route has been established, forward the actual data. However, when instantaneous end-to-end paths are difficult or impossible to establish, routing protocols must take to a "store and forward" approach, where data is incrementally moved and stored throughout the network in hopes that it will eventually reach its destination.[4][5][6] A common technique used to maximize the probability of a message being successfully transferred is to replicate many copies of the message in the hope that one will succeed in reaching its destination.[7] This is feasible only on networks with large amounts of local storage and internode bandwidth relative to the expected traffic. In many common problem spaces, this inefficiency is outweighed by the increased efficiency and shortened delivery times made possible by taking maximum advantage of available unscheduled forwarding opportunities. In others, where available storage and internode throughput opportunities are more tightly constrained, a more discriminate algorithm is required.

Other concerns

Bundle protocols

In efforts to provide a shared framework for algorithm and application development in DTNs, RFC 4838 and RFC 5050 were published in 2007 to define a common abstraction to software running on disrupted networks. Commonly known as the Bundle Protocol, this protocol defines a series of contiguous data blocks as a bundle—where each bundle contains enough semantic information to allow the application to make progress where an individual block may not. Bundles are routed in a store and forward manner between participating nodes over varied network transport technologies (including both IP and non-IP based transports). The transport layers carrying the bundles across their local networks are called bundle convergence layers. The bundle architecture therefore operates as an overlay network, providing a new naming architecture based on Endpoint Identifiers (EIDs) and coarse-grained class of service offerings.

Protocols using bundling must leverage application-level preferences for sending bundles across a network. Due to the store and forward nature of delay-tolerant protocols, routing solutions for delay-tolerant networks can benefit from exposure to application-layer information. For example, network scheduling can be influenced if application data must be received in its entirety, quickly, or without variation in packet delay. Bundle protocols collect application data into bundles that can be sent across heterogeneous network configurations with high-level service guarantees. The service guarantees are generally set by the application level, and the RFC 5050 Bundle Protocol specification includes "bulk", "normal", and "expedited" markings.

In October of 2014 the Internet Engineering Task Force (IETF) instantiated a Delay Tolerant Networking working group to review and revise the protocol specified in RFC5050[8]. The Bundle Protocol for CCSDS[9] is a profile of RFC5050 specifically addressing the Bundle Protocol's utility for data communication in space missions.

Security issues

Addressing security issues has been a major focus of the bundle protocol. Possible attacks take the form of nodes behaving as a "black hole" or a "flooder"[10][11][12].

Security concerns for delay-tolerant networks vary depending on the environment and application, though authentication and privacy are often critical. These security guarantees are difficult to establish in a network without persistent connectivity because the network hinders complicated cryptographic protocols, hinders key exchange, and each device must identify other intermittently visible devices.[13][14] Solutions have typically been modified from mobile ad hoc network and distributed security research, such as the use of distributed certificate authorities[15] and PKI schemes. Original solutions from the delay-tolerant research community include: 1) the use of identity-based encryption, which allows nodes to receive information encrypted with their public identifier;[16] and 2) the use of tamper-evident tables with a gossiping protocol;[17]

Implementations

There are a number of implementations of the Bundle Protocol:

BPv6 (RFC5050, Bundle Protocol for CCSDS)

The main implementation of BPv6 are: listed below. A number of other implementations exist.

  • NASA Interplanetary Overlay Network (ION) -- Written in C; designed to run on a wide variety of platforms; conforms to restrictions for space flight software (e.g. no dynamic memory allocation).
  • IBR-DTN -- C++ - based; runs on routers with OpenWRT; also contains JAVA applications (router and user apps) for use on Android.
  • DTN2 -- C++ - based; designed to be a reference / learning / teaching implementation of the Bundle Protocol.

BPv7 (Internet Research Task Force RFC)

The draft of BPv7 lists six known implementations.[18]

  • µPCN -- C; built upon the POSIX API as well as FreeRTOS and intended to run on low-cost micro satellites.
  • PyDTN -- Python; developed by X-works and during the IETF 101 Hackathon.
  • Terra -- Java; developed in the context of terrestrial DTN.
  • dtn7-go -- Go; implementation focused on easy extensibility and suitable for research.
  • dtn7-rs -- Rust; intended for environments with limited resources and performance requirements.
  • NASA Interplanetary Overlay Network (ION) -- C; intended to be usable in embedded environments including spacecraft flight computers.

Research efforts

Various research efforts are currently investigating the issues involved with DTN:

Some research efforts look at DTN for the Interplanetary Internet by examining use of the Bundle Protocol in space:

  • The Saratoga project at the University of Surrey, which was the first to test the bundle protocol in space on the UK-DMC Disaster Monitoring Constellation satellite in 2008.[19][20][21]
  • NASA JPL's Deep Impact Networking (DINET) Experiment on board the Deep Impact/EPOXI spacecraft.[22][23]
  • BioServe Space Technologies, one of the first payload developers to adopt the DTN technology, has utilized their CGBA (Commercial Generic Bioprocessing Apparatus) payloads on board the ISS, which provide computational/communications platforms, to implement the DTN protocol.[24][25][26]
  • NASA, ESA Use Experimental Interplanetary Internet to Test Robot From International Space Station [27]
gollark: Interesting.
gollark: Well, I like the `f : Number -> Number` above it style.
gollark: næeat.
gollark: Oh, *that's* what you mean by "nameless", neat.
gollark: Ah, so "lambda" technology?

See also

References
  1. A Delay-Tolerant Network Architecture for Challenged Internets, K. Fall, SIGCOMM, August 2003.
  2. Perkins, C.; Royer, E. (1999), "Ad hoc on-demand distance vector routing", The Second IEEE Workshop on Mobile Computing Systems and Applications
  3. Johnson, D.; Maltz, D. (1996), "Dynamic source routing in ad hoc wireless networks", Mobile Computing, Kluwer Academic, pp. 153–181
  4. John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM, April 2006.
  5. Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li Shiuan Peh, and Daniel Rubenstein (2002). Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. SIGOPS Oper. Syst. Rev. 36. pp. 96–107. doi:10.1145/605397.605408. ISBN 978-1581135749.CS1 maint: uses authors parameter (link)
  6. Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott (2007). "Impact of human mobility on opportunistic forwarding algorithms". IEEE Transactions on Mobile Computing. 6 (6): 606–620. doi:10.1109/TMC.2007.1060.CS1 maint: uses authors parameter (link)
  7. Vahdat, Amin; Becker, David (2000), "Epidemic routing for partially connected ad hoc networks", Technical Report CS-2000-06, Duke University
  8. "RFC 5050 - Bundle Protocol Specification". datatracker.ietf.org. Retrieved 2019-09-09.
  9. CCSDS Bundle Protocol Specification (PDF). Washington, D.C.: CCSDS. 2015.
  10. Bucur, Doina; Iacca, Giovanni; Squillero, Giovanni; Tonda, Alberto (2015). Mora, Antonio M.; Squillero, Giovanni (eds.). "Black Holes and Revelations: Using Evolutionary Algorithms to Uncover Vulnerabilities in Disruption-Tolerant Networks". Applications of Evolutionary Computation. Lecture Notes in Computer Science. Springer International Publishing. 9028: 29–41. doi:10.1007/978-3-319-16549-3_3. ISBN 9783319165493.
  11. Bucur, Doina; Iacca, Giovanni; Squillero, Giovanni; Tonda, Alberto (2015). Mora, Antonio M.; Squillero, Giovanni (eds.). "Black Holes and Revelations: Using Evolutionary Algorithms to Uncover Vulnerabilities in Disruption-Tolerant Networks". Applications of Evolutionary Computation. Lecture Notes in Computer Science. Springer International Publishing. 9028: 29–41. doi:10.1007/978-3-319-16549-3_3. ISBN 9783319165493.
  12. Bucur, Doina; Iacca, Giovanni (2017-09-01). "Improved search methods for assessing Delay-Tolerant Networks vulnerability to colluding strong heterogeneous attacks". Expert Systems with Applications. 80: 311–322. doi:10.1016/j.eswa.2017.03.035. ISSN 0957-4174.
  13. "Anonymity and security in delay-tolerant networks" A. Kate, G. Zaverucha, and U. Hengartner. 3rd International Conference on Security and Privacy in Communication Networks (SecureComm 2007)
  14. "Security Considerations in Space and Delay-Tolerant Networks" S. Farrell and V. Cahill. Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology
  15. DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks
  16. "Practical security for disconnected nodes" Seth, A. Keshav, S. 1st IEEE ICNP Workshop on Secure Network Protocols (NPSec), 2005.
  17. MobiRate: Making Mobile Raters Stick to their Word. ACM Ubicomp 2008
  18. Fall, Kevin; Birrane, Edward; Burleigh, Scott. "Bundle Protocol Version 7". tools.ietf.org. Retrieved 2020-08-07.
  19. Use of the Delay-Tolerant Networking Bundle Protocol from Space Archived 2008-05-13 at the Wayback Machine, L. Wood et al., Conference paper IAC-08-B2.3.10, 59th International Astronautical Congress, Glasgow, September 2008.
  20. UK-DMC satellite first to transfer sensor data from space using 'bundle' protocol Archived 2012-04-26 at the Wayback Machine, press release, Surrey Satellite Technology Ltd, 11 September 2008.
  21. CLEO Orbital Internet earns Time Magazine award Archived 2008-12-07 at the Wayback Machine, Robin Wolstenholme, Surrey Satellite Technology Ltd space blog, 14 November 2008.
  22. A Better Network for Outer Space, Brittany Sauser, MIT Technology Review, 27 October 2008.
  23. NASA Successfully Tests First Deep Space Internet, NASA press release 08-298, 18 November 2008.
  24. Jenkins, Andrew; Kuzminsky, Sebastian; Gifford, Kevin K.; Holbrook, Mark; Nichols, Kelvin; Pitts, Lee. (2010). "Delay/Disruption-Tolerant Networking: Flight Test Results from the International Space Station." Archived 2011-09-02 at the Wayback Machine IEEE Aerospace Conference.
  25. Gifford, Kevin K.; Jenkins, Andrew; Holbrook, Mark; Kuzminsky, Sebastian; Nichols, Kelvin; Pitts, Lee. (2010). "DTN Implementation and Utilization Options on the International Space Station." Archived 2011-09-02 at the Wayback Machine American Institute of Aeronautics and Astronautics.]
  26. The Automation Group at BioServe Space Technologies University of Colorado, Boulder.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.