]> Huawei

zhangli344@huawei.com

Huawei

jie.dong@huawei.com

Orange

mohamed.boucadair@orange.com

Routing Time-Variant Routing schedule YANG module applicability Time-Variant Routing (TVR) is a routing system that can support the predicted topology changes caused by internal or external reasons. Typical use cases include resource preservation networks, operating efficiency networks and dynamic reachability networks. This document provides examples of how to implement the TVR scheduling capabilities for key use cases. It describes which part of the TVR data model is used and why, and it outlines operational and security considerations when deploying TVR-based technologies. Discussion Venues Discussion of this document takes place on the Time-Variant Routing Working Group mailing list (tvr@ietf.org), which is archived at . Source for this draft and an issue tracker can be found at .

Introduction The Time-Variant Routing (TVR) Working Group addresses a growing need in modern network environments where predictable variations in topology - such as the restoration, activation, or loss of network elements, are part of normal operations. This approach is essential in dynamic networks with mobile nodes, where links may be frequently disrupted and re-established due to mobility or in networks with highly predictable traffic patterns, where links may be powered down to conserve or reduce energy. This document provides examples of implementing TVR scheduling capabilities in identified use cases. It demonstrates the applicability of the TVR data model, methods for disseminating the TVR schedules, and the necessary IETF ancillary technologies for network environments, such as time synchronization and policy, that support TVR capabilities.

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 when, and only when, they appear in all capitals, as shown here.

Applicability of TVR Yang Model The TVR data model defines the TVR node YANG module and TVR topology YANG module. This clause discusses the applicability of these two modules separately.

Applicability of TVR Node YANG Module As specified in , module ietf-tvr-node.yang is a device model and designed to manage a single node with scheduled attributes. It is not necessary in all TVR use cases. The applicability of TVR node YANG module depends on whether changes in the attributes of network devices are caused by the environment or centrally controlled.

• When the changes are caused by the environment changes (such as movement, sunlight changes, and weather changes) or the devices themselves decisions, the network device does not need to get the managed information through the YANG module. For example, when two nodes's distance is too fat to establish connection, then the link is down. Another case is that when the weather is not good and leading to the link degradation, then the nodes decide to disconnect the link.
• When the changes are caused by the centralized control (such as a controller, or an orchestrator), the devices themselves does not know when to adjust the attributes. In this case, the scheduled attributes changes should be delivered to the network devices through TVR node YANG module.

Applicability of TVR Topology YANG Module As specified in , module ietf-tvr-topology.yang describes a network topology with a time-variant availability schedule. This YANG module is also not applicable for all TVR use cases. According to the description of , the scheduling generation locality and execution locality may be centralized or distributed.

• When the schedules are generated and executed in distributed manner, which means that each node generates and executes its specific schedules. In this scenario, the topology YANG module is not necessary, the devices can collect topology schedules by other means. This scenario is outside of the scope of this document.
• When the schedules are generated and executed in centralized manner and within the same device, the topology YANG module is also not applicable. Therefore, this scenario is also outside of the scope of this document.
• When the schedules are generated and executed in centralized manner but on different devices. For example, the schedule is generated by the managing device, and executed by the network controller. In this scenario the scheduled topology changes need to be sent to the execution device through the topology YANG module. This scenario is called "Centralized Scenario".
• When the schedules are generated in a centralized manner and executed in a distributed manner, the YANG module needs to be used to deliver the scheduled topology changes to the managed device. This scenario is called "Distributed Scenario".

Interactions in Centralized Scenario In the centralized scenario, the network managing device generates and maintains schedules, the routing application is deployed in the network controller, and the network devices execute the schedules and routing results. The following figure shows the components of the centralized scenario.

Components of Centralized Scenario | Network Devices | +----------------------+ +-------------------+ ]]>

A centralized scenario involves the interaction between the managing device and network controller, the managing device and network devices, and the controller and network devices. The managing device may need to deliver node-specific schedules to network devices by TVR Schedule Node YANG module . This is optional and only necessary when the node attribute changes are instructed by the controller. In the meanwhile, the network devices need to report their own status data to the managing device. The managing device needs to deliver the schedules of network topology to the network controller by the TVR Network Topology YANG module , so that the routing application in the controller can consider the impact of topology changes on routes when calculating routes. The network controller should deliver the route calculation results to the network devices. The format of the routing results depend on the protocols deployed (The typical protocols include BGP, PCEP, etc.). The routing results for a period in the future could be sent to the network devices in wall-clock time or be packed and sent at some special points.

Interactions in Distributed Scenario In the distributed scenario, the managing device generates and maintains schedules, the routing application is deployed in the network devices which also executes schedules and route calculation.

Components of Distributed Scenario

The distributed model only involves the interaction between managing devices and network devices(managed devices). The managing device need to deliver network topology schedules to all the network devices by TVR Network Topology Yang module for route calculation. The managing device may also need to deliver node-specific schedules to network devices by TVR Schedule Node YANG module, this is optional and only necessary when the node attributes changes are instructed by the controller. The network devices need to report their own status data to the managing device.

Encoding of the YANG Model The TVR data model can manage network resources and topologies with scheduled attributes. There are modules defined in the TVR data model, these are:

• The “ietf-tvr-schedule” module contains the schedule YANG definitions. This module uses groupings from data model;
• The “ietf-tvr-topology” module defines a network topology with a time-variant availability schedule;
• The “ietf-tvr-node” module is to be used to manage the scheduled attributes of a single node.

To create a schedule, the following TVR data model objects and subsequent branches are used:

• ‘node-schedule’
• ‘interface-schedule’
• ‘attribute-schedule’

A TVR scenario example is provided below, where a wireless link is shut down for 12 hours, from 19:00 to 7am the next day. The schedule is identified using a unique identifier that is conveyed in ‘schedule-id’, and the recurring schedule can be applied for multiple days using Coordinated Universal Time (UTC). More detailed examples of the json code is provided in this documents Appendix. The methods for disseminating and propagating the generated schedules are discussed in the following subsections.

Management Protocols for TVR The TVR data model is designed to be accessed via YANG-based management protocols such as NETCONF , RESTCONF and CORECONF. This section discusses the applicability of these protocols for configuring time-variant network resources using the TVR YANG data models. NETCONF provides a robust mechanism for managing complex network configurations, particularly when transactional integrity and operational consistency are required. Its ability to execute atomic transactions ensures that schedules involving multiple resources are applied fully, preventing partial updates that could lead to configuration inconsistencies. This feature is important for time-sensitive scheduling in TVR environments. Additionally, NETCONF supports the validation of configurations prior to commitment, allowing operators to verify the correctness of schedules before they are applied. It also includes rollback capabilities, such as restoring a previous configuration during scheduling errors. In contrast, RESTCONF offers a simpler, stateless method for interacting with network devices, making it suitable for use cases requiring lightweight, rapid configuration. RESTCONF utilizes a RESTful interface over HTTP, providing a streamlined approach to network configuration and management. Therefore, RESTCONF may be advantageous in scenarios where quick adjustments to schedules are needed or where integration with web-based or cloud-native systems is a priority. CORECONF provides a lightweight, stateless method for managing small network devices where saving bytes to transport a message is very important. CORECONF uses CoAP methods to access structured data defined in YANG which is a complementary to RESTCONF. Contrary to RESTCONF, CORECONF many design decisions are motivated by the saving of bytes. Therefore, CORECONF is advantageous in networks with constrained devices and very limited transmission bandwidth, especially in IoT devices that already deployed CoAP. Depending on the type of node in the TVR network, NETCONF would be the preferred protocol for large-scale, critical scheduling operations requiring validation and rollback mechanisms. For smaller-scale or isolated scheduling tasks, RESTCONF provides an efficient and straightforward option without the need for the transactional features offered by NETCONF. CORECONF is preferred in resource constrained IoT networks where saving message bytes is a priority. The choice of protocol to use with the TVR YANG model should be driven by the specific requirements of the network environment and the complexity of the scheduling tasks involved. The security aspects of these management protocols, including their strengths and weaknesses, are discussed further in of this document.

Time Synchronization Time Synchronization is fundamental for ensuring that TVR mechanisms, which depend on highly accurate timing, function as intended across an entire network. Misalignment in time could lead to serious routing issues, including inefficiency in path forwarding, instability in routing tables, and traffic outages. Time Synchronization mechanisms will be used to ensure:

• Coordination of Planned Network Events;
• Verification of TVR Data Model Time Stamps
• Accurate Scheduling of Paths;
• Fault Tolerance.

Different time-variant scenarios may require different granularities of time synchronization. For example, the period of traffic and topology changes in tidal networks is usually a day or week. Therefore, a second-level time synchronization is enough. However, for the dynamic reachability scenarios, a fine-granularity time synchronization may be necessary, as the nodes may moving very fast in some cases (the moving speed of a low earth orbit satellite is more than 7900 m/s) Existing clock synchronization protocols can be classified into hardware-based protocols and software-based protocols. Hardware-based protocols often rely on dedicated hardware to ensure clock synchronization, such as Satellite Based Timing Service (SBTS) and Precision Time Protocol (PTP). The SBTS includes but not limited to Global Position System (GPS), BeiDou Navigation Satellite System(BDS), Global Navigation Satellite System(GLONASS), and Galileo satellite navigation system. Software-based protocols, on the other hand, synchronize clocks through software packages running on systems, such as Network Time Protocol (NTP) and Simple Network Time Protocol (SNTP) . The security aspects of time synchronization mechanisms are discussed further in of this document.

Hardware-based Time Synchronization Mechanisms Hardware-based protocols typically have higher precision and stability, but also have higher cost due to the dedicated hardware. SBTS and PTP are the typical hardware-based time synchronization mechanisms. SBTS provides a precise time synchronization service based on the signals transmitted by the satellites. SBTS can realize the micro-second level time synchronization among the devices installed with SBTS reviver hardware. PTP is a network protocol that complies with the IEEE 1588 standard and is used to implement high-precision time synchronization between network nodes. PTP implements time synchronization by transmitting synchronization messages between master and slave devices. Based on the hardware timestamp, the precision of time synchronization is much higher than that of NTP, and can reach the sub-microsecond level or even tens of nanoseconds. When deploying PTP in TVR networks, the managing devices should be the master and the network devices and controller should be the slaves which get time from the master. Both SBTS and PTP can realize micro-second level time synchronization. Depending on the features of TVR network, the SBTS would be the preferred mechanisms for large-scale, high dynamic and open-air networks, especially networks with unreliable links as it does not require network links to exchange time information. For the small-scale networks with stable links but have high-precision time synchronization requirements, the PTP is much preferred.

Software-based Time Synchronization Protocols Software-based protocols are simple and applicable to common hardware devices, but have lower precision (For example, the NTP can realize the synchronization at tens of milliseconds level).

NTP NTP uses a hierarchical structure of time sources. Each level of this hierarchy is termed a stratum. Generally, an NTP server synchronized to an authoritative clock runs at stratum 1. Such NTP server functions as the primary time server to provide clock synchronization for other devices on the network. Stratum 2 servers obtain time from stratum 1 servers, stratum 3 servers obtain time from stratum 2 servers, and so on. In TVR use cases, the managing device functions as a level-1 NTP server and synchronized to an authoritative clock source. The network controller and network devices behave as clients to obtain accurate time from the managing device. shows an NTP deployment scenario for obtaining clock from a GPS clock source.

Deployment Case of NTP in Tidal Networks

NTP is preferred in large-scale networks with reliable links and long-term changes, which dose not require a high-precision time synchronization.

SNTP SNTP is a subset of the NTP used to synchronize computer clocks in the Internet. It simplifies the complex NTP synchronization function and has lower clock precision, but the synchronization precision still can be guarded under seconds. SNTP is also preferred in large-scale networks with reliable links, long-term changes, and loose synchronization precision. In addition, it is more suitable for networks with limited resources than NTP.

Schedule Database The schedule database is used to store and maintain schedules, the database may be deployed on a managing device and managed devices based on requirements. The source of the schedule database may be diversified, for example, configuration from an administrator or YANG model from the management interface. The schedule entries of different databases may be different, but the content of the same schedule entry in the schedule databases of different devices in the same domain must be consistent. There are at least two ways to make the content of the same schedule entry in different schedule databases consistent:

• All the schedule entries are generated at a specific device;
• Schedule entries are generated at different devices, but there is a synchronization mechanism to synchronize the schedule databases among devices.

Option 1 is simplest and easy to implement. In a time-variant domain, the managing device may receive scheduling requests and generate all schedule entries. Then the schedule entries are delivered to the necessary network devices in the domain through the TVR YANG model. Option 2 relies on advertisement mechanisms (such as routing techniques) to advertise the scheduling data generated by itself to other devices. This could be achieved using extensions to existing routing schemes and techniques. These options will be discussed with the TVR Working Group, and agreed approaches will be documented in future versions of this Internet Draft.

Data Structure defines a TVR Node and TVR Topology YANG modules. The Node YANG module includes node power schedules and interface schedules. The Topology YANG module includes node schedules and link schedules. Based on the preceding four schedule types, the schedule database should contain four types of schedule entries in different formats:

• Node power schedule entry;
• Interface schedule entry;
• Node schedule entry;
• Link schedule entry;

The detailed format and fields of different types of schedule entries could reference to the definitions of the corresponding YANG modules. Editor’s note: Code examples will be provided here in future versions of this document.

Schedule Operations This section provides general requirements for using the TVR schedules. The schedule database should support the add, update, and delete operations. When adding or updating a schedule entry, the execution node needs to check whether resource conflicts exist between the current schedule and existing schedules. If a conflict exists, the operation should be failed. Schedules are updated and deleted based on schedule IDs. Therefore, schedule IDs must be unique in a time-variant domain. This can be handled, e.g., by a dedicated allocation agent within the time-variant domain. Editor’s note: Future versions of this document will expand on the schedule operations requirements and best practices.

Operational Considerations Several operational considerations exist when using TVR techniques and data models in a network. This section provides some high-level observations and more detailed sub-sections for specific consideration related to schedule dissemination, execution, and recovery in case of failure to apply a schedule or partial change.

• Coordinated Network Events: TVR often coordinates routing changes anticipating events like predictable low-traffic periods or link downtimes (e.g., scheduled maintenance or traffic demand).
• Accurate Scheduling of Paths: TVR schedules capable routers and network nodes will dynamically adjust forwarding paths based on planned changes in link availability or network conditions.
• Time-Stamped Data Models: TVR will require the use time-stamped data models (e.g., schedules for link changes or availability windows) to make interface management decisions. This ensures that all TVR nodes interpret the timing of events consistently and implement time-based policies correctly.

Therefore, network time accuracy and time-stamped data models are critical to ensure that coordinated network events and scheduled path decisions across the network are based on a consistent time reference. Without accurate time sync, nodes could apply different schedules, causing routing inconsistencies, path flapping, or packet loss.

Schedule Dissemination when distributing schedules, the following problems should be considered:

• The managed devices that receives a schedule should have the ability to execute the schedule. It is meaningless to send a schedule to a managed device that does not have the ability to execute the schedule. If the device does not support schedule execution, it must ignore it on receipt.
• Before distributing schedules to a managed device, the managing device need to ensure that the time of the managing device is synchronized with that of the managed device. If the time is not synchronized, the schedules will be executed at a wrong timepoint and may causing unexpected network faults.
• The distributing of a schedule should be earlier than the earliest start time of the schedule, this ensures that the managed device has enough time to execute this schedule.

Schedule Execution Schedule execution means that a component (e.g., device) undertakes an action (e.g., allocates and deallocates resources) at specified time points. The schedule execution of Node Module and Topology Module should be considered separately.

Execution of Node Schedule Node schedule execution indicates a node to change its node/interfaces availability/power up and down, and other attributes directly or by commands. when executing a node schedule, the schedule executor should undertake an action at specified time points as indicated in the schedule.

Execution of Topology Module Schedule Topology schedule execution means a node take some measures before or upon the scheduled topology changes. The schedule executor should understand the consequences of the schedule execution. The addition and deletion of the topology need to be considered separately. A link coming up or a node joining a topology should not have any functional change until the change is proven to be fully operational. The routing paths may be pre-computed but should not be installed before all the topology changes are confirmed to be operational. The benefits of this pre-computation appear to be very small. The network may choose to not do any pre-installation or pre-computation in reaction to topological additions at a small cost of some operational efficiency. Topological deletions are an entirely different matter. If a link or node is to be removed from the topology, then the network should act before the anticipated change to route traffic around the expected topological change. Specifically, at some point before the planned topology change, the routing paths should be pre-computed and installed before the topology change takes place. The required time to perform such planned action will vary depending on the exact network and configuration. When using an IGP or other distributed routing protocols, the affected links may be set to a high metric to direct traffic to alternate paths. This type of change does require some time to propagate through the network, so the metric change should be initiated far enough in advance that the network converges before the actual topological change. In addition to the addition and deleting of topology, a schedule may indicate the attributes change of some links, such as bandwidth and delay. If an attribute changes better (such as latency decrease and bandwidth increase), then the executer should take actions later or until the topology change is proven to be fully operational. If an attribute changes worse (such as latency increase and bandwidth decrease), then the node should react to it before the change take place.

Schedule Recovery Schedule recovery means when a node lost its specific schedule data, it should be able to recover these schedule data. Typical scenarios include data loss due to device restart, disconnection from managing devices and failure to receive new schedules for a long time. In these scenarios, once the connection between the managed device and the managing device is established again, the managing device needs to re-distribute all schedules that start time is later than the current moment to the managed device after time synchronization is finished.

Error Handling

Consistency Error Consistency error means that some time parameters conflict with other time parameters in the same schedule or in other schedules.

• If the time parameters of a schedule conflict with each other, for example, the period-start bigger than period-end, the duration is longer than the product of frequency and interval, or the duration is longer than utc-until, then the schedule should be discarded and an error should be returned to the managed device.
• If there is a conflict between schedules, for example, schedule1 indicates that interface B is closed at time A, but schedule2 indicates that interface B is open at time A, then all conflicting schedules should be discarded and an error should be returned to the managed device.

Editor's Note: multi-manager scenarios need to be considered.

Security Considerations The integration of time-variant mechanisms in network operations presents distinct security challenges that require thorough analysis to safeguard the network’s integrity, availability, and confidentiality. Networks that rely on time-sensitive data for routing and forwarding decisions are particularly susceptible to attacks that exploit timing dependencies. The "Security Considerations" section of outlines various threat vectors and categories specific to time-variant environments.

Denial-of-Service (DoS) Attack In a time-variant network, malicious actors could attack the network by disrupting or manipulating the time synchronization process. For example, an attacker could intentionally delay or corrupt time signals exchanged within the network, leading to routing errors and widespread denial-of-service (DoS) attacks. This kind of attack could be mitigated by the redundancy time synchronization mechanisms, for example, multiple NTP sources or multiple time synchronization protocols could be deployed in a TVR network. The network devices could guarantee the correctness of the time by checking whether the time signals from different sources or protocols. In addition, the identification authentication is also an important way to protect the time signals being tampered by attackers. Some security extensions for time synchronization protocols (such as NTS (Network Time Security)) are recommended to be applied.

Traffic Analysis and Path Prediction In a time-variant network, if time information is not adequately protected, attackers could conduct traffic analysis to infer routing decisions, network load, or usage patterns. The schedule ability could enable attackers to launch highly targeted attacks, such as selectively overloading certain links or intercepting sensitive communications. This kind of attack could be mitigated by the encryption of schedules and the authentication of managing devices. For the networks using NETCONF to deliver schedules, NETCONF over TLS is recommended to achieve the bidirectional authentication and encryption of YANG model data. RESTCONF supports TLS originally, so it can be deployed without additional configurations or modifications. In addition, in time variant networks with centralized scenario, the encryption of routing path information is also necessary to avoid the fake routing information. Considering the most typical protocols used to deliver the routing path information between controller and network devices are BGP and PCEP, and both are based on TCP. Therefore, the TLS is recommended to be applied for the conservation.

Activity Identification and Privacy In certain scenarios, precise time information exchanged within the network could be correlated with specific user or device behavior, inadvertently revealing private information. This risk could also be mitigated by the solutions mentioned in .

Spoofing and Manipulation of Time Information In a time-variant network, if an attacker were to inject false or manipulated time data into the network, it could cause routers and devices to make incorrect decisions, potentially leading to traffic misrouting, network partitions, or inefficient use of resources. This risk could also be mitigated by the solutions mentioned in .

Replay Attacks on Time-Sensitive Data Time-variant network data and schedules updates may be susceptible to replay attacks, which could cause network devices to act on outdated information, leading to inconsistent routing decisions, misaligned schedules, or security gaps. In particular, attackers could exploit replay attacks to force devices into outdated configurations or interfere with the synchronization of schedules across the network. This kind of attack could be mitigated by encrypting time signals, schedules and routing path data, and adding a unique number to the encrypted section of a packet. This has been implemented in existing protocols, for example, the NTS supports unique identifier extension field (EF) containing a random number, the TLS supports Message Authentication Code generated from sequence number.

Compromised Time Sources The reliance on external time sources for synchronization purposes presents a potential attack surface for time-variant networks. If a trusted time source, such as a GPS signal or an NTP server, is compromised, the attacker could feed erroneous time information to the entire network, disrupting its operation. This kind of attack could be mitigated by the solutions mentioned in .

IANA Considerations This document has no IANA actions.

References Normative References In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Futurewei Technologies Arrcus, Inc. LabN Consulting, L.L.C. LabN Consulting, L.L.C. Viagenie The YANG model in this document includes three modules, and can be used to manage network resources and topologies with scheduled attributes, such as predictable link loss and link connectivity as a function of time. The intent is to have this information be utilized by Time-Variant Routing systems. This document introduces use cases where Time-Variant Routing (TVR) computations (i.e., routing computations that take into consideration time-based or scheduled changes to a network) could improve routing protocol convergence and/or network performance. Informative References JHU/APL Thales Alenia Space Futurewei Technologies Ori Industries Huawei This document introduces use cases where Time-Variant Routing (TVR) computations (i.e. routing computations taking into considerations time-based or scheduled changes to a network) could improve routing protocol convergence and/or network performance. Lancaster University Telefonica JHU/APL Huawei Time-Variant Routing (TVR) refers to calculating a path or subpath through a network where the time of message transmission (or receipt) is part of the overall route computation. This means that, all things being equal, a TVR computation might produce different results depending on the time that the computation is performed without other detectable changes to the network topology or other cost functions associated with the route. This document introduces requirements where TVR computations could improve message exchange in a network. Huawei Huawei Orange Lancaster University This document defines common types and groupings that are meant to be used for scheduling purposes such as event, policy, services, or resources based on date and time. For the sake of better modularity, the YANG module includes a set of recurrence related groupings with varying levels of representation (i.e., from basic to advanced) to accommodate a variety of requirements. It also defines groupings for validating requested schedules and reporting scheduling status. The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices. It uses an Extensible Markup Language (XML)-based data encoding for the configuration data as well as the protocol messages. The NETCONF protocol operations are realized as remote procedure calls (RPCs). This document obsoletes RFC 4741. [STANDARDS-TRACK] This document describes an HTTP-based protocol that provides a programmatic interface for accessing data defined in YANG, using the datastore concepts defined in the Network Configuration Protocol (NETCONF). Trilliant Networks Inc. consultant IMT Atlantique YumaWorks Universität Bremen TZI This document describes a network management interface for constrained devices and networks, called CoAP Management Interface (CORECONF). The Constrained Application Protocol (CoAP) is used to access datastore and data node resources specified in YANG, or SMIv2 converted to YANG. CORECONF uses the YANG to CBOR mapping and converts YANG identifier strings to numeric identifiers for payload size reduction. CORECONF extends the set of YANG based protocols, NETCONF and RESTCONF, with the capability to manage constrained devices and networks. The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for use with constrained nodes and constrained (e.g., low-power, lossy) networks. The nodes often have 8-bit microcontrollers with small amounts of ROM and RAM, while constrained networks such as IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs) often have high packet error rates and a typical throughput of 10s of kbit/s. The protocol is designed for machine- to-machine (M2M) applications such as smart energy and building automation. CoAP provides a request/response interaction model between application endpoints, supports built-in discovery of services and resources, and includes key concepts of the Web such as URIs and Internet media types. CoAP is designed to easily interface with HTTP for integration with the Web while meeting specialized requirements such as multicast support, very low overhead, and simplicity for constrained environments. The Network Time Protocol (NTP) is widely used to synchronize computer clocks in the Internet. This document describes NTP version 4 (NTPv4), which is backwards compatible with NTP version 3 (NTPv3), described in RFC 1305, as well as previous versions of the protocol. NTPv4 includes a modified protocol header to accommodate the Internet Protocol version 6 address family. NTPv4 includes fundamental improvements in the mitigation and discipline algorithms that extend the potential accuracy to the tens of microseconds with modern workstations and fast LANs. It includes a dynamic server discovery scheme, so that in many cases, specific server configuration is not required. It corrects certain errors in the NTPv3 design and implementation and includes an optional extension mechanism. This memorandum describes the Simple Network Time Protocol Version 4 (SNTPv4), which is a subset of the Network Time Protocol (NTP) used to synchronize computer clocks in the Internet. SNTPv4 can be used when the ultimate performance of a full NTP implementation based on RFC 1305 is neither needed nor justified. When operating with current and previous NTP and SNTP versions, SNTPv4 requires no changes to the specifications or known implementations, but rather clarifies certain design features that allow operation in a simple, stateless remote-procedure call (RPC) mode with accuracy and reliability expectations similar to the UDP/TIME protocol described in RFC 868. This memorandum obsoletes RFC 1769, which describes SNTP Version 3 (SNTPv3), and RFC 2030, which describes SNTPv4. Its purpose is to correct certain inconsistencies in the previous documents and to clarify header formats and protocol operations for NTPv3 (IPv4) and SNTPv4 (IPv4, IPv6, and OSI), which are also used for SNTP. A further purpose is to provide guidance for home and business client implementations for routers and other consumer devices to protect the server population from abuse. A working knowledge of the NTPv3 specification, RFC 1305, is not required for an implementation of SNTP. This memo provides information for the Internet community. The Network Configuration Protocol (NETCONF) provides mechanisms to install, manipulate, and delete the configuration of network devices. This document describes how to use the Transport Layer Security (TLS) protocol with mutual X.509 authentication to secure the exchange of NETCONF messages. This revision of RFC 5539 documents the new message framing used by NETCONF 1.1 and it obsoletes RFC 5539. China Mobile China Mobile The SDO 3GPP has done tremendous work to either standardize or study various types of wireless services that would depend on the satellite constellation network. While the ISLs, or Inter-Satellite Links, along with the routing scheme(s) over them are critical to help fullfil the satellite services, the 3GPP considers them out-of-scope. This leaves the significant work to be explored in the IETF domain. This draft stems from the 3GPP satellite use cases that have been studied for many years up to now, across a couple of releases, and lands on summarizing the challenges & considerations of the satellite-based routing. Based on some unique & advantageous characteristics associated with satellite networks, the draft raises briefly the general routing considerations for the integrated Non- Terrestrial & Terrestial Networks.

Acknowledgments TBD

Appendix A: Code Examples

Code Examples for “Energy-harvesting Wireless Sensor Network” As described in , in an energy-harvesting wireless sensor network, nodes rely exclusively on environmental sources for power, such as solar panels. On-board power levels may fluctuate based on various factors. This example assumes that a node will only power its radio when available power is over some threshold. In this scenario, the TVR Node Yang Module is not applicable, since the node attributes changes are caused by the environment, not by the instructions from managing device. The TVR Topology Yang Module may be necessary to convey the schedule of topology changes to all the nodes. Considering a topology with three nodes, the connectivity of this three-node networks changes over time and repeats daily. The detailed change information is shown in . The link between node1 and node2 is powered on at 8:00 and powered off at 11:00. The link between node2 and node3 is powered on at 11:00 and powered off at 16:00.

An example of topology connectivity of Energy-harvesting Wireless Sensor Network

The corresponding json example is shown in .

Json code of topology schedule for Energy-harvesting Wireless Sensor Network

Code Examples for "Cellular Network" As described in , the "Cellular Network" is a network where the nodes operating over cellular connections that charge both peak and off-peak data rates. In this case, individual nodes may be allocated a fixed set of "peak" minutes such that exceeding that amount of time results in expensive overage charges. As a result, links are just available at specific "peak" minutes. In this scenario, both the TVR node YANG module and TVR topology YANG module are applicable to manage the state of node interfaces and deliver the predicted topology changes to each node. Considering a topology with three nodes, the connectivity variation of it is shown in . Taking the node1 as an example, the corresponding node YANG module json code for node1 is shown in

TVR node YANG module json code of node1

The corresponding topology yang module json code is the same as

Code Examples for “Tidal Network” As described in , the "Tidal Network" is a network where traffic volume undergoes significant fluctuations at different times. In the context of a tidal network scenario, energy-saving methods may include the deactivation of some or all components of network nodes as planned. In this scenario, both the TVR node YANG module and TVR topology YANG module are applicable to manage the state of node (interfaces) and deliver the predicted topology changes to each node. shows a tidal network topology with 4 nodes.

An example topology of Tidal Network

Taking the node N1 as an example, assuming the node-ids of N1, N2, N3, N4 are 192.168.0.1, 192.168.0.2, 192.168.0.3, and 192.168.0.4. The corresponding node YANG module json code for it is shown in

TVR node YANG module json code of node N1

The corresponding topology YANG module json code is shown in

Json code of topology schedule for Tidal Network

Code Examples for “Mobile Satellites” As described in , the "Mobile Satellites" generally refers to the Low Earth Orbit(LEO) network, which includes hundreds to thousands of spacecrafts that can communicate both with their orbital neighbors as well as down to any ground station that they happen to be passing over. The connection between the spacecrafts and the ground station depend on the flight trajectories of the spacecrafts, so the link changes between them is predictable. introduces a scenario with 3 spacecrafts and 1 ground station. The changes of topology are shown in . The ground station connects to spacecraft N3 at time t1, connects to N2 at time t2, and connects to N1 at time t3. The duration of the connection depends on the satellite altitude and the elevation angle. According to , for the spacecrafts at the 500km altitude, and the connection between the spacecraft and ground station can keep for 7 minutes.

An example topology for Mobile Satellites

In this scenario, the TVR topology YANG module is applicable to deliver the predicted topology changes to each node. However, the TVR node YANG module is not applicable, this depends on whether the link changes are controlled by satellites themselves or by the managing device. Here, we provide the json codes for TVR topology YANG module and node YANG module as a reference. Taking the spacecraft N1 as an example, assuming the time t1 is 10:00:00 1 July 2025 and the node-ids of N1, N2, N3, and ground station is 192.168.0.1, 192.168.0.2, 192.168.0.3, and 192.168.0.4., then the corresponding node YANG module json code for it is shown in .

TVR node YANG module json code of spacecraft N1

Assuming that time t1 is 10:00:00 1 July 2025, time t2 is 10:10:00 1 July 2025, and time t3 is 10:20:00 1 July 2025, then the corresponding topology YANG module json code is shown in .

Json code of topology schedule for Mobile Satellites

Code examples for “Predictable Moving Vessels” As described in , the "Predictable Moving Vessels" involves the movement of vessels with predictable trajectories, such as ferries or planes. These endpoints often rely on a combination of satellite and terrestrial systems for Internet connectivity. Consider a scenario where a vessel uses satellites to access the Internet, including a ship and three satellites. As the satellite and the vessel move, the vessel establishes connections with the satellites N1, N2, and N3 at t1, t2, and t3 respectively. It is assumed that each connection lasts for 1 minutes. The changes of topology are shown in .

An example topology for Predictable Moving Vessels

This scenario is quite similar to the "Mobile Satellites" example, so the TVR node YANG module json code and topology YANG json code of this scenario can refer to the json code of the "Mobile Satellites" example.

Contributors Lancaster University

United Kingdom d.king@lancaster.ac.uk

Lancaster University

c.rotsos@lancaster.ac.uk

China Mobile

liupengyjy@chinamobile.com

Juniper Networks

tony.li@tony.li