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
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
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 28 January 2022.¶
Copyright (c) 2021 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.¶
[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
This document proposes OSPFv3 extensions for distributing BitPositions
configured on the links
in "Bit Index Explicit Replication Traffic Engineering" (BIER-TE)
This section describes protocol extensions to OSPFv3
for distributing BIER-TE information
such as the BitPositions configured on the links 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 BIER-TE Sub-TLV below
for distributing BIER-TE information.
This Sub-TLV has the following format.¶
Multi-Topology ID identifying the topology
that is associated with the BIER-TE sub-domain.¶
Single-octet BIER Algorithm used to calculate
underlay paths to reach other BFRs. Values are allocated
from the "BIER Algorithm" registry defined in
Single-octet IGP Algorithm used to either modify,
enhance, or replace the calculation of underlay paths to reach
other BFRs as defined by the BAR value. Values are defined
in the "IGP Algorithm Types" registry.¶
A 2-octet field encoding the BitPosition
locally configured on the link/interface when the Link Type of
the link in the Router-Link TLV containing this Sub-TLV
is 1 (i.e., Point-to-Point connection to another router) or
2 (i.e., connection to Transit Network or say LAN).¶
A 2-octet field encoding the BitPosition
of the connection on the designated router (DR) end. This field is
valid when the Link Type in the Router-Link TLV
containing this Sub-TLV is 2 (i.e., Transit Network or LAN).
For the other value of the Link Type, this field MUST be ignored. The
DrEndBitPosition may be configured on
the link/interface to a transit network
(i.e., broadcast link or say LAN).¶
Note that if each of BitPosition and DrEndBitPosition uses more than
2 octets, we use 4 or more octets for each of them.¶
Przygienda, T., Shen, N., and N. Sheth, "M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs)", RFC 5120, DOI 10.17487/RFC5120, , <https://www.rfc-editor.org/info/rfc5120>.
Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A., Przygienda, T., and S. Aldrin, "Multicast Using Bit Index Explicit Replication (BIER)", RFC 8279, DOI 10.17487/RFC8279, , <https://www.rfc-editor.org/info/rfc8279>.
Lindem, A., Roy, A., Goethals, D., Reddy Vallem, V., and F. Baker, "OSPFv3 Link State Advertisement (LSA) Extensibility", RFC 8362, DOI 10.17487/RFC8362, , <https://www.rfc-editor.org/info/rfc8362>.
Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A., Tantsura, J., Aldrin, S., and I. Meilik, "Encapsulation for Bit Index Explicit Replication (BIER) in MPLS and Non-MPLS Networks", RFC 8296, DOI 10.17487/RFC8296, , <https://www.rfc-editor.org/info/rfc8296>.
Ginsberg, L., Ed., Przygienda, T., Aldrin, S., and Z. Zhang, "Bit Index Explicit Replication (BIER) Support via IS-IS", RFC 8401, DOI 10.17487/RFC8401, , <https://www.rfc-editor.org/info/rfc8401>.
Psenak, P., Ed., Kumar, N., Wijnands, IJ., Dolganow, A., Przygienda, T., Zhang, J., and S. Aldrin, "OSPFv2 Extensions for Bit Index Explicit Replication (BIER)", RFC 8444, DOI 10.17487/RFC8444, , <https://www.rfc-editor.org/info/rfc8444>.
Rosen, E., Ed., Sivakumar, M., Przygienda, T., Aldrin, S., and A. Dolganow, "Multicast VPN Using Bit Index Explicit Replication (BIER)", RFC 8556, DOI 10.17487/RFC8556, , <https://www.rfc-editor.org/info/rfc8556>.