RIFT Keys Structure and Well-Known Registry in Key Value TIE
draft-rift-head-kv-registry-00
Network Working Group J. Head
Internet-Draft A. Przygienda
Intended status: Standards Track Juniper Networks
Expires: 26 August 2021 22 February 2021
RIFT Keys Structure and Well-Known Registry in Key Value TIE
draft-rift-head-kv-registry-00
Abstract
Routing in Fat-Trees RIFT [RIFT] allows for key/value pairs to be
advertised within Key-Value Topology Information Elements (KV TIEs).
The data contained within these KV TIEs can be used for any
imaginable purpose. This document defines the various Key Types
(i.e. Well-Known, OUI, and Experimental) and a method to structure
corresponding values.
Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC 2119 [RFC2119].
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on 26 August 2021.
Copyright Notice
Copyright (c) 2021 IETF Trust and the persons identified as the
document authors. All rights reserved.
Head & Przygienda Expires 26 August 2021 [Page 1]
Internet-Draft draft-ietf-head-rift-kv-registry February 2021
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents (https://trustee.ietf.org/
license-info) in effect on the date of publication of this document.
Please review these documents carefully, as they describe your rights
and restrictions with respect to this document. Code Components
extracted from this document must include Simplified BSD License text
as described in Section 4.e of the Trust Legal Provisions and are
provided without warranty as described in the Simplified BSD License.
Table of Contents
1. Description . . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Key-Value Pair Structure . . . . . . . . . . . . . . . . . . 3
2.1. Well-Known Key Type . . . . . . . . . . . . . . . . . . . 3
2.2. OUI Key Type . . . . . . . . . . . . . . . . . . . . . . 4
2.3. Experimental Key Type . . . . . . . . . . . . . . . . . . 4
3. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 5
3.1. Key Type Registry . . . . . . . . . . . . . . . . . . . . 5
3.1.1. Requested Entries . . . . . . . . . . . . . . . . . . 5
3.2. Experimental Key Type . . . . . . . . . . . . . . . . . . 5
3.2.1. Requested Entries . . . . . . . . . . . . . . . . . . 6
3.3. Well-Known Key Type . . . . . . . . . . . . . . . . . . . 6
3.3.1. Requested Entries . . . . . . . . . . . . . . . . . . 6
3.4. OUI Key Type . . . . . . . . . . . . . . . . . . . . . . 6
3.4.1. Requested Entries . . . . . . . . . . . . . . . . . . 7
4. Security Considerations . . . . . . . . . . . . . . . . . . . 7
5. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 7
6. Normative References . . . . . . . . . . . . . . . . . . . . 7
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 7
1. Description
Routing in Fat-Trees (RIFT [RIFT]) allows for key/value pairs to be
advertised within Key-Value Topology Information Elements (KV TIEs).
There are no restrictions placed on the type of data that is
contained in KV TIEs nor what the data is used for. It could contain
a simple string or even Thrift encoded data. However, the KV
elements SHOULD NOT be used to carry topology information used by
RIFT itself to perform distributed computations.
This document defines a Key Type Registry to maintain Well-Known and
vendor specific Key Types in order to simplify interoperability
between implementations and eliminate the risk of collision for
future implementations. An Experimental Key Type is additionally
defined.
Head & Przygienda Expires 26 August 2021 [Page 2]
Internet-Draft draft-ietf-head-rift-kv-registry February 2021
2. Key-Value Pair Structure
Figure 1 illustrates the generic Key-Value Pair structure.
0 1 2 3
Show full document text