RFC 9922: A Common YANG Data Model for Scheduling
- Q. Ma, Ed.,
- Q. Wu,
- M. Boucadair, Ed.,
- D. King
Abstract
This document defines common types and groupings that are meant to be used
for scheduling purposes, such as events, policies, services, or resources based on
date and time. For the sake of better modularity, the YANG module includes a
set of recurrence
Status of This Memo
This is an Internet Standards Track document.¶
This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841.¶
Information about the current status of this document, any
errata, and how to provide feedback on it may be obtained at
https://
Copyright Notice
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://
1. Introduction
This document defines a common schedule YANG module
This document does not make any assumption about the nature of actions that are triggered by the schedules. Detection and resolution of any schedule conflicts are beyond the scope of this document.¶
Section 5 discusses the relationship with the Management Information Base (MIB) managed objects for scheduling management operations defined in [RFC3231].¶
Appendix A describes a set of examples to illustrate the use of the common schedule groupings (Section 3.3). Appendix B provides sample modules to exemplify how future modules can use the extensibility provisions in the "ietf-schedule" module (Section 6). Also, Appendix C provides an example of using the "ietf-schedule" module for scheduled use of a resources framework (e.g., [RFC8413]).¶
2. Conventions and Definitions
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
The meanings of the symbols in tree diagrams are defined in [RFC8340].¶
This document uses the YANG terminology defined in Section 3 of [RFC7950].¶
This document makes use of the following terms:¶
- Recurrence rule:
-
Refers to a rule or repeating pattern for recurring events. See also Section 3.8.5.3 of [RFC5545] for a comprehensive iCalendar recurrence rule specification.¶
- Recurrence instance (or Recurrence, for short):
-
Refers to an instance that matches a recurrence rule.¶
- Recurrence set:
-
Refers to a set of recurrence instances.¶
- Frequency:
-
Characterizes the type of a recurrence rule. Values are taken from the "FREQ" rule in Section 3.3.10 of [RFC5545].¶
-
For example, repeating events based on an interval of a second or more are classified as recurrence with a frequency value of "SECONDLY". Frequency values defined as identities in the YANG module are used in lowercase.¶
- iCalendar:
- Interval:
-
Refers to an integer that specifies the interval at which a recurrence rule repeats. Values are taken from the "INTERVAL" rule in Section 3.3.10 of [RFC5545].¶
-
For example, "1" means every second for a secondly rule, every minute for a minutely rule, every hour for an hourly rule, etc.¶
- System:
-
Refers to an entity that hosts a schedule that is managed using the YANG module defined in this document.¶
"schedule
3. Module Overview
3.1. Features
The "ietf-schedule" data model defines the recurrence
Refer to Section 3.4 and Appendix B.1 for the use of these features.¶
3.2. Types and Identities
The "ietf-schedule" module (Section 6) defines the following identities:¶
3.3. Scheduling Groupings
The "ietf-schedule" module (Section 6) defines the following groupings:¶
Examples are provided in Appendix A.¶
3.3.1. The "generic-schedule-params" Grouping
A system accepts and handles schedule requests, which may help further
automate the scheduling process of events, policies, services, or resources
based on date and time. The "generic
The "description" parameter includes a description of the schedule. No constraint is imposed on the structure nor the use of this parameter.¶
The "time
The "validity" parameter specifies the date and time after which a schedule will not be considered as valid. It determines the latest time that a schedule can be started and thus executed independently from when it ends, and it takes precedence over similar attributes that are provided at the schedule instance itself. A requested schedule may still be accepted, but any occurrences that start later than the configured value will not be executed.¶
The "max
The "max
The "discard
These parameters apply to all schedules on a system and are meant to provide guards against stale configuration, schedule requests that are too short and that would thus prevent validation by admins of some critical systems, etc.¶
3.3.2. The "period-of-time" Grouping
The "period
The "time
The "period
3.3.3. The "recurrence-basic" Grouping
The "recurrence
The frequency parameter ("frequency") identifies the type of recurrence rule. For example, a "daily" frequency value specifies repeating events based on an interval of a day or more.¶
Consistent with Section 3.3.10 of [RFC5545], the interval parameter ("interval") represents at which interval the recurrence rule repeats. For example, within a "daily" recurrence rule, an interval value of "8" means every eight days.¶
Note that, per Section 4.13 of [YANG-GUIDE], no "default" substatement is defined here for both "frequency" and "interval" parameters because there are cases (e.g., profiling) where using these statements is problematic. No "mandatory" substatement is defined here for the same reason. YANG modules using this grouping SHOULD refine these two nodes with either a "mandatory" or a "default" statement if they always need to be configured or have default values. This recommendation MAY be ignored in cases such as when this grouping is used by another grouping.¶
The "recurrence
3.3.4. The "recurrence-utc" Grouping
The "recurrence
The "start
The "duration" parameter specifies, in units of seconds, the time period of the first occurrence. Unless specified otherwise (e.g., through additional augmented parameters), the "duration" also applies to subsequent recurrence instances. When unspecified, each occurrence is considered as immediate completion (e.g., execute an immediate command that is considered to complete quickly) or hard to compute an exact duration (e.g., run a data analysis script whose execution time may depend on the data volume and computation resource availability). The behavior to follow when a task takes more time than specified by the "duration" is out of scope. Such considerations belong to task management, not schedule management.¶
Note that the "interval" and "duration" cover two distinct properties of a schedule event. The interval specifies when a schedule will occur, combined with the frequency parameter, while the duration indicates how long an occurrence will last. This document allows the interval between occurrences to be shorter than the duration of each occurrence (e.g., a recurring event is scheduled to start every day for a duration of 2 days).¶
The repetition can be scoped by a specified end time or by a count of occurrences,
indicated by the "recurrence
The "recurrence
3.3.5. The "recurrence-with-time-zone" Grouping
The "recurrence
The "recurrence
The grouping also includes a
"time
The repetition can be scoped by a specified end time or by a count of occurrences,
indicated by the "recurrence
The considerations discussed in Section 3.3.4 for "interval" and "duration" are also applicable to "recurrence
Unlike the definition of the "recurrence
3.3.6. The "recurrence-utc-with-periods" Grouping
The "recurrence
The recurrence instances are specified by the union of occurrences defined
by both the recurrence rule and "period
3.3.7. The "recurrence-time-zone-with-periods" Grouping
The "recurrence
The recurrence instances are specified by the union of occurrences defined by both the recurrence rule and "period" list. Duplicate instances are ignored.¶
3.3.8. The "icalendar-recurrence" Grouping
The "icalendar
An array of the "bysecond" (or "byminute" or "byhour") specifies a list of seconds within a minute (or minutes within an hour or hours of the day). For example, within a "minutely" recurrence rule, the values of "byminute" node "10" and "20" mean the occurrences are generated at the 10th and 20th minute within an hour, reducing the number of recurrence instances from all minutes.¶
The parameter "byday" specifies a list of days of the week, with an optional direction that indicates the nth occurrence of a specific day within the "monthly" or "yearly" frequency instance. Valid values of "direction" are 1 to 5 or -5 to -1 within a "monthly" recurrence rule and 1 to 53 or -53 to -1 within a "yearly" recurrence rule. For example, within a "monthly" rule, the "weekday" with a value of "monday" and the "direction" with a value of "-1" represents the last Monday of the month.¶
An array of the "bymonthday" (or byyearday", "byyearweek", or "byyearmonth") specifies a list of days of the month (or days of the year, weeks of the year, or months of the year). For example, within a "yearly" recurrence rule, the values of "byyearmonth" instances "1" and "2" mean the occurrences are generated in January and February, increasing the "yearly" recurrence from every year to every January and February of the year.¶
The "bysetpos" conveys a list of values that corresponds to the nth occurrence within the set of recurrence instances to be specified. For example, in a "monthly" recurrence rule, the "byday" data node specifies every Monday of the week, and the "bysetpos" with a value of "-1" represents the last Monday of the month. Not setting the "bysetpos" data node represents every Monday of the month.¶
The "workweek
The "exception
3.3.9. The "schedule-status", "schedule-status-with-time-zone", and "schedule-status-with-name" Groupings
The "schedule
The "schedule-name" parameter is useful to uniquely identify a schedule in a network device or controller if multiple scheduling contexts exist.¶
The "state" parameter is defined to configure
The "version" parameter is used to track the current schedule version information. The version can be incremented by the entity that created the schedule. The "last-update" parameter identifies when the schedule was last modified. In some contexts, this parameter can be used to track the configuration of a given schedule. In such cases, the "version" may not be used.¶
The "schedule-type" parameter identifies the type of the current schedule.
The "counter", "last
When no time zone is included, "local-time" reports the actual local time as seen by the entity that
hosts a schedule. This parameter can be used by a controller to infer the offset to UTC. This use
is similar to the use of "sched
"last
The current groupings capture common parameters that are applicable to typical scheduling contexts known so far. Future modules can define other useful parameters as needed. For example, in a scheduling context with multiple system sources to feed the schedules, the "source" and "precedence" parameters may be needed to reflect how schedules from different sources should be prioritized.¶
3.4. Features Use and Augmentations
Appendix B.1 provides an example about how the features defined in Section 3.1 can be used. Implementations may support a basic recurrence rule or an advanced one, as needed, by declaring different features. Whether only one or both features are supported is implementation specific and depends on the specific scheduling context.¶
The common schedule groupings (Section 3.3) can also be augmented to support specific needs. As an example, Appendix B.2 demonstrates how additional parameters can be added to comply with specific schedule needs.¶
4. Some Usage Restrictions
There are some restrictions that need to be followed when using groupings defined in the "ietf-schedule" YANG module (Section 3.3):¶
5. Relationship to the DISMAN-SCHEDULE-MIB
[RFC3231] specifies a Management Information Base (MIB) used to schedule management operations periodically or at specified dates and times.¶
Although no data nodes are defined in this document, Table 1 lists
how the main objects in the DISMAN
7. Security Considerations
This section is modeled after the template described in Section 3.7 of [YANG-GUIDE].¶
The "ietf-schedule" YANG module defines a data model that is designed to be accessed via YANG-based management protocols, such as NETCONF [RFC6241] and RESTCONF [RFC8040]. These YANG-based management protocols (1) have to use a secure transport layer (e.g., SSH [RFC4252], TLS [RFC8446], and QUIC [RFC9000]) and (2) have to use mutual authentication.¶
The Network Configuration Access Control Model (NACM) [RFC8341] provides the means to restrict access for particular NETCONF or RESTCONF users to a preconfigured subset of all available NETCONF or RESTCONF protocol operations and content.¶
The "ietf-schedule" module defines a set of identities, types, and groupings. These nodes are intended to be reused by other YANG modules. The module by itself does not expose any data nodes that are writable, data nodes that contain read-only state, or RPCs. As such, there are no additional security issues related to the "ietf-schedule" module that need to be considered.¶
Modules that use the groupings that are defined in this document should identify the corresponding security considerations. For example, reusing the following groupings will expose privacy-related information:¶
8. IANA Considerations
8.1. The IETF XML Registry
This document has registered the following URI in the "IETF XML Registry" [RFC3688].¶
9. References
9.1. Normative References
- [RFC2119]
-
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10
.17487 , , <https:///RFC2119 www >..rfc -editor .org /info /rfc2119 - [RFC3231]
-
Levi, D. and J. Schoenwaelder, "Definitions of Managed Objects for Scheduling Management Operations", RFC 3231, DOI 10
.17487 , , <https:///RFC3231 www >..rfc -editor .org /info /rfc3231 - [RFC3688]
-
Mealling, M., "The IETF XML Registry", BCP 81, RFC 3688, DOI 10
.17487 , , <https:///RFC3688 www >..rfc -editor .org /info /rfc3688 - [RFC5545]
-
Desruisseaux, B., Ed., "Internet Calendaring and Scheduling Core Object Specification (iCalendar)", RFC 5545, DOI 10
.17487 , , <https:///RFC5545 www >..rfc -editor .org /info /rfc5545 - [RFC6020]
-
Bjorklund, M., Ed., "YANG - A Data Modeling Language for the Network Configuration Protocol (NETCONF)", RFC 6020, DOI 10
.17487 , , <https:///RFC6020 www >..rfc -editor .org /info /rfc6020 - [RFC7317]
-
Bierman, A. and M. Bjorklund, "A YANG Data Model for System Management", RFC 7317, DOI 10
.17487 , , <https:///RFC7317 www >..rfc -editor .org /info /rfc7317 - [RFC7950]
-
Bjorklund, M., Ed., "The YANG 1.1 Data Modeling Language", RFC 7950, DOI 10
.17487 , , <https:///RFC7950 www >..rfc -editor .org /info /rfc7950 - [RFC8174]
-
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10
.17487 , , <https:///RFC8174 www >..rfc -editor .org /info /rfc8174 - [RFC8341]
-
Bierman, A. and M. Bjorklund, "Network Configuration Access Control Model", STD 91, RFC 8341, DOI 10
.17487 , , <https:///RFC8341 www >..rfc -editor .org /info /rfc8341 - [RFC9911]
-
Schönwälder, J., Ed., "Common YANG Data Types", RFC 9911, DOI 10
.17487 , , <https:///RFC9911 www >..rfc -editor .org /info /rfc9911
9.2. Informative References
- [NETMOD
-ECA -POLICY] -
Wu, Q., Bryskin, I., Birkholz, H., Liu, X., and B. Claise, "A YANG Data model for ECA Policy Management", Work in Progress, Internet-Draft, draft
-ietf , , <https://-netmod -eca -policy -01 datatracker >..ietf .org /doc /html /draft -ietf -netmod -eca -policy -01 - [NTPv5]
-
Lichvar, M. and T. Mizrahi, "Network Time Protocol Version 5", Work in Progress, Internet-Draft, draft
-ietf , , <https://-ntp -ntpv5 -08 datatracker >..ietf .org /doc /html /draft -ietf -ntp -ntpv5 -08 - [RFC3339]
-
Klyne, G. and C. Newman, "Date and Time on the Internet: Timestamps", RFC 3339, DOI 10
.17487 , , <https:///RFC3339 www >..rfc -editor .org /info /rfc3339 - [RFC4252]
-
Ylonen, T. and C. Lonvick, Ed., "The Secure Shell (SSH) Authentication Protocol", RFC 4252, DOI 10
.17487 , , <https:///RFC4252 www >..rfc -editor .org /info /rfc4252 - [RFC6241]
-
Enns, R., Ed., Bjorklund, M., Ed., Schoenwaelder, J., Ed., and A. Bierman, Ed., "Network Configuration Protocol (NETCONF)", RFC 6241, DOI 10
.17487 , , <https:///RFC6241 www >..rfc -editor .org /info /rfc6241 - [RFC7951]
-
Lhotka, L., "JSON Encoding of Data Modeled with YANG", RFC 7951, DOI 10
.17487 , , <https:///RFC7951 www >..rfc -editor .org /info /rfc7951 - [RFC8040]
-
Bierman, A., Bjorklund, M., and K. Watsen, "RESTCONF Protocol", RFC 8040, DOI 10
.17487 , , <https:///RFC8040 www >..rfc -editor .org /info /rfc8040 - [RFC8340]
-
Bjorklund, M. and L. Berger, Ed., "YANG Tree Diagrams", BCP 215, RFC 8340, DOI 10
.17487 , , <https:///RFC8340 www >..rfc -editor .org /info /rfc8340 - [RFC8345]
-
Clemm, A., Medved, J., Varga, R., Bahadur, N., Ananthakrishnan, H., and X. Liu, "A YANG Data Model for Network Topologies", RFC 8345, DOI 10
.17487 , , <https:///RFC8345 www >..rfc -editor .org /info /rfc8345 - [RFC8413]
-
Zhuang, Y., Wu, Q., Chen, H., and A. Farrel, "Framework for Scheduled Use of Resources", RFC 8413, DOI 10
.17487 , , <https:///RFC8413 www >..rfc -editor .org /info /rfc8413 - [RFC8446]
-
Rescorla, E., "The Transport Layer Security (TLS) Protocol Version 1.3", RFC 8446, DOI 10
.17487 , , <https:///RFC8446 www >..rfc -editor .org /info /rfc8446 - [RFC9000]
-
Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based Multiplexed and Secure Transport", RFC 9000, DOI 10
.17487 , , <https:///RFC9000 www >..rfc -editor .org /info /rfc9000 - [RFC9657]
-
Birrane, III, E., Kuhn, N., Qu, Y., Taylor, R., and L. Zhang, "Time-Variant Routing (TVR) Use Cases", RFC 9657, DOI 10
.17487 , , <https:///RFC9657 www >..rfc -editor .org /info /rfc9657 - [W3C.XML1.0]
-
Bray, T., Ed., Paoli, J., Ed., Sperberg
-Mc , Maler, E., Ed., and F. Yergeau, Ed., "Extensible Markup Language (XML) 1.0 (Fifth Edition)", W3C Recommendation, , <https://Queen, C. M., Ed. www >..w3 .org /TR /2008 /REC -xml -20081126 / - [YANG
-CONFIG -SCHEDULE] -
Liu, X., Bryskin, I., Beeram, V. P., Saad, T., Shah, H. C., and O. G. de Dios, "A YANG Data Model for Configuration Scheduling", Work in Progress, Internet-Draft, draft
-liu , , <https://-netmod -yang -schedule -05 datatracker >..ietf .org /doc /html /draft -liu -netmod -yang -schedule -05 - [YANG-GUIDE]
-
Bierman, A., Boucadair, M., and Q. Wu, "Guidelines for Authors and Reviewers of Documents Containing YANG Data Models", Work in Progress, Internet-Draft, draft
-ietf , , <https://-netmod -rfc8407bis -28 datatracker >..ietf .org /doc /html /draft -ietf -netmod -rfc8407bis -28 - [YANG-NAC]
-
Ma, Q., Wu, Q., Boucadair, M., and D. King, "A YANG Data Model and RADIUS Extension for Policy-Based Network Access Control", Work in Progress, Internet-Draft, draft
-ietf , , <https://-opsawg -ucl -acl -12 datatracker >..ietf .org /doc /html /draft -ietf -opsawg -ucl -acl -12 - [YANG-OAM]
-
Contreras, L. M., Lopez, V., and Q. Wu, "A YANG Data Model for Network Diagnosis using Scheduled Sequences of OAM Tests", Work in Progress, Internet-Draft, draft
-ietf , , <https://-opsawg -scheduling -oam -tests -04 datatracker >..ietf .org /doc /html /draft -ietf -opsawg -scheduling -oam -tests -04 - [YANG-SCHEDULE]
-
Qu, Y., Lindem, A., Kinzie, E., Fedyk, D., and M. Blanchet, "YANG Data Model for Scheduled Attributes", Work in Progress, Internet-Draft, draft
-ietf , , <https://-tvr -schedule -yang -08 datatracker >..ietf .org /doc /html /draft -ietf -tvr -schedule -yang -08
Appendix A. Examples of Scheduling Format Representation
This section provides some examples to illustrate the use of the period and recurrence formats defined in Section 6. The following modules are used for illustration purposes and make examples verifiable:¶
For each example, only the message body is provided with JSON, which is used for encoding per the guidance in [RFC7951].¶
A.1. The "generic-schedule-params" Grouping
Figure 10 illustrates the example of a requested schedule that needs to start no earlier than
08:00 AM, January 1, 2025 and end no later than 8:00 PM, January 31, 2025 (Beijing time).
Schedule requests that fail to meet the requirements are ignored by the system, as indicated by
"discard
To illustrate the difference between "max
A.2. The "period-of-time" Grouping
Figure 12 shows an example of a period that starts at 08:00:00 UTC on January 1, 2025 and ends at 18:00:00 UTC on December 31, 2027.¶
An example of a period that starts at 08:00:00 UTC on January 1, 2025 and lasts 15 days and 5 hours and 20 minutes is encoded as shown in Figure 13.¶
An example of a period that starts at 2:00 AM in Los Angeles on November 19, 2025 and lasts 20 weeks is depicted in Figure 14.¶
A.3. The "recurrence-basic" Grouping
Figure 15 indicates a recurrence of every 2 days, which starts immediately and repeats forever:¶
A.4. The "recurrence-utc" Grouping
Figure 16 indicates a recurrence from 8:00 AM to 9:00 AM every day, from December 1 to December 31, 2025 in UTC:¶
A.5. The "recurrence-with-time-zone" Grouping
Figure 17 indicates a recurrence of every 2 hours for 10 occurrences that lasts 10 minutes and starts at 3 PM on December 1, 2025 in New York:¶
A.6. The "recurrence-utc-with-periods" Grouping
Figure 18 indicates a recurrence that occurs every two days starting at 9:00 AM and 3:00 PM for a duration of 30 minutes and 40 minutes, respectively, from 2025-06-01 to 2025-06-30 in UTC:¶
A.7. The "recurrence-time-zone-with-periods" Grouping
Figure 19 indicates a recurrence that occurs every 30 minutes and lasts for 15 minutes from 9:00 AM to 5:00 PM and two extra occurrences at 6:00 PM and 6:30 PM with each lasting for 20 minutes on 2025-12-01 (New York):¶
A.8. The "icalendar-recurrence" Grouping
Figure 20 indicates 10 occurrences at 8:00 AM (EST) every last Saturday of the month starting in January 2024:¶
Figure 21 is an example of a recurrence that occurs on the last workday of the month until December 25, 2025, starting January 1, 2025:¶
Figure 22 indicates a recurrence that occurs every 20 minutes from 9:00 AM to 4:40 PM (UTC), with the exclusion of the occurrence starting at 10:20 AM on 2025-12-01:¶
A.9. The "schedule-status" Grouping
Figure 23 indicates the scheduled recurrence status of Figure 22 at the time of 12:15 PM on 2025-12-01 (UTC):¶
At the time of 12:15 PM on 2025-12-01 (UTC), the recurring event occurred at (note that the occurrence at 10:20 AM is excluded): 9:00, 9:20, 9:40, 10:00, 10:40, 11:00, 11:20, 11:40, and 12:00. The last occurrence was at 12:00, and the upcoming one is at 12:20.¶
Appendix B. Examples of Using/Extending the "ietf-schedule" Module
This non-normative section shows two examples for how the "ietf-schedule" module can be used or extended for scheduled events or attributes based on date and time.¶
B.1. Example: Schedule Tasks to Execute Based on a Recurrence Rule
Scheduled tasks can be used to execute specific actions based on certain recurrence rules (e.g.,
every Friday at 8:00 AM). The following example module, which "uses" the "icalendar
B.2. Example: Schedule Network Properties to Change Based on Date and Time
Network properties may change over a specific period of time or based on a
recurrence rule, e.g., [RFC9657].
The following example module, which augments the "recurrence
Figure 24 shows a configuration example in XML [W3C.XML1.0] of a link's bandwidth that is scheduled between 2025-12-01 0:00 UTC to the end of 2025-12-31 with a daily schedule. In each day, the bandwidth value is scheduled to be 500 Kbps between 1:00 AM to 6:00 AM and 800 Kbps between 10:00 PM to 11:00 PM. The bandwidth value that is not covered by the period above is 1000 Kbps.¶
Appendix C. Examples of Using the "ietf-schedule" Module for Scheduled Use of Resources Framework
This section exemplifies how the architecture for supporting scheduled
reservation of Traffic Engineering (TE) resources in [RFC8413] might leverage the "period
The following example module shows how a scheduled link capacity reservation could be defined.¶
Section 4 of [RFC8413] defines the reference architecture for scheduled use of resources. The service requester sends a request to a Path Computation Element (PCE) and includes the parameters of the Label Switched Path (LSP) that the requester wishes to supply. The configuration example to provide the scheduled resource is shown in Figure 25.¶
Acknowledgments
This work is derived from [YANG-NAC]. There is a desire from the OPSAWG to see this module separately defined for wide use in scheduling context.¶
Thanks to Adrian Farrel, Wei Pan, Tianran Zhou, Joe Clarke, Steve Baillargeon, Dhruv Dhody, Robert Wilton, and Italo Busi for their valuable comments and inputs to this work.¶
Many thanks to the authors of [YANG-SCHEDULE], [YANG-OAM], and [NETMOD
Other related efforts were explored in the past, e.g., [YANG
Thanks to Reshad Rahman for the great YANG Doctors review, Mahesh Jethanandani for the AD review, Per Andersson for the OPSDIR review, Peter Yee for the GENART review, and Acee Lindem for the RTGDIR review.¶
Thanks to Éric Vyncke, Erik Kline, and Mike Bishop for the IESG review.¶