< draft-ietf-rift-yang-05.txt   draft-ietf-rift-yang-06.txt >
RIFT WG Z. Zhang RIFT WG Z. Zhang
Internet-Draft Y. Wei Internet-Draft Y. Wei
Intended status: Standards Track ZTE Corporation Intended status: Standards Track ZTE Corporation
Expires: 21 April 2022 S. Ma Expires: 13 October 2022 S. Ma
Google Google
X. Liu X. Liu
Volta Networks Volta Networks
B. Rijsman B. Rijsman
Individual Individual
18 October 2021 11 April 2022
A YANG Data Model for Routing in Fat Trees (RIFT) A YANG Data Model for Routing in Fat Trees (RIFT)
draft-ietf-rift-yang-05 draft-ietf-rift-yang-06
Abstract Abstract
This document defines a YANG data model for the configuration and This document defines a YANG data model for the configuration and
management of Routing in Fat Trees (RIFT) Protocol. management of Routing in Fat Trees (RIFT) Protocol.
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
skipping to change at page 1, line 37 skipping to change at page 1, line 37
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 21 April 2022. This Internet-Draft will expire on 13 October 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 (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
and restrictions with respect to this document. Code Components and restrictions with respect to this document. Code Components
extracted from this document must include Simplified BSD License text extracted from this document must include Revised BSD License text as
as described in Section 4.e of the Trust Legal Provisions and are described in Section 4.e of the Trust Legal Provisions and are
provided without warranty as described in the Simplified BSD License. provided without warranty as described in the Revised BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 2 1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 2
1.2. Conventions Used in This Document . . . . . . . . . . . . 3 1.2. Conventions Used in This Document . . . . . . . . . . . . 3
1.3. Tree Diagrams . . . . . . . . . . . . . . . . . . . . . . 3 1.3. Tree Diagrams . . . . . . . . . . . . . . . . . . . . . . 3
1.4. Prefixes in Data Node Names . . . . . . . . . . . . . . . 3 1.4. Prefixes in Data Node Names . . . . . . . . . . . . . . . 3
2. Design of the Data Model . . . . . . . . . . . . . . . . . . 4 2. Design of the Data Model . . . . . . . . . . . . . . . . . . 4
2.1. Scope of Model . . . . . . . . . . . . . . . . . . . . . 4 2.1. Scope of Model . . . . . . . . . . . . . . . . . . . . . 4
skipping to change at page 11, line 43 skipping to change at page 11, line 43
2.6. Notifications 2.6. Notifications
Unexpected TIE and neighbor's layer error should be notified. Unexpected TIE and neighbor's layer error should be notified.
3. RIFT YANG model 3. RIFT YANG model
This module references [I-D.ietf-rift-rift], [RFC5881], [RFC6991], This module references [I-D.ietf-rift-rift], [RFC5881], [RFC6991],
[RFC8177], [RFC8294], [RFC8343], [RFC8349], [RFC8505], [IEEE8021AS]. [RFC8177], [RFC8294], [RFC8343], [RFC8349], [RFC8505], [IEEE8021AS].
<CODE BEGINS> file "ietf-rift@2021-10-18.yang" <CODE BEGINS> file "ietf-rift@2022-04-11.yang"
module ietf-rift { module ietf-rift {
yang-version 1.1; yang-version 1.1;
namespace "urn:ietf:params:xml:ns:yang:ietf-rift"; namespace "urn:ietf:params:xml:ns:yang:ietf-rift";
prefix rift; prefix rift;
import ietf-inet-types { import ietf-inet-types {
prefix "inet"; prefix "inet";
reference "RFC 6991: Common YANG Data Types"; reference "RFC 6991: Common YANG Data Types";
} }
skipping to change at page 13, line 47 skipping to change at page 13, line 47
(https://www.rfc-editor.org/info/rfcXXXX); see the RFC (https://www.rfc-editor.org/info/rfcXXXX); see the RFC
itself for full legal notices. itself for full legal notices.
The key words 'MUST', 'MUST NOT', 'REQUIRED', 'SHALL', The key words 'MUST', 'MUST NOT', 'REQUIRED', 'SHALL',
'SHALL NOT', 'SHOULD', 'SHOULD NOT', 'RECOMMENDED', 'SHALL NOT', 'SHOULD', 'SHOULD NOT', 'RECOMMENDED',
'NOT RECOMMENDED', 'MAY', and 'OPTIONAL' in this document 'NOT RECOMMENDED', 'MAY', and 'OPTIONAL' in this document
are to be interpreted as described in BCP 14 (RFC 2119) are to be interpreted as described in BCP 14 (RFC 2119)
(RFC 8174) when, and only when, they appear in all (RFC 8174) when, and only when, they appear in all
capitals, as shown here."; capitals, as shown here.";
revision 2021-10-18 { revision 2022-04-11 {
description "Initial revision."; description "Initial revision.";
reference "RFC XXXX: A YANG Data Model for RIFT."; reference "RFC XXXX: A YANG Data Model for RIFT.";
} }
/* /*
* Features * Features
*/ */
feature nonce-delta-adjust { feature nonce-delta-adjust {
description description
"Support weak nonce delta adjusting which is used in security "Support weak nonce delta adjusting which is used in security
skipping to change at page 34, line 9 skipping to change at page 34, line 9
} }
uses node-capability; uses node-capability;
leaf overload-flag { leaf overload-flag {
type boolean; type boolean;
description description
"If the overload bit in TIEs is set."; "If the overload bit in TIEs is set.";
} }
leaf name { leaf name {
type string; type string;
description description
"The name of this node. It won't be used as the key of node, "The name of this node. It won't be used as the key
just used for description."; of node, just used for description.";
} }
leaf pod { leaf pod {
type uint32; type uint32;
description description
"Point of Delivery. The self-contained vertical slice of a "Point of Delivery. The self-contained vertical slice
Clos or Fat Tree network containing normally only level 0 of a Clos or Fat Tree network containing normally
and level 1 nodes. It communicates with nodes in other PoDs only level 0 and level 1 nodes. It communicates with
via the spine. We number PoDs to distinguish them and use nodes in other PoDs via the spine. We number PoDs to
PoD #0 to denote 'undefined' PoD."; distinguish them and use PoD #0 to denote
'undefined' PoD.";
} }
leaf startup-time { leaf startup-time {
type yang:date-and-time; type yang:date-and-time;
description "Startup time of the node."; description "Startup time of the node.";
} }
leaf-list miscabled-links { leaf-list miscabled-links {
type linkid-type; type linkid-type;
config false; config false;
description "List of miscabled links."; description "List of miscabled links.";
} }
skipping to change at page 39, line 6 skipping to change at page 39, line 6
The authors would like to thank Tony Przygienda, Benchong Xu The authors would like to thank Tony Przygienda, Benchong Xu
(xu.benchong@zte.com.cn), for their review, valuable comments and (xu.benchong@zte.com.cn), for their review, valuable comments and
suggestions. suggestions.
7. References 7. References
7.1. Normative References 7.1. Normative References
[I-D.ietf-rift-rift] [I-D.ietf-rift-rift]
Sharma, A., Thubert, P., Rijsman, B., and D. Afanasiev, Sharma, A., Thubert, P., Rijsman, B., Afanasiev, D., and
"RIFT: Routing in Fat Trees", Work in Progress, Internet- A. Przygienda, "RIFT: Routing in Fat Trees", Work in
Draft, draft-ietf-rift-rift-13, 12 July 2021, Progress, Internet-Draft, draft-ietf-rift-rift-15, 3
<https://www.ietf.org/archive/id/draft-ietf-rift-rift- January 2022, <https://www.ietf.org/archive/id/draft-ietf-
13.txt>. rift-rift-15.txt>.
[IEEE8021AS] [IEEE8021AS]
"IEEE Standard for Local and Metropolitan Area Networks - "IEEE Standard for Local and Metropolitan Area Networks -
Timing and Synchronization for Time-Sensitive Applications Timing and Synchronization for Time-Sensitive Applications
in Bridged Local Area Networks", in Bridged Local Area Networks",
<https://ieeexplore.ieee.org/document/5741898/>. <https://ieeexplore.ieee.org/document/5741898/>.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997, DOI 10.17487/RFC2119, March 1997,
 End of changes. 11 change blocks. 
22 lines changed or deleted 23 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/