draft-ietf-detnet-problem-statement-05.txt   draft-ietf-detnet-problem-statement-06.txt 
detnet N. Finn detnet N. Finn
Internet-Draft Huawei Technologies Co. Ltd Internet-Draft Huawei Technologies Co. Ltd
Intended status: Informational P. Thubert Intended status: Informational P. Thubert
Expires: December 24, 2018 Cisco Expires: January 17, 2019 Cisco
June 22, 2018 July 16, 2018
Deterministic Networking Problem Statement Deterministic Networking Problem Statement
draft-ietf-detnet-problem-statement-05 draft-ietf-detnet-problem-statement-06
Abstract Abstract
This paper documents the needs in various industries to establish This paper documents the needs in various industries to establish
multi-hop paths for characterized flows with deterministic multi-hop paths for characterized flows with deterministic
properties. properties.
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
skipping to change at page 1, line 33 skipping to change at page 1, line 33
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on December 24, 2018. This Internet-Draft will expire on January 17, 2019.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2018 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of (https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 2, line 19 skipping to change at page 2, line 19
3. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 6 3. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 6
3.1. Supported topologies . . . . . . . . . . . . . . . . . . 6 3.1. Supported topologies . . . . . . . . . . . . . . . . . . 6
3.2. Flow Characterization . . . . . . . . . . . . . . . . . . 6 3.2. Flow Characterization . . . . . . . . . . . . . . . . . . 6
3.3. Centralized Path Computation and Installation . . . . . . 6 3.3. Centralized Path Computation and Installation . . . . . . 6
3.4. Distributed Path Setup . . . . . . . . . . . . . . . . . 7 3.4. Distributed Path Setup . . . . . . . . . . . . . . . . . 7
3.5. Duplicated data format . . . . . . . . . . . . . . . . . 8 3.5. Duplicated data format . . . . . . . . . . . . . . . . . 8
4. Security Considerations . . . . . . . . . . . . . . . . . . . 8 4. Security Considerations . . . . . . . . . . . . . . . . . . . 8
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9 5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9
6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 9 6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 9
7. Informative References . . . . . . . . . . . . . . . . . . . 9 7. Informative References . . . . . . . . . . . . . . . . . . . 9
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 11 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 10
1. Introduction 1. Introduction
The Deterministic Networking Use Cases [I-D.ietf-detnet-use-cases] The Deterministic Networking Use Cases [I-D.ietf-detnet-use-cases]
document illustrates that beyond the classical case of industrial document illustrates that beyond the classical case of industrial
automation and control systems (IACS), there are in fact multiple automation and control systems (IACS), there are in fact multiple
industries with strong and yet relatively similar needs for industries with strong and yet relatively similar needs for
deterministic network services with latency guarantees and ultra-low deterministic network services with latency guarantees and ultra-low
packet loss. packet loss.
skipping to change at page 7, line 51 skipping to change at page 7, line 51
1. Neighbors and their capabilities are discovered and exposed to 1. Neighbors and their capabilities are discovered and exposed to
compute a path that fits the DetNet constraints, typically of compute a path that fits the DetNet constraints, typically of
latency, time precision and resource availability. latency, time precision and resource availability.
2. A constrained path is calculated with an improved version of 2. A constrained path is calculated with an improved version of
Constrained Shortest Path First (CSPF) that is aware of DetNet. Constrained Shortest Path First (CSPF) that is aware of DetNet.
3. The path may be installed using a control protocol such as RSVP- 3. The path may be installed using a control protocol such as RSVP-
TE, associated with flow identification, per-hop behavior such as TE, associated with flow identification, per-hop behavior such as
Packet Replication and Elimination, blocked resources, and flow Packet Replication and Elimination, and blocked resources. In
timing information. In that case, traffic flows can be that case, traffic flows can be transported through an MPLS-TE
transported through an MPLS-TE tunnel, using the reserved tunnel, using the reserved resources for this flow at each hop.
resources for this flow at each hop.
4. Alternatively, the routing and flow information may be placed in-
band in the IP packet, e.g., using Segment Routing and/or IPv6
Routing and Option Headers, in which case the packet is routed
along a prescribed source route path following forwarding
indications that are present in the packet.
3.5. Duplicated data format 3.5. Duplicated data format
In some cases the duplication and elimination of packets over non- In some cases the duplication and elimination of packets over non-
congruent paths is required to achieve a sufficiently high delivery congruent paths is required to achieve a sufficiently high delivery
ratio to meet application needs. In these cases, a small number of ratio to meet application needs. In these cases, a small number of
packet formats and supporting protocols are required (preferably, packet formats and supporting protocols are required (preferably,
just one) to serialize the packets of a DetNet stream at one point in just one) to serialize the packets of a DetNet stream at one point in
the network, replicate them at one or more points in the network, and the network, replicate them at one or more points in the network, and
discard duplicates at one or more other points in the network, discard duplicates at one or more other points in the network,
skipping to change at page 9, line 52 skipping to change at page 9, line 44
<http://www.odva.org/Portals/0/Library/ <http://www.odva.org/Portals/0/Library/
Publications_Numbered/ Publications_Numbered/
PUB00138R3_CIP_Adv_Tech_Series_EtherNetIP.pdf>. PUB00138R3_CIP_Adv_Tech_Series_EtherNetIP.pdf>.
[HART] www.hartcomm.org, "Highway Addressable Remote Transducer, [HART] www.hartcomm.org, "Highway Addressable Remote Transducer,
a group of specifications for industrial process and a group of specifications for industrial process and
control devices administered by the HART Foundation". control devices administered by the HART Foundation".
[I-D.ietf-detnet-use-cases] [I-D.ietf-detnet-use-cases]
Grossman, E., "Deterministic Networking Use Cases", draft- Grossman, E., "Deterministic Networking Use Cases", draft-
ietf-detnet-use-cases-16 (work in progress), May 2018. ietf-detnet-use-cases-17 (work in progress), June 2018.
[IEC62439] [IEC62439]
IEC, "Industrial communication networks - High IEC, "Industrial communication networks - High
availability automation networks - Part 3: Parallel availability automation networks - Part 3: Parallel
Redundancy Protocol (PRP) and High-availability Seamless Redundancy Protocol (PRP) and High-availability Seamless
Redundancy (HSR) - IEC62439-3", 2012, Redundancy (HSR) - IEC62439-3", 2012,
<https://webstore.iec.ch/publication/7018>. <https://webstore.iec.ch/publication/7018>.
[IEEE802.1TSNTG] [IEEE802.1TSNTG]
IEEE Standards Association, "IEEE 802.1 Time-Sensitive IEEE Standards Association, "IEEE 802.1 Time-Sensitive
 End of changes. 6 change blocks. 
16 lines changed or deleted 9 lines changed or added

This html diff was produced by rfcdiff 1.47. The latest version is available from http://tools.ietf.org/tools/rfcdiff/