draft-ietf-mpls-mldp-hsmp-05.txt		draft-ietf-mpls-mldp-hsmp-06.txt
	Network Working Group L. Jin		Network Working Group L. Jin
	Internet-Draft		Internet-Draft
	Intended status: Standards Track F. Jounay		Intended status: Standards Track F. Jounay
	Expires: June 14, 2014 France Telecom		Expires: July 2, 2014 France Telecom
	I. Wijnands		I. Wijnands
	Cisco Systems, Inc		Cisco Systems, Inc
	N. Leymann		N. Leymann
	Deutsche Telekom AG		Deutsche Telekom AG
	December 11, 2013		December 29, 2013
	LDP Extensions for Hub & Spoke Multipoint Label Switched Path		LDP Extensions for Hub & Spoke Multipoint Label Switched Path
	draft-ietf-mpls-mldp-hsmp-05.txt		draft-ietf-mpls-mldp-hsmp-06.txt
	Abstract		Abstract
	This draft introduces a hub & spoke multipoint (HSMP) Label Switched		This draft introduces a hub & spoke multipoint (HSMP) Label Switched
	Path (LSP), which allows traffic both from root to leaf through		Path (LSP), which allows traffic both from root to leaf through
	point-to-multipoint (P2MP) LSP and also leaf to root along the		point-to-multipoint (P2MP) LSP and also leaf to root along the
	reverse path. That means traffic entering the HSMP LSP from		reverse path. That means traffic entering the HSMP LSP from
	application/customer at the root node travels downstream to each leaf		application/customer at the root node travels downstream to each leaf
	node, exactly as if it is travelling downstream along a P2MP LSP to		node, exactly as if it is travelling downstream along a P2MP LSP to
	each leaf node. Upstream traffic entering the HSMP LSP at any leaf		each leaf node. Upstream traffic entering the HSMP LSP at any leaf
	skipping to change at page 2, line 4		skipping to change at page 2, line 4
	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 June 14, 2014.		This Internet-Draft will expire on July 2, 2014.
	Copyright Notice		Copyright Notice
	Copyright (c) 2013 IETF Trust and the persons identified as the		Copyright (c) 2013 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 . . . . . . . . . . . . . . . . . . . . . . . . . 4		1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
	2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4		2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4
	3. Setting up HSMP LSP with LDP . . . . . . . . . . . . . . . . . 4		3. Setting up HSMP LSP with LDP . . . . . . . . . . . . . . . . . 5
	3.1. Support for HSMP LSP Setup with LDP . . . . . . . . . . . 5		3.1. Support for HSMP LSP Setup with LDP . . . . . . . . . . . 5
	3.2. HSMP FEC Elements . . . . . . . . . . . . . . . . . . . . 6		3.2. HSMP FEC Elements . . . . . . . . . . . . . . . . . . . . 6
	3.3. Using the HSMP FEC Elements . . . . . . . . . . . . . . . 6		3.3. Using the HSMP FEC Elements . . . . . . . . . . . . . . . 6
	3.4. HSMP LSP Label Map . . . . . . . . . . . . . . . . . . . . 7		3.4. HSMP LSP Label Map . . . . . . . . . . . . . . . . . . . . 7
	3.4.1. HSMP LSP Leaf Node Operation . . . . . . . . . . . . . 8		3.4.1. HSMP LSP Leaf Node Operation . . . . . . . . . . . . . 8
	3.4.2. HSMP LSP Transit Node Operation . . . . . . . . . . . 8		3.4.2. HSMP LSP Transit Node Operation . . . . . . . . . . . 8
	3.4.3. HSMP LSP Root Node Operation . . . . . . . . . . . . . 9		3.4.3. HSMP LSP Root Node Operation . . . . . . . . . . . . . 9
	3.5. HSMP LSP Label Withdraw . . . . . . . . . . . . . . . . . 10		3.5. HSMP LSP Label Withdraw . . . . . . . . . . . . . . . . . 10
	3.5.1. HSMP Leaf Operation . . . . . . . . . . . . . . . . . 10		3.5.1. HSMP Leaf Operation . . . . . . . . . . . . . . . . . 10
	3.5.2. HSMP Transit Node Operation . . . . . . . . . . . . . 10		3.5.2. HSMP Transit Node Operation . . . . . . . . . . . . . 10
	skipping to change at page 4, line 47		skipping to change at page 4, line 47
	MP2MP LSP: multipoint-to-multipoint Label Switched Path. An LSP		MP2MP LSP: multipoint-to-multipoint Label Switched Path. An LSP
	that connects a set of nodes, such that traffic sent by any node		that connects a set of nodes, such that traffic sent by any node
	in the LSP is delivered to all others.		in the LSP is delivered to all others.
	HSMP LSP: hub & spoke multipoint Label Switched Path. An LSP that		HSMP LSP: hub & spoke multipoint Label Switched Path. An LSP that
	has one root node and one or more leaf nodes, allows traffic from		has one root node and one or more leaf nodes, allows traffic from
	root to all leaf nodes along downstream P2MP LSP and also leaf to		root to all leaf nodes along downstream P2MP LSP and also leaf to
	root node along the upstream unicast LSP.		root node along the upstream unicast LSP.
			FEC: Forwarding Equivalence Class
	3. Setting up HSMP LSP with LDP		3. Setting up HSMP LSP with LDP
	HSMP LSP is similar to MP2MP LSP described in [RFC6388], with the		HSMP LSP is similar to MP2MP LSP described in [RFC6388], with the
	difference that, when the leaf LSRs send traffic on the LSP, the		difference that, when the leaf LSRs send traffic on the LSP, the
	traffic is first delivered only to the root node and follows the		traffic is first delivered only to the root node and follows the
	upstream path from the leaf node to the root node. The root node		upstream path from the leaf node to the root node. The root node
	then distributes the traffic on the P2MP tree to all of the leaf		then distributes the traffic on the P2MP tree to all of the leaf
	nodes.		nodes.
	HSMP LSP consists of a downstream path and upstream path. The		HSMP LSP consists of a downstream path and upstream path. The
	skipping to change at page 6, line 15		skipping to change at page 6, line 19
	F-bit: Forward unknown TLV bit, as described in [RFC5036]. The value		F-bit: Forward unknown TLV bit, as described in [RFC5036]. The value
	of this bit MUST be 0 since a Capability Parameter TLV is sent only		of this bit MUST be 0 since a Capability Parameter TLV is sent only
	in Initialization and Capability messages, which are not forwarded.		in Initialization and Capability messages, which are not forwarded.
	The length SHOULD be 1, and the S bit and reserved bits are defined		The length SHOULD be 1, and the S bit and reserved bits are defined
	in [RFC5561] section 3.		in [RFC5561] section 3.
	The HSMP LSP Capability Parameter type is to be assigned by IANA.		The HSMP LSP Capability Parameter type is to be assigned by IANA.
	If the peer has not advertised the corresponding capability, then		If the peer has not advertised the corresponding capability, then
	label messages using the HSMP FEC Element SHOULD NOT be sent to the		label messages using the HSMP Forwarding Equivalence Class (FEC)
	peer. Since ordered mode is applied for HSMP LSP signalling, the		Element SHOULD NOT (as described in [RFC6388] section 2.1) be sent to
			the peer. Since ordered mode is applied for HSMP LSP signalling, the
	label message break would ensure that the initiating leaf node is		label message break would ensure that the initiating leaf node is
	unable to establish the upstream path to root node.		unable to establish the upstream path to root node.
	3.2. HSMP FEC Elements		3.2. HSMP FEC Elements
	Similar as MP2MP LSP, we define two new protocol entities, the HSMP		Similar as MP2MP LSP, we define two new protocol entities, the HSMP
	Downstream FEC Element and Upstream FEC Element. If a FEC TLV		Downstream FEC Element and Upstream FEC Element. If a FEC TLV
	contains one of the HSMP FEC Elements, the HSMP FEC Element MUST be		contains one of the HSMP FEC Elements, the HSMP FEC Element MUST be
	the only FEC Element in the FEC TLV. The structure, encoding and		the only FEC Element in the FEC TLV. The structure, encoding and
	error handling for the HSMP Downstream FEC Element and Upstream FEC		error handling for the HSMP Downstream FEC Element and Upstream FEC
End of changes. 7 change blocks.
	7 lines changed or deleted		10 lines changed or added
This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/