< draft-chen-bier-te-lan-00.txt		draft-chen-bier-te-lan-01.txt >
	Network Working Group H. Chen		Network Working Group H. Chen
	Internet-Draft M. McBride		Internet-Draft M. McBride
	Intended status: Standards Track Futurewei		Intended status: Standards Track Futurewei
	Expires: 25 April 2022 A. Wang		Expires: 17 May 2022 A. Wang
	China Telecom		China Telecom
	G. Mishra		G. Mishra
	Verizon Inc.		Verizon Inc.
	L. Liu		L. Liu
	Fujitsu		Fujitsu
	X. Liu		X. Liu
	Volta Networks		Volta Networks
	22 October 2021		13 November 2021
	BIER-TE for Broadcast Link		BIER-TE for Broadcast Link
	draft-chen-bier-te-lan-00		draft-chen-bier-te-lan-01
	Abstract		Abstract
	This document describes extensions to "Bit Index Explicit Replication		This document describes extensions to "Bit Index Explicit Replication
	Traffic Engineering" (BIER-TE) for supporting LANs (i.e., broadcast		Traffic Engineering" (BIER-TE) for supporting LANs (i.e., broadcast
	links). For a multicast packet with an explicit point-to-multipoint		links). For a multicast packet with an explicit point-to-multipoint
	(P2MP) path traversing LANs, the packet is replicated and forwarded		(P2MP) path traversing LANs, the packet is replicated and forwarded
	statelessly along the path.		statelessly along the path.
	Requirements Language		Requirements Language
	skipping to change at page 1, line 49 ¶		skipping to change at page 1, line 49 ¶
	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 25 April 2022.		This Internet-Draft will expire on 17 May 2022.
	Copyright Notice		Copyright Notice
	Copyright (c) 2021 IETF Trust and the persons identified as the		Copyright (c) 2021 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 (https://trustee.ietf.org/		Provisions Relating to IETF Documents (https://trustee.ietf.org/
	license-info) in effect on the date of publication of this document.		license-info) in effect on the date of publication of this document.
	Please review these documents carefully, as they describe your rights		Please review these documents carefully, as they describe your rights
	skipping to change at page 2, line 29 ¶		skipping to change at page 2, line 29 ¶
	Table of Contents		Table of Contents
	1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2		1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
	1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3		1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3
	2. Example Application of Current BIER-TE with LAN . . . . . . . 4		2. Example Application of Current BIER-TE with LAN . . . . . . . 4
	2.1. Example BIER-TE Topology with LAN . . . . . . . . . . . . 4		2.1. Example BIER-TE Topology with LAN . . . . . . . . . . . . 4
	2.2. BIER-TE BIFT on BFR . . . . . . . . . . . . . . . . . . . 5		2.2. BIER-TE BIFT on BFR . . . . . . . . . . . . . . . . . . . 5
	2.3. Example P2MP Path with LAN . . . . . . . . . . . . . . . 10		2.3. Example P2MP Path with LAN . . . . . . . . . . . . . . . 10
	3. Improved BIER-TE with LAN . . . . . . . . . . . . . . . . . . 11		3. Improved BIER-TE with LAN . . . . . . . . . . . . . . . . . . 11
	3.1. New BP Assignments for LAN . . . . . . . . . . . . . . . 11		3.1. New BP Assignments for LAN . . . . . . . . . . . . . . . 11
	3.2. Improved BIER-TE BIFT on BFR . . . . . . . . . . . . . . 12		3.2. Improved BIER-TE BIFT on BFR . . . . . . . . . . . . . . 13
	3.3. Updated Forwarding Procedure . . . . . . . . . . . . . . 16		3.3. Updated Forwarding Procedure . . . . . . . . . . . . . . 17
	4. Example Application of Improved BIER-TE . . . . . . . . . . . 17		4. Example Application of Improved BIER-TE . . . . . . . . . . . 18
	5. Security Considerations . . . . . . . . . . . . . . . . . . . 18		5. Security Considerations . . . . . . . . . . . . . . . . . . . 19
	6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 18		6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 20
	7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 18		7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 20
	8. References . . . . . . . . . . . . . . . . . . . . . . . . . 19		8. References . . . . . . . . . . . . . . . . . . . . . . . . . 20
	8.1. Normative References . . . . . . . . . . . . . . . . . . 19		8.1. Normative References . . . . . . . . . . . . . . . . . . 20
	8.2. Informative References . . . . . . . . . . . . . . . . . 20		8.2. Informative References . . . . . . . . . . . . . . . . . 21
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 21		Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 22
	1. Introduction		1. Introduction
	[I-D.ietf-bier-te-arch] introduces Bit Index Explicit Replication		[I-D.ietf-bier-te-arch] introduces Bit Index Explicit Replication
	(BIER) Traffic/Tree Engineering (BIER-TE). It is an architecture for		(BIER) Traffic/Tree Engineering (BIER-TE). It is an architecture for
	per-packet stateless explicit point to multipoint (P2MP) multicast		per-packet stateless explicit point to multipoint (P2MP) multicast
	path/tree. A Bit-Forwarding Router (BFR) in a BIER-TE domain has a		path/tree. A Bit-Forwarding Router (BFR) in a BIER-TE domain has a
	BIER-TE Bit Index Forwarding Table (BIFT). A BIER-TE BIFT on a BFR		BIER-TE Bit Index Forwarding Table (BIFT). A BIER-TE BIFT on a BFR
	comprises a forwarding entry for a BitPosition (BP) assigned to each		comprises a forwarding entry for a BitPosition (BP) assigned to each
	of the adjacencies of the BFR. If the BP represents a forward		of the adjacencies of the BFR. If the BP represents a forward
	skipping to change at page 4, line 18 ¶		skipping to change at page 4, line 18 ¶
	2. Example Application of Current BIER-TE with LAN		2. Example Application of Current BIER-TE with LAN
	This section illustrates an example application of the current BIER-		This section illustrates an example application of the current BIER-
	TE defined in [I-D.ietf-bier-te-arch] to the BIER-TE topology with		TE defined in [I-D.ietf-bier-te-arch] to the BIER-TE topology with
	LAN in Figure 1.		LAN in Figure 1.
	2.1. Example BIER-TE Topology with LAN		2.1. Example BIER-TE Topology with LAN
	An example BIER-TE topology with a LAN for a BIER-TE domain is shown		An example BIER-TE topology with a LAN for a BIER-TE domain is shown
	in Figure 1. It has 8 nodes/BFRs A, B, C, D, E, F, G and H. Nodes/		in Figure 1. It has 9 nodes/BFRs A, B, C, D, E, F, G, H and K.
	BFRs D, F, E, H and A are BFERs and have local decap adjacency		Nodes/BFRs D, F, E, H, A and K are BFERs and have local decap
	BitPositions (BPs for short) 1, 2, 3, 4, and 5 respectively. For		adjacency BitPositions (BPs for short) 1, 2, 3, 4, 5 and 6
	simplicity, these BPs are represented by (SI:BitString), where SI = 0		respectively. For simplicity, these BPs are represented by
	and BitString is of 8 bits. BPs 1, 2, 3, 4, and 5 are represented by		(SI:BitString), where SI = 0 and BitString is of 8 bits. BPs 1, 2,
	1 (0:00000001), 2 (0:00000010), 3 (0:00000100), 4 (0:00001000) and 5		3, 4, 5 and 6 are represented by 1 (0:00000001), 2 (0:00000010), 3
	(0:00010000) respectively.		(0:00000100), 4 (0:00001000), 5 (0:00010000) and 6 (0:00100000)
			respectively.
	4' | 4		6
			( K )
			/14'
			/
			4' /13' | 4
	/-----------( G )--------+ ( H )		/-----------( G )--------+ ( H )
	/ 14' |________/		/ 16' |________/
	/ | 15'		/ | 17'
	/3' _________|		/3' _________|
	1' 2' / 6' /13' | 16'		1' 2' / 6' /15' | 18'
	( A )------------( B )--------------( C ) +--------( D )		( A )------------( B )--------------( C ) +--------( D )
	5 7'\ 5' \11' | 1		5 7'\ 5' \11' | 1
	\ \ LAN		\ \ LAN
	\ \		\ \
	\8' 10' \12'		\8' 10' \12'
	( E )--------------( F )		( E )--------------( F )
	3 9' 2		3 9' 2
	Figure 1: Example BIER-TE Topology with BP to BFR on LAN		Figure 1: Example BIER-TE Topology with BP to BFR on LAN
	The BitPositions for the forward connected adjacencies are		The BitPositions for the forward connected adjacencies are
	represented by i', where i is from 1 to 16. In one option, they are		represented by i', where i is from 1 to 18. In one option, they are
	encoded as (n+i), where n is a power of 2 such as 32768. For		encoded as (n+i), where n is a power of 2 such as 32768. For
	simplicity, these BitPositions are represented by (SI:BitString),		simplicity, these BitPositions are represented by (SI:BitString),
	where SI = (6 + (i-1)/8) and BitString is of 8 bits. BitPositions i'		where SI = (6 + (i-1)/8) and BitString is of 8 bits. BitPositions i'
	(i from 1 to 16) are represented by 1'(6:00000001), 2'(6:00000010),		(i from 1 to 18) are represented by 1'(6:00000001), 2'(6:00000010),
	3'(6:00000100), 4'(6:00001000), 5'(6:00010000), 6'(6:00100000),		3'(6:00000100), 4'(6:00001000), 5'(6:00010000), 6'(6:00100000),
	7'(6:01000000), 8'(6:10000000), 9'(7:00000001), 10'(7:00000010), . .		7'(6:01000000), 8'(6:10000000), 9'(7:00000001), 10'(7:00000010), . .
	. , 16'(7:10000000).		. , 16'(7:10000000), 17'(8:00000001), 18'(8:00000010).
	For a link between two nodes X and Y, there are two BitPositions for		For a link between two nodes X and Y, there are two BitPositions for
	two forward connected adjacencies. These two forward connected		two forward connected adjacencies. These two forward connected
	adjacency BitPositions are assigned on nodes X and Y respectively.		adjacency BitPositions are assigned on nodes X and Y respectively.
	The BitPosition assigned on X is the forward connected adjacency of		The BitPosition assigned on X is the forward connected adjacency of
	Y. The BitPosition assigned on Y is the forward connected adjacency		Y. The BitPosition assigned on Y is the forward connected adjacency
	of X.		of X.
	For example, for the link between nodes B and C in the figure, two		For example, for the link between nodes B and C in the figure, two
	forward connected adjacency BitPositions 5' and 6' are assigned to		forward connected adjacency BitPositions 5' and 6' are assigned to
	skipping to change at page 5, line 25 ¶		skipping to change at page 5, line 29 ¶
	end of the link. It is the forward connected adjacency of node C.		end of the link. It is the forward connected adjacency of node C.
	BitPosition 6' is assigned on node C to C's end of the link. It is		BitPosition 6' is assigned on node C to C's end of the link. It is
	the forward connected adjacency of node B.		the forward connected adjacency of node B.
	For a LAN (i.e., broadcast link) connecting nodes X1, X2, ..., Xm,		For a LAN (i.e., broadcast link) connecting nodes X1, X2, ..., Xm,
	there are m BitPositions for m forward connected adjacencies. These		there are m BitPositions for m forward connected adjacencies. These
	m forward connected adjacency BitPositions are assigned on nodes X1,		m forward connected adjacency BitPositions are assigned on nodes X1,
	X2, ..., Xm respectively.		X2, ..., Xm respectively.
	For the LAN connecting 4 nodes C, G, H and D in the figure, 4 forward		For the LAN connecting 4 nodes C, G, H and D in the figure, 4 forward
	connected adjacency BitPositions 13', 14', 15' and 16' are assigned		connected adjacency BitPositions 15', 16', 17' and 18' are assigned
	to C, G, H and D respectively.		to C, G, H and D respectively.
	2.2. BIER-TE BIFT on BFR		2.2. BIER-TE BIFT on BFR
	Every BFR in a BIER-TE domain/topology has a BIER-TE BIFT. This		Every BFR in a BIER-TE domain/topology has a BIER-TE BIFT. This
	section shows the BIER-TE BIFT on every BFR/node of the BIER-TE		section shows the BIER-TE BIFT on every BFR/node of the BIER-TE
	topology with LAN in Figure 1.		topology with LAN in Figure 1.
	For the BIER-TE topology in Figure 1, each of 8 nodes/BFRs A, B, C,		For the BIER-TE topology in Figure 1, each of 9 nodes/BFRs A, B, C,
	D, E, F, G and H has its BIER-TE BIFT for the topology. The BIFT on		D, E, F, G, H and K has its BIER-TE BIFT for the topology. The BIFT
	a BFR comprises a forwarding entry for each of the adjacencies of the		on a BFR comprises a forwarding entry for each of the adjacencies of
	BFR.		the BFR.
	The BIER-TE BIFT on BFR A (i.e., node A) is shown in Figure 2. There		The BIER-TE BIFT on BFR A (i.e., node A) is shown in Figure 2. There
	are two adjacencies of A. One is the forward connected adjacency		are two adjacencies of A. One is the forward connected adjacency
	from A to B (represented by BP 2'); the other is the local decap		from A to B (represented by BP 2'); the other is the local decap
	adjacency (represented by BP 5) for BFER (i.e., egress) A. The BIFT		adjacency (represented by BP 5) for BFER (i.e., egress) A. The BIFT
	on A has two forwarding entries.		on A has two forwarding entries.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	skipping to change at page 7, line 45 ¶		skipping to change at page 7, line 45 ¶
	adjacencies.		adjacencies.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 5'(6:00010000) | fw-connected | B |		| 5'(6:00010000) | fw-connected | B |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 12'(7:00001000) | fw-connected | F |		| 12'(7:00001000) | fw-connected | F |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 14'(7:00100000) | fw-connected | G |		| 16'(7:10000000) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 15'(7:01000000) | fw-connected | H |		| 17'(8:00000001) | fw-connected | H |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 16'(7:10000000) | fw-connected | D |		| 18'(8:00000010) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 4: BIER-TE BIFT on BFR C		Figure 4: BIER-TE BIFT on BFR C
	The BIER-TE BIFT on BFR D (i.e., node D) is shown in Figure 5. There		The BIER-TE BIFT on BFR D (i.e., node D) is shown in Figure 5. There
	are four adjacencies of D. Three of them are the forward connected		are four adjacencies of D. Three of them are the forward connected
	adjacencies from D to C (represented by BP 13'), D to G (represented		adjacencies from D to C (represented by BP 13'), D to G (represented
	by BP 14') and D to H (represented by BP 15') respectively; the other		by BP 14') and D to H (represented by BP 15') respectively; the other
	is the local decap adjacency (represented by BP 1) for BFER (i.e.,		is the local decap adjacency (represented by BP 1) for BFER (i.e.,
	egress) D. The BIFT on D has four forwarding entries for these		egress) D. The BIFT on D has four forwarding entries for these
	adjacencies.		adjacencies.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 13'(7:00010000) | fw-connected | C |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 14'(7:00100000) | fw-connected | G |		| 16'(7:10000000) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 15'(7:01000000) | fw-connected | H |		| 17'(8:00000001) | fw-connected | H |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 1 (0:00000001) | local-decap | |		| 1 (0:00000001) | local-decap | |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 5: BIER-TE BIFT on BFR D		Figure 5: BIER-TE BIFT on BFR D
	The BIER-TE BIFT on BFR E (i.e., node E) is shown in Figure 6. There		The BIER-TE BIFT on BFR E (i.e., node E) is shown in Figure 6. There
	are three adjacencies of E. Two of them are the forward connected		are three adjacencies of E. Two of them are the forward connected
	adjacencies from E to B (represented by BP 7') and E to F		adjacencies from E to B (represented by BP 7') and E to F
	(represented by BP 10') respectively; the other is the local decap		(represented by BP 10') respectively; the other is the local decap
	skipping to change at page 9, line 38 ¶		skipping to change at page 9, line 38 ¶
	by BP 13'), G to H (represented by BP 15') and G to D (represented by		by BP 13'), G to H (represented by BP 15') and G to D (represented by
	BP 16') respectively. The BIFT on G has four forwarding entries for		BP 16') respectively. The BIFT on G has four forwarding entries for
	these adjacencies.		these adjacencies.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 3'(6:00000100) | fw-connected | B |		| 3'(6:00000100) | fw-connected | B |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 13'(7:00010000) | fw-connected | C |		| 14'(7:00100000) | fw-connected | K |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 15'(7:01000000) | fw-connected | H |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 16'(7:10000000) | fw-connected | D |		| 17'(8:00000001) | fw-connected | H |
			+-----------------+--------------+------------+
			| 18'(8:00000010) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 8: BIER-TE BIFT on BFR G		Figure 8: BIER-TE BIFT on BFR G
	The BIER-TE BIFT on BFR H (i.e., node H) is shown in Figure 9. There		The BIER-TE BIFT on BFR H (i.e., node H) is shown in Figure 9. There
	are four adjacencies of H. Three of them are the forward connected		are four adjacencies of H. Three of them are the forward connected
	adjacencies from H to C (represented by BP 13'), H to G (represented		adjacencies from H to C (represented by BP 13'), H to G (represented
	by BP 14') and H to D (represented by BP 16') respectively; the other		by BP 14') and H to D (represented by BP 16') respectively; the other
	is the local decap adjacency (represented by BP 4) for BFER (i.e.,		is the local decap adjacency (represented by BP 4) for BFER (i.e.,
	egress) H. The BIFT on H has four forwarding entries for these		egress) H. The BIFT on H has four forwarding entries for these
	adjacencies.		adjacencies.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 13'(7:00010000) | fw-connected | C |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 14'(7:00100000) | fw-connected | G |		| 16'(7:10000000) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 16'(7:10000000) | fw-connected | D |		| 18'(8:00000010) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 4 (0:00001000) | local-decap | |		| 4 (0:00001000) | local-decap | |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 9: BIER-TE BIFT on BFR H		Figure 9: BIER-TE BIFT on BFR H
	2.3. Example P2MP Path with LAN		2.3. Example P2MP Path with LAN
	This section presents the forwarding behaviors along an explicit P2MP		This section presents the forwarding behaviors along an explicit P2MP
	path in Figure 1 going through the LAN in the figure.		path in Figure 1 going through the LAN in the figure. The path is
			from BFIR A to BFERs K, H and F
	The explicit P2MP path traverses the link/adjacency from A to B		The explicit P2MP path traverses the link/adjacency from A to B
	(indicated by BP 2'), the link/adjacency from B to G (indicated by BP		(indicated by BP 2'), the link/adjacency from B to G (indicated by BP
	4') and the link/adjacency from B to C (indicated by BP 6'), the		4') and the link/adjacency from B to C (indicated by BP 6'), the
	link/adjacency from G to H (indicated by BP 15'), and the link/		link/adjacency from G to K (indicated by BP 14'), the link/adjacency
	adjacency from C to F (indicated by BP 12'). This path is		from G to H (indicated by BP 17'), and the link/adjacency from C to F
	represented by {2', 4', 6', 12', 15', 2, 4}. The packet at A has		(indicated by BP 12'). This path is represented by {2', 4', 6', 12',
	this path.		14', 17', 2, 4, 6}. The packet at A has this path.
	For the packet with the P2MP path, A forwards the packet to B		For the packet with the P2MP path, A forwards the packet to B
	according to the forwarding entry for BP 2' in its BIFT.		according to the forwarding entry for BP 2' in its BIFT.
	After receiving the packet from A, B forwards the packet to G and C		After receiving the packet from A, B forwards the packet to G and C
	according to the forwarding entries for BPs 4' and 6' in B's BIFT		according to the forwarding entries for BPs 4' and 6' in B's BIFT
	respectively. The packet received by G has path {12', 15', 2, 4}.		respectively. The packet received by G has path {12', 14', 17', 2,
	The packet received by C has path {12', 15', 2, 4}.		4, 6}. The packet received by C has path {12', 14', 17', 2, 4, 6}.
	After receiving the packet from B, G sends the packet to H according		After receiving the packet from B, G sends a copy of the packet to K
	to the forwarding entry for BP 15' in G's BIFT.		according to the forwarding entry for BP 14' in G's BIFT, and another
			copy of the packet to H according to the forwarding entry for BP 17'
			in G's BIFT.
	After receiving the packet from B, C copies and sends the packet to H		After receiving the packet from B, C copies and sends the packet to H
	and F according to the forwarding entries for BPs 15' and 12' in C's		and F according to the forwarding entries for BPs 17' and 12' in C's
	BIFT respectively.		BIFT respectively.
	Egress node H of the P2MP path receives the duplicated packets. One		Egress node H of the P2MP path receives the duplicated packets. One
	packet is from G, and the same copy is from C.		packet is from G, and the same copy is from C.
	The solution proposed for LANs in this document resolve this issue.		The solution proposed for LANs in this document resolve this issue.
	For a packet with an explicit P2MP path traversing LANs (i.e.,		For a packet with an explicit P2MP path traversing LANs (i.e.,
	broadcast links), the packet is replicated and forwarded statelessly		broadcast links), the packet is replicated and forwarded statelessly
	along the path. Each of the egress nodes of the path will not		along the path. Each of the egress nodes of the path will not
	receive any duplicated packet.		receive any duplicated packet.
	skipping to change at page 11, line 37 ¶		skipping to change at page 12, line 5 ¶
	adjacency from the pseudo node to the BFR.		adjacency from the pseudo node to the BFR.
	The adjacency from a BFR to the pseudo node is called a LAN		The adjacency from a BFR to the pseudo node is called a LAN
	adjacency. The adjacency from the pseudo node to a BFR is a forward		adjacency. The adjacency from the pseudo node to a BFR is a forward
	connected adjacency.		connected adjacency.
	For example, suppose that the pseudo node for the LAN in Figure 1 is		For example, suppose that the pseudo node for the LAN in Figure 1 is
	Px. The BP assignments for the LAN (i.e., connections between Px and		Px. The BP assignments for the LAN (i.e., connections between Px and
	BFRs C, G, H and D) are illustrated in Figure 10.		BFRs C, G, H and D) are illustrated in Figure 10.
	4' 4		6
			( K )
			/14'
			/
			4' /13' | 4
	/-----------( G )---------+ ( H )		/-----------( G )---------+ ( H )
	/ 15' | ________/		/ 17' | ________/
	/ 16'| /18' 17'		/ 18'| /20' 19'
	/3' _________ Px		/3' _________ Px
	1' 2' / 6' /13' 14' |20' 19'		1' 2' / 6' /15' 16' |22' 21'
	( A )------------( B )--------------( C ) +---------( D )		( A )------------( B )--------------( C ) +---------( D )
	5 7'\ 5' \11' 1		5 7'\ 5' \11' 1
	\ \		\ \
	\ \		\ \
	\8' 10' \12'		\8' 10' \12'
	( E )--------------( F )		( E )--------------( F )
	3 9' 2		3 9' 2
	Figure 10: Example BIER-TE Topology with BPs for LAN		Figure 10: Example BIER-TE Topology with BPs for LAN
	The connection/adjacency from Px to C is assigned BP 13', and the		The connection/adjacency from Px to C is assigned BP 15', and the
	connection/adjacency from C to Px is assigned BP 14'.		connection/adjacency from C to Px is assigned BP 16'.
	The connection/adjacency from Px to G is assigned BP 15', and the		The connection/adjacency from Px to G is assigned BP 17', and the
	connection/adjacency from G to Px is assigned BP 16'.		connection/adjacency from G to Px is assigned BP 18'.
	The connection/adjacency from Px to H is assigned BP 17', and the		The connection/adjacency from Px to H is assigned BP 19', and the
	connection/adjacency from H to Px is assigned BP 18'.		connection/adjacency from H to Px is assigned BP 20'.
	The connection/adjacency from Px to D is assigned BP 19', and the		The connection/adjacency from Px to D is assigned BP 21', and the
	connection/adjacency from D to Px is assigned BP 20'.		connection/adjacency from D to Px is assigned BP 22'.
	In an alternative, all the nodes/BFRs attached to a LAN are assumed		In an alternative, all the nodes/BFRs attached to a LAN are assumed
	fully connected each other (i.e., they are fully meshed). For a		fully connected each other (i.e., they are fully meshed). For a
	connection between any two BFRs on the LAN, two forward connected		connection between any two BFRs on the LAN, two forward connected
	adjacencies are assigned to the two ends of the connection.		adjacencies are assigned to the two ends of the connection.
	For example, there are four BFRs C, G, H and D attached to the LAN in		For example, there are four BFRs C, G, H and D attached to the LAN in
	Figure 1. There are six connections among these four BFRs. They are		Figure 1. There are six connections among these four BFRs. They are
	connections between C and G, C and H, C and D, G and H, G and D, H		connections between C and G, C and H, C and D, G and H, G and D, H
	and D. Twelve BPs are needed for these six connections.		and D. Twelve BPs are needed for these six connections.
	skipping to change at page 13, line 7 ¶		skipping to change at page 13, line 25 ¶
	For a BFR attached to a LAN, suppose that the pseudo node for the LAN		For a BFR attached to a LAN, suppose that the pseudo node for the LAN
	is Px. The improved BIER-TE BIFT on the BFR comprises a forwarding		is Px. The improved BIER-TE BIFT on the BFR comprises a forwarding
	entry for the LAN adjacency from the BFR to Px and a secondary BIFT		entry for the LAN adjacency from the BFR to Px and a secondary BIFT
	for Px. The secondary BIFT for Px on the BFR contains a forwarding		for Px. The secondary BIFT for Px on the BFR contains a forwarding
	entry for each of the forward connected adjacencies from Px to the		entry for each of the forward connected adjacencies from Px to the
	BFRs attached to the LAN except for the adjacency from Px to the BFR.		BFRs attached to the LAN except for the adjacency from Px to the BFR.
	For example, the improved BIER-TE BIFT on BFR C is illustrated in		For example, the improved BIER-TE BIFT on BFR C is illustrated in
	Figure 11. It comprises the forwarding entry for the LAN adjacency		Figure 11. It comprises the forwarding entry for the LAN adjacency
	from C to Px (indicated by BP 14') and the secondary BIFT for Px on		from C to Px (indicated by BP 16') and the secondary BIFT for Px on
	BFR C. The secondary BIFT contains three forwarding entries for		BFR C. The secondary BIFT contains three forwarding entries for
	three forward connected adjacencies from Px to G (indicated by 15'),		three forward connected adjacencies from Px to G (indicated by 17'),
	Px to H (indicated by 17') and Px to D (indicated by 19')		Px to H (indicated by 19') and Px to D (indicated by 21')
	respectively.		respectively.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 15'(7:01000000) | fw-connected | G |		| 17'(8:00000001) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 17'(8:00000001) | fw-connected | H |		| 19'(8:00000100) | fw-connected | H |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 19'(8:00000100) | fw-connected | D |		| 21'(8:00010000) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Secondary BIFT for Px on BFR C		Secondary BIFT for Px on BFR C
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 5'(6:00010000) | fw-connected | B |		| 5'(6:00010000) | fw-connected | B |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 12'(7:00001000) | fw-connected | F |		| 12'(7:00001000) | fw-connected | F |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 14'(7:00100000) |lan-connected | Px |		| 16'(7:10000000) |lan-connected | Px |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 11: Improved BIER-TE BIFT on BFR C		Figure 11: Improved BIER-TE BIFT on BFR C
	The improved BIER-TE BIFT on BFR G is illustrated in Figure 12. It		The improved BIER-TE BIFT on BFR G is illustrated in Figure 12. It
	comprises the forwarding entry for the LAN adjacency from G to Px		comprises the forwarding entry for the LAN adjacency from G to Px
	(indicated by BP 16') and the secondary BIFT for Px on BFR G. The		(indicated by BP 18') and the secondary BIFT for Px on BFR G. The
	secondary BIFT contains three forwarding entries for three forward		secondary BIFT contains three forwarding entries for three forward
	connected adjacencies from Px to C (indicated by 13'), Px to H		connected adjacencies from Px to C (indicated by 15'), Px to H
	(indicated by 17') and Px to D (indicated by 19') respectively.		(indicated by 19') and Px to D (indicated by 21') respectively.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 13'(7:00010000) | fw-connected | C |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 17'(8:00000001) | fw-connected | H |		| 19'(8:00000100) | fw-connected | H |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 19'(8:00000100) | fw-connected | D |		| 21'(8:00010000) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Secondary BIFT for Px on BFR G		Secondary BIFT for Px on BFR G
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 3'(6:00000100) | fw-connected | B |		| 3'(6:00000100) | fw-connected | B |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 16'(7:00100000) |lan-connected | Px |		| 14'(7:00100000) | fw-connected | K |
			+-----------------+--------------+------------+
			| 18'(8:00000010) |lan-connected | Px |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 12: Improved BIER-TE BIFT on BFR G		Figure 12: Improved BIER-TE BIFT on BFR G
	The improved BIER-TE BIFT on BFR H is illustrated in Figure 13. It		The improved BIER-TE BIFT on BFR H is illustrated in Figure 13. It
	comprises the forwarding entry for the LAN adjacency from H to Px		comprises the forwarding entry for the LAN adjacency from H to Px
	(indicated by BP 18') and the secondary BIFT for Px on BFR H. The		(indicated by BP 20') and the secondary BIFT for Px on BFR H. The
	secondary BIFT contains three forwarding entries for three forward		secondary BIFT contains three forwarding entries for three forward
	connected adjacencies from Px to C (indicated by 13'), Px to G		connected adjacencies from Px to C (indicated by 15'), Px to G
	(indicated by 15') and Px to D (indicated by 19') respectively.		(indicated by 17') and Px to D (indicated by 21') respectively.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 13'(7:00010000) | fw-connected | C |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 15'(7:01000000) | fw-connected | G |		| 17'(8:00000001) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 19'(8:00000100) | fw-connected | D |		| 21'(8:00010000) | fw-connected | D |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Secondary BIFT for Px on BFR H		Secondary BIFT for Px on BFR H
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 4 (0:00001000) | local-decap | |		| 4 (0:00001000) | local-decap | |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 18'(8:00000010) |lan-connected | Px |		| 20'(8:00001000) |lan-connected | Px |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 13: Improved BIER-TE BIFT on BFR H		Figure 13: Improved BIER-TE BIFT on BFR H
	The improved BIER-TE BIFT on BFR D is illustrated in Figure 14. It		The improved BIER-TE BIFT on BFR D is illustrated in Figure 14. It
	comprises the forwarding entry for the LAN adjacency from D to Px		comprises the forwarding entry for the LAN adjacency from D to Px
	(indicated by BP 20') and the secondary BIFT for Px on BFR D. The		(indicated by BP 22') and the secondary BIFT for Px on BFR D. The
	secondary BIFT contains three forwarding entries for three forward		secondary BIFT contains three forwarding entries for three forward
	connected adjacencies from Px to C (indicated by 13'), Px to G		connected adjacencies from Px to C (indicated by 15'), Px to G
	(indicated by 15') and Px to H (indicated by 17') respectively.		(indicated by 17') and Px to H (indicated by 19') respectively.
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 13'(7:00010000) | fw-connected | C |		| 15'(7:01000000) | fw-connected | C |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 15'(7:01000000) | fw-connected | G |		| 17'(8:00000001) | fw-connected | G |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 17'(8:00000001) | fw-connected | H |		| 19'(8:00000100) | fw-connected | H |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Secondary BIFT for Px on BFR D		Secondary BIFT for Px on BFR D
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| Adjacency BP | Action | BFR-NBR |		| Adjacency BP | Action | BFR-NBR |
	| (SI:BitString) | | (Next Hop) |		| (SI:BitString) | | (Next Hop) |
	+=================+==============+============+		+=================+==============+============+
	| 1 (0:00000001) | local-decap | |		| 1 (0:00000001) | local-decap | |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	| 20'(8:00000001) |lan-connected | Px |		| 22'(8:00000100) |lan-connected | Px |
	+-----------------+--------------+------------+		+-----------------+--------------+------------+
	Figure 14: Improved BIER-TE BIFT on BFR D		Figure 14: Improved BIER-TE BIFT on BFR D
	3.3. Updated Forwarding Procedure		3.3. Updated Forwarding Procedure
	The forwarding procedure defined in [I-D.ietf-bier-te-arch] is		The forwarding procedure defined in [I-D.ietf-bier-te-arch] is
	updated/enhanced for using an improved BIER-TE BIFT to support BIER-		updated/enhanced for using an improved BIER-TE BIFT to support BIER-
	TE with LAN.		TE with LAN.
	skipping to change at page 17, line 51 ¶		skipping to change at page 18, line 51 ¶
	to Figure 1. It shows the forwarding behaviors along an explicit		to Figure 1. It shows the forwarding behaviors along an explicit
	P2MP path in Figure 10 going through the LAN in the figure.		P2MP path in Figure 10 going through the LAN in the figure.
	The new BP assignments for the LAN in Figure 1 is shown in Figure 10.		The new BP assignments for the LAN in Figure 1 is shown in Figure 10.
	The improved BIER-TE BIFT on each of the BFRs attached to the LAN is		The improved BIER-TE BIFT on each of the BFRs attached to the LAN is
	given in Section 3.2.		given in Section 3.2.
	The explicit P2MP path traverses the link/adjacency from A to B		The explicit P2MP path traverses the link/adjacency from A to B
	(indicated by BP 2'), the link/adjacency from B to G (indicated by BP		(indicated by BP 2'), the link/adjacency from B to G (indicated by BP
	4') and the link/adjacency from B to C (indicated by BP 6'), the		4') and the link/adjacency from B to C (indicated by BP 6'), the
	link/adjacency from G to Px (indicated by BP 16'), the link/adjacency		link/adjacency from G to K (indicated by BP 14'), the link/adjacency
	from C to F (indicated by BP 12'), and the link/adjacency from Px to		from G to Px (indicated by BP 18'), the link/adjacency from C to F
	H (indicated by BP 17'). This path is represented by {2', 4', 6',		(indicated by BP 12'), and the link/adjacency from Px to H (indicated
	12', 16', 17', 2, 4}. The packet at A has this path.		by BP 19'). This path is represented by {2', 4', 6', 12', 14', 18',
			19', 2, 4, 6}. The packet at A has this path.
	For the packet with the P2MP path, A forwards the packet to B		For the packet with the P2MP path, A forwards the packet to B
	according to the forwarding entry for BP 2' in its BIFT.		according to the forwarding entry for BP 2' in its BIFT.
	After receiving the packet from A, B forwards the packet to G and C		After receiving the packet from A, B forwards the packet to G and C
	according to the forwarding entries for BPs 4' and 6' in B's BIFT		according to the forwarding entries for BPs 4' and 6' in B's BIFT
	respectively. The packet received by G has path {12', 16', 17', 2,		respectively. The packet received by G has path {12', 14', 18', 19',
	4}. The packet received by C has path {12', 16', 17', 2, 4}.		2, 4, 6}. The packet received by C has path {12', 14', 18', 19', 2,
			4, 6}.
	After receiving the packet from B, G "sends" the packet to Px		After receiving the packet from B, G sends a copy of the packet to K
	according to the forwarding entry for BP 16' in G's improved BIER-TE		according to the forwarding entry for BP 14' in G's improved BIER-TE
	BIFT. After receiving the packet from G, which has path {12', 17',		BIFT and "sends" another copy of the packet to Px according to the
	2, 4}, Px "sends" the packet to H according to the forwarding entry		forwarding entry for BP 18' in G's improved BIER-TE BIFT. After
	for BP 17' in the secondary BIFT for Px (a part of G's improved BIER-		receiving the packet from G, which has path {12', 19', 2, 4, 6}, Px
	TE BIFT).		"sends" the packet to H according to the forwarding entry for BP 19'
			in the secondary BIFT for Px (a part of G's improved BIER-TE BIFT).
	After receiving the packet from G, which has path {12', 2, 4}, H		After receiving the packet from G, which has path {12', 19', 2, 4,
			6}, K decapsulates the packet and passes a copy of the payload of the
			packet to the packet's NextProto within node K according to the
			forwarding entry for BP 6 in K's BIFT.
			After receiving the packet from G, which has path {12', 2, 4, 6}, H
	decapsulates the packet and passes a copy of the payload of the		decapsulates the packet and passes a copy of the payload of the
	packet to the packet's NextProto within node H according to the		packet to the packet's NextProto within node H according to the
	forwarding entry for BP 4 in H's improved BIER-TE BIFT.		forwarding entry for BP 4 in H's improved BIER-TE BIFT.
	After receiving the packet from B, which has path {12', 16', 17', 2,		After receiving the packet from B, which has path {12', 14', 18',
	4}, C sends the packet to F according to the forwarding entry for BP		19', 2, 4, 6}, C sends the packet to F according to the forwarding
	12' in C's improved BIER-TE BIFT.		entry for BP 12' in C's improved BIER-TE BIFT.
	After receiving the packet from C, which has path {16', 17', 2, 4}, F		After receiving the packet from C, which has path {14', 18', 19', 2,
	decapsulates the packet and passes a copy of the payload of the		4, 6}, F decapsulates the packet and passes a copy of the payload of
	packet to the packet's NextProto within node F according to the		the packet to the packet's NextProto within node F according to the
	forwarding entry for BP 2 in F's BIER-TE BIFT.		forwarding entry for BP 2 in F's BIER-TE BIFT.
	Egress node H of the P2MP path does not receive any duplicated		Egress node H of the P2MP path does not receive any duplicated
	packet.		packet.
	5. Security Considerations		5. Security Considerations
	TBD.		TBD.
	6. IANA Considerations		6. IANA Considerations
End of changes. 68 change blocks.
	114 lines changed or deleted		138 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/