< draft-ietf-bier-ospf-bier-extensions-06.txt		draft-ietf-bier-ospf-bier-extensions-07.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: December 22, 2017 Cisco		Expires: January 4, 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.
	June 20, 2017		July 3, 2017
	OSPF Extensions for BIER		OSPF Extensions for BIER
	draft-ietf-bier-ospf-bier-extensions-06.txt		draft-ietf-bier-ospf-bier-extensions-07.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 http://datatracker.ietf.org/drafts/current/.		Drafts is at http://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 December 22, 2017.		This Internet-Draft will expire on January 4, 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
	(http://trustee.ietf.org/license-info) in effect on the date of		(http://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 31 ¶		skipping to change at page 2, line 31 ¶
	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 Tree Type Sub-TLV . . . . . . . . . . . . . 5
	2.4. Flooding scope of BIER Information . . . . . . . . . . . 6		2.4. Optional BIER sub-domain BSL conversion Sub-TLV . . . . . 6
			2.5. Flooding scope of BIER Information . . . . . . . . . . . 7
	3. Security Considerations . . . . . . . . . . . . . . . . . . . 7		3. Security Considerations . . . . . . . . . . . . . . . . . . . 7
	4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 7		4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 7
	5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 7		5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 8
	6. Normative References . . . . . . . . . . . . . . . . . . . . 7		6. Normative References . . . . . . . . . . . . . . . . . . . . 8
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 8		Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 8
	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
	skipping to change at page 5, line 46 ¶		skipping to change at page 5, line 48 ¶
	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 Tree Type Sub-TLV
	This Sub-TLV carries the information associated with the supported		The BIER Tree Type Sub-TLV is a Sub-TLV of the BIER Sub-TLV. This
	BIER tree type for a sub-domain. This Sub-TLV is optional and its		Sub-TLV carries the information associated with the supported BIER
	absence has the same semantics as its presence with Tree Type value 0		tree type for a sub-domain. This Sub-TLV is optional and its absence
	(SPF). When Tree Type 0 is used, it is RECOMMENDED that this Sub-TLV		has the same semantics as its presence with Tree Type value 0 (SPF).
	is omitted in order to reduce the space consumed in the parent TLV.
			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		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-		multiple occurences of this Sub-TLV are present in a single BIER Sub-
	TLV, the BIER sub-TLV MUST be ignored.		TLV, the BIER sub-TLV MUST be ignored.
	If the tree type (implied or explicitly advertised) does not match		If the tree type (implied or explicitly advertised) does not match
	the locally configured tree type associated with the matching sub-		the locally configured tree type associated with the matching sub-
	domain, the BIER sub-TLV MUST be ignored.		domain, the BIER sub-TLV MUST be ignored.
	0 1 2 3		0 1 2 3
	skipping to change at page 6, line 27 ¶		skipping to change at page 6, line 30 ¶
	+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+		+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
	| Tree Type |		| Tree Type |
	+-+-+-+-+-+-+-+-+		+-+-+-+-+-+-+-+-+
	Type: TBD3.		Type: TBD3.
	Length: 1 octet.		Length: 1 octet.
	Tree Type: 1 octet		Tree Type: 1 octet
	2.4. Flooding scope of BIER Information		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
			Sub-TLV. This sub-TLV indicates whether the BFR is capable of
			imposing a different Bit String Length (BSL) than the one it received
			in a BIER encapsulated packet. Such a capability may allow future,
			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
			blackholes in scenarios where not all routers support the same set of
			BSLs in a given MT-ID and Sub-domain-ID.
			The BIER sub-domain BSL conversion Sub-TLV is optional and its
			absence indicates that the router is NOT capable of imposing
			different BSLs but will always forward the packet with the BSL
			unchanged. This sub-TLV MAY occur at most once in a given BIER sub-
			TLV. If multiple occurrences of this sub-TLV are received in a given
			BIER sub-TLV, the BIER sub-TLV MUST be ignored.
			The BIER sub-domain BSL conversion Sub-TLV has following format:
			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 |
			+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
			Type: TBD4.
			Length: 0 octets.
			2.5. 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. The following procedure is		propagate BIER information between areas. The following procedure is
	used in order to propagate BIER related information between areas:		used in order to propagate BIER related information between areas:
	When an OSPF Area Border Router (ABR) advertises a Type-3 Summary		When an OSPF Area Border Router (ABR) advertises a Type-3 Summary
	LSA from an intra-area or inter-area prefix to all its attached		LSA from an intra-area or inter-area prefix to all its attached
	areas, it will also originate an Extended Prefix Opaque LSA, as		areas, it will also originate an Extended Prefix Opaque LSA, as
	skipping to change at page 7, line 16 ¶		skipping to change at page 8, line 4 ¶
	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: TBD1
	BIER MPLS Encapsulation Sub-TLV: TBD2		BIER MPLS Encapsulation Sub-TLV: TBD2
	BIER Tree Type Sub-TLV: TBD3		BIER Tree Type Sub-TLV: TBD3
			BIER sub-domain BSL conversion Sub-TLV
	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
	S. Aldrin, "Multicast using Bit Index Explicit		S. Aldrin, "Multicast using Bit Index Explicit
End of changes. 10 change blocks.
	14 lines changed or deleted		48 lines changed or added
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/