draft-ietf-bier-ospf-bier-extensions-08.txt   draft-ietf-bier-ospf-bier-extensions-09.txt 
OSPF P. Psenak, Ed. OSPF P. Psenak, Ed.
Internet-Draft N. Kumar Internet-Draft N. Kumar
Intended status: Standards Track IJ. Wijnands Intended status: Standards Track IJ. Wijnands
Expires: April 6, 2018 Cisco Expires: April 25, 2018 Cisco
A. Dolganow A. Dolganow
Nokia Nokia
T. Przygienda T. Przygienda
J. Zhang J. Zhang
Juniper Networks, Inc. Juniper Networks, Inc.
S. Aldrin S. Aldrin
Google, Inc. Google, Inc.
October 3, 2017 October 22, 2017
OSPF Extensions for BIER OSPF Extensions for BIER
draft-ietf-bier-ospf-bier-extensions-08.txt draft-ietf-bier-ospf-bier-extensions-09.txt
Abstract Abstract
Bit Index Explicit Replication (BIER) is an architecture that Bit Index Explicit Replication (BIER) is an architecture that
provides multicast forwarding through a "BIER domain" without provides multicast forwarding through a "BIER domain" without
requiring intermediate routers to maintain multicast related per-flow requiring intermediate routers to maintain multicast related per-flow
state. Neither does BIER require an explicit tree-building protocol state. Neither does BIER require an explicit tree-building protocol
for its operation. A multicast data packet enters a BIER domain at a for its operation. A multicast data packet enters a BIER domain at a
"Bit-Forwarding Ingress Router" (BFIR), and leaves the BIER domain at "Bit-Forwarding Ingress Router" (BFIR), and leaves the BIER domain at
one or more "Bit-Forwarding Egress Routers" (BFERs). The BFIR router one or more "Bit-Forwarding Egress Routers" (BFERs). The BFIR router
skipping to change at page 2, line 7 skipping to change at page 2, line 7
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on April 6, 2018. This Internet-Draft will expire on April 25, 2018.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of (https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 2, line 30 skipping to change at page 2, line 30
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Flooding of the BIER Information in OSPF . . . . . . . . . . 3 2. Flooding of the BIER Information in OSPF . . . . . . . . . . 3
2.1. BIER Sub-TLV . . . . . . . . . . . . . . . . . . . . . . 3 2.1. BIER Sub-TLV . . . . . . . . . . . . . . . . . . . . . . 3
2.2. BIER MPLS Encapsulation Sub-TLV . . . . . . . . . . . . . 4 2.2. BIER MPLS Encapsulation Sub-TLV . . . . . . . . . . . . . 4
2.3. Optional BIER Tree Type Sub-TLV . . . . . . . . . . . . . 5 2.3. Optional BIER sub-domain BSL conversion Sub-TLV . . . . . 6
2.4. Optional BIER sub-domain BSL conversion Sub-TLV . . . . . 6 2.4. Flooding scope of BIER Information . . . . . . . . . . . 6
2.5. Flooding scope of BIER Information . . . . . . . . . . . 7
3. Security Considerations . . . . . . . . . . . . . . . . . . . 8 3. Security Considerations . . . . . . . . . . . . . . . . . . . 8
4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8 4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8
4.1. BIER Tree Type Registry . . . . . . . . . . . . . . . . . 8 5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 8
5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 9 6. Normative References . . . . . . . . . . . . . . . . . . . . 8
6. Normative References . . . . . . . . . . . . . . . . . . . . 9 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 9
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 10
1. Introduction 1. Introduction
Bit Index Explicit Replication (BIER) is an architecture that Bit Index Explicit Replication (BIER) is an architecture that
provides optimal multicast forwarding through a "BIER domain" without provides optimal multicast forwarding through a "BIER domain" without
requiring intermediate routers to maintain any multicast related per- requiring intermediate routers to maintain any multicast related per-
flow state. Neither does BIER explicitly require a tree-building flow state. Neither does BIER explicitly require a tree-building
protocol for its operation. A multicast data packet enters a BIER protocol for its operation. A multicast data packet enters a BIER
domain at a "Bit-Forwarding Ingress Router" (BFIR), and leaves the domain at a "Bit-Forwarding Ingress Router" (BFIR), and leaves the
BIER domain at one or more "Bit-Forwarding Egress Routers" (BFERs). BIER domain at one or more "Bit-Forwarding Egress Routers" (BFERs).
skipping to change at page 3, line 46 skipping to change at page 3, line 44
The BIER Sub-TLV has the following format: The BIER Sub-TLV has the following format:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length | | Type | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Sub-domain-ID | MT-ID | BFR-id | | Sub-domain-ID | MT-ID | BFR-id |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| BAR | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Sub-TLVs (variable) | | Sub-TLVs (variable) |
+- -+ +- -+
| | | |
Type: TBD1 Type: 9
Length: Variable, dependent on sub-TLVs. Length: Variable, dependent on sub-TLVs.
Sub-domain-ID: Unique value identifying the BIER sub-domain within Sub-domain-ID: Unique value identifying the BIER sub-domain within
the BIER domain, as described in section 1 of the BIER domain, as described in section 1 of
[I-D.ietf-bier-architecture]. [I-D.ietf-bier-architecture].
MT-ID: Multi-Topology ID (as defined in [RFC4915]) that identifies MT-ID: Multi-Topology ID (as defined in [RFC4915]) that identifies
the topology that is associated with the BIER sub-domain. the topology that is associated with the BIER sub-domain.
BFR-id: A 2 octet field encoding the BFR-id, as documented in BFR-id: A 2 octet field encoding the BFR-id, as documented in
section 2 of [I-D.ietf-bier-architecture]. If the BFR is not section 2 of [I-D.ietf-bier-architecture]. If the BFR is not
locally configured with a valid BFR-id, the value of this field is locally configured with a valid BFR-id, the value of this field is
set to invalid BFR-id per [I-D.ietf-bier-architecture]. set to invalid BFR-id per [I-D.ietf-bier-architecture].
BAR: Single octet BIER Algorithm. 0 is the only supported value
defined in this document and represents Shortest Path First (SPF)
algorithm based on IGP link metric. This is the standard shortest
path algorithm as computed by the OSPF protocol. Other values may
be defined in the future.
Each BFR sub-domain MUST be associated with one and only one OSPF Each BFR sub-domain MUST be associated with one and only one OSPF
topology that is identified by the MT-ID. If the association between topology that is identified by the MT-ID. If the association between
BIER sub-domain and OSPF topology advertised in the BIER sub-TLV by BIER sub-domain and OSPF topology advertised in the BIER sub-TLV by
other BFRs is in conflict with the association locally configured on other BFRs is in conflict with the association locally configured on
the receiving router, the BIER Sub-TLV MUST be ignored. the receiving router, the BIER Sub-TLV MUST be ignored.
If a BFR advertises the same Sub-domain-ID in multiple BIER sub-TLVs, If a BFR advertises the same Sub-domain-ID in multiple BIER sub-TLVs,
the BRF MUST be treated as if it did not advertise a BIER sub-TLV for the BRF MUST be treated as if it did not advertise a BIER sub-TLV for
such sub-domain. such sub-domain.
All BFRs MUST detect advertisement of duplicate valid BFR-IDs for a All BFRs MUST detect advertisement of duplicate valid BFR-IDs for a
given MT-ID and Sub-domain-ID. When such duplication is detected all given MT-ID and Sub-domain-ID. When such duplication is detected all
BFRs advertising duplicates MUST be treated as if they did not BFRs advertising duplicates MUST be treated as if they did not
advertise a valid BFR-id. advertise a valid BFR-id.
The supported algorithm MUST be consistent for all routers supporting
a given BFR sub-domain. A router receiving BIER Sub-TLV
advertisement with a BAR which does not match the locally configured
value MUST report a misconfiguration for the given BIER sub-domain
and MUST ignore such BIER sub-TLV.
2.2. BIER MPLS Encapsulation Sub-TLV 2.2. BIER MPLS Encapsulation Sub-TLV
The BIER MPLS Encapsulation Sub-TLV is a Sub-TLV of the BIER Sub-TLV. The BIER MPLS Encapsulation Sub-TLV is a Sub-TLV of the BIER Sub-TLV.
The BIER MPLS Encapsulation Sub-TLV is used in order to advertise The BIER MPLS Encapsulation Sub-TLV is used in order to advertise
MPLS specific information used for BIER. It MAY appear multiple MPLS specific information used for BIER. It MAY appear multiple
times in the BIER Sub-TLV. times in the BIER Sub-TLV.
The BIER MPLS Encapsulation Sub-TLV has the following format: The BIER MPLS Encapsulation Sub-TLV has the following format:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length | | Type | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|Lbl Range Size | Label Range Base | |Lbl Range Size | Label Range Base |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|BS Len | Reserved | |BS Len | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Type: TBD2
Type: 10
Length: 4 octets Length: 4 octets
Label Range Size: A 1 octet field encoding the label range size of Label Range Size: A 1 octet field encoding the label range size of
the label range. It MUST be greater then 0, otherwise the the label range. It MUST be greater then 0, otherwise the
advertising router MUST be treated as if it did not advertise a advertising router MUST be treated as if it did not advertise a
BIER sub-TLV. BIER sub-TLV.
Label Range Base: A 3 octet field, where the 20 rightmost bits Label Range Base: A 3 octet field, where the 20 rightmost bits
represent the first label in the label range. The 4 leftmost bits represent the first label in the label range. The 4 leftmost bits
skipping to change at page 5, line 47 skipping to change at page 6, line 13
ignored. ignored.
Label ranges within all BIER MPLS Encapsulation Sub-TLV inside the Label ranges within all BIER MPLS Encapsulation Sub-TLV inside the
same BIER Sub-TLV MUST NOT overlap. If the overlap is detected, the same BIER Sub-TLV MUST NOT overlap. If the overlap is detected, the
advertising router MUST be treated as if it did not advertise a BIER advertising router MUST be treated as if it did not advertise a BIER
sub-TLV. sub-TLV.
All advertised labels MUST be valid, otherwise the BIER sub-TLV MUST All advertised labels MUST be valid, otherwise the BIER sub-TLV MUST
be ignored. be ignored.
2.3. Optional BIER Tree Type Sub-TLV 2.3. Optional BIER sub-domain BSL conversion Sub-TLV
The BIER Tree Type Sub-TLV is a Sub-TLV of the BIER Sub-TLV. This
Sub-TLV carries the information associated with the supported BIER
tree type for a sub-domain. This Sub-TLV is optional and its absence
has the same semantics as its presence with Tree Type value 0 (SPF).
When Tree Type 0 is used, it is RECOMMENDED that this Sub-TLV is
omitted in order to reduce the space consumed in the parent TLV.
This Sub-TLV MAY occur no more than once in a BIER sub-TLV. If
multiple occurences of this Sub-TLV are present in a single BIER Sub-
TLV, the BIER sub-TLV MUST be ignored.
If the tree type (implied or explicitly advertised) does not match
the locally configured tree type associated with the matching sub-
domain, the BIER sub-TLV MUST be ignored.
0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Tree Type |
+-+-+-+-+-+-+-+-+
Type: TBD3.
Length: 1 octet.
Tree Type: 1 octet field describing the Tree Type. The following
value is defined by this document:
0: Shortest Path First (SPF) algorithm based on IGP link
metric. This is the standard shortest path algorithm as
computed by the OSPF protocol.
2.4. Optional BIER sub-domain BSL conversion Sub-TLV
The BIER sub-domain BSL conversion Sub-TLV is a Sub-TLV of the BIER The BIER sub-domain BSL conversion Sub-TLV is a Sub-TLV of the BIER
Sub-TLV. This sub-TLV indicates whether the BFR is capable of Sub-TLV. This sub-TLV indicates whether the BFR is capable of
imposing a different Bit String Length (BSL) than the one it received imposing a different Bit String Length (BSL) than the one it received
in a BIER encapsulated packet. Such a capability may allow future, in a BIER encapsulated packet. Such a capability may allow future,
advanced tree types which ensure simple migration procedures from one advanced tree types which ensure simple migration procedures from one
BSL to another in a given MT-ID and Sub-domain-ID or prevent stable BSL to another in a given MT-ID and Sub-domain-ID or prevent stable
blackholes in scenarios where not all routers support the same set of blackholes in scenarios where not all routers support the same set of
BSLs in a given MT-ID and Sub-domain-ID. BSLs in a given MT-ID and Sub-domain-ID.
skipping to change at page 7, line 13 skipping to change at page 6, line 39
BIER sub-TLV, the BIER sub-TLV MUST be ignored. BIER sub-TLV, the BIER sub-TLV MUST be ignored.
The BIER sub-domain BSL conversion Sub-TLV has following format: The BIER sub-domain BSL conversion Sub-TLV has following format:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length | | Type | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Type: TBD4. Type: 11
Length: 0 octets. Length: 0 octets.
2.5. Flooding scope of BIER Information 2.4. Flooding scope of BIER Information
The flooding scope of the OSPF Extended Prefix Opaque LSA [RFC7684] The flooding scope of the OSPF Extended Prefix Opaque LSA [RFC7684]
that is used for advertising the BIER Sub-TLV is set to area-local. that is used for advertising the BIER Sub-TLV is set to area-local.
To allow BIER deployment in a multi-area environment, OSPF must To allow BIER deployment in a multi-area environment, OSPF must
propagate BIER information between areas. propagate BIER information between areas.
( ) ( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) ( ) ( )
R1 Area 1 R2 Area 0 R3 Area 2 R4 R1 Area 1 R2 Area 0 R3 Area 2 R4
( ) ( ) ( ) ( ) ( ) ( )
skipping to change at page 8, line 31 skipping to change at page 8, line 15
3. Security Considerations 3. Security Considerations
Implementations must assure that malformed TLV and Sub-TLV Implementations must assure that malformed TLV and Sub-TLV
permutations do not result in errors which cause hard OSPF failures. permutations do not result in errors which cause hard OSPF failures.
4. IANA Considerations 4. IANA Considerations
The document requests three new allocations from the OSPF Extended The document requests three new allocations from the OSPF Extended
Prefix sub-TLV registry as defined in [RFC7684]. Prefix sub-TLV registry as defined in [RFC7684].
BIER Sub-TLV: TBD1 BIER Sub-TLV: 9
BIER MPLS Encapsulation Sub-TLV: TBD2
BIER Tree Type Sub-TLV: TBD3
BIER sub-domain BSL conversion Sub-TLV
4.1. BIER Tree Type Registry
IANA is requested to set up a registry called "BIER Tree Type". The
registration policy for this registry is "Standards Action"
([RFC8126] and [RFC7120]).
Values in this registry must come from the range 0-255.
The initial value in the BIER Tree Type registry is: BIER MPLS Encapsulation Sub-TLV: 10
0: Shortest Path First (SPF) algorithm based on standard IGP link BIER sub-domain BSL conversion Sub-TLV: 11
metric.
5. Acknowledgments 5. Acknowledgments
The authors would like to thank Rajiv Asati, Christian Martin, Greg The authors would like to thank Rajiv Asati, Christian Martin, Greg
Shepherd and Eric Rosen for their contribution. Shepherd and Eric Rosen for their contribution.
6. Normative References 6. Normative References
[I-D.ietf-bier-architecture] [I-D.ietf-bier-architecture]
Wijnands, I., Rosen, E., Dolganow, A., Przygienda, T., and Wijnands, I., Rosen, E., Dolganow, A., Przygienda, T., and
skipping to change at page 10, line 31 skipping to change at page 10, line 4
Email: naikumar@cisco.com Email: naikumar@cisco.com
IJsbrand Wijnands IJsbrand Wijnands
Cisco Cisco
De Kleetlaan 6a De Kleetlaan 6a
Diegem 1831 Diegem 1831
Belgium Belgium
Email: ice@cisco.com Email: ice@cisco.com
Andrew Dolganow Andrew Dolganow
Nokia Nokia
750 Chai Chee Rd 750 Chai Chee Rd
06-06 Viva Business Park 06-06 Viva Business Park
Singapore 469004 Singapore 469004
Email: andrew.dolganow@alcatel-lucent.com Email: andrew.dolganow@nokia.com
Tony Przygienda Tony Przygienda
Juniper Networks, Inc. Juniper Networks, Inc.
10 Technology Park Drive 10 Technology Park Drive
Westford, MA 01886 Westford, MA 01886
USA USA
Email: prz@juniper.net Email: prz@juniper.net
Jeffrey Zhang Jeffrey Zhang
Juniper Networks, Inc. Juniper Networks, Inc.
10 Technology Park Drive 10 Technology Park Drive
Westford, MA 01886 Westford, MA 01886
USA USA
Email: zzhang@juniper.net Email: zzhang@juniper.net
Sam Aldrin Sam Aldrin
Google, Inc. Google, Inc.
 End of changes. 20 change blocks. 
72 lines changed or deleted 34 lines changed or added

This html diff was produced by rfcdiff 1.46. The latest version is available from http://tools.ietf.org/tools/rfcdiff/