Internet-Draft | OSPFv3 for BIER-TE | July 2023 |
Chen, et al. | Expires 6 January 2024 | [Page] |
This document describes OSPFv3 extensions for distributing the BitPositions configured on a Bit-Forwarding Router (BFR) in a "Bit Index Explicit Replication Traffic Engineering" (BIER-TE) domain.¶
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] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
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 6 January 2024.¶
Copyright (c) 2023 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 Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
[RFC9262] introduces Bit Index Explicit Replication (BIER) Traffic/Tree Engineering (BIER-TE). It is an architecture for per-packet stateless explicit point to multipoint (P2MP) multicast path/tree. There are three types of BitPositions (BPs) in a BIER-TE domain: link BitPosition (BP), routed BP and localdecap BP. A link BP is a BP configured on a link from Bit-Forwarding Router (BFR) X to BFR Y for a forward connected adjacency from X to Y. A routed BP is a BP configured on BFR X for a forward routed adjacency from X to a remote BFR Z not directly connected to X. A localdecap BP is a BP configured on a BFR.¶
[I-D.ietf-bier-ospfv3-extensions] describes OSPFv3 Extensions for distributing the BFR identifier (BFR-id) configured on a BFR. This document specifies OSPFv3 extensions for distributing the BitPositions configured a BFR in a BIER-TE domain. The BitPositions distributed may be used by a BFR as a Point of Local Repair (PLR) for Fast-ReRoute (FRR).¶
This section describes protocol extensions to OSPFv3 for distributing the BitPositions configured on a BFR in a BIER-TE domain.¶
[RFC8362] defines OSPFv3 Extended Router LSA, which may include multiple Router-Link TLVs. A Router-Link TLV defines a single router link. A Router-Link TLV may include a Link-BP Sub-TLV below for distributing a link BP.¶
The Node BPs TLV, Routed BP Sub-TLV and Localdecap BP Sub-TLV defined in [I-D.ietf-bier-te-ospf] are reused in OSPVv3 for distributing the routed BitPositions and the localdecap BitPosition configured on a BFR.¶
Protocol extensions defined in this document do not affect the OSPF security other than those as discussed in the Security Considerations section of [RFC8362].¶
Under "OSPFv3 Extended-LSA Sub-TLVs" registry as defined in [RFC8362], IANA is requested to assign a new registry value for Link-BP Sub-TLV as follows:¶
+==============+===================+=====================+ | Value | Description | reference | +==============+===================+=====================+ | TBD1 (30) | Link-BP | This document | +--------------+-------------------+---------------------+¶
The authors would like to thank Acee Lindem, Les Ginsberg, Tony Przygienda, Jeffrey Zhang and Toerless Eckert for their comments on this work.¶