< draft-bcx-rtgwg-tcr-01.txt		draft-bcx-rtgwg-tcr-02.txt >
	rtgwg S. Bryant		rtgwg S. Bryant
	Internet-Draft University of Surrey 5GIC		Internet-Draft University of Surrey 5GIC
	Intended status: Informational A. Clemm		Intended status: Informational A. Clemm
	Expires: April 22, 2022 Futurewei Technologies, Inc.		Expires: November 10, 2022 Futurewei Technologies, Inc.
	October 19, 2021		May 09, 2022
	Token Cell Routing Data Plane Concepts		Token Cell Routing Data Plane Concepts
	draft-bcx-rtgwg-tcr-01		draft-bcx-rtgwg-tcr-02
	Abstract		Abstract
	Token Cell Routing is a powerful yet hardware friendly method of		Token Cell Routing is a powerful yet hardware friendly method of
	constructing data plane packets to meet the needs of new		constructing data plane packets to meet the needs of new
	applications. It is based on the use of token cells (special kinds		applications. It is based on the use of token cells (special kinds
	of lightly structured tokens) to provide pointers to procedures pre-		of lightly structured tokens) to provide pointers to procedures pre-
	positioned in the forwarding layer together with the parameters		positioned in the forwarding layer together with the parameters
	needed to provide the required processing context. A packet can be		needed to provide the required processing context. A packet can be
	composed from multiple token cells as needed to result in new new		composed from multiple token cells as needed to result in new new
	skipping to change at page 1, line 38 ¶		skipping to change at page 1, line 38 ¶
	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 April 22, 2022.		This Internet-Draft will expire on November 10, 2022.
	Copyright Notice		Copyright Notice
	Copyright (c) 2021 IETF Trust and the persons identified as the		Copyright (c) 2022 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
	(https://trustee.ietf.org/license-info) in effect on the date of		(https://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
	skipping to change at page 4, line 23 ¶		skipping to change at page 4, line 23 ¶
	neither we or anyone else has built. Thus, it is likely to have bugs		neither we or anyone else has built. Thus, it is likely to have bugs
	and certainly has many aspects that can be improved on. We would be		and certainly has many aspects that can be improved on. We would be
	delighted to work with others who are interested in exploring this		delighted to work with others who are interested in exploring this
	idea and developing it further. A starter set of discussion items is		idea and developing it further. A starter set of discussion items is
	included in Section 12 towards the end of the document.		included in Section 12 towards the end of the document.
	1.1. Requirements Language		1.1. Requirements Language
	The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",		The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
	"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and		"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
	"OPTIONAL" in this document are to be interpreted as described in		"OPTIONAL" in this document are to be interpreted as described in BCP
	BCP14 [RFC2119] [RFC8174] when, and only when, they appear in all		14 [RFC2119] [RFC8174] when, and only when, they appear in all
	capitals, as shown here.		capitals, as shown here.
	2. The TCR Concept		2. The TCR Concept
	The foundation of TCR is the construction of the packet from a set of		The foundation of TCR is the construction of the packet from a set of
	token cells. A token cell is an extended length, type, value		token cells. A token cell is an extended length, type, value
	construct. The type and part of the value is processed by a longest		construct. The type and part of the value is processed by a longest
	match engine, which operates much like an IP address lookup engine,		match engine, which operates much like an IP address lookup engine,
	but operates on arbitrary constructs rather than being confined to		but operates on arbitrary constructs rather than being confined to
	address lookup. As part of its value, the token cell may also carry		address lookup. As part of its value, the token cell may also carry
	skipping to change at page 39, line 7 ¶		skipping to change at page 39, line 7 ¶
	[DOI.10.1109_NOMS47738.2020.9110431]		[DOI.10.1109_NOMS47738.2020.9110431]
	Clemm, A. and T. Eckert, "High-Precision Latency		Clemm, A. and T. Eckert, "High-Precision Latency
	Forwarding over Packet-Programmable Networks", NOMS 2020 -		Forwarding over Packet-Programmable Networks", NOMS 2020 -
	2020 IEEE/IFIP Network Operations and		2020 IEEE/IFIP Network Operations and
	Management Symposium, DOI 10.1109/noms47738.2020.9110431,		Management Symposium, DOI 10.1109/noms47738.2020.9110431,
	April 2020.		April 2020.
	[I-D.ietf-ippm-ioam-data]		[I-D.ietf-ippm-ioam-data]
	Brockners, F., Bhandari, S., and T. Mizrahi, "Data Fields		Brockners, F., Bhandari, S., and T. Mizrahi, "Data Fields
	for In-situ OAM", draft-ietf-ippm-ioam-data-15 (work in		for In-situ OAM", draft-ietf-ippm-ioam-data-17 (work in
	progress), October 2021.		progress), December 2021.
	[RFC3270] Le Faucheur, F., Wu, L., Davie, B., Davari, S., Vaananen,		[RFC3270] Le Faucheur, F., Wu, L., Davie, B., Davari, S., Vaananen,
	P., Krishnan, R., Cheval, P., and J. Heinanen, "Multi-		P., Krishnan, R., Cheval, P., and J. Heinanen, "Multi-
	Protocol Label Switching (MPLS) Support of Differentiated		Protocol Label Switching (MPLS) Support of Differentiated
	Services", RFC 3270, DOI 10.17487/RFC3270, May 2002,		Services", RFC 3270, DOI 10.17487/RFC3270, May 2002,
	<https://www.rfc-editor.org/info/rfc3270>.		<https://www.rfc-editor.org/info/rfc3270>.
	[RFC3985] Bryant, S., Ed. and P. Pate, Ed., "Pseudo Wire Emulation		[RFC3985] Bryant, S., Ed. and P. Pate, Ed., "Pseudo Wire Emulation
	Edge-to-Edge (PWE3) Architecture", RFC 3985,		Edge-to-Edge (PWE3) Architecture", RFC 3985,
	DOI 10.17487/RFC3985, March 2005,		DOI 10.17487/RFC3985, March 2005,
End of changes. 6 change blocks.
	9 lines changed or deleted		9 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/