BIER Underlay Path Calculation Algorithm and Constraints
draft-ietf-bier-bar-ipa-04

Document Type Active Internet-Draft (bier WG)
Last updated 2019-05-29
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
BIER                                                            Z. Zhang
Internet-Draft                                             A. Przygienda
Updates: 8401,8444 (if approved)                        Juniper Networks
Intended status: Standards Track                             A. Dolganow
Expires: November 30, 2019                                    H. Bidgoli
                                                                   Nokia
                                                             I. Wijnands
                                                           Cisco Systems
                                                                A. Gulko
                                                         Thomson Reuters
                                                            May 29, 2019

        BIER Underlay Path Calculation Algorithm and Constraints
                       draft-ietf-bier-bar-ipa-04

Abstract

   This document specifies general rules for interaction between the BAR
   (BIER Algorithm) and IPA (IGP Algorithm) fields defined in ISIS/
   OSPFv2 Extensions for BIER.  The semantics for the BAR and IPA fields
   (when both or any of them is non-zero) defined in this document
   updates the semantics defined in RFC8444/RFC8401.

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

   This Internet-Draft will expire on November 30, 2019.

Zhang, et al.           Expires November 30, 2019               [Page 1]
Internet-Draft                bier-bar-ipa                      May 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
   2.  General Rules for the BAR and IPA fields  . . . . . . . . . .   3
     2.1.  When BAR Is Not Used  . . . . . . . . . . . . . . . . . .   4
     2.2.  Exceptions/Extensions to the General Rules  . . . . . . .   4
   3.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   4
   4.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   4
   5.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   4
     5.1.  Normative References  . . . . . . . . . . . . . . . . . .   4
     5.2.  Informative References  . . . . . . . . . . . . . . . . .   5
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   5

1.  Introduction

   In Bit Index Explicit Replication (BIER) architecture [RFC8279],
   packets with a BIER encapsulation header are forwarded to the
   neighbors on the underlay paths towards the BFERs.  For each sub-
   domain, the paths are calculated in the underlay topology for the
   sub-domain, following a calculation algorithm specific to the sub-
   domain.  The <topology, algorithm> could be congruent or incongruent
   with unicast.  The topology could be a default topology, a multi-
   topology [RFC5120] topology.  The algorithm could be a generic IGP
   algorithm (e.g.  SPF) or could be a BIER specific one defined in the
   future.

   In [RFC8401] and [RFC8444], an 8-bit BAR (BIER Algorithm) field and
   8-bit IPA (IGP Algorithm) field are defined to signal the BIER
   specific algorithm and generic IGP Algorithm respectively and only
   value 0 is allowed for both fields in those two documents.  This
   document specifies the general rules for the two fields and their
   interaction when either or both fields are not 0, and updates their
   semantics defined in [RFC8444] and [RFC8401].

Zhang, et al.           Expires November 30, 2019               [Page 2]
Show full document text