< draft-chen-detnet-sr-based-bounded-latency-00.txt   draft-chen-detnet-sr-based-bounded-latency-01.txt >
Network Working Group M. Chen Network Working Group M. Chen
Internet-Draft X. Geng Internet-Draft X. Geng
Intended status: Informational Huawei Intended status: Informational Huawei
Expires: April 22, 2019 Z. Li Expires: November 8, 2019 Z. Li
China Mobile China Mobile
October 19, 2018 May 7, 2019
Segment Routing (SR) Based Bounded Latency Segment Routing (SR) Based Bounded Latency
draft-chen-detnet-sr-based-bounded-latency-00 draft-chen-detnet-sr-based-bounded-latency-01
Abstract Abstract
One of the goals of DetNet is to provide bounded end-to-end latency One of the goals of DetNet is to provide bounded end-to-end latency
for critical flows. This document defines how to leverage Segment for critical flows. This document defines how to leverage Segment
Routing (SR) to implement bounded latency. Specifically, the SR Routing (SR) to implement bounded latency. Specifically, the SR
Identifier (SID) is used to specify transmission time (cycles) of a Identifier (SID) is used to specify transmission time (cycles) of a
packet. When forwarding devices along the path follow the packet. When forwarding devices along the path follow the
instructions carried in the packet, the bounded latency is achieved. instructions carried in the packet, the bounded latency is achieved.
This is called Cycle Specified Queuing and Forwarding (CSQF) in this This is called Cycle Specified Queuing and Forwarding (CSQF) in this
skipping to change at page 2, line 4 skipping to change at page 2, line 4
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 April 22, 2019. This Internet-Draft will expire on November 8, 2019.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2019 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
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Cycle Specified Queuing and Forwarding . . . . . . . . . . . 3 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.1. CSQF Basic Concepts . . . . . . . . . . . . . . . . . . . 3 3. Cycle Specified Queuing and Forwarding . . . . . . . . . . . 4
2.2. CSQF Queuing Model . . . . . . . . . . . . . . . . . . . 5 3.1. CSQF Basic Concepts . . . . . . . . . . . . . . . . . . . 4
2.3. CSQF Timing Model . . . . . . . . . . . . . . . . . . . . 7 3.2. CSQF Queuing Model . . . . . . . . . . . . . . . . . . . 5
2.4. Congestion Protection and Resource Reservation . . . . . 8 3.3. CSQF Timing Model . . . . . . . . . . . . . . . . . . . . 7
2.5. An Example of CSQF . . . . . . . . . . . . . . . . . . . 9 3.4. Congestion Protection and Resource Reservation . . . . . 8
3. Segment Routing Extensions for CSQF . . . . . . . . . . . . . 10 3.5. An Example of CSQF . . . . . . . . . . . . . . . . . . . 9
4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11 4. Segment Routing Extensions for CSQF . . . . . . . . . . . . . 10
5. Security Considerations . . . . . . . . . . . . . . . . . . . 11 4.1. Time Aware Adjacency Segment(TA-Adj-SID) . . . . . . . . 11
6. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 11 5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11
7. References . . . . . . . . . . . . . . . . . . . . . . . . . 11 6. Security Considerations . . . . . . . . . . . . . . . . . . . 11
7.1. Normative References . . . . . . . . . . . . . . . . . . 11 7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 11
7.2. Informative References . . . . . . . . . . . . . . . . . 11 8. References . . . . . . . . . . . . . . . . . . . . . . . . . 12
8.1. Normative References . . . . . . . . . . . . . . . . . . 12
8.2. Informative References . . . . . . . . . . . . . . . . . 12
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12
1. Introduction 1. Introduction
Deterministic Networking (DetNet) [I-D.ietf-detnet-architecture] is Deterministic Networking (DetNet) [I-D.ietf-detnet-architecture] is
defined to provide end-to-end bounded latency and extremely low defined to provide end-to-end bounded latency and extremely low
packet loss rates for critical flows. For a specific path, the end- packet loss rates for critical flows. For a specific path, the end-
to-end latency consists of two parts: 1) the accumulated latency on to-end latency consists of two parts: 1) the accumulated latency on
the wire, 2) the accumulated latency of nodes along the path. The the wire, 2) the accumulated latency of nodes along the path. The
former can be considered as constant once the path has been former can be considered as constant once the path has been
skipping to change at page 3, line 13 skipping to change at page 3, line 15
end bounded latency can be achieved. end bounded latency can be achieved.
[I-D.finn-detnet-bounded-latency] gives a framework that describes [I-D.finn-detnet-bounded-latency] gives a framework that describes
how bounded latency and zero congestion loss are achieved. It how bounded latency and zero congestion loss are achieved. It
introduces a parameterized timing model that can be used by DetNet introduces a parameterized timing model that can be used by DetNet
solutions by selecting a corresponding Quality of Service (QoS) solutions by selecting a corresponding Quality of Service (QoS)
algorithm and resource reservation algorithm to achieve the bounded algorithm and resource reservation algorithm to achieve the bounded
latency and zero congestion loss goal. latency and zero congestion loss goal.
This document defines how to leverage Segment Routing (SR) [RFC8402] This document defines how to leverage Segment Routing (SR) [RFC8402]
to implement bounded latency. Specifically, the SR Identifier (SID) to implement bounded latency, which is called Time Aware Segment
is used to carry and specify the "sending time" (cycle) of a packet, Routing(TA-SR). A segment is associated with a topological
and ensure that the packet will be transmitted in that specified instruction, which instruct a node to forward the packet via a
sending cycle in order to achieve the bounded latency. This is specific outgoing interface, as it is defined in [RFC8402]. At the
called Cycle Specified Queuing and Forwarding (CSQF) in this same time, the segment is also associated with DetNet bounded latency
document. service. Specifically, the segment ID(SID) is used to carry and
specify the "sending time" of a packet, and some mechanisms can be
used to ensure that the packet will be transmitted in that specified
period of sending time, which is called Time Aware Segment
Routing(TA-SR).
2. Cycle Specified Queuing and Forwarding The TA-SR architecture supports any type of control plane:
distributed (IS-IS or OSPF or BGP), centralized (NETCONF or PCEP or
BGP), or hybrid (PCEP or BGP).
2.1. CSQF Basic Concepts The TA-SR architecture can be instantiated on various data planes,
including TA-SR over MPLS (TA-SR MPLS) or TA-SR over IPv6 (TA-SRv6).
2. Terminology
All the terminologies used in this document are extensions of
[RFC8402].
Time Aware Segment:
Time Aware SID:
TA-SR MPLS SID:
TA-SRv6 SID:
TA-SR Domain:
TA-SR Globle Block (SRGB):
TA-SR Local Block (SRGB):
TA-Adjacency Segment:
Forwarding Time Base: besides: the node uses the SID as an entry to
get the Egress interface with Forwarding Information Base(FIB);
Similarl, the node can use the SID as an entry to get the sending
time of the packet, with Forwarding Time Base.
3. Cycle Specified Queuing and Forwarding
3.1. CSQF Basic Concepts
By specifying the sending cycle of a packet at a node and making sure By specifying the sending cycle of a packet at a node and making sure
that the packet will be transmitted in that cycle, CSQF can achieve that the packet will be transmitted in that cycle, CSQF can achieve
bounded latency within the node. By specifying the sending cycle at bounded latency within the node. By specifying the sending cycle at
every node along a path, the end-to-end bounded latency can be every node along a path, the end-to-end bounded latency can be
achieved. achieved.
To support CSQF, similar to Cyclic Queuing and Forwarding (CQF) To support CSQF, similar to Cyclic Queuing and Forwarding (CQF)
[IEEE802.1Qch], the sending time of an output interface of a node is [IEEE802.1Qch], the sending time of an output interface of a node is
divided into a series of equal time intervals with the duration of T. divided into a series of equal time intervals with the duration of T.
Each time interval is called a "cycle", and each cycle corresponds to Each time interval is called a "cycle", and each cycle corresponds to
a queue. During a cycle, only the corresponding queue is open and a queue. During a cycle, only the corresponding queue is open and
all the packets in that queue will be transmitted. CSQF can not only all the packets in that queue will be transmitted. CSQF can not only
control the bounded latency at every node along a path, but regulate control the bounded latency at every node along a path, but regulate
the traffic at each node as planned. Therefore, no congestion will the traffic at each node as planned. Therefore, no congestion will
occur. occur.
Figure 1 provides an overview of CSQF. Figure 1 provides an overview of CSQF.
+---+ +---+ +---+ +---+
| A |----------| B |----------| C |---------| D |
+-+-+ +---+ +-+-+ +---+
A |---X---+-------+-------+-------+-------+-------+-------|
B |-------+-------+---X---+-------+-------+-------+-------|
C |-------+-------+-------+-------+---X---+-------+-------|
E |-------+-------+-------+-------+-------+-------+---X---|
cycle1 cycle2 cycle3 cycle4 cycle5 cycle6 cycle7
DetNet path: A->B->C->D
Specified cycle list of packet X: <1, 3, 5, 7>
Figure 1: CSQF Overview
+---+ +---+ +---+ +---+ +---+ +---+ +---+ +---+
| A |---| B |---| C |---| D | | A |---| B |---| C |---| D |
+-+-+ +---+ +---+ +---+ +-+-+ +---+ +---+ +---+
A |---X---+-------+-------+-------+-------+-------+-------| A |---X---+-------+-------+-------+-------+-------+-------|
B |-------+-------+---X---+-------+-------+-------+-------| B |-------+-------+---X---+-------+-------+-------+-------|
C |-------+-------+-------+-------+---X---+-------+-------| C |-------+-------+-------+-------+---X---+-------+-------|
skipping to change at page 5, line 18 skipping to change at page 5, line 27
indicate in which cycle and to which output interface that a indicate in which cycle and to which output interface that a
packet is specified to transmit, and an SR SID list is used to packet is specified to transmit, and an SR SID list is used to
carry the specified cycles along a path. With SR, there is no carry the specified cycles along a path. With SR, there is no
per-flow states maintained at the intermediate and egress node. per-flow states maintained at the intermediate and egress node.
As a result, scalability is greatly improved compared to a As a result, scalability is greatly improved compared to a
solution that maintains flow state at each hop. solution that maintains flow state at each hop.
o Flow aggregation is naturally supported by introducing SR and o Flow aggregation is naturally supported by introducing SR and
cycle-based scheduling. cycle-based scheduling.
2.2. CSQF Queuing Model 3.2. CSQF Queuing Model
In Cyclic Queuing and Forwarding (CQF) [IEEE802.1Qch], time is In Cyclic Queuing and Forwarding (CQF) [IEEE802.1Qch], time is
divided into numbered time intervals, and each time interval is divided into numbered time intervals, and each time interval is
called a cycle; the critical traffic is then transmitted and queued called a cycle; the critical traffic is then transmitted and queued
for transmission along a path in a cyclic manner. With CQF, the for transmission along a path in a cyclic manner. With CQF, the
delays experienced by a given packet are as follows: delays experienced by a given packet are as follows:
o The maximum end-to-end delay = (N+1) * T; o The maximum end-to-end delay = (N+1) * T;
o The minimum end-to-end delay = (N-1) * T; o The minimum end-to-end delay = (N-1) * T;
skipping to change at page 7, line 7 skipping to change at page 7, line 12
particular queue, its role will rotate as "...->SQ->RQ->TQ->SQ->...", particular queue, its role will rotate as "...->SQ->RQ->TQ->SQ->...",
the starting role of a queue can be any one of the three roles. the starting role of a queue can be any one of the three roles.
In CSQF, a cycle corresponds to a queue. There are several ways to In CSQF, a cycle corresponds to a queue. There are several ways to
do cycle to queue mapping. The simplest mapping between cycles and do cycle to queue mapping. The simplest mapping between cycles and
queues is 1:1 mapping. There could be N:1 mapping, but that requires queues is 1:1 mapping. There could be N:1 mapping, but that requires
more identifiers, which in the case of segment routing, would require more identifiers, which in the case of segment routing, would require
more SIDs. This document does not specify which mapping should be more SIDs. This document does not specify which mapping should be
used. The mapping choice is left to the operator. used. The mapping choice is left to the operator.
2.3. CSQF Timing Model 3.3. CSQF Timing Model
DetNet relay node A DetNet relay node B DetNet relay node A DetNet relay node B
+-------------------+ +-------------------+ +-------------------+ +-------------------+
| Reg. Queue | | Reg. Queue | | Reg. Queue | | Reg. Queue |
| +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ |
-->+ | | | | | | + +------->+ | | | | | | + +--> -->+ | | | | | | + +------->+ | | | | | | + +-->
| +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ | | +-+-+ +-+-+-+ |
| | | | | | | |
+-------------------+ +-------------------+ +-------------------+ +-------------------+
-->|<->|<-->|<---->|<->|<------>|<->|<-->|<---->|<->|<-- -->|<->|<-->|<---->|<->|<------>|<->|<-->|<---->|<->|<--
skipping to change at page 8, line 39 skipping to change at page 8, line 44
With above, for CSQF, the delays experienced by a given packet are as With above, for CSQF, the delays experienced by a given packet are as
follows: follows:
o The maximum end-to-end delay = Link delay + N * (Max-P-Delay + o The maximum end-to-end delay = Link delay + N * (Max-P-Delay +
2T); 2T);
o The maximum end-to-end jitter = 2T; o The maximum end-to-end jitter = 2T;
o Where N is the number of hops and T is the duration of a cycle. o Where N is the number of hops and T is the duration of a cycle.
2.4. Congestion Protection and Resource Reservation 3.4. Congestion Protection and Resource Reservation
Congestion protection is the key for bounded latency and zero Congestion protection is the key for bounded latency and zero
congestion loss. An essential component of DetNet is Traffic congestion loss. An essential component of DetNet is Traffic
Engineering (TE), so that dedicated resources can be reserved for the Engineering (TE), so that dedicated resources can be reserved for the
exclusive use of DetNet flows. To avoid congestion, two or more exclusive use of DetNet flows. To avoid congestion, two or more
flows must be prevented from contending for the same resource. For flows must be prevented from contending for the same resource. For
normal TE, the critical resource is bandwidth, but in the case of normal TE, the critical resource is bandwidth, but in the case of
CSQF, the critical resource is interface occupation time. Bandwidth CSQF, the critical resource is interface occupation time. Bandwidth
is an average value, which can generally guarantee the quality of is an average value, which can generally guarantee the quality of
service generally, but bursts and congestion may still occur. By service generally, but bursts and congestion may still occur. By
skipping to change at page 9, line 19 skipping to change at page 9, line 23
information (the cycle), and it ensures that a node can schedule information (the cycle), and it ensures that a node can schedule
different packets without conflict and forward the packets at the different packets without conflict and forward the packets at the
proper time. The resource reservation is not explicitly implemented proper time. The resource reservation is not explicitly implemented
by a control plane protocol, such as Resource Reservation Protocol - by a control plane protocol, such as Resource Reservation Protocol -
Traffic Engineering (RSVP-TE) or Stream Reservation Protocol (SRP). Traffic Engineering (RSVP-TE) or Stream Reservation Protocol (SRP).
Rather, it is guaranteed by the SR controller, which maintains the Rather, it is guaranteed by the SR controller, which maintains the
status of different flows and time occupation of all the network status of different flows and time occupation of all the network
devices in the domain. This is called the Virtual Resource devices in the domain. This is called the Virtual Resource
Reservation (VRR) in this document. Reservation (VRR) in this document.
2.5. An Example of CSQF 3.5. An Example of CSQF
+---+ +---+ +---+ +---+ +---+ +---+ +---+ +---+
| A |----| B |----| C |----| E | | A |----| B |----| C |----| E |
+-+-+ +---+ +-+-+ +---+ +-+-+ +---+ +-+-+ +---+
| +---+ | | +---+ |
+------| D |------+ +------| D |------+
+---+ +---+
A |---X---+-------+-------+-------+-------+-------+-------| A |---X---+-------+-------+-------+-------+-------+-------|
skipping to change at page 10, line 18 skipping to change at page 10, line 23
the experienced maximum end-to-end delay is: the experienced maximum end-to-end delay is:
(N-1) * link delay + N * (maximum processing delay + 2T) (N-1) * link delay + N * (maximum processing delay + 2T)
= 3*100 + 4* 40 = 3*100 + 4* 40
= 460 (us) = 460 (us)
The maximum end-to-end jitter is always 2T (20us). The maximum end-to-end jitter is always 2T (20us).
3. Segment Routing Extensions for CSQF 4. Segment Routing Extensions for CSQF
This document defines a new segment that is called a Cycle Segment, This document defines a new segment that is called a Cycle Segment,
which is used to identify a cycle. A Cycle Segment is a local which is used to identify a cycle. A Cycle Segment is a local
segment and is allocated from the Segment Routing Local Block segment and is allocated from the Segment Routing Local Block
(SRLB)[RFC8402]. (SRLB)[RFC8402].
A Cycle Segment has two meanings: 1) identify an interface/link, just A Cycle Segment has two meanings: 1) identify an interface/link, just
like the adjacency segment does; 2) identify a cycle of the like the adjacency segment does; 2) identify a cycle of the
interface/link. To specify to which interface and in which cycle a interface/link. To specify to which interface and in which cycle a
packet should be transmitted, it just needs to attach a Cycle Segment packet should be transmitted, it just needs to attach a Cycle Segment
skipping to change at page 11, line 5 skipping to change at page 11, line 8
interface. For example, given node A, SR-MPLS SIDs 1001, 1002, and interface. For example, given node A, SR-MPLS SIDs 1001, 1002, and
1003 are allocated to one of its interfaces. SID 1001 identifies 1003 are allocated to one of its interfaces. SID 1001 identifies
cycle 1, SID 1002 identifies cycle 2, SID 1003 identifies cycle 3. cycle 1, SID 1002 identifies cycle 2, SID 1003 identifies cycle 3.
The SR [RFC8402] can be instantiated on various data planes. There The SR [RFC8402] can be instantiated on various data planes. There
are two data-plane instantiations of SR: SR over MPLS (SR-MPLS) and are two data-plane instantiations of SR: SR over MPLS (SR-MPLS) and
SR over IPv6 (SRv6). Both SR-MPLS and SRv6 SIDs can be used for CSQF SR over IPv6 (SRv6). Both SR-MPLS and SRv6 SIDs can be used for CSQF
cycle identification. The mapping (IGP extensions) between a cycle cycle identification. The mapping (IGP extensions) between a cycle
and a SID will be defined in a separate document. and a SID will be defined in a separate document.
4. IANA Considerations 4.1. Time Aware Adjacency Segment(TA-Adj-SID)
An Time Aware Adjacency segment is an IGP segment attached to a
specified sending time of a unidirectional adjacency, which
inheriting all the definitions of Adjacency segment defined in
[RFC8402], adding new capability:
When a node binds a group of AT-Adj-SIDs V1-Vn to a local data-link
L, the node MUST install the following FIB entry:
Incoming Active Segment: V1-Vn
Ingress Operation: NEXT
Egress Interface: L
When a node binds an TA-Adj-SID V1 to sending time: Cycle 1, the node
MUST install the following Forwarding Time Base (FTB) entry:
Incoming Active Segment: V1
Sending Time: Cycle 1
Output Queue: Queue 1
So a packet with TA-Adj-SID V1 will be transmitted go through output
queue 1 of egress interface L within cycle 1.
5. IANA Considerations
This document makes no request of IANA. This document makes no request of IANA.
Note to RFC Editor: this section may be removed on publication as an Note to RFC Editor: this section may be removed on publication as an
RFC. RFC.
5. Security Considerations 6. Security Considerations
6. Acknowledgements 7. Acknowledgements
The authors would like to thank Andrew G. Malis, Norman Finn for his The authors would like to thank Andrew G. Malis, Norman Finn for his
review, suggestion and comments to this document. review, suggestion and comments to this document.
7. References 8. References
7.1. Normative References 8.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997, DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>. <https://www.rfc-editor.org/info/rfc2119>.
7.2. Informative References 8.2. Informative References
[I-D.finn-detnet-bounded-latency] [I-D.finn-detnet-bounded-latency]
Finn, N., Boudec, J., Mohammadpour, E., Varga, B., and J. Finn, N., Boudec, J., Mohammadpour, E., Zhang, J., Varga,
Farkas, "DetNet Bounded Latency", draft-finn-detnet- B., and J. Farkas, "DetNet Bounded Latency", draft-finn-
bounded-latency-01 (work in progress), July 2018. detnet-bounded-latency-03 (work in progress), March 2019.
[I-D.geng-detnet-conf-yang] [I-D.geng-detnet-conf-yang]
Geng, X., Chen, M., Li, Z., and R. Rahman, "DetNet Geng, X., Chen, M., Li, Z., and R. Rahman, "DetNet
Configuration YANG Model", draft-geng-detnet-conf-yang-05 Configuration YANG Model", draft-geng-detnet-conf-yang-06
(work in progress), October 2018. (work in progress), October 2018.
[I-D.geng-detnet-info-distribution] [I-D.geng-detnet-info-distribution]
Geng, X., Chen, M., and Z. Li, "IGP-TE Extensions for Geng, X., Chen, M., and Z. Li, "IGP-TE Extensions for
DetNet Information Distribution", draft-geng-detnet-info- DetNet Information Distribution", draft-geng-detnet-info-
distribution-02 (work in progress), March 2018. distribution-03 (work in progress), October 2018.
[I-D.ietf-detnet-architecture] [I-D.ietf-detnet-architecture]
Finn, N., Thubert, P., Varga, B., and J. Farkas, Finn, N., Thubert, P., Varga, B., and J. Farkas,
"Deterministic Networking Architecture", draft-ietf- "Deterministic Networking Architecture", draft-ietf-
detnet-architecture-08 (work in progress), September 2018. detnet-architecture-12 (work in progress), March 2019.
[IEEE802.1Qch] [IEEE802.1Qch]
"IEEE, "Cyclic Queuing and Forwarding (IEEE Draft IEEE, "IEEE, "Cyclic Queuing and Forwarding (IEEE Draft
P802.1Qch)", 2017, P802.1Qch)", 2017,
<http://www.ieee802.org/1/files/private/ch-drafts/>.", <http://www.ieee802.org/1/files/private/ch-drafts/>.",
2016. 2016.
[RFC8402] Filsfils, C., Ed., Previdi, S., Ed., Ginsberg, L., [RFC8402] Filsfils, C., Ed., Previdi, S., Ed., Ginsberg, L.,
Decraene, B., Litkowski, S., and R. Shakir, "Segment Decraene, B., Litkowski, S., and R. Shakir, "Segment
Routing Architecture", RFC 8402, DOI 10.17487/RFC8402, Routing Architecture", RFC 8402, DOI 10.17487/RFC8402,
July 2018, <https://www.rfc-editor.org/info/rfc8402>. July 2018, <https://www.rfc-editor.org/info/rfc8402>.
Authors' Addresses Authors' Addresses
 End of changes. 26 change blocks. 
63 lines changed or deleted 111 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/