< draft-psenak-ospf-bier-extensions-01.txt		draft-psenak-ospf-bier-extensions-02.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 27, 2015 Cisco		Expires: August 29, 2015 Cisco
	A. Dolganow		A. Dolganow
	Alcatel-Lucent		Alcatel-Lucent
	T. Przygienda		T. Przygienda
	Ericsson		Ericsson
	J. Zhang		J. Zhang
	Juniper Networks, Inc.		Juniper Networks, Inc.
	S. Aldrin		S. Aldrin
	Huawei Technologies		Huawei Technologies
	October 24, 2014		February 25, 2015
	OSPF Extensions For BIER		OSPF Extensions For BIER
	draft-psenak-ospf-bier-extensions-01.txt		draft-psenak-ospf-bier-extensions-02.txt
	Abstract		Abstract
	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. BIER also does not require any explicit tree-building		flow state. BIER also does not require any explicit 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 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 April 27, 2015.		This Internet-Draft will expire on August 29, 2015.
	Copyright Notice		Copyright Notice
	Copyright (c) 2014 IETF Trust and the persons identified as the		Copyright (c) 2015 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
	carefully, as they describe your rights and restrictions with respect		carefully, as they describe your rights and restrictions with respect
	to this document. Code Components extracted from this document must		to this document. Code Components extracted from this document must
	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. The BIER Sub-TLV . . . . . . . . . . . . . . . . . . . . 3		2.1. The BIER Sub-TLV . . . . . . . . . . . . . . . . . . . . 3
	2.2. The BIER MPLS Encapsulation Sub-TLV . . . . . . . . . . . 4		2.2. The BIER MPLS Encapsulation Sub-TLV . . . . . . . . . . . 4
	2.3. Flooding scope of BIER Information . . . . . . . . . . . 5		2.3. Flooding scope of BIER Information . . . . . . . . . . . 5
	3. Security Considerations . . . . . . . . . . . . . . . . . . . 5		3. Security Considerations . . . . . . . . . . . . . . . . . . . 6
	4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 5		4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 6
	5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 6		5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 6
	6. Normative References . . . . . . . . . . . . . . . . . . . . 6		6. Normative References . . . . . . . . . . . . . . . . . . . . 6
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 6		Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 7
	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 43 ¶		skipping to change at page 3, line 43 ¶
	information. The new Sub-TLV is called BIER Sub-TLV. Multiple BIER		information. The new Sub-TLV is called BIER Sub-TLV. Multiple BIER
	Sub-TLVs may be included in the Extended Prefix TLV.		Sub-TLVs may be included in the Extended Prefix TLV.
	BIER Sub-TLV has the following format:		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 |
	+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+		+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
	| BS Length | MT-ID | BFR-id |		| Subdomain-ID | MT-ID | BFR-id |
	+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+		+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
	| Sub-TLVs (variable) |		| Sub-TLVs (variable) |
	+- -+		+- -+
	| |		| |
	Type: TBD		Type: TBD
	Length: 4 bytes		Length: 4 bytes
	BS Length: A 1 octet field encoding the supported BitString length		Subdomain-ID: Unique value identifying the BIER subdomain within
	associated with this BFR-prefix. The values allowed in this field		the BIER domain, as described in section 1 of
	are specified in section 3 of		[I-D.wijnands-bier-architecture].
	[I-D.wijnands-mpls-bier-encapsulation].
	MT-ID: Multi-Topology ID (as defined in [RFC4915]).		MT-ID: Multi-Topology ID (as defined in [RFC4915]) that identifies
			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 [I-D.wijnands-bier-architecture]. If the BFR-id is		section 2 [I-D.wijnands-bier-architecture]. If the BFR-id is
	zero, it means, the advertising router is not advertising any		zero, it means, the advertising router is not advertising any
	BIER-id.		BIER-id.
	If multiple BIER Sub-TLVs are present, all having the same BS Length		Each BFR sub-domain MUST be associate with a single OSPF topology
	and MT-ID values, first one MUST be used and subsequent ones MUST be		that is identified by the MT-ID. If the association between BEIR
	ignored.		sub-domain and OSPF topology advertised in the BIER sub-TLV is in
			conflict with the association locally configured on the receiving
			router, BIER sub-TLV SHOULD be ignored.
	2.2. The BIER MPLS Encapsulation Sub-TLV		2.2. The BIER MPLS Encapsulation Sub-TLV
	BIER MPLS Encapsulation Sub-TLV is a sub-TLV of the BIER Sub-TLV.		BIER MPLS Encapsulation Sub-TLV is a sub-TLV of the BIER Sub-TLV.
	BIER MPLS Encapsulation Sub-TLVIt is used in order to advertise MPLS		BIER MPLS Encapsulation Sub-TLVt is used in order to advertise MPLS
	specific information used for BIER. It MUST appear only once in the		specific information used for BIER. It MAY appear multiple times in
	BIER Sub-TLV.		the BIER Sub-TLV.
	BIER MPLS Encapsulation Sub-TLV has the following format:		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 Length | Reserved |
			+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
	Type: TBD		Type: TBD
	Length: 4 bytes		Length: 4 bytes
	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.		the label range. It MUST be greater then 0, otherwise the TLV
			MUST be ignored.
	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.		represent the first label in the label range.
			BS Length: A 1 octet field encoding the supported BitString length
			associated with this BFR-prefix. The values allowed in this field
			are specified in section 3 of
			[I-D.wijnands-mpls-bier-encapsulation].
	The "label range" is the set of labels beginning with the label		The "label range" is the set of labels beginning with the label
	range base and ending with (label range base)+(label range size)-		range base and ending with (label range base)+(label range size)-
	1. A unique label range is allocated for each BitStream length		1. A unique label range is allocated for each BitStream length
	and Multi-Topology ID. These labels are used for BIER forwarding		and Multi-Topology ID. These labels are used for BIER forwarding
	as described in [I-D.wijnands-bier-architecture] and		as described in [I-D.wijnands-bier-architecture] and
	[I-D.wijnands-mpls-bier-encapsulation].		[I-D.wijnands-mpls-bier-encapsulation].
	The size of the label range is determined by the number of Set		The size of the label range is determined by the number of Set
	Identifiers (SI) (section 2 of [I-D.wijnands-bier-architecture])		Identifiers (SI) (section 2 of [I-D.wijnands-bier-architecture])
	that are used in the network. Each SI maps to a single label in		that are used in the network. Each SI maps to a single label in
	the label range. The first label is for SI=0, the second label is		the label range. The first label is for SI=0, the second label is
	for SI=1, etc.		for SI=1, etc.
			If same BS length is repeated in multiple BIER MPLS Encapsulation
			Sub-TLV inside the same BIER Sub-TLV, the first BIER MPLS
			Encapsulation Sub-TLV with such BS length MUST be used and any
			subsequent BIER MPLS Encapsulation Sub-TLVs with the same BS length
			MUST be ignored.
			Label ranges within all BIER MPLS Encapsulation Sub-TLV inside the
			same BIER Sub-TLV SHOULD NOT overlap. If the overlap is detected,
			overlapping BIER MPLS Encapsulation Sub-TLV SHOULD be ignored.
	2.3. Flooding scope of BIER Information		2.3. Flooding scope of BIER Information
	Flooding scope of the OSPF Extended Prefix Opaque LSA		Flooding scope of the OSPF Extended Prefix Opaque LSA
	[I-D.ietf-ospf-prefix-link-attr] that is used for advertising BIER		[I-D.ietf-ospf-prefix-link-attr] that is used for advertising BIER
	Sub TLV is set to area. If (and only if) a single BIER domain		Sub TLV is set to area. If (and only if) a single BIER domain
	contains multiple OSPF areas, OSPF must propagate BIER information		contains multiple OSPF areas, OSPF must propagate BIER information
	between areas. The following procedure is used in order to propagate		between areas. The following procedure is used in order to propagate
	BIER related information between areas:		BIER related information between areas:
	When an OSPF ABR advertises a Type-3 Summary LSA from an intra-		When an OSPF ABR advertises a Type-3 Summary LSA from an intra-
	skipping to change at page 6, line 4 ¶		skipping to change at page 6, line 26 ¶
	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 two new allocations from the OSPF Extended		The document requests two new allocations from the OSPF Extended
	Prefix sub-TLV registry as defined in		Prefix sub-TLV registry as defined in
	[I-D.ietf-ospf-prefix-link-attr].		[I-D.ietf-ospf-prefix-link-attr].
	BIER Sub-TLV: TBD		BIER Sub-TLV: TBD
	BIER MPLS Encapsulation Sub-TLV: TBD		BIER MPLS Encapsulation Sub-TLV: TBD
	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-ospf-prefix-link-attr]		[I-D.ietf-ospf-prefix-link-attr]
	Psenak, P., Gredler, H., Shakir, R., Henderickx, W.,		Psenak, P., Gredler, H., Shakir, R., Henderickx, W.,
	Tantsura, J., and A. Lindem, "OSPFv2 Prefix/Link Attribute		Tantsura, J., and A. Lindem, "OSPFv2 Prefix/Link Attribute
	Advertisement", draft-ietf-ospf-prefix-link-attr-01 (work		Advertisement", draft-ietf-ospf-prefix-link-attr-03 (work
	in progress), September 2014.		in progress), February 2015.
	[I-D.wijnands-bier-architecture]		[I-D.wijnands-bier-architecture]
	Wijnands, I., Rosen, E., Dolganow, A., and T. Przygienda,		Wijnands, I., Rosen, E., Dolganow, A., and T. Przygienda,
	"Multicast using Bit Index Explicit Replication", draft-		"Multicast using Bit Index Explicit Replication", draft-
	wijnands-bier-architecture-00 (work in progress),		wijnands-bier-architecture-00 (work in progress),
	September 2014.		September 2014.
	[I-D.wijnands-mpls-bier-encapsulation]		[I-D.wijnands-mpls-bier-encapsulation]
	Wijnands, I., Rosen, E., Dolganow, A., and J. Tantsura,		Wijnands, I., Rosen, E., Dolganow, A., and J. Tantsura,
	"Encapsulation for Bit Index Explicit Replication in MPLS		"Encapsulation for Bit Index Explicit Replication in MPLS
End of changes. 18 change blocks.
	23 lines changed or deleted		44 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/