Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Schemes for FECFRAME
draft-ietf-tsvwg-rlc-fec-scheme-09

Document Type Active Internet-Draft (tsvwg WG)
Last updated 2018-10-11 (latest revision 2018-09-19)
Replaces draft-roca-tsvwg-rlc-fec-scheme
Stream IETF
Intended RFC status Proposed Standard
Formats plain text xml pdf html bibtex
Reviews SECDIR, GENART, TSVART will not review this version
Stream WG state Submitted to IESG for Publication (wg milestone: Jun 2018 - Submit "Sliding Wind... )
Document shepherd Wesley Eddy
Shepherd write-up Show (last changed 2018-08-01)
IESG IESG state IESG Evaluation::Revised I-D Needed
Consensus Boilerplate Yes
Telechat date
Has 3 DISCUSSes. Needs 2 more YES or NO OBJECTION positions to pass.
Responsible AD Spencer Dawkins
Send notices to David Black <david.black@dell.com>, Wesley Eddy <wes@mti-systems.com>
IANA IANA review state IANA OK - Actions Needed
IANA action state None
TSVWG                                                            V. Roca
Internet-Draft                                                  B. Teibi
Intended status: Standards Track                                   INRIA
Expires: March 23, 2019                               September 19, 2018

Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC)
                          Schemes for FECFRAME
                   draft-ietf-tsvwg-rlc-fec-scheme-09

Abstract

   This document describes two fully-specified Forward Erasure
   Correction (FEC) Schemes for Sliding Window Random Linear Codes
   (RLC), one for RLC over the Galois Field (A.K.A.  Finite Field)
   GF(2), a second one for RLC over the Galois Field GF(2^^8), each time
   with the possibility of controlling the code density.  They can
   protect arbitrary media streams along the lines defined by FECFRAME
   extended to sliding window FEC codes, as defined in [fecframe-ext].
   These sliding window FEC codes rely on an encoding window that slides
   over the source symbols, generating new repair symbols whenever
   needed.  Compared to block FEC codes, these sliding window FEC codes
   offer key advantages with real-time flows in terms of reduced FEC-
   related latency while often providing improved packet erasure
   recovery capabilities.

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."

   This Internet-Draft will expire on March 23, 2019.

Copyright Notice

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

Roca & Teibi             Expires March 23, 2019                 [Page 1]
Internet-Draft               RLC FEC Scheme               September 2018

   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  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Limits of Block Codes with Real-Time Flows  . . . . . . .   3
     1.2.  Lower Latency and Better Protection of Real-Time Flows
           with the Sliding Window RLC Codes . . . . . . . . . . . .   4
     1.3.  Small Transmission Overheads with the Sliding Window RLC
           FEC Scheme  . . . . . . . . . . . . . . . . . . . . . . .   5
     1.4.  Document Organization . . . . . . . . . . . . . . . . . .   6
   2.  Definitions and Abbreviations . . . . . . . . . . . . . . . .   6
   3.  Procedures  . . . . . . . . . . . . . . . . . . . . . . . . .   7
     3.1.  Possible Parameter Derivations  . . . . . . . . . . . . .   7
       3.1.1.  Case of a CBR Real-Time Flow  . . . . . . . . . . . .   8
       3.1.2.  Other Types of Real-Time Flow . . . . . . . . . . . .  10
       3.1.3.  Case of a Non Real-Time Flow  . . . . . . . . . . . .  11
     3.2.  ADU, ADUI and Source Symbols Mappings . . . . . . . . . .  11
     3.3.  Encoding Window Management  . . . . . . . . . . . . . . .  13
     3.4.  Pseudo-Random Number Generator (PRNG) . . . . . . . . . .  13
     3.5.  Coding Coefficients Generation Function . . . . . . . . .  15
     3.6.  Finite Fields Operations  . . . . . . . . . . . . . . . .  17
       3.6.1.  Finite Field Definitions  . . . . . . . . . . . . . .  17
       3.6.2.  Linear Combination of Source Symbols Computation  . .  17
   4.  Sliding Window RLC FEC Scheme over GF(2^^8) for Arbitrary
       Packet Flows  . . . . . . . . . . . . . . . . . . . . . . . .  18
     4.1.  Formats and Codes . . . . . . . . . . . . . . . . . . . .  18
       4.1.1.  FEC Framework Configuration Information . . . . . . .  18
       4.1.2.  Explicit Source FEC Payload ID  . . . . . . . . . . .  19
       4.1.3.  Repair FEC Payload ID . . . . . . . . . . . . . . . .  20
       4.1.4.  Additional Procedures . . . . . . . . . . . . . . . .  21
   5.  Sliding Window RLC FEC Scheme over GF(2) for Arbitrary Packet
       Flows . . . . . . . . . . . . . . . . . . . . . . . . . . . .  21
Show full document text