Internet-Draft | ISIS for BIER-TE | July 2022 |
Chen, et al. | Expires 30 January 2023 | [Page] |
This document describes IS-IS extensions for distributing BitPositions configured on the links in "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 30 January 2023.¶
Copyright (c) 2022 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.¶
[I-D.ietf-bier-te-arch] 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. A link in a BIER-TE domain has its BitPositions. For a link between two nodes X and Y, there are two BitPositions for two forward connected adjacencies. These two adjacency BitPositions could be configured on nodes X and Y respectively. The BitPosition configured on X is the forward connected adjacency of Y. The BitPosition configured on Y is the forward connected adjacency of X.¶
This document proposes IS-IS extensions for distributing BitPositions configured on the links in "Bit Index Explicit Replication Traffic Engineering" (BIER-TE) domain.¶
This section describes protocol extensions to IS-IS for distributing BIER-TE information such as the BitPositions configured on the links in a BIER-TE domain.¶
An Extended IS Reachability TLV (Type 22) defined in [RFC5305] may contain Sub-TLVs (such as those for TE) that apply to a link/interface to a neighbor. To encode multiple links or interfaces to neighbors, the structure inside TLV is repeated.¶
MT Intermediate Systems TLV (Type 222) defined in [RFC5120] may contain Sub-TLVs (such as those for TE) that apply to a link/interface. It is aligned with Extended IS Reachability TLV (Type 22) beside an additional two bytes in front at the beginning of the TLV for MT-ID.¶
BIER-TE Info Sub-TLV of the following format is defined and used in Extended IS Reachability TLV (Type 22) and/or MT Intermediate Systems TLV (Type 222) to advertise the BIER-TE information about a link or interface.¶
No Sub-Sub-TLV is defined so far. Note that if each of BitPosition and DrEndBitPosition uses more than 2 octets, we use 4 or more octets for each of them.¶
Under "Sub-TLVs for TLVs 22, 23, 25, 141, 222, and 223" for IS-IS TLV Codepoints, IANA is requested to assign a new codepoint for BIER-TE Info Sub-TLV as follows:¶
+============+=============+==+==+==+===+===+===+=============+ |Sub-TLV Type|Sub-TLV Name |22|23|25|141|222|223|reference | +============+=============+==+==+==+===+===+===+=============+ | TBD1 |BIER-TE Info |y |n |n | n | y | n |This document| +------------+-------------+--+--+--+---+---+---+-------------+¶
The authors would like to thank Tony Przygienda and Acee Lindem for their comments on this work.¶