Segment Routing (SR) Based Bounded Latency
draft-chen-detnet-sr-based-bounded-latency-00

Document Type Active Internet-Draft (individual)
Last updated 2018-10-19
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                            M. Chen
Internet-Draft                                                   X. Geng
Intended status: Informational                                    Huawei
Expires: April 22, 2019                                            Z. Li
                                                            China Mobile
                                                        October 19, 2018

               Segment Routing (SR) Based Bounded Latency
             draft-chen-detnet-sr-based-bounded-latency-00

Abstract

   One of the goals of DetNet is to provide bounded end-to-end latency
   for critical flows.  This document defines how to leverage Segment
   Routing (SR) to implement bounded latency.  Specifically, the SR
   Identifier (SID) is used to specify transmission time (cycles) of a
   packet.  When forwarding devices along the path follow the
   instructions carried in the packet, the bounded latency is achieved.
   This is called Cycle Specified Queuing and Forwarding (CSQF) in this
   document.

   Since SR is a source routing technology, no per-flow state is
   maintained at intermediate and egress nodes, SR-based CSQF naturally
   supports flow aggregation that is deemed to be a key capability to
   allow DetNet to scale to large networks.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

Chen, et al.             Expires April 22, 2019                 [Page 1]
Internet-Draft                  SR DetNet                   October 2018

   This Internet-Draft will expire on April 22, 2019.

Copyright Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Cycle Specified Queuing and Forwarding  . . . . . . . . . . .   3
     2.1.  CSQF Basic Concepts . . . . . . . . . . . . . . . . . . .   3
     2.2.  CSQF Queuing Model  . . . . . . . . . . . . . . . . . . .   5
     2.3.  CSQF Timing Model . . . . . . . . . . . . . . . . . . . .   7
     2.4.  Congestion Protection and Resource Reservation  . . . . .   8
     2.5.  An Example of CSQF  . . . . . . . . . . . . . . . . . . .   9
   3.  Segment Routing Extensions for CSQF . . . . . . . . . . . . .  10
   4.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  11
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .  11
   6.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .  11
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  11
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .  11
     7.2.  Informative References  . . . . . . . . . . . . . . . . .  11
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  12

1.  Introduction

   Deterministic Networking (DetNet) [I-D.ietf-detnet-architecture] is
   defined to provide end-to-end bounded latency and extremely low
   packet loss rates for critical flows.  For a specific path, the end-
   to-end latency consists of two parts: 1) the accumulated latency on
   the wire, 2) the accumulated latency of nodes along the path.  The
   former can be considered as constant once the path has been
   determined.  The latter is contributed by the latency within each
   node along the path.  So, to guarantee the end-to-end bounded
   latency, control the bounded latency within a node is the key.  If
   every node along the path can guarantee bounded latency, then end-to-
   end bounded latency can be achieved.

Chen, et al.             Expires April 22, 2019                 [Page 2]
Show full document text