< draft-ietf-raw-technologies-01.txt		draft-ietf-raw-technologies-02.txt >
	RAW P. Thubert, Ed.		RAW P. Thubert, Ed.
	Internet-Draft Cisco Systems		Internet-Draft Cisco Systems
	Intended status: Informational D. Cavalcanti		Intended status: Informational D. Cavalcanti
	Expires: 23 August 2021 Intel		Expires: 9 December 2021 Intel
	X. Vilajosana		X. Vilajosana
	Universitat Oberta de Catalunya		Universitat Oberta de Catalunya
	C. Schmitt		C. Schmitt
	Research Institute CODE, UniBwM		Research Institute CODE, UniBwM
	J. Farkas		J. Farkas
	Ericsson		Ericsson
	19 February 2021		7 June 2021
	Reliable and Available Wireless Technologies		Reliable and Available Wireless Technologies
	draft-ietf-raw-technologies-01		draft-ietf-raw-technologies-02
	Abstract		Abstract
	This document presents a series of recent technologies that are		This document presents a series of recent technologies that are
	capable of time synchronization and scheduling of transmission,		capable of time synchronization and scheduling of transmission,
	making them suitable to carry time-sensitive flows with high		making them suitable to carry time-sensitive flows with high
	reliability and availability.		reliability and availability.
	Status of This Memo		Status of This Memo
	skipping to change at page 1, line 40 ¶		skipping to change at page 1, line 40 ¶
	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 23 August 2021.		This Internet-Draft will expire on 9 December 2021.
	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.
	skipping to change at page 2, line 34 ¶		skipping to change at page 2, line 34 ¶
	4.3.1. General Characteristics . . . . . . . . . . . . . . . 11		4.3.1. General Characteristics . . . . . . . . . . . . . . . 11
	4.3.2. Applicability to deterministic flows . . . . . . . . 11		4.3.2. Applicability to deterministic flows . . . . . . . . 11
	4.4. 802.11ad and 802.11ay (mmWave operation) . . . . . . . . 12		4.4. 802.11ad and 802.11ay (mmWave operation) . . . . . . . . 12
	4.4.1. General Characteristics . . . . . . . . . . . . . . . 13		4.4.1. General Characteristics . . . . . . . . . . . . . . . 13
	4.4.2. Applicability to deterministic flows . . . . . . . . 13		4.4.2. Applicability to deterministic flows . . . . . . . . 13
	5. IEEE 802.15.4 . . . . . . . . . . . . . . . . . . . . . . . . 13		5. IEEE 802.15.4 . . . . . . . . . . . . . . . . . . . . . . . . 13
	5.1. Provenance and Documents . . . . . . . . . . . . . . . . 13		5.1. Provenance and Documents . . . . . . . . . . . . . . . . 13
	5.2. TimeSlotted Channel Hopping . . . . . . . . . . . . . . . 15		5.2. TimeSlotted Channel Hopping . . . . . . . . . . . . . . . 15
	5.2.1. General Characteristics . . . . . . . . . . . . . . . 15		5.2.1. General Characteristics . . . . . . . . . . . . . . . 15
	5.2.2. Applicability to Deterministic Flows . . . . . . . . 17		5.2.2. Applicability to Deterministic Flows . . . . . . . . 17
	6. 5G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31		6. 5G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
	6.1. Provenance and Documents . . . . . . . . . . . . . . . . 31		6.1. Provenance and Documents . . . . . . . . . . . . . . . . 30
	6.2. General Characteristics . . . . . . . . . . . . . . . . . 33		6.2. General Characteristics . . . . . . . . . . . . . . . . . 32
	6.3. Deployment and Spectrum . . . . . . . . . . . . . . . . . 34		6.3. Deployment and Spectrum . . . . . . . . . . . . . . . . . 33
	6.4. Applicability to Deterministic Flows . . . . . . . . . . 35		6.4. Applicability to Deterministic Flows . . . . . . . . . . 34
	6.4.1. System Architecture . . . . . . . . . . . . . . . . . 35		6.4.1. System Architecture . . . . . . . . . . . . . . . . . 34
	6.4.2. Overview of The Radio Protocol Stack . . . . . . . . 37		6.4.2. Overview of The Radio Protocol Stack . . . . . . . . 36
	6.4.3. Radio (PHY) . . . . . . . . . . . . . . . . . . . . . 38		6.4.3. Radio (PHY) . . . . . . . . . . . . . . . . . . . . . 37
	6.4.4. Scheduling and QoS (MAC) . . . . . . . . . . . . . . 40		6.4.4. Scheduling and QoS (MAC) . . . . . . . . . . . . . . 39
	6.4.5. Time-Sensitive Networking (TSN) Integration . . . . . 42		6.4.5. Time-Sensitive Networking (TSN) Integration . . . . . 41
	6.5. Summary . . . . . . . . . . . . . . . . . . . . . . . . . 45		6.5. Summary . . . . . . . . . . . . . . . . . . . . . . . . . 45
	7. L-band Digital Aeronautical Communications System . . . . . . 46		7. L-band Digital Aeronautical Communications System . . . . . . 46
	7.1. Provenance and Documents . . . . . . . . . . . . . . . . 47		7.1. Provenance and Documents . . . . . . . . . . . . . . . . 47
	7.2. General Characteristics . . . . . . . . . . . . . . . . . 48		7.2. General Characteristics . . . . . . . . . . . . . . . . . 48
	7.3. Deployment and Spectrum . . . . . . . . . . . . . . . . . 49		7.3. Deployment and Spectrum . . . . . . . . . . . . . . . . . 49
	7.4. Applicability to Deterministic Flows . . . . . . . . . . 49		7.4. Applicability to Deterministic Flows . . . . . . . . . . 49
	7.4.1. System Architecture . . . . . . . . . . . . . . . . . 50		7.4.1. System Architecture . . . . . . . . . . . . . . . . . 50
	7.4.2. Overview of The Radio Protocol Stack . . . . . . . . 50		7.4.2. Overview of The Radio Protocol Stack . . . . . . . . 50
	7.4.3. Radio (PHY) . . . . . . . . . . . . . . . . . . . . . 51		7.4.3. Radio (PHY) . . . . . . . . . . . . . . . . . . . . . 51
	7.4.4. Scheduling, Frame Structure and QoS (MAC) . . . . . . 52		7.4.4. Scheduling, Frame Structure and QoS (MAC) . . . . . . 52
	skipping to change at page 4, line 23 ¶		skipping to change at page 4, line 23 ¶
	and retries. ARQ is a typical model at Layer-2 on a wireless		and retries. ARQ is a typical model at Layer-2 on a wireless
	medium. It is typically avoided end-to-end on deterministic flows		medium. It is typically avoided end-to-end on deterministic flows
	because it introduces excessive indetermination in latency, but a		because it introduces excessive indetermination in latency, but a
	limited number of retries within a bounded time may be used over a		limited number of retries within a bounded time may be used over a
	wireless link and yet respect end-to-end constraints.		wireless link and yet respect end-to-end constraints.
	Available: That is exempt of unscheduled outage, the expectation for		Available: That is exempt of unscheduled outage, the expectation for
	a network being that the flow is maintained in the face of any		a network being that the flow is maintained in the face of any
	single breakage.		single breakage.
			Deterministic Networking We refer to section 2 of [RFC8557] for this
			term.
	FEC: Forward error correction, sending redundant coded data to help		FEC: Forward error correction, sending redundant coded data to help
	the receiver recover transmission errors without the delays		the receiver recover transmission errors without the delays
	incurred with ARQ.		incurred with ARQ.
	HARQ: Hybrid ARQ, a combination of FEC and ARQ.		HARQ: Hybrid ARQ, a combination of FEC and ARQ.
	PCE: Path Computation Element.		PCE: Path Computation Element.
	PAREO (functions): the wireless extension of DetNet PREOF. PAREO		PAREO (functions): the wireless extension of DetNet PREOF. PAREO
	functions include scheduled ARQ at selected hops, and expect the		functions include scheduled ARQ at selected hops, and expect the
	skipping to change at page 14, line 28 ¶		skipping to change at page 14, line 28 ¶
	capabilities provided by TSCH. The group designed the essential		capabilities provided by TSCH. The group designed the essential
	mechanisms to enable the management plane operation while ensuring		mechanisms to enable the management plane operation while ensuring
	IPv6 is supported. Yet the charter did not focus to providing a		IPv6 is supported. Yet the charter did not focus to providing a
	solution to establish end to end Tracks while meeting quality of		solution to establish end to end Tracks while meeting quality of
	service requirements. 6TiSCH, through the RFC8480 [RFC8480] defines		service requirements. 6TiSCH, through the RFC8480 [RFC8480] defines
	the 6P protocol which provides a pairwise negotiation mechanism to		the 6P protocol which provides a pairwise negotiation mechanism to
	the control plane operation. The protocol supports agreement on a		the control plane operation. The protocol supports agreement on a
	schedule between neighbors, enabling distributed scheduling. 6P goes		schedule between neighbors, enabling distributed scheduling. 6P goes
	hand-in-hand with a Scheduling Function (SF), the policy that decides		hand-in-hand with a Scheduling Function (SF), the policy that decides
	how to maintain cells and trigger 6P transactions. The Minimal		how to maintain cells and trigger 6P transactions. The Minimal
	Scheduling Function (MSF) [I-D.ietf-6tisch-msf] is the default SF		Scheduling Function (MSF) [RFC9033] is the default SF defined by the
	defined by the 6TiSCH WG; other standardized SFs can be defined in		6TiSCH WG; other standardized SFs can be defined in the future. MSF
	the future. MSF extends the minimal schedule configuration, and is		extends the minimal schedule configuration, and is used to add child-
	used to add child-parent links according to the traffic load.		parent links according to the traffic load.
	Time sensitive networking on low power constrained wireless networks		Time sensitive networking on low power constrained wireless networks
	have been partially addressed by ISA100.11a [ISA100.11a] and		have been partially addressed by ISA100.11a [ISA100.11a] and
	WirelessHART [WirelessHART]. Both technologies involve a central		WirelessHART [WirelessHART]. Both technologies involve a central
	controller that computes redundant paths for industrial process		controller that computes redundant paths for industrial process
	control traffic over a TSCH mesh. Moreover, ISA100.11a introduces		control traffic over a TSCH mesh. Moreover, ISA100.11a introduces
	IPv6 capabilities with a Link-Local Address for the join process and		IPv6 capabilities with a Link-Local Address for the join process and
	a global unicast addres for later exchanges, but the IPv6 traffic		a global unicast addres for later exchanges, but the IPv6 traffic
	typically ends at a local application gateway and the full power of		typically ends at a local application gateway and the full power of
	IPv6 for end-to-end communication is not enabled. Compared to that		IPv6 for end-to-end communication is not enabled. Compared to that
	state of the art, work at the IETF and in particular at RAW could		state of the art, work at the IETF and in particular at RAW could
	provide additional techniques such as optimized P2P routing, PAREO		provide additional techniques such as optimized P2P routing, PAREO
	functions, and end-to-end secured IPv6/CoAP connectivity.		functions, and end-to-end secured IPv6/CoAP connectivity.
	The 6TiSCH architecture [I-D.ietf-6tisch-architecture] identifies		The 6TiSCH architecture [RFC9030] identifies different models to
	different models to schedule resources along so-called Tracks (see		schedule resources along so-called Tracks (see Section 5.2.2.2)
	Section 5.2.2.2) exploiting the TSCH schedule structure however the		exploiting the TSCH schedule structure however the focus at 6TiSCH is
	focus at 6TiSCH is on best effort traffic and the group was never		on best effort traffic and the group was never chartered to produce
	chartered to produce standard work related to Tracks.		standard work related to Tracks.
	Useful References include:		Useful References include:
	1. IEEE Std 802.15.4: "IEEE Std. 802.15.4, Part. 15.4: Wireless		1. IEEE Std 802.15.4: "IEEE Std. 802.15.4, Part. 15.4: Wireless
	Medium Access Control (MAC) and Physical Layer (PHY)		Medium Access Control (MAC) and Physical Layer (PHY)
	Specifications for Low-Rate Wireless Personal Area Networks"		Specifications for Low-Rate Wireless Personal Area Networks"
	[IEEE Std. 802.15.4]. The latest version at the time of this		[IEEE Std. 802.15.4]. The latest version at the time of this
	writing is dated year 2015.		writing is dated year 2015.
	2. Morell, A. , Vilajosana, X. , Vicario, J. L. and Watteyne, T.		2. Morell, A. , Vilajosana, X. , Vicario, J. L. and Watteyne, T.
	skipping to change at page 16, line 31 ¶		skipping to change at page 16, line 31 ¶
	| | | | | | | | | | | | |		| | | | | | | | | | | | |
	+-------------------------------------------------+ +-----+		+-------------------------------------------------+ +-----+
	ch.		ch.
	offset		offset
	Figure 1: Slotframe example with scheduled cells between nodes A,		Figure 1: Slotframe example with scheduled cells between nodes A,
	B and C		B and C
	This schedule represents the possible communications of a node with		This schedule represents the possible communications of a node with
	its neighbors, and is managed by a Scheduling Function such as the		its neighbors, and is managed by a Scheduling Function such as the
	Minimal Scheduling Function (MSF) [I-D.ietf-6tisch-msf]. Each cell		Minimal Scheduling Function (MSF) [RFC9033]. Each cell in the
	in the schedule is identified by its slotoffset and channeloffset		schedule is identified by its slotoffset and channeloffset
	coordinates. A cell's timeslot offset indicates its position in		coordinates. A cell's timeslot offset indicates its position in
	time, relative to the beginning of the slotframe. A cell's channel		time, relative to the beginning of the slotframe. A cell's channel
	offset is an index which maps to a frequency at each iteration of the		offset is an index which maps to a frequency at each iteration of the
	slotframe. Each packet exchanged between neighbors happens within		slotframe. Each packet exchanged between neighbors happens within
	one cell. The size of a cell is a timeslot duration, between 10 to		one cell. The size of a cell is a timeslot duration, between 10 to
	15 milliseconds. An Absolute Slot Number (ASN) indicates the number		15 milliseconds. An Absolute Slot Number (ASN) indicates the number
	of slots elapsed since the network started. It increments at every		of slots elapsed since the network started. It increments at every
	slot. This is a 5 byte counter that can support networks running for		slot. This is a 5 byte counter that can support networks running for
	more than 300 years without wrapping (assuming a 10 ms timeslot).		more than 300 years without wrapping (assuming a 10 ms timeslot).
	Channel hopping provides increased reliability to multi-path fading		Channel hopping provides increased reliability to multi-path fading
	skipping to change at page 17, line 5 ¶		skipping to change at page 17, line 5 ¶
	hopping sequence referred as macHopSeq in the IEEE802.15.4		hopping sequence referred as macHopSeq in the IEEE802.15.4
	specification.		specification.
	The Time-Frequency Division Multiple Access provided by TSCH enables		The Time-Frequency Division Multiple Access provided by TSCH enables
	the orchestration of traffic flows, spreading them in time and		the orchestration of traffic flows, spreading them in time and
	frequency, and hence enabling an efficient management of the		frequency, and hence enabling an efficient management of the
	bandwidth utilization. Such efficient bandwidth utilization can be		bandwidth utilization. Such efficient bandwidth utilization can be
	combined to OFDM modulations also supported by the IEEE802.15.4		combined to OFDM modulations also supported by the IEEE802.15.4
	standard [IEEE Std. 802.15.4] since the 2015 version.		standard [IEEE Std. 802.15.4] since the 2015 version.
			TSCH networks operate in ISM bands in which the spectrum is shared by
			different coexisting technologies. Regulations such as FCC, ETSI and
			ARIB impose duty cycle regulations to limit the use of the bands but
			yet interference may constraint the probability to deliver a packet.
			Part of these reliability challenges are addressed at the MAC
			introducing redundancy and diversity, thanks to channel hopping,
			scheduling and ARQ policies. Yet, the MAC layer operates with a
			1-hop vision, being limited to local actions to mitigate
			underperforming links.
	In the RAW context, low power reliable networks should address non-		In the RAW context, low power reliable networks should address non-
	critical control scenarios such as Class 2 and monitoring scenarios		critical control scenarios such as Class 2 and monitoring scenarios
	such as Class 4 defined by the RFC5673 [RFC5673]. As a low power		such as Class 4 defined by the RFC5673 [RFC5673]. As a low power
	technology targeting industrial scenarios radio transducers provide		technology targeting industrial scenarios radio transducers provide
	low data rates (typically between 50kbps to 250kbps) and robust		low data rates (typically between 50kbps to 250kbps) and robust
	modulations to trade-off performance to reliability. TSCH networks		modulations to trade-off performance to reliability. TSCH networks
	are organized in mesh topologies and connected to a backbone.		are organized in mesh topologies and connected to a backbone.
	Latency in the mesh network is mainly influenced by propagation		Latency in the mesh network is mainly influenced by propagation
	aspects such as interference. ARQ methods and redundancy techniques		aspects such as interference. ARQ methods and redundancy techniques
	such as replication and elimination should be studied to provide the		such as replication and elimination should be studied to provide the
	skipping to change at page 18, line 39 ¶		skipping to change at page 18, line 49 ¶
	--- 6TiSCH------6TiSCH------6TiSCH------6TiSCH--		--- 6TiSCH------6TiSCH------6TiSCH------6TiSCH--
	6TiSCH / Device Device Device Device \		6TiSCH / Device Device Device Device \
	Device- - 6TiSCH		Device- - 6TiSCH
	\ 6TiSCH 6TiSCH 6TiSCH 6TiSCH / Device		\ 6TiSCH 6TiSCH 6TiSCH 6TiSCH / Device
	----Device------Device------Device------Device--		----Device------Device------Device------Device--
	Figure 2		Figure 2
	5.2.2.1.1. Packet Marking and Handling		5.2.2.1.1. Packet Marking and Handling
	Section "Packet Marking and Handling" of		Section "Packet Marking and Handling" of [RFC9030] describes the
	[I-D.ietf-6tisch-architecture] describes the packet tagging and		packet tagging and marking that is expected in 6TiSCH networks.
	marking that is expected in 6TiSCH networks.
	5.2.2.1.1.1. Tagging Packets for Flow Identification		5.2.2.1.1.1. Tagging Packets for Flow Identification
	For packets that are routed by a PCE along a Track, the tuple formed		For packets that are routed by a PCE along a Track, the tuple formed
	by the IPv6 source address and a local RPLInstanceID is tagged in the		by the IPv6 source address and a local RPLInstanceID is tagged in the
	packets to identify uniquely the Track and associated transmit bundle		packets to identify uniquely the Track and associated transmit bundle
	of timeSlots.		of timeSlots.
	It results that the tagging that is used for a DetNet flow outside		It results that the tagging that is used for a DetNet flow outside
	the 6TiSCH LLN MUST be swapped into 6TiSCH formats and back as the		the 6TiSCH LLN MUST be swapped into 6TiSCH formats and back as the
	skipping to change at page 22, line 13 ¶		skipping to change at page 22, line 13 ¶
	It is possible for centralized and distributed routing to share a		It is possible for centralized and distributed routing to share a
	same topology. Generally they will operate in different slotFrames,		same topology. Generally they will operate in different slotFrames,
	and centralized routes will be used for scheduled traffic and will		and centralized routes will be used for scheduled traffic and will
	have precedence over distributed routes in case of conflict between		have precedence over distributed routes in case of conflict between
	the slotFrames.		the slotFrames.
	5.2.2.1.4. SlotFrames and Priorities		5.2.2.1.4. SlotFrames and Priorities
	A slotFrame is the base object that a PCE needs to manipulate to		A slotFrame is the base object that a PCE needs to manipulate to
	program a schedule into an LLN node. Elaboration on that concept can		program a schedule into an LLN node. Elaboration on that concept can
	be fond in section "SlotFrames and Priorities" of		be fond in section "SlotFrames and Priorities" of [RFC9030]
	[I-D.ietf-6tisch-architecture]
	IEEE802.15.4 TSCH avoids contention on the medium by formatting time		IEEE802.15.4 TSCH avoids contention on the medium by formatting time
	and frequencies in cells of transmission of equal duration. In order		and frequencies in cells of transmission of equal duration. In order
	to describe that formatting of time and frequencies, the 6TiSCH		to describe that formatting of time and frequencies, the 6TiSCH
	architecture defines a global concept that is called a Channel		architecture defines a global concept that is called a Channel
	Distribution and Usage (CDU) matrix; a CDU matrix is a matrix of		Distribution and Usage (CDU) matrix; a CDU matrix is a matrix of
	cells with an height equal to the number of available channels		cells with an height equal to the number of available channels
	(indexed by ChannelOffsets) and a width (in timeSlots) that is the		(indexed by ChannelOffsets) and a width (in timeSlots) that is the
	period of the network scheduling operation (indexed by slotOffsets)		period of the network scheduling operation (indexed by slotOffsets)
	for that CDU matrix. The size of a cell is a timeSlot duration, and		for that CDU matrix. The size of a cell is a timeSlot duration, and
	skipping to change at page 23, line 20 ¶		skipping to change at page 23, line 14 ¶
	Multiple slotFrames can coexist in a node schedule, i.e., a node can		Multiple slotFrames can coexist in a node schedule, i.e., a node can
	have multiple activities scheduled in different slotFrames, based on		have multiple activities scheduled in different slotFrames, based on
	the precedence of the 6TiSCH topologies. The slotFrames may be		the precedence of the 6TiSCH topologies. The slotFrames may be
	aligned to different CDU matrices and thus have different width.		aligned to different CDU matrices and thus have different width.
	There is typically one slotFrame for scheduled traffic that has the		There is typically one slotFrame for scheduled traffic that has the
	highest precedence and one or more slotFrame(s) for RPL traffic. The		highest precedence and one or more slotFrame(s) for RPL traffic. The
	timeSlots in the slotFrame are indexed by the SlotOffset; the first		timeSlots in the slotFrame are indexed by the SlotOffset; the first
	cell is at SlotOffset 0.		cell is at SlotOffset 0.
	The 6TiSCH architecture introduces the concept of chunks		The 6TiSCH architecture introduces the concept of chunks ([RFC9030])
	([I-D.ietf-6tisch-architecture]) to operate such spectrum		to operate such spectrum distribution for a whole group of cells at a
	distribution for a whole group of cells at a time. The CDU matrix is		time. The CDU matrix is formatted into a set of chunks, each of them
	formatted into a set of chunks, each of them identified uniquely by a		identified uniquely by a chunk-ID, see Figure 5. The PCE MUST
	chunk-ID, see Figure 5. The PCE MUST compute the partitioning of CDU		compute the partitioning of CDU matrices into chunks and shared that
	matrices into chunks and shared that knowledge with all the nodes in		knowledge with all the nodes in a 6TiSCH network.
	a 6TiSCH network.
	+-----+-----+-----+-----+-----+-----+-----+ +-----+		+-----+-----+-----+-----+-----+-----+-----+ +-----+
	chan.Off. 0 |chnkA|chnkP|chnk7|chnkO|chnk2|chnkK|chnk1| ... |chnkZ|		chan.Off. 0 |chnkA|chnkP|chnk7|chnkO|chnk2|chnkK|chnk1| ... |chnkZ|
	+-----+-----+-----+-----+-----+-----+-----+ +-----+		+-----+-----+-----+-----+-----+-----+-----+ +-----+
	chan.Off. 1 |chnkB|chnkQ|chnkA|chnkP|chnk3|chnkL|chnk2| ... |chnk1|		chan.Off. 1 |chnkB|chnkQ|chnkA|chnkP|chnk3|chnkL|chnk2| ... |chnk1|
	+-----+-----+-----+-----+-----+-----+-----+ +-----+		+-----+-----+-----+-----+-----+-----+-----+ +-----+
	...		...
	+-----+-----+-----+-----+-----+-----+-----+ +-----+		+-----+-----+-----+-----+-----+-----+-----+ +-----+
	chan.Off. 15 |chnkO|chnk6|chnkN|chnk1|chnkJ|chnkZ|chnkI| ... |chnkG|		chan.Off. 15 |chnkO|chnk6|chnkN|chnk1|chnkJ|chnkZ|chnkI| ... |chnkG|
	+-----+-----+-----+-----+-----+-----+-----+ +-----+		+-----+-----+-----+-----+-----+-----+-----+ +-----+
	skipping to change at page 24, line 8 ¶		skipping to change at page 23, line 43 ¶
	The appropriation of a chunk can be requested explicitly by the PCE		The appropriation of a chunk can be requested explicitly by the PCE
	to any node. After a successful appropriation, the PCE owns the		to any node. After a successful appropriation, the PCE owns the
	cells in that chunk, and may use them as hard cells to set up Tracks.		cells in that chunk, and may use them as hard cells to set up Tracks.
	Then again, 6TiSCH did not propose a method for chunk definition and		Then again, 6TiSCH did not propose a method for chunk definition and
	a protocol for appropriation. This is to be done at RAW.		a protocol for appropriation. This is to be done at RAW.
	5.2.2.2. 6TiSCH Tracks		5.2.2.2. 6TiSCH Tracks
	A Track at 6TiSCH is the application to wireless of the concept of a		A Track at 6TiSCH is the application to wireless of the concept of a
	path in the Detnet architecture [I-D.ietf-detnet-architecture]. A		path in the "Detnet architecture" [RFC8655]. A Track can follow a
	Track can follow a simple sequence of relay nodes or can be		simple sequence of relay nodes or can be structured as a more complex
	structured as a more complex Destination Oriented Directed Acyclic		Destination Oriented Directed Acyclic Graph (DODAG) to a unicast
	Graph (DODAG) to a unicast destination. Along a Track, 6TiSCH nodes		destination. Along a Track, 6TiSCH nodes reserve the resources to
	reserve the resources to enable the efficient transmission of packets		enable the efficient transmission of packets while aiming to optimize
	while aiming to optimize certain properties such as reliability and		certain properties such as reliability and ensure small jitter or
	ensure small jitter or bounded latency. The Track structure enables		bounded latency. The Track structure enables Layer-2 forwarding
	Layer-2 forwarding schemes, reducing the overhead of taking routing		schemes, reducing the overhead of taking routing decisions at the
	decisions at the Layer-3.		Layer-3.
	Serial Tracks can be understood as the concatenation of cells or		Serial Tracks can be understood as the concatenation of cells or
	bundles along a routing path from a source towards a destination.		bundles along a routing path from a source towards a destination.
	The serial Track concept is analogous to the circuit concept where		The serial Track concept is analogous to the circuit concept where
	resources are chained through the multi-hop topology. For example, A		resources are chained through the multi-hop topology. For example, A
	bundle of Tx Cells in a particular node is paired to a bundle of Rx		bundle of Tx Cells in a particular node is paired to a bundle of Rx
	Cells in the next hop node following a routing path.		Cells in the next hop node following a routing path.
	Whereas scheduling ensures reliable delivery in bounded time along		Whereas scheduling ensures reliable delivery in bounded time along
	any Track, high availability requires the application of PAREO		any Track, high availability requires the application of PAREO
	skipping to change at page 27, line 13 ¶		skipping to change at page 26, line 29 ¶
	the 6TiSCH devices support.		the 6TiSCH devices support.
	5.2.2.2.2. Track Forwarding		5.2.2.2.2. Track Forwarding
	By forwarding, this specification means the per-packet operation that		By forwarding, this specification means the per-packet operation that
	allows to deliver a packet to a next hop or an upper layer in this		allows to deliver a packet to a next hop or an upper layer in this
	node. Forwarding is based on pre-existing state that was installed		node. Forwarding is based on pre-existing state that was installed
	as a result of the routing computation of a Track by a PCE. The		as a result of the routing computation of a Track by a PCE. The
	6TiSCH architecture supports three different forwarding model, G-MPLS		6TiSCH architecture supports three different forwarding model, G-MPLS
	Track Forwarding (TF), 6LoWPAN Fragment Forwarding (FF) and IPv6		Track Forwarding (TF), 6LoWPAN Fragment Forwarding (FF) and IPv6
	Forwarding (6F) which is the classical IP operation		Forwarding (6F) which is the classical IP operation [RFC9030]. The
	[I-D.ietf-6tisch-architecture]. The DetNet case relates to the Track		DetNet case relates to the Track Forwarding operation under the
	Forwarding operation under the control of a PCE.		control of a PCE.
	A Track is a unidirectional path between a source and a destination.		A Track is a unidirectional path between a source and a destination.
	In a Track cell, the normal operation of IEEE802.15.4 Automatic		In a Track cell, the normal operation of IEEE802.15.4 Automatic
	Repeat-reQuest (ARQ) usually happens, though the acknowledgment may		Repeat-reQuest (ARQ) usually happens, though the acknowledgment may
	be omitted in some cases, for instance if there is no scheduled cell		be omitted in some cases, for instance if there is no scheduled cell
	for a retry.		for a retry.
	Track Forwarding is the simplest and fastest. A bundle of cells set		Track Forwarding is the simplest and fastest. A bundle of cells set
	to receive (RX-cells) is uniquely paired to a bundle of cells that		to receive (RX-cells) is uniquely paired to a bundle of cells that
	are set to transmit (TX-cells), representing a layer-2 forwarding		are set to transmit (TX-cells), representing a layer-2 forwarding
	skipping to change at page 56, line 10 ¶		skipping to change at page 56, line 10 ¶
	[RFC8200] Deering, S. and R. Hinden, "Internet Protocol, Version 6		[RFC8200] Deering, S. and R. Hinden, "Internet Protocol, Version 6
	(IPv6) Specification", STD 86, RFC 8200,		(IPv6) Specification", STD 86, RFC 8200,
	DOI 10.17487/RFC8200, July 2017,		DOI 10.17487/RFC8200, July 2017,
	<https://www.rfc-editor.org/info/rfc8200>.		<https://www.rfc-editor.org/info/rfc8200>.
	[RFC5673] Pister, K., Ed., Thubert, P., Ed., Dwars, S., and T.		[RFC5673] Pister, K., Ed., Thubert, P., Ed., Dwars, S., and T.
	Phinney, "Industrial Routing Requirements in Low-Power and		Phinney, "Industrial Routing Requirements in Low-Power and
	Lossy Networks", RFC 5673, DOI 10.17487/RFC5673, October		Lossy Networks", RFC 5673, DOI 10.17487/RFC5673, October
	2009, <https://www.rfc-editor.org/info/rfc5673>.		2009, <https://www.rfc-editor.org/info/rfc5673>.
	[I-D.ietf-detnet-architecture]		[RFC8557] Finn, N. and P. Thubert, "Deterministic Networking Problem
	Finn, N., Thubert, P., Varga, B., and J. Farkas,		Statement", RFC 8557, DOI 10.17487/RFC8557, May 2019,
	"Deterministic Networking Architecture", Work in Progress,		<https://www.rfc-editor.org/info/rfc8557>.
	Internet-Draft, draft-ietf-detnet-architecture-13, 6 May
	2019, <https://tools.ietf.org/html/draft-ietf-detnet-
	architecture-13>.
	[I-D.ietf-6tisch-architecture]		[RFC8655] Finn, N., Thubert, P., Varga, B., and J. Farkas,
	Thubert, P., "An Architecture for IPv6 over the TSCH mode		"Deterministic Networking Architecture", RFC 8655,
	of IEEE 802.15.4", Work in Progress, Internet-Draft,		DOI 10.17487/RFC8655, October 2019,
	draft-ietf-6tisch-architecture-30, 26 November 2020,		<https://www.rfc-editor.org/info/rfc8655>.
	<https://tools.ietf.org/html/draft-ietf-6tisch-
	architecture-30>.		[RFC9030] Thubert, P., Ed., "An Architecture for IPv6 over the Time-
			Slotted Channel Hopping Mode of IEEE 802.15.4 (6TiSCH)",
			RFC 9030, DOI 10.17487/RFC9030, May 2021,
			<https://www.rfc-editor.org/info/rfc9030>.
			[RFC9033] Chang, T., Ed., Vucinic, M., Vilajosana, X., Duquennoy,
			S., and D. Dujovne, "6TiSCH Minimal Scheduling Function
			(MSF)", RFC 9033, DOI 10.17487/RFC9033, May 2021,
			<https://www.rfc-editor.org/info/rfc9033>.
	13. Informative References		13. Informative References
	[RFC6550] Winter, T., Ed., Thubert, P., Ed., Brandt, A., Hui, J.,		[RFC6550] Winter, T., Ed., Thubert, P., Ed., Brandt, A., Hui, J.,
	Kelsey, R., Levis, P., Pister, K., Struik, R., Vasseur,		Kelsey, R., Levis, P., Pister, K., Struik, R., Vasseur,
	JP., and R. Alexander, "RPL: IPv6 Routing Protocol for		JP., and R. Alexander, "RPL: IPv6 Routing Protocol for
	Low-Power and Lossy Networks", RFC 6550,		Low-Power and Lossy Networks", RFC 6550,
	DOI 10.17487/RFC6550, March 2012,		DOI 10.17487/RFC6550, March 2012,
	<https://www.rfc-editor.org/info/rfc6550>.		<https://www.rfc-editor.org/info/rfc6550>.
	skipping to change at page 57, line 11 ¶		skipping to change at page 57, line 17 ¶
	and Maintenance (OAM) Tools", RFC 7276,		and Maintenance (OAM) Tools", RFC 7276,
	DOI 10.17487/RFC7276, June 2014,		DOI 10.17487/RFC7276, June 2014,
	<https://www.rfc-editor.org/info/rfc7276>.		<https://www.rfc-editor.org/info/rfc7276>.
	[RFC8279] Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A.,		[RFC8279] Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A.,
	Przygienda, T., and S. Aldrin, "Multicast Using Bit Index		Przygienda, T., and S. Aldrin, "Multicast Using Bit Index
	Explicit Replication (BIER)", RFC 8279,		Explicit Replication (BIER)", RFC 8279,
	DOI 10.17487/RFC8279, November 2017,		DOI 10.17487/RFC8279, November 2017,
	<https://www.rfc-editor.org/info/rfc8279>.		<https://www.rfc-editor.org/info/rfc8279>.
	[I-D.ietf-6tisch-msf]
	Chang, T., Vucinic, M., Vilajosana, X., Duquennoy, S., and
	D. Dujovne, "6TiSCH Minimal Scheduling Function (MSF)",
	Work in Progress, Internet-Draft, draft-ietf-6tisch-msf-
	18, 12 September 2020,
	<https://tools.ietf.org/html/draft-ietf-6tisch-msf-18>.
	[I-D.pthubert-raw-architecture]		[I-D.pthubert-raw-architecture]
	Thubert, P., Papadopoulos, G., and R. Buddenberg,		Thubert, P., Papadopoulos, G. Z., and R. Buddenberg,
	"Reliable and Available Wireless Architecture/Framework",		"Reliable and Available Wireless Architecture/Framework",
	Work in Progress, Internet-Draft, draft-pthubert-raw-		Work in Progress, Internet-Draft, draft-pthubert-raw-
	architecture-05, 15 November 2020,		architecture-05, 15 November 2020,
	<https://tools.ietf.org/html/draft-pthubert-raw-		<https://tools.ietf.org/html/draft-pthubert-raw-
	architecture-05>.		architecture-05>.
	[I-D.ietf-roll-nsa-extension]		[I-D.ietf-roll-nsa-extension]
	Koutsiamanis, R., Papadopoulos, G., Montavont, N., and P.		Koutsiamanis, R., Papadopoulos, G., Montavont, N., and P.
	Thubert, "Common Ancestor Objective Function and Parent		Thubert, "Common Ancestor Objective Function and Parent
	Set DAG Metric Container Extension", Work in Progress,		Set DAG Metric Container Extension", Work in Progress,
	skipping to change at page 58, line 16 ¶		skipping to change at page 58, line 20 ¶
	dispatch-06>.		dispatch-06>.
	[I-D.ietf-bier-te-arch]		[I-D.ietf-bier-te-arch]
	Eckert, T., Cauchie, G., and M. Menth, "Tree Engineering		Eckert, T., Cauchie, G., and M. Menth, "Tree Engineering
	for Bit Index Explicit Replication (BIER-TE)", Work in		for Bit Index Explicit Replication (BIER-TE)", Work in
	Progress, Internet-Draft, draft-ietf-bier-te-arch-09, 30		Progress, Internet-Draft, draft-ietf-bier-te-arch-09, 30
	October 2020,		October 2020,
	<https://tools.ietf.org/html/draft-ietf-bier-te-arch-09>.		<https://tools.ietf.org/html/draft-ietf-bier-te-arch-09>.
	[I-D.ietf-6tisch-coap]		[I-D.ietf-6tisch-coap]
	Sudhaakar, R. and P. Zand, "6TiSCH Resource Management and		Sudhaakar, R. S. and P. Zand, "6TiSCH Resource Management
	Interaction using CoAP", Work in Progress, Internet-Draft,		and Interaction using CoAP", Work in Progress, Internet-
	draft-ietf-6tisch-coap-03, 9 March 2015,		Draft, draft-ietf-6tisch-coap-03, 9 March 2015,
	<https://tools.ietf.org/html/draft-ietf-6tisch-coap-03>.		<https://tools.ietf.org/html/draft-ietf-6tisch-coap-03>.
	[I-D.svshah-tsvwg-deterministic-forwarding]		[I-D.svshah-tsvwg-deterministic-forwarding]
	Shah, S. and P. Thubert, "Deterministic Forwarding PHB",		Shah, S. and P. Thubert, "Deterministic Forwarding PHB",
	Work in Progress, Internet-Draft, draft-svshah-tsvwg-		Work in Progress, Internet-Draft, draft-svshah-tsvwg-
	deterministic-forwarding-04, 30 August 2015,		deterministic-forwarding-04, 30 August 2015,
	<https://tools.ietf.org/html/draft-svshah-tsvwg-		<https://tools.ietf.org/html/draft-svshah-tsvwg-
	deterministic-forwarding-04>.		deterministic-forwarding-04>.
	[IEEE Std. 802.15.4]		[IEEE Std. 802.15.4]
	skipping to change at page 62, line 13 ¶		skipping to change at page 62, line 13 ¶
	SpecificationDetails.aspx?specificationId=3144>.		SpecificationDetails.aspx?specificationId=3144>.
	[TS38300] "3GPP TS 38.300, NR Overall description",		[TS38300] "3GPP TS 38.300, NR Overall description",
	<https://portal.3gpp.org/desktopmodules/Specifications/		<https://portal.3gpp.org/desktopmodules/Specifications/
	SpecificationDetails.aspx?specificationId=3191>.		SpecificationDetails.aspx?specificationId=3191>.
	[IMT2020] "ITU towards IMT for 2020 and beyond",		[IMT2020] "ITU towards IMT for 2020 and beyond",
	<https://www.itu.int/en/ITU-R/study-groups/rsg5/rwp5d/imt-		<https://www.itu.int/en/ITU-R/study-groups/rsg5/rwp5d/imt-
	2020/Pages/default.aspx>.		2020/Pages/default.aspx>.
	[RFC8655] Finn, N., Thubert, P., Varga, B., and J. Farkas,
	"Deterministic Networking Architecture", RFC 8655,
	DOI 10.17487/RFC8655, October 2019,
	<https://www.rfc-editor.org/info/rfc8655>.
	[I-D.ietf-detnet-ip-over-tsn]		[I-D.ietf-detnet-ip-over-tsn]
	Varga, B., Farkas, J., Malis, A., and S. Bryant, "DetNet		Varga, B., Farkas, J., Malis, A. G., and S. Bryant,
	Data Plane: IP over IEEE 802.1 Time Sensitive Networking		"DetNet Data Plane: IP over IEEE 802.1 Time Sensitive
	(TSN)", Work in Progress, Internet-Draft, draft-ietf-		Networking (TSN)", Work in Progress, Internet-Draft,
	detnet-ip-over-tsn-05, 13 December 2020,		draft-ietf-detnet-ip-over-tsn-07, 19 February 2021,
	<https://tools.ietf.org/html/draft-ietf-detnet-ip-over-		<https://tools.ietf.org/html/draft-ietf-detnet-ip-over-
	tsn-05>.		tsn-07>.
	[IEEE802.1TSN]		[IEEE802.1TSN]
	IEEE 802.1, "Time-Sensitive Networking (TSN) Task Group",		IEEE 802.1, "Time-Sensitive Networking (TSN) Task Group",
	<http://www.ieee802.org/1/pages/tsn.html>.		<http://www.ieee802.org/1/pages/tsn.html>.
	[IEEE802.1AS]		[IEEE802.1AS]
	IEEE, "IEEE Standard for Local and metropolitan area		IEEE, "IEEE Standard for Local and metropolitan area
	networks -- Timing and Synchronization for Time-Sensitive		networks -- Timing and Synchronization for Time-Sensitive
	Applications", IEEE 802.1AS-2020,		Applications", IEEE 802.1AS-2020,
	<https://standards.ieee.org/content/ieee-standards/en/		<https://standards.ieee.org/content/ieee-standards/en/
End of changes. 23 change blocks.
	82 lines changed or deleted		85 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/