Jet Propulsion Laboratory California Institute of Technology Disruption Tolerant Network Technology Flight Validation Report by Ross M. Jones Jet Propulsion.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

CCSDS Cross Support Services Issue 0.1 October, 2008 Takahiro Yamada, JAXA/ISAS Peter Shames, NASA/JPL.
National Aeronautics and Space Administration 1 Licklider Transmission Protocol (LTP): An Overview Scott Burleigh Jet Propulsion Laboratory California.
Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.
NETWORK LAYER (1) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
1 Comments on Delay Tolerant Network (DTN) October, 2008 Berlin, Germany Takahiro Yamada, JAXA/ISAS.
S. Burleigh, A. Hoke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, H. Weiss An approach to Interplanetary Internet Presented by Fabián E. Bustamante.
University Of Maryland1 A Study Of Cyclone Technology.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Gursharan Singh Tatla Transport Layer 16-May
SEPT, 2005CSI Part 2.2 Protocols and Protocol Layering Robert Probert, SITE, University of Ottawa.
Data Communications and Networking
Planes, Trains and DTN (Delay Tolerant Networking) Ashton G. Vaughs Jet Propulsion Laboratory Copyright 2009 California Institute of Technology Government.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
2004 International Telemetering Conference20 October CCSDS FILE DELIVERY PROTOCOL INTER-IMPLEMENTATION TESTING FINAL REPORT TESTING OF A DTN PROTOCOL.
Chapter 4: Managing LAN Traffic
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
Communication Networks
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
Open Source DTN for ISS Payloads Concept Proposal, 05-Jun Open-source DTN communication software for ISS Payloads Kevin K. Gifford BioServe Space.
Distributed Network Scheduling Bradley J. Clement, Steven R. Schaffer Jet Propulsion Laboratory, California Institute of Technology Contact:
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
International Workshop on Satellite and Space Communications 2009, IWSSC 2009, 9-11 September 2009, Siena, Italy Evaluation of CCSDS File Delivery Protocol.
5/22/2008 RMJ-1 DINET Deep Impact Network Experiment Adapted from Technical Summary, Management and Project Engineering DINET CDR 6/2/08 Ross Jones.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
1 Chapter 16 Protocols and Protocol Layering. 2 Protocol  Agreement about communication  Specifies  Format of messages (syntax)  Meaning of messages.
EITnotes.com For more notes and topics visit:
Paper Group: 12 Data Transport in Challenged Networks Above papers are original works of respective authors, referenced here for academic purposes only.
The OSI Model.
Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.
Delay-Tolerant Networking (DTN)
Page No. 1 Kelvin Nichols Payload Operations and Integration Center EO50 Delay Tolerant Networking (DTN) Implementation on the International Space Station.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.
333: DISCUSS THE FUNDAMENTALS OF NETWORKING.  1. Discuss networking concepts (20 hrs)  2. Discuss hardware & software requirement to setup a Local Area.
V. Tsaoussidis, DUTH – Greece
Computer Networks with Internet Technology William Stallings
COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.
Computer Networks. A computer network is defined as the interconnection of 2 or more independent computers or/and peripherals. Computer Network.
Data and Computer Communications Chapter 11 – Asynchronous Transfer Mode.
Enabling Technologies (Chapter 1)  Understand the technology and importance of:  Virtualization  Cloud Computing  WAN Acceleration  Deep Packet Inspection.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Communication Networks - Overview CSE 3213 – Fall November 2015.
CCSDS Fall Meeting at ESTEC
Topic 3 Analysing network traffic
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
20 November 2008 SB-1 First Look at the Deep Impact DTN Experiment (DINET) Scott Burleigh Jet Propulsion Laboratory California Institute of Technology.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
CCSDS Fall 2013 Approved For Public Release via the NASA Science and Technical Information Process DAA Space Data Systems Applications in the iPAS.
NASA MSFC Mission Operations Laboratory MSFC NASA MSFC Mission Operations Laboratory Ku - Band, DTN, and enhanced payload utilization.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
WAN Transmission Media
17 November Asynchronous Message Service (1 of 3) In addition to file transfer, event-driven asynchronous message exchange may also be useful for.
1 Protocols and Protocol Layering. 2 Protocol Agreement about communication Specifies –Format of messages –Meaning of messages –Rules for exchange –Procedures.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
Interplanetary Networking Issues Dai Stanton DTN working Group Input October 2009.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Page No. 1 Overview Kelvin Nichols Payload Operations and Integration Center EO50 SSCN Delay Tolerant Networking (DTN)
Chapter 9 Optimizing Network Performance
Delay-Tolerant Networking (DTN)
Delay-Tolerant Networks (DTNs)
CS408/533 Computer Networks Text: William Stallings Data and Computer Communications, 6th edition Chapter 1 - Introduction.
ETR-NASA DTN Phase-1 Test Results
Packet Switching Datagram Approach Virtual Circuit Approach
DTN Bundle Protocol on the IETF Standards Track
Data Communication Networks
Net 323 D: Networks Protocols
Optical communications & networking - an Overview
Presentation transcript:

Jet Propulsion Laboratory California Institute of Technology Disruption Tolerant Network Technology Flight Validation Report by Ross M. Jones Jet Propulsion Laboratory California Institute of Technology ComNet Group Presenters: Sotirios – Angelos Lenas and Nikolaos Bezirgiannidis Deep Impact Network Experiment (DINET)

Overview  Install and test essential elements of DTN technology on the Deep Impact spacecraft ( million Km from Earth)  300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes  The DINET experiment was held by JPL and sponsored by NASA  Performed in close cooperation with the EPOXI project  Period of experiment: 27 days (October – November 2008)  Demonstrate DTN readiness for operational use in space missions ComNet Group 1/20

Innovations  First deep-space node on the Interplanetary Internet Automatic, contact-sensitive relay operations (store-and-forward Bundle Protocol) Automatic rate control Delay-tolerant retransmission (Licklider Transmission Protocol) Prioritization of merged traffic flows Custody transfer  Longest digital communication network link ever  First use of dynamic routing over deep space links  First use of messaging middleware (CCSDS Asynchronous Message Service publish/subscribe) over deep space links ComNet Group 2/20

Topology  All the nodes, except for the Deep Impact spacecraft, were physically located in the JPL Deep Space Operations Team (DSOT) area or in the Protocol Test Laboratory (PTL) ComNet Group 3/20

Configuration settings 1/2  Convergence-layer protocols on experiment topology: ComNet Group 4/20

Configuration settings 2/2  Images sent at priorities 0, 1. Network management traffic, custody signals, critical images sent at priority 2  Custody transfer on all application bundles  Bundle headers were CBHE-compressed  Time-to-live was 10 days for all image bundles  Max bundle size was 64 KB. Max LTP segment size was 739 bytes  Contact Graph Routing used to compute routes dynamically ComNet Group 5/20

Experiment Schedule  The 4-week period of DINET operations was divided into two configurations (a and b) of four tracking passes each. Configuration a  no injection of artificial data loss Configuration b  3.125% of all LTP segments were randomly discarded upon reception at the DI spacecraft and at DSOT nodes ComNet Group 6/20

Experiment 1 ComNet Group 7/20

Experiment 2 ComNet Group 8/20

Experiment 3 ComNet Group 9/20

Investigation Elements  DTN Bundle: Origination Transmission Acquisition Dynamic route computation Congestion control Prioritization Custody transfer Automatic retransmission procedures ComNet Group 10/20

Validation Objectives  DTN performance metrics: Path Utilization Rate ○ Automatic forwarding ○ Custody transfer ○ Delay – tolerant retransmission Delivery Acceleration Ratio ○ Priority system ION Node Storage Utilization ○ Congestion control Multipath Advantage ○ Dynamic routing ComNet Group 11/20

Terms of Validation 1/2 XYZ  the transmission opportunity from node X to node Y on DINET pass or configuration Z  D XYZ  Duration of XYZ in seconds  C XYZ  Data rate in bytes/sec  K XYZ  Raw capacity (D XYZ * C XYZ )  S XYZ  Total data return capacity Σ K XYZ for Z = 1-4 (a) or Z = 5-8 (b)  R PZ  Volume of priority-P science data (ex. priority 0 – conf a: R 0a ) R Ta = R 0a + R 1a + R 2a  W Ta = R 0a + (2*R 1a ) + (4*R 2a )  Urgency-weighted volume of science data (configuration a) ComNet Group 12/20

Terms of Validation 2/2  Q Ta = λ * R Ta  Reference volume of priority T science data, λ  proportion of image bundles with priority T  V Ta = (0.5 * Q 0a ) + Q 1a + (2.0 * Q 2a )  Urgency-weighted reference volume of science data  I X  Size of the ION data store at node X  A X = 0.6 * I X  Size of the traffic store allocation at node X  N XZ  Total unassigned space at node X for pass Z  P XYa = min( Σ K ijZ ), Z = 1-4  Net path capacity from X to Y (config. a) ComNet Group 13/20

Experiment Results Metric 1 – Path Utilization Rate (U)  U a = R Ta / S M2a (Volume of priority-P science data / Total data return capacity)  Validation criteria: Ua > 90% (DTN uses both high-rate and low-rate links efficiently) Ub > 90% (DTN remains efficient despite an increase in the rate of data loss)  Analysis of the DINET experiment log indicates that Ua was 76.2% and Ub was 72.4%  However Passes 2 and 8 were underutilized due to anomalies so their path utilization don’t reflect protocol efficiency 20% of uplink capacity was by link service overhead (telecommand coding)  Final result Ua = 97.4 Ub = 92.5  Both validation criteria were satisfied ComNet Group 14/20

Experiment Results Metric 2 – Delivery Acceleration Ratio (G)  G a = W Ta / V Ta (Urgency-weighted volume of science data / Urgency-weighted reference volume of science data)  Validation criteria: Ga > 1.05 (Prioritization accelerates the delivery of urgent data) Gb > 1.1 (The advantage of prioritization increases with the rate of data loss)  Analysis of the DINET experiment log indicates: Ga = 1.10 Gb = 1.12  Both validation criteria were satisfied ComNet Group 15/20

Experiment Results Metric 3 – ION Node Storage Utilization  Validation criteria: Total number of bundles for which custody is refused anywhere in the network (“Depleted Storage”)  Always zero, throughout each configuration ○ Never run out of storage anywhere N X7 = N X6 for all values of X  True for all nodes (Storage utilization stabilizes over the course of network operations)  Both validation criteria were satisfied ComNet Group 16/20

Experiment Results Metric 4 – Multipath Advantage  M XY = Σ P XY / max(P XY ) – 1 (Net path capacity from X to Y)  Validation criterion: The multipath advantage for traffic from node 20 to node 8 is greater than 20% (Dynamic routing among multiple possible paths increases the total network capacity from Phobos to Earth)  The computed multipath advantage for traffic from node 20 to node 8 through the entire DINET experiment was 27%  The validation criterion was satisfied ComNet Group 17/20

Anomalies  DTN-Related Apparent image arrival out of priority order in pass 2 Underutilization of link in pass 2 Loss of advantage provided by alternative route (cross-link between nodes ) Bundle expiration on EPOXI Underutilization of link in pass 8 Custody refusal at node 5 due to redundant reception Unexplained “watch” characters Aggregate capacity overflow  Other Types of Anomalies Software Hardware Environmental Procedural ComNet Group 18/20

Technical Significance  DTN can work in deep space  Successfully demonstrated over a variety of conditions with realistic traffic patterns  Validation objectives were met  Network function were completely automated  Automatic identification of missing data and selective retransmission  Total lack of data corruption ComNet Group 19/20

Strategic Significance  Network protocols of DINET can be used universally  DINET code is available for immediate use  Priority management promises better network utilization of available BW  Low operations labor costs due to automatic (internet-like) data exchange between nodes  Lack of human intervention results in saving time and money ComNet Group 20/20

Thank you for your attention! Questions?