Flex Algorithm for BIER
draft-nainar-bier-flex-algo-00

Document Type Active Internet-Draft (individual)
Last updated 2019-11-04
Stream (None)
Intended RFC status (None)
Formats plain text pdf htmlized 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)
Internet Engineering Task Force                                 N. Kumar
Internet-Draft                                              IJ. Wijnands
Intended status: Informational                                 M. Mishra
Expires: May 7, 2020                                               Cisco
                                                        November 4, 2019

                        Flex Algorithm for BIER
                     draft-nainar-bier-flex-algo-00

Abstract

   Bit Index Explicit Replication (BIER) is an architecture that
   provides optimal multicast forwarding through a "BIER domain" without
   requiring intermediate routers to run explicit tree-building protocol
   or to maintain multicast-related, per-flow state.  IGP protocols are
   extended to carry BFR-Id and other encapsulation informations that
   are used by traditional path computing algorithm using link metric
   for a loop-free best path selection.

   This document defines a constrained based path selection using IGP
   flexible Algorithm for BIER.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in RFC
   2119 [RFC2119] RFC 8174 [RFC8174] when and only when, they appear in
   all capitals, as shown here.

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 May 7, 2020.

Kumar, et al.              Expires May 7, 2020                  [Page 1]
Internet-Draft             BIER Flex Algorithm             November 2019

Copyright Notice

   Copyright (c) 2019 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
     1.1.  Acronyms and Terminology  . . . . . . . . . . . . . . . .   3
       1.1.1.  Acronyms  . . . . . . . . . . . . . . . . . . . . . .   3
       1.1.2.  Terminology . . . . . . . . . . . . . . . . . . . . .   3
   2.  Flexible Algorithm  . . . . . . . . . . . . . . . . . . . . .   3
   3.  Constraint Forwarding Identifier  . . . . . . . . . . . . . .   4
     3.1.  BFR ID Mapping for Flexible Algorithm . . . . . . . . . .   4
     3.2.  BIER-MPLS Label Mapping for Flexiblem Algorithm . . . . .   5
   4.  IGP Extensions Flexible Algorithm . . . . . . . . . . . . . .   6
     4.1.  ISIS  . . . . . . . . . . . . . . . . . . . . . . . . . .   6
     4.2.  OSPF  . . . . . . . . . . . . . . . . . . . . . . . . . .   6
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   6
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   6
   7.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   6
   8.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   6
     8.1.  Normative References  . . . . . . . . . . . . . . . . . .   6
     8.2.  Informative References  . . . . . . . . . . . . . . . . .   7
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   7

1.  Introduction

   [RFC8279] defines Bit Index Explicit Replication (BIER), an
   architecture that provides optimal multicast forwarding through a
   "BIER domain" without requiring intermediate routers to run explicit
   tree-building protocol or to maintain multicast-related, per-flow
   state.  [RFC8401] and [RFC8444] defines the IGP protocols extensions
   to carry BFR-Id and other encapsulation informations that are used by
   traditional path computing algorithm using link metric for a loop-
   free best path selection.

Kumar, et al.              Expires May 7, 2020                  [Page 2]
Internet-Draft             BIER Flex Algorithm             November 2019

   The ability to compute constrained path using attributes beyond the
Show full document text