<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.43 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-zhao-nmrg-ip-optical-ndt-sim-framework-01" category="info" submissionType="IRTF" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="IP-Optical NDT Simulation Framework">A Lightweight Cross-Layer Simulation Framework for IP-Optical Network Digital Twins</title>
    <seriesInfo name="Internet-Draft" value="draft-zhao-nmrg-ip-optical-ndt-sim-framework-01"/>
    <author initials="J." surname="Zhao" fullname="Jing Zhao">
      <organization>China Unicom</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>zhaoj501@chinaunicom.cn</email>
      </address>
    </author>
    <author initials="S." surname="Zhang" fullname="Shuai Zhang" role="editor">
      <organization>China Unicom</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>zhangs366@chinaunicom.cn</email>
      </address>
    </author>
    <author initials="R." surname="Pang" fullname="Ran Pang">
      <organization>China Unicom</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>pangran@chinaunicom.cn</email>
      </address>
    </author>
    <date year="2026" month="November" day="02"/>
    <area>IRTF</area>
    <workgroup>Network Management Research Group</workgroup>
    <abstract>
      <?line 57?>

<t>This document describes a lightweight, event-driven simulation framework for IP-optical Network Digital Twins (NDTs). The framework investigates how optical and transport events propagate across network layers and interact with IP-layer protection, routing convergence, and traffic redistribution.</t>
      <t>The framework integrates three capabilities into a unified simulation process: dependency-aware event propagation, causal coordination of IP and optical behaviors on a common simulation timeline, and fidelity-aware evaluation of the resulting service impacts. Cross-layer dependency uncertainty and model limitations are explicitly considered to avoid unsupported resilience conclusions.</t>
      <t>The framework uses abstract optical and transport states rather than continuous optical propagation models. It reuses existing IETF topology and management information where applicable and supports reproducible what-if analysis, historical incident replay, and protection-strategy comparison. It does not define new network protocols or YANG modules, and simulation results are not directly applied to production networks.</t>
    </abstract>
  </front>
  <middle>
    <?line 65?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>IP and optical transport networks are commonly managed as separate layers. The IP layer provides routing, traffic engineering, Segment Routing, fast reroute, and traffic forwarding, while optical and transport layers provide connectivity, resource allocation, and protection or restoration capabilities.</t>
      <t>Although these layers are operationally distinct, their behaviors are closely coupled. A physical failure may affect multiple IP links, while optical protection may restore connectivity before an IP-layer failure-detection mechanism triggers. Conversely, IP fast reroute or routing convergence may occur while lower-layer restoration is still in progress, potentially causing unnecessary traffic movement or transient congestion.</t>
      <t>Such interactions are difficult to evaluate using an IP-only or optical-only simulation. Static cross-layer topology correlation can identify dependencies but cannot, by itself, explain how protection actions and service impacts evolve over time.</t>
      <t>The main research question addressed by this document is:
* How can a lightweight Network Digital Twin reproduce the causal interactions between optical and IP network behaviors, while accounting for incomplete dependency information and limitations of simplified simulation models?</t>
      <t>To address this question, the framework combines an abstract optical and transport state model with IP-layer behavior simulation through a common cross-layer event mechanism.
The intended contribution is not a new topology model or an additional network control protocol. Instead, it is a simulation methodology for determining which resources are affected by an event, how the resulting network behaviors interact over time, and under which conditions the resulting service-impact estimates can be considered reliable.</t>
      <t>This document builds upon the IRTF NDT reference architecture and can use topology relationships provided by SIMAP and existing IP/optical topology models.</t>
      <t>While these existing efforts provide architectural foundations, topology correlation, and support for what-if analysis, this document focuses on the execution semantics of interacting optical and IP-layer events, uncertainty propagation into dynamic service-impact assessment, and reproducible validation of simulation behavior.</t>
      <t>The framework does not redefine the underlying topology models or their interfaces.</t>
    </section>
    <section anchor="requirements-language">
      <name>Requirements Language</name>
      <t>The key words "<strong>MUST</strong>", "<strong>MUST NOT</strong>", "<strong>REQUIRED</strong>", "<strong>SHALL</strong>", "<strong>SHALL NOT</strong>", "<strong>SHOULD</strong>", "<strong>SHOULD NOT</strong>", "<strong>RECOMMENDED</strong>", "<strong>NOT RECOMMENDED</strong>", "<strong>MAY</strong>", and "<strong>OPTIONAL</strong>" 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.</t>
    </section>
    <section anchor="framework-architecture">
      <name>Framework Architecture</name>
      <section anchor="logical-functions">
        <name>Logical Functions</name>
        <t>The framework contains three logical functions:
* IP Simulation Function (IPSF): Simulates IP-layer behavior, including failure detection, IGP convergence, Segment Routing policy changes, fast reroute, traffic redistribution, and resulting service impacts.
* Lightweight Optical and Transport State Function (LOTSF): Represents optical, OTN, and physical resources using discrete resource states, protection actions, timers, and capacity characteristics. It does not require continuous optical propagation simulation.
* Cross-Layer Correlation Function (CLCF): Maintains cross-layer dependency relationships, translates events between simulation functions, and coordinates event execution using a common causal event timeline.</t>
        <t>The CLCF is the central coordination function. It does not replace production controllers and does not control the production network.</t>
        <figure anchor="fig-1">
          <name>Event-Driven IP-Optical Cross-Layer Simulation Framework</name>
          <sourcecode type="text"><![CDATA[
+-----------------------------------------------------------+
|                   NDT Scenario Context                    |
|                                                           |
| IP/TE Topology | Optical/OTN Resources | Traffic          |
| Dependency Information | Events | Timing Profiles         |
+-----------------------------+-----------------------------+
                              |
                              v
+-----------------------------------------------------------+
|          Cross-Layer Correlation Function (CLCF)          |
|                                                           |
|  +-------------------+  +------------------------------+  |
|  | Dependency Graph  |  | Causal Event Queue           |  |
|  |                   |  |                              |  |
|  | Resource Mapping  |  | Event Ordering               |  |
|  | Shared Risks      |  | Causal Dependencies          |  |
|  | Uncertainty       |  | Cross-Layer Translation      |  |
|  +-------------------+  +------------------------------+  |
+-----------------------------+-----------------------------+
                              |
                +-------------+-------------+
                |                           |
                v                           v
+---------------------------+  +----------------------------+
| Lightweight Optical and   |  | IP Simulation Function     |
| Transport State Function  |  | (IPSF)                     |
| (LOTSF)                   |  |                            |
|                           |  | IP Detection / FRR         |
| Optical / OTN States      |  | IGP / BGP / SR Policy      |
| Protection / Restoration  |  | Routing Convergence        |
| Resource Capacity         |  | Traffic / Service Impact   |
+-------------+-------------+  +--------------+-------------+
              |                               |
              +---------------+---------------+
                              |
                              v
+-----------------------------------------------------------+
|                 Cross-Layer Evaluation                    |
|                                                           |
| Causal Event Trace | Service Impact | Shared-Risk Exposure|
| Dependency Uncertainty | Model Fidelity                   |
| Reproducible Scenario Comparison                          |
+-----------------------------+-----------------------------+
                              |
                              v
                   Advisory Results Only
]]></sourcecode>
        </figure>
        <t>The arrows in Figure 1 represent the logical organization of the framework. During simulation, the CLCF exchanges events and state updates bidirectionally with the IPSF and LOTSF. Result evaluation may also use intermediate states, not only final states.</t>
      </section>
      <section anchor="scenario-context-and-dependency-information">
        <name>Scenario Context and Dependency Information</name>
        <t>Each simulation is associated with a scenario context containing the baseline topology, traffic demands, service objectives, relevant resource dependencies, event inputs, and applicable timing and policy profiles.</t>
        <t>A Cross-Layer Dependency Graph provides the relationships required to determine how lower-layer resource changes may affect IP-layer objects. These relationships can include IP logical links, router interfaces, OTN resources, optical channels, fiber spans, cables, ducts, sites, protection groups, and physical shared-risk objects.</t>
        <t>Dependency information may be incomplete, inferred, or inconsistent across data sources. To represent these conditions, the framework distinguishes four relationship categories:</t>
        <ul spacing="normal">
          <li>
            <t>Verified: A relationship supported by available authoritative or otherwise validated information.</t>
          </li>
          <li>
            <t>Inferred: A relationship derived from indirect evidence or correlation rules.</t>
          </li>
          <li>
            <t>Conflicting: A relationship for which available sources provide incompatible information.</t>
          </li>
          <li>
            <t>Unknown: A relationship that cannot be established using the available inputs.</t>
          </li>
        </ul>
        <t>Dependencies may also carry source provenance, temporal validity, and confidence indications. A confidence indication does not necessarily represent a statistically calibrated probability.</t>
        <t>The CLCF uses these attributes when determining the affected resources of an event. A verified dependency can support a definite impact conclusion under the declared model assumptions, whereas an unknown or conflicting dependency may require alternative hypotheses or an explicitly undetermined result.</t>
        <t>In particular, an unknown lower-layer dependency MUST NOT be interpreted as evidence that two IP paths are physically disjoint.</t>
      </section>
      <section anchor="uncertainty-aware-impact-and-resilience-assessment">
        <name>Uncertainty-Aware Impact and Resilience Assessment</name>
        <t>The Cross-Layer Dependency Graph may contain incomplete, inferred, or conflicting relationships. These conditions can affect both the identification of shared physical risks and the propagation of lower-layer events into IP-layer simulation effects.</t>
        <t>The framework therefore distinguishes uncertainty in dependency evidence from uncertainty in the resulting resilience conclusion.</t>
        <section anchor="dependency-hypotheses">
          <name>Dependency Hypotheses</name>
          <t>When a dependency cannot be uniquely established, the CLCF can construct alternative dependency hypotheses consistent with the available observations and verified relationships.</t>
          <t>Each hypothesis represents a possible cross-layer dependency configuration for the affected part of the network.</t>
          <t>Verified relationships are preserved across admissible hypotheses. Inferred, conflicting, or unknown relationships may produce alternative dependency configurations, subject to known resource and topology constraints.</t>
          <t>The framework does not assign numerical probabilities to these hypotheses unless a separately validated probabilistic model is available.</t>
          <t>Hypothesis evaluation can be limited to the resources relevant to the selected simulation scenario to avoid unnecessary expansion of the entire dependency graph.</t>
        </section>
        <section anchor="three-valued-resilience-assessment">
          <name>Three-Valued Resilience Assessment</name>
          <t>For a given topology snapshot, the CLCF evaluates whether a primary path and a backup path satisfy the physical-diversity requirement within a declared shared-risk scope.</t>
          <t>The assessment produces one of three outcomes:</t>
          <ul spacing="normal">
            <li>
              <t><strong>Verified:</strong> Physical disjointness is established through complete, verified dependency information within the assessment scope, or through exhaustive evaluation showing that all materially admissible dependency hypotheses satisfy the diversity requirement.</t>
            </li>
            <li>
              <t><strong>Violated:</strong> A shared physical-risk object is established by verified evidence, or exhaustive evaluation shows that all materially admissible dependency hypotheses violate the diversity requirement.</t>
            </li>
            <li>
              <t><strong>Undetermined:</strong> Neither physical disjointness nor a violation can be established. This includes cases involving incomplete or conflicting dependencies, differing outcomes across admissible hypotheses, or insufficient hypothesis coverage.</t>
            </li>
          </ul>
          <t>An unknown dependency MUST NOT be interpreted as evidence of physical disjointness. When only a subset of admissible hypotheses has been evaluated, a definitive conclusion requires sufficient independent evidence; otherwise, the result is Undetermined.</t>
          <t>The assessment report identifies the supporting evidence, unresolved dependencies, and relevant assumptions. Here, Verified denotes the physical-diversity assessment outcome rather than the verification status of an individual dependency relationship.</t>
        </section>
        <section anchor="uncertainty-propagation-into-simulation">
          <name>Uncertainty Propagation into Simulation</name>
          <t>Dependency uncertainty is also considered when propagating lower-layer events into IP-layer effects.</t>
          <t>For each admissible dependency hypothesis, the CLCF identifies the potentially affected IP links, paths, and services. The corresponding event effects can then be evaluated using the causal simulation procedure.</t>
          <t>The resulting affected-resource sets may be compared to distinguish:</t>
          <ul spacing="normal">
            <li>
              <t><strong>Confirmed affected resources:</strong> Confirmed affected resources are those whose impact is established by verified dependencies or by exhaustive hypothesis evaluation. If the hypothesis set is incomplete, resources affected under every evaluated hypothesis are reported as common to the evaluated scenarios, rather than definitively affected.</t>
            </li>
            <li>
              <t><strong>Potentially affected resources:</strong> Resources identified as affected under at least one admissible hypothesis.</t>
            </li>
            <li>
              <t><strong>Unaffected resources:</strong> Resources established as unaffected under all relevant admissible hypotheses.</t>
            </li>
          </ul>
          <t>For quantitative service-impact metrics, the framework may report the range of results obtained across the evaluated hypotheses.</t>
          <t>Such ranges are not necessarily statistical confidence intervals. They represent scenario-dependent outcomes under the specified dependency assumptions. They constitute exhaustive bounds only when the evaluated hypotheses cover all material admissible possibilities.</t>
          <t>This distinction allows the framework to avoid producing a single unsupported prediction when dependency information is insufficient.</t>
          <t>Each dependency hypothesis is evaluated using an independent simulation state and causal event queue initialized from the same baseline scenario. Events and state changes produced under one hypothesis do not affect the execution of another hypothesis. Results are aggregated only after the individual hypothesis evaluations are completed.</t>
        </section>
        <section anchor="uncertainty-aware-reporting">
          <name>Uncertainty-Aware Reporting</name>
          <t>A simulation report can include the assessed resilience status, supporting dependency evidence, unresolved dependency relationships, and assumptions used during hypothesis evaluation.</t>
          <t>When service-impact estimates differ between hypotheses, the report identifies the dependencies responsible for those differences.</t>
          <t>The result can therefore distinguish a verified shared-risk violation, a potential shared-risk exposure, and an absence of sufficient evidence to establish physical diversity.</t>
          <t>This mechanism enables dependency uncertainty to influence both the interpretation of cross-layer resilience and the execution of service-impact simulation.</t>
        </section>
      </section>
    </section>
    <section anchor="causal-cross-layer-simulation">
      <name>Causal Cross-Layer Simulation</name>
      <section anchor="causal-event-queue-execution-semantics">
        <name>Causal Event Queue Execution Semantics</name>
        <t>The framework uses a simulation-wide Causal Event Queue to coordinate optical/transport events, IP-layer reactions, and service-impact observations. The queue is intended to reproduce the temporal and causal relationships between network-layer behaviors without requiring the optical and IP simulation functions to execute in lockstep.</t>
        <section anchor="event-representation-and-preconditions">
          <name>Event Representation and Preconditions</name>
          <t>A normalized simulation event is represented by the following logical attributes:</t>
          <ul spacing="normal">
            <li>
              <t><strong>Event Identifier:</strong> A unique identifier within the simulation execution.</t>
            </li>
            <li>
              <t><strong>Scheduled Time:</strong> The logical time at which the event is eligible for execution.</t>
            </li>
            <li>
              <t><strong>Origin and Target:</strong> The originating function and affected resource or network object.</t>
            </li>
            <li>
              <t><strong>Event Type:</strong> A resource-state change, observation, protection action, routing reaction, or evaluation event.</t>
            </li>
            <li>
              <t><strong>Causal Predecessors:</strong> References to events whose successful execution is required before the event can proceed.</t>
            </li>
            <li>
              <t><strong>Expected State Version:</strong> An optional reference to the resource-state version under which the event was generated.</t>
            </li>
            <li>
              <t><strong>Event Parameters:</strong> Timing, resource, and policy parameters relevant to the modeled action.</t>
            </li>
          </ul>
          <t>An event may additionally contain its effective timestamp and observation timestamp when these differ from the scheduled execution time.</t>
          <t>The distinction is important because the occurrence of a physical condition and its observation by an IP-layer mechanism are not necessarily simultaneous.</t>
          <t>Each event is associated with an execution precondition. An event is eligible for execution only when its causal predecessors have completed and its relevant state conditions remain satisfied.</t>
          <t>For example, a simulated IP fast-reroute action may depend on the completion of an IP-layer failure-detection event. If optical restoration removes the impairment before the configured detection condition is satisfied, the pending detection event may become inapplicable.</t>
          <t>Conversely, a rerouting action already completed before optical restoration is not retroactively removed. Any subsequent traffic movement must be represented by another event.</t>
          <figure anchor="fig-2">
            <name>Causal Cross-Layer Event Execution Mechanism</name>
            <sourcecode type="text"><![CDATA[
         +------------------------------------------------+
    +--->|            Causal Event Queue (Q)              |
    |    |                                                |
    |    | Time / Event ID / Causal Predecessors           |
    |    | Expected State Version / Event Parameters      |
    |    +-----------------------+------------------------+
    |                            |
    |                            v
    |                 +------------------------+
    |                 | Pending event within   |     No
    |                 | simulation horizon T?  +-------------+
    |                 +-----------+------------+             |
    |                            Yes                         |
    |                             |                          |
    |                             v                          |
    |                 +------------------------+              |
    |                 | Advance Logical Time   |              |
    |                 | Accumulate Service     |              |
    |                 | Impact over Interval   |              |
    |                 +-----------+------------+              |
    |                             |                          |
    |                             v                          |
    |                 +------------------------+              |
    |                 | Select and Remove      |              |
    |                 | Causally Enabled Event |              |
    |                 +-----------+------------+              |
    |                             |                          |
    |                             v                          |
    |                 +------------------------+              |
    |                 | Event Validation       |              |
    |                 |                        |              |
    |                 | Check Preconditions    |              |
    |                 | Check State Version    |              |
    |                 | Check Duplicate Effect |              |
    |                 +-----------+------------+              |
    |                             |                          |
    |                 +-----------+-----------+              |
    |                 |                       |              |
    |              Invalid                  Valid            |
    |                 |                       |              |
    |                 v                       v              |
    |       +-------------------+  +----------------------+  |
    |       | Skip / Invalidate |  | Atomic State Update  |  |
    |       | / Deduplicate     |  |                      |  |
    |       |                   |  | LOTSF: Optical / OTN |  |
    |       | Record Outcome    |  | IPSF: IP / Routing   |  |
    |       +---------+---------+  +----------+-----------+  |
    |                 |                       |              |
    |                 |                       v              |
    |                 |            +----------------------+  |
    |                 |            | Derive New Events    |  |
    |                 |            |                      |  |
    |                 |            | Detection/Protection |  |
    |                 |            | Restoration/Reroute  |  |
    |                 |            +----------+-----------+  |
    |                 |                       |              |
    |                 +-----------+-----------+              |
    |                             |                          |
    |                             v                          |
    |                 +------------------------+              |
    |                 | Record Causal Trace    |              |
    |                 | Schedule New Events    |              |
    |                 | (Event Time >= Now)    |              |
    |                 +-----------+------------+              |
    |                             |                          |
    +-----------------------------+                          |
                                                             |
                                                             v
                                        +------------------------+
                                        | Finalize Service Impact|
                                        |                        |
                                        | Causal Event Trace     |
                                        | Service / Risk Report  |
                                        | Model Status           |
                                        +------------------------+
]]></sourcecode>
          </figure>
        </section>
        <section anchor="deterministic-scheduling-and-concurrent-events">
          <name>Deterministic Scheduling and Concurrent Events</name>
          <t>The CLCF maintains a non-decreasing logical simulation clock. Events are selected primarily according to their scheduled simulation time.</t>
          <t>At each simulation timestamp, the scheduler processes eligible events in an order consistent with their declared causal dependencies.</t>
          <t>When multiple independent events share the same scheduled timestamp, the framework uses a documented deterministic tie-breaking rule. Such ordering is an execution convention and does not imply a physical causal relationship between otherwise independent network actions.</t>
          <t>Each event applies an atomic update to the relevant simulated state and may generate additional events.</t>
          <t>Newly generated events may target the same or another simulation function. Their scheduled times cannot precede the current logical simulation time.</t>
          <t>Events generated at the same timestamp are processed until no further eligible same-time events remain. Implementations should detect inconsistent causal dependencies and unbounded zero-time event generation.</t>
          <t>When concurrent events request conflicting state changes to the same resource, the simulator applies a declared conflict-resolution rule or reports an unresolved simulation conflict. When simultaneous events can produce different outcomes depending on their execution order, the framework should identify the result as ordering-sensitive. The simulator may evaluate alternative admissible orderings or apply a justified, documented ordering policy. Deterministic tie-breaking alone does not establish the physical ordering of concurrent network actions.</t>
          <t>The IPSF and LOTSF can therefore model overlapping recovery processes while preserving deterministic replay.</t>
          <t>Service impact is evaluated using the intermediate network states and their durations, rather than only the final converged state.</t>
        </section>
        <section anchor="event-invalidation-and-duplicate-suppression">
          <name>Event Invalidation and Duplicate Suppression</name>
          <t>A pending event can become inapplicable when the underlying network state changes before the event is executed.</t>
          <t>The framework uses resource-state versions and event preconditions to identify stale events. A stale event does not modify the current simulated state, but its invalidation and reason are retained in the causal event trace.</t>
          <t>Duplicate event suppression is also necessary because the same physical failure may be reported through multiple alarms or management systems.</t>
          <t>Events can be deduplicated when they represent the same causal occurrence, target resource, intended effect, and applicable state version. Events originating from distinct physical failures must not be merged solely because they affect the same resource.</t>
          <t>The framework also distinguishes an unchanged state from a new state transition. Repeated notifications of an already-applied state change do not need to trigger repeated IP-layer reactions unless the configured model explicitly requires them.</t>
          <t>If repeated cross-layer actions produce routing oscillation or continuing state changes, the framework retains those transitions as simulated behavior rather than incorrectly suppressing them as duplicates.</t>
        </section>
        <section anchor="causal-trace-and-execution-outcome">
          <name>Causal Trace and Execution Outcome</name>
          <t>For each processed event, the framework records the scheduled and executed times, causal predecessors, state changes, and resulting events.</t>
          <t>Events that are skipped, invalidated, or rejected are also recorded with their execution outcomes.</t>
          <t>The resulting causal trace enables the framework to determine whether an IP-layer reaction was triggered by a lower-layer state change, an observation delay, an earlier routing action, or an interaction between concurrent recovery processes.</t>
          <t>This event trace is the basis for reproducible scenario replay, timing-error analysis, and the identification of potentially adverse protection interactions.</t>
          <sourcecode type="text"><![CDATA[
Algorithm 1: Causal Cross-Layer Event Execution

Input:
    S = initial simulation state
    Q = initial causal event queue
    T = simulation time horizon

t_prev = simulation start time

while Q is not empty:

    t = Q.next_timestamp()

    if t > T:
        break

    accumulate_service_impact(S, t_prev, t)

    E = Q.remove_events_at(t)
    steps = 0

    while E is not empty:

        e = E.pop_causally_enabled()

        if e is NONE:
            report_unresolved_dependencies(E)
            terminate simulation

        steps = steps + 1

        if steps > MAX_ZERO_TIME_STEPS:
            report_zero_time_cycle()
            terminate simulation

        if state_version_is_stale(e, S):
            record(e, "INVALIDATED")
            invalidate_dependent_events(e)
            continue

        if preconditions_not_satisfied(e, S):
            record(e, "SKIPPED")
            invalidate_dependent_events(e)
            continue

        if is_duplicate_effect(e, S):
            record(e, "DEDUPLICATED")
            continue

        delta = apply_atomic_transition(e, S)
        record(e, delta)

        for child in derive_events(e, S):

            require child.time >= t

            if child.time == t:
                E.insert(child)
            else:
                Q.insert(child)

    t_prev = t

accumulate_service_impact(S, t_prev, T)

return:
    causal_trace,
    service_impact,
    model_status
]]></sourcecode>
          <t>The scheduler removes each selected event from the pending event set before processing it. Events generated at the current simulation timestamp are processed within the same logical time step. A bounded zero-time execution guard prevents unbounded event generation.</t>
          <t>Service impact is accumulated over intervals between consecutive simulation timestamps, using the network state applicable to each interval. Invalidated or skipped events do not modify the simulation state, and their dependent events are invalidated unless an alternative valid causal dependency exists.</t>
          <section anchor="example-restoration-and-detection-timing">
            <name>Example: Restoration and Detection Timing</name>
            <t>Consider an illustrative scenario in which a lower-layer failure occurs at simulation time 0, while an IP failure-detection condition would be satisfied at 50 ms if the impairment persists.</t>
            <t>If the optical layer restores the affected connectivity at 35 ms and the IP detection condition is no longer satisfied, the pending detection event is invalidated and no IP rerouting is triggered by that event.</t>
            <t>If optical restoration instead completes at 90 ms, the IP-layer detection event may execute at 50 ms and trigger a simulated rerouting action. When optical restoration subsequently completes, the resulting connectivity change may initiate further IP-layer behavior depending on the configured policy.</t>
            <t>All timing values are illustrative and are not protocol defaults.</t>
            <t>This example demonstrates that causal event execution must account for changing preconditions and concurrent recovery processes. Simply processing all previously scheduled events without state validation may produce unnecessary or incorrect simulated routing transitions.</t>
          </section>
        </section>
      </section>
      <section anchor="cross-layer-impact-translation">
        <name>Cross-Layer Impact Translation</name>
        <t>The CLCF translates lower-layer state changes into IP-layer simulation effects using the dependency graph and configured translation rules.</t>
        <t>For hard failures, translation identifies affected IP logical links, paths, Segment Routing policies, and services. However, a lower-layer failure does not automatically imply that the corresponding IP link becomes unavailable. Lower-layer protection may preserve or restore client connectivity before the relevant IP failure-detection mechanism declares a failure.</t>
        <t>For soft degradation, the CLCF may estimate packet-loss risk, delay variation, or effective capacity reduction using equipment characteristics, historical measurements, calibrated impairment profiles, and operator-defined thresholds.</t>
        <t>A pre-FEC error indication does not necessarily imply IP packet loss. When an impairment-to-service relationship is not sufficiently supported, the framework reports a bounded or unknown impact rather than assuming a deterministic mapping.</t>
        <t>The IPSF subsequently models IP-layer reactions using the translated effects and configured protocol behavior. BFD-related behavior, for example, uses a configured or modeled detection profile rather than a universal detection-time assumption.</t>
        <t>Cross-layer translation rules remain simulation-specific and may be calibrated using historical observations.</t>
        <section anchor="example-fiber-failure-and-cross-layer-event-propagation">
          <name>Example: Fiber Failure and Cross-Layer Event Propagation</name>
          <t>Consider a fiber failure affecting an optical resource that supports one or more IP logical links. The framework processes the resulting cross-layer events as follows:</t>
          <ol spacing="normal" type="1"><li>
              <t><strong>Failure and Optical Protection:</strong> The LOTSF updates the affected resource state and schedules optical protection or restoration events according to the configured timing profile.</t>
            </li>
            <li>
              <t><strong>Cross-Layer Event Translation:</strong> The CLCF identifies affected IP links using the Cross-Layer Dependency Graph. If the lower-layer failure causes an observable IP-layer impairment, the CLCF generates a corresponding simulation event. A lower-layer failure does not necessarily imply an immediate IP link failure.</t>
            </li>
            <li>
              <t><strong>IP-Layer Reaction:</strong> Upon receiving the impairment event, the IPSF models the configured failure-detection behavior. If the impairment persists until the detection condition is satisfied, the IPSF may trigger fast reroute, routing convergence, or Segment Routing policy recomputation.</t>
            </li>
            <li>
              <t><strong>Restoration and Event Invalidation:</strong> When optical connectivity is restored, the LOTSF generates a restoration event, which the CLCF translates into an updated IP-layer condition. If the IP failure-detection condition is no longer satisfied, a pending detection event may be invalidated. IP-layer actions already completed are preserved, and any subsequent routing changes depend on the configured recovery policy.</t>
            </li>
            <li>
              <t><strong>Service-Impact Evaluation:</strong> The framework evaluates the resulting traffic and service states over the event timeline, including interruption duration, traffic redistribution, and possible overlapping protection actions.</t>
            </li>
          </ol>
          <t>For example, assume an impairment begins at simulation time 0 and would satisfy an IP failure-detection condition at 50 ms if it persists. If optical restoration completes at 35 ms and the impairment is cleared, the pending detection event is invalidated. If restoration completes at 90 ms, IP-layer detection and rerouting may occur before optical recovery.</t>
          <t>These timing values are illustrative and are not protocol defaults.</t>
          <t>This example demonstrates how the CLCF coordinates lower-layer state changes and IP-layer reactions through causal event scheduling, rather than directly mapping each optical failure to an unconditional IP link failure.</t>
        </section>
      </section>
      <section anchor="protection-interaction-and-service-impact">
        <name>Protection Interaction and Service Impact</name>
        <t>The interaction between optical restoration and IP-layer protection is evaluated through their combined effects on routing and service behavior.</t>
        <t>The framework considers whether IP-layer detection and rerouting occur before, during, or after lower-layer recovery, and whether the resulting traffic movement is necessary or beneficial.</t>
        <t>Overlapping protection actions do not automatically constitute a coordination problem. A coordination conflict is identified only when the modeled interaction causes an adverse outcome, such as avoidable rerouting, repeated traffic movement, transient congestion, or service-impact amplification under the selected evaluation criteria.</t>
        <t>The IPSF calculates the effect of network-state changes on traffic demands, path availability, resource utilization, and service objectives. Service-specific delay, loss, and recovery constraints may be supplied as scenario evaluation criteria.</t>
        <t>The resulting cross-layer evaluation can distinguish between a resource failure that is masked by lower-layer recovery, a failure requiring an IP-layer response, and an event whose effect remains uncertain because of incomplete dependencies or insufficient model fidelity.</t>
      </section>
      <section anchor="simulation-results">
        <name>Simulation Results</name>
        <t>A simulation produces a traceable evaluation report rather than a production control instruction.</t>
        <t>The report can include:</t>
        <t>The causal event trace and protection or convergence timeline.
Affected resources, IP paths, and services.
Service-impact estimates, including relevant loss, delay, congestion, and recovery characteristics.
Verified shared risks, unresolved dependencies, and uncertainty assumptions.
Scenario versions, translation rules, timing profiles, and model-validity information.</t>
        <t>These outputs allow the operator to determine not only the expected service impact but also which assumptions and event interactions contributed to that result.</t>
      </section>
    </section>
    <section anchor="model-validation-and-evaluation-methodology">
      <name>Model Validation and Evaluation Methodology</name>
      <t>The proposed framework uses abstract optical and transport states to support lightweight cross-layer simulation. Its effectiveness depends on whether the model can reproduce relevant network behaviors and provide additional insight beyond existing simulation approaches.</t>
      <t>This section outlines a methodology for validating model fidelity and evaluating the contribution of causal cross-layer simulation.</t>
      <section anchor="model-fidelity-validation">
        <name>Model Fidelity Validation</name>
        <t>Model fidelity can be evaluated by replaying historical network incidents using recorded topology, optical alarms, protection events, IP routing changes, and service-performance observations.</t>
        <t>The LOTSF reproduces lower-layer state transitions, while the CLCF coordinates cross-layer events and the IPSF simulates IP-layer reactions. The resulting event timeline and service impacts are compared with observed network behavior.</t>
        <t>Relevant evaluation metrics include:</t>
        <ul spacing="normal">
          <li>
            <t><strong>Event Timing Accuracy:</strong> Differences between simulated and observed event timestamps and recovery durations.</t>
          </li>
          <li>
            <t><strong>Event-Order Agreement:</strong> Consistency of simulated causal event sequences with observed event ordering.</t>
          </li>
          <li>
            <t><strong>Service-Impact Accuracy:</strong> Differences in service-interruption duration, traffic loss, and congestion behavior.</t>
          </li>
          <li>
            <t><strong>Dependency Accuracy:</strong> Correct identification of affected resources and physical shared risks.</t>
          </li>
        </ul>
        <t>Historical observations may be used to calibrate timing and event-translation parameters. Independent observations should be used for validation where available.</t>
        <t>When operational ground truth is insufficient, the framework reports model assumptions and uncertainty rather than claiming validated prediction accuracy. Synthetic scenarios may verify execution correctness but do not establish operational accuracy.</t>
      </section>
      <section anchor="comparative-evaluation">
        <name>Comparative Evaluation</name>
        <t>The proposed framework can be compared with two baseline approaches to assess the additional value of causal cross-layer event simulation.</t>
        <t>Three approaches are considered:</t>
        <ol spacing="normal" type="1"><li>
            <t><strong>IP-Only Simulation:</strong> Models IP failure detection, routing convergence, and traffic redistribution without explicit lower-layer dependencies.</t>
          </li>
          <li>
            <t><strong>Static Cross-Layer Correlation:</strong> Uses IP-optical dependency information to identify affected resources and shared risks, but does not coordinate optical restoration and IP-layer reactions through a common causal event timeline.</t>
          </li>
          <li>
            <t><strong>Causal Cross-Layer Simulation:</strong> Combines dependency-aware event propagation, causal event scheduling, and uncertainty-aware service-impact evaluation.</t>
          </li>
        </ol>
        <t>A common failure scenario is used for comparison. Two logically disjoint IP paths share an underlying physical resource, while another backup path has incomplete physical-dependency information.</t>
        <t>A lower-layer failure is introduced with different optical restoration timing profiles, allowing evaluation of interactions between optical recovery and IP-layer failure detection or rerouting.</t>
        <t>The approaches use consistent IP behavior models, traffic demands, and service objectives where applicable. Differences in available cross-layer information are documented.</t>
        <t>The comparison focuses on:</t>
        <ul spacing="normal">
          <li>
            <t><strong>Shared-Risk Identification:</strong> Whether hidden physical dependencies and uncertain path-diversity conclusions are correctly identified.</t>
          </li>
          <li>
            <t><strong>Recovery Behavior:</strong> Whether cross-layer event ordering and protection interactions are accurately represented.</t>
          </li>
          <li>
            <t><strong>Service Impact:</strong> Differences in predicted interruption duration, congestion, and traffic redistribution.</t>
          </li>
          <li>
            <t><strong>Simulation Efficiency:</strong> Execution time, memory consumption, and event-processing overhead.</t>
          </li>
        </ul>
        <t>Results are compared against historical observations or a declared reference model where available. Unsupported predictions are reported as unavailable rather than assigned artificial error values.</t>
        <t>For reproducibility, experiments record topology snapshots, dependency information, event inputs, timing profiles, model versions, and random seeds where applicable.</t>
        <t>The evaluation aims to determine when causal cross-layer simulation provides additional accuracy or analytical value, while identifying limitations caused by incomplete data, model abstraction, and computational overhead. No performance improvement is assumed without supporting experimental evidence.</t>
      </section>
    </section>
    <section anchor="representative-simulation-scenarios">
      <name>Representative Simulation Scenarios</name>
      <section anchor="shared-risk-failure-and-concurrent-recovery">
        <name>Shared-Risk Failure and Concurrent Recovery</name>
        <t>Consider a network in which two logically disjoint IP paths share an underlying physical duct. A third candidate backup path has incomplete physical-dependency information.</t>
        <t>The scenario introduces a failure of the shared duct. The LOTSF models the affected lower-layer resources and associated protection behavior. The CLCF resolves verified dependencies and schedules the corresponding IP-layer effects on the causal timeline.</t>
        <t>In parallel, the IPSF models failure detection, fast reroute, Segment Routing policy changes, and traffic redistribution using the selected timing and policy profiles.</t>
        <t>The simulation evaluates whether lower-layer recovery can preserve connectivity, whether IP rerouting is triggered, and whether the combined recovery actions create additional congestion or service disruption.</t>
        <t>For the third path, whose physical dependency remains unresolved, the framework does not assume physical disjointness. Alternative dependency hypotheses may be evaluated where sufficient information exists.</t>
        <t>The final report combines the event timeline, service-impact results, verified shared-risk violations, and unresolved resilience assumptions.</t>
        <t>This scenario demonstrates how dependency quality and event timing jointly affect cross-layer resilience conclusions.</t>
      </section>
      <section anchor="soft-degradation-and-protection-strategy-comparison">
        <name>Soft Degradation and Protection Strategy Comparison</name>
        <t>Consider an optical channel that experiences degraded performance without an immediate hard failure.</t>
        <t>The LOTSF represents the degradation using a resource-state transition and relevant performance indicators. The CLCF applies an impairment-to-service translation profile to determine whether an IP-layer effect is supported by the available evidence.</t>
        <t>The IPSF then evaluates alternative behaviors, such as maintaining the current route, selectively shifting affected traffic, or allowing configured protection mechanisms to respond.</t>
        <t>The simulation compares service impact, traffic utilization, convergence behavior, and unnecessary routing changes.</t>
        <t>If the relationship between optical degradation and packet-layer impact is uncertain, the evaluation reports the associated assumptions or impact bounds.</t>
        <t>Historical observations may subsequently be used to assess whether the selected translation profile and event-timing model reproduce the observed service behavior.</t>
        <t>This scenario demonstrates the role of calibrated impairment translation in causal cross-layer simulation without requiring continuous optical propagation modeling.</t>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The framework can consume sensitive topology, physical infrastructure, service, and traffic information. Access control, data integrity protection, and appropriate confidentiality measures are therefore necessary.</t>
      <t>Incorrect or malicious input data may lead to inaccurate dependency assessments, incorrect event propagation, or misleading recovery recommendations. Input validation and provenance tracking are important safeguards.</t>
      <t>The simulation environment must remain logically isolated from production network control. Simulated state transitions, routing changes, protection actions, and traffic-engineering recommendations are simulation-only information and MUST NOT be directly applied to production network elements.</t>
      <t>Any subsequent operational action based on simulation results requires a separate authorization, validation, and change-control process outside the scope of this document.</t>
      <t>Simulation reports may reveal physical shared risks and network resilience weaknesses and should be protected accordingly.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document requests no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC5307" target="https://www.rfc-editor.org/info/rfc5307" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5307.xml">
          <front>
            <title>IS-IS Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)</title>
            <author fullname="K. Kompella" initials="K." role="editor" surname="Kompella"/>
            <author fullname="Y. Rekhter" initials="Y." role="editor" surname="Rekhter"/>
            <date month="October" year="2008"/>
            <abstract>
              <t>This document specifies encoding of extensions to the IS-IS routing protocol in support of Generalized Multi-Protocol Label Switching (GMPLS). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5307"/>
          <seriesInfo name="DOI" value="10.17487/RFC5307"/>
        </reference>
        <reference anchor="RFC5880" target="https://www.rfc-editor.org/info/rfc5880" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5880.xml">
          <front>
            <title>Bidirectional Forwarding Detection (BFD)</title>
            <author fullname="D. Katz" initials="D." surname="Katz"/>
            <author fullname="D. Ward" initials="D." surname="Ward"/>
            <date month="June" year="2010"/>
            <abstract>
              <t>This document describes a protocol intended to detect faults in the bidirectional path between two forwarding engines, including interfaces, data link(s), and to the extent possible the forwarding engines themselves, with potentially very low latency. It operates independently of media, data protocols, and routing protocols. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5880"/>
          <seriesInfo name="DOI" value="10.17487/RFC5880"/>
        </reference>
        <reference anchor="RFC8345" target="https://www.rfc-editor.org/info/rfc8345" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8345.xml">
          <front>
            <title>A YANG Data Model for Network Topologies</title>
            <author fullname="A. Clemm" initials="A." surname="Clemm"/>
            <author fullname="J. Medved" initials="J." surname="Medved"/>
            <author fullname="R. Varga" initials="R." surname="Varga"/>
            <author fullname="N. Bahadur" initials="N." surname="Bahadur"/>
            <author fullname="H. Ananthakrishnan" initials="H." surname="Ananthakrishnan"/>
            <author fullname="X. Liu" initials="X." surname="Liu"/>
            <date month="March" year="2018"/>
            <abstract>
              <t>This document defines an abstract (generic, or base) YANG data model for network/service topologies and inventories. The data model serves as a base model that is augmented with technology-specific details in other, more specific topology and inventory data models.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8345"/>
          <seriesInfo name="DOI" value="10.17487/RFC8345"/>
        </reference>
        <reference anchor="RFC8453" target="https://www.rfc-editor.org/info/rfc8453" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8453.xml">
          <front>
            <title>Framework for Abstraction and Control of TE Networks (ACTN)</title>
            <author fullname="D. Ceccarelli" initials="D." role="editor" surname="Ceccarelli"/>
            <author fullname="Y. Lee" initials="Y." role="editor" surname="Lee"/>
            <date month="August" year="2018"/>
            <abstract>
              <t>Traffic Engineered (TE) networks have a variety of mechanisms to facilitate the separation of the data plane and control plane. They also have a range of management and provisioning protocols to configure and activate network resources. These mechanisms represent key technologies for enabling flexible and dynamic networking. The term "Traffic Engineered network" refers to a network that uses any connection-oriented technology under the control of a distributed or centralized control plane to support dynamic provisioning of end-to- end connectivity.</t>
              <t>Abstraction of network resources is a technique that can be applied to a single network domain or across multiple domains to create a single virtualized network that is under the control of a network operator or the customer of the operator that actually owns the network resources.</t>
              <t>This document provides a framework for Abstraction and Control of TE Networks (ACTN) to support virtual network services and connectivity services.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8453"/>
          <seriesInfo name="DOI" value="10.17487/RFC8453"/>
        </reference>
        <reference anchor="RFC8795" target="https://www.rfc-editor.org/info/rfc8795" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8795.xml">
          <front>
            <title>YANG Data Model for Traffic Engineering (TE) Topologies</title>
            <author fullname="X. Liu" initials="X." surname="Liu"/>
            <author fullname="I. Bryskin" initials="I." surname="Bryskin"/>
            <author fullname="V. Beeram" initials="V." surname="Beeram"/>
            <author fullname="T. Saad" initials="T." surname="Saad"/>
            <author fullname="H. Shah" initials="H." surname="Shah"/>
            <author fullname="O. Gonzalez de Dios" initials="O." surname="Gonzalez de Dios"/>
            <date month="August" year="2020"/>
            <abstract>
              <t>This document defines a YANG data model for representing, retrieving, and manipulating Traffic Engineering (TE) Topologies. The model serves as a base model that other technology-specific TE topology models can augment.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8795"/>
          <seriesInfo name="DOI" value="10.17487/RFC8795"/>
        </reference>
        <reference anchor="RFC9085" target="https://www.rfc-editor.org/info/rfc9085" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9085.xml">
          <front>
            <title>Border Gateway Protocol - Link State (BGP-LS) Extensions for Segment Routing</title>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="H. Gredler" initials="H." surname="Gredler"/>
            <author fullname="M. Chen" initials="M." surname="Chen"/>
            <date month="August" year="2021"/>
            <abstract>
              <t>Segment Routing (SR) allows for a flexible definition of end-to-end paths by encoding paths as sequences of topological subpaths, called "segments". These segments are advertised by routing protocols, e.g., by the link-state routing protocols (IS-IS, OSPFv2, and OSPFv3) within IGP topologies.</t>
              <t>This document defines extensions to the Border Gateway Protocol - Link State (BGP-LS) address family in order to carry SR information via BGP.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9085"/>
          <seriesInfo name="DOI" value="10.17487/RFC9085"/>
        </reference>
        <reference anchor="RFC9256" target="https://www.rfc-editor.org/info/rfc9256" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9256.xml">
          <front>
            <title>Segment Routing Policy Architecture</title>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <author fullname="D. Voyer" initials="D." surname="Voyer"/>
            <author fullname="A. Bogdanov" initials="A." surname="Bogdanov"/>
            <author fullname="P. Mattes" initials="P." surname="Mattes"/>
            <date month="July" year="2022"/>
            <abstract>
              <t>Segment Routing (SR) allows a node to steer a packet flow along any path. Intermediate per-path states are eliminated thanks to source routing. SR Policy is an ordered list of segments (i.e., instructions) that represent a source-routed policy. Packet flows are steered into an SR Policy on a node where it is instantiated called a headend node. The packets steered into an SR Policy carry an ordered list of segments associated with that SR Policy.</t>
              <t>This document updates RFC 8402 as it details the concepts of SR Policy and steering into an SR Policy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9256"/>
          <seriesInfo name="DOI" value="10.17487/RFC9256"/>
        </reference>
        <reference anchor="RFC9552" target="https://www.rfc-editor.org/info/rfc9552" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9552.xml">
          <front>
            <title>Distribution of Link-State and Traffic Engineering Information Using BGP</title>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <date month="December" year="2023"/>
            <abstract>
              <t>In many environments, a component external to a network is called upon to perform computations based on the network topology and the current state of the connections within the network, including Traffic Engineering (TE) information. This is information typically distributed by IGP routing protocols within the network.</t>
              <t>This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism applies to physical and virtual (e.g., tunnel) IGP links. The mechanism described is subject to policy control.</t>
              <t>Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs).</t>
              <t>This document obsoletes RFC 7752 by completely replacing that document. It makes some small changes and clarifications to the previous specification. This document also obsoletes RFC 9029 by incorporating the updates that it made to RFC 7752.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9552"/>
          <seriesInfo name="DOI" value="10.17487/RFC9552"/>
        </reference>
        <reference anchor="I-D.ietf-nmop-simap-concept" target="https://datatracker.ietf.org/doc/html/draft-ietf-nmop-simap-concept-15" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-nmop-simap-concept.xml">
          <front>
            <title>SIMAP: Concept, Requirements, and Use Cases</title>
            <author fullname="Olga Havel" initials="O." surname="Havel">
              <organization>Huawei</organization>
            </author>
            <author fullname="Benoît Claise" initials="B." surname="Claise">
              <organization>Everything OPS &amp; Arrcus</organization>
            </author>
            <author fullname="Oscar Gonzalez de Dios" initials="O. G." surname="de Dios">
              <organization>Telefonica</organization>
            </author>
            <author fullname="Thomas Graf" initials="T." surname="Graf">
              <organization>Swisscom</organization>
            </author>
            <date day="23" month="October" year="2026"/>
            <abstract>
              <t>This document defines the concept of Service &amp; Infrastructure Maps (SIMAP) and identifies a set of SIMAP requirements and use cases. The SIMAP was previously known as Digital Map. SIMAP evolves the earlier 'Digital Map' concept by making explicit the ties between service and infrastructure layers, clarifying expected outcomes for operations and automation, and addressing ambiguity associated with the term 'digital.' The document intends to be used as a reference for the assessment of the various topology modules to meet SIMAP requirements.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-nmop-simap-concept-15"/>
        </reference>
        <reference anchor="I-D.irtf-nmrg-network-digital-twin-arch" target="https://datatracker.ietf.org/doc/html/draft-irtf-nmrg-network-digital-twin-arch-13" xml:base="https://bib.ietf.org/public/rfc/bibxml-ids/reference.I-D.irtf-nmrg-network-digital-twin-arch.xml">
          <front>
            <title>Network Digital Twin (NDT): Concepts and Reference Architecture</title>
            <author fullname="Cheng Zhou" initials="C." surname="Zhou">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Hongwei Yang" initials="H." surname="Yang">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Xiaodong Duan" initials="X." surname="Duan">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Diego Lopez" initials="D." surname="Lopez"/>
            <author fullname="Antonio Pastor" initials="A." surname="Pastor"/>
            <author fullname="Qin Wu" initials="Q." surname="Wu">
              <organization>Huawei</organization>
            </author>
            <author fullname="Mohamed Boucadair" initials="M." surname="Boucadair">
              <organization>Orange</organization>
            </author>
            <author fullname="Christian Jacquenet" initials="C." surname="Jacquenet">
              <organization>Orange</organization>
            </author>
            <date day="1" month="July" year="2026"/>
            <abstract>
              <t>The application of Digital Twin technology in the networking field is meant to develop various rich network applications, realize efficient and cost-effective data-driven network management, and accelerate network innovation. This document presents an overview of the concept of Network Digital Twin (NDT), provides the basic definitions and a reference architecture, lists a set of application scenarios, and discusses such technology's benefits and key challenges. This document is a product of the Network Management Research Group (NMRG) of the Internet Research Task Force (IRTF). This document reflects the consensus of the research group. It is not a candidate for any level of Internet Standard and is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-irtf-nmrg-network-digital-twin-arch-13"/>
        </reference>
        <reference anchor="I-D.ietf-ccamp-otn-topo-yang" target="https://datatracker.ietf.org/doc/html/draft-ietf-ccamp-otn-topo-yang-21" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-ccamp-otn-topo-yang.xml">
          <front>
            <title>A YANG Data Model for Optical Transport Network Topology</title>
            <author fullname="Haomian Zheng" initials="H." surname="Zheng">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Italo Busi" initials="I." surname="Busi">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Xufeng Liu" initials="X." surname="Liu">
              <organization>Individual</organization>
            </author>
            <author fullname="Sergio Belotti" initials="S." surname="Belotti">
              <organization>Nokia</organization>
            </author>
            <author fullname="Oscar Gonzalez de Dios" initials="O. G." surname="de Dios">
              <organization>Telefonica</organization>
            </author>
            <date day="16" month="June" year="2026"/>
            <abstract>
              <t>This document defines a YANG data model for representing, retrieving, and manipulating Optical Transport Network (OTN) topologies. It is independent of control plane protocols and captures topological and resource-related information pertaining to OTN.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-ccamp-otn-topo-yang-21"/>
        </reference>
        <reference anchor="I-D.ietf-ccamp-optical-impairment-topology-yang" target="https://datatracker.ietf.org/doc/html/draft-ietf-ccamp-optical-impairment-topology-yang-24" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-ccamp-optical-impairment-topology-yang.xml">
          <front>
            <title>A YANG Data Model for Optical Impairment-aware Topology</title>
            <author fullname="Dieter Beller" initials="D." surname="Beller">
              <organization>Nokia</organization>
            </author>
            <author fullname="Esther Le Rouzic" initials="E." surname="Le Rouzic">
              <organization>Orange</organization>
            </author>
            <author fullname="Sergio Belotti" initials="S." surname="Belotti">
              <organization>Nokia</organization>
            </author>
            <author fullname="Gabriele Galimberti" initials="G." surname="Galimberti">
              <organization>Nokia</organization>
            </author>
            <author fullname="Italo Busi" initials="I." surname="Busi">
              <organization>Huawei Technologies</organization>
            </author>
            <date day="22" month="June" year="2026"/>
            <abstract>
              <t>Provisioning an optical connection requires that path continuity, resource availability, and impairment constraints be satisfied in order to determine viable paths through the network. This process is known as Impairment-Aware Routing and Wavelength Assignment (IA-RWA) in Wavelength Switched Optical Networks (WSONs) and as Impairment- Aware Routing and Spectrum Assignment (IA-RSA) in Spectrum Switched Optical Networks (SSONs). This document defines a YANG data model for impairment-aware Traffic Engineering (TE) topologies in optical networks. The model augments the technology-agnostic YANG data model for TE topologies and provides read-only topology information, including optical impairments. Such information can be used, for example, by a Path Computation Engine (PCE) to compute optically feasible paths prior to connection establishment.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-ccamp-optical-impairment-topology-yang-24"/>
        </reference>
      </references>
    </references>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+19aXMbR5bgd/yKCvuLLAGQZFvdNje6Z2mRanNGB01S3u2Z
mGAUCgmgrEIVXAdpeLX92/edmS+rCiRlz/QcsQyHTAKVWXm8+5zNZpM2bwt3
lBwnr/P1pr11+G/ysq6aZvY63bs6ucy3XZG2eVUmr+p0626r+kOyqurk7Hz2
btfmWVokb11LH5/k67yFv69u87KZpItF7W6OogdPrkYnnGRp69ZVvT9K8nJV
TZZVVsJXR8myTlft7NdNWs3Kbb2e5btZxXPNymU7a/LtbKWTzJ49nzTdYps3
DUze7ncw/uzi6tWk7LYLVx8lkyW85Sj58tmXf5g9fz579uUkq8rGlU3XwJf5
Dh5p665pv3z27Fv4Mq1dKjPg9Ou66nZHfq9v0jJdu60r2+TCNS6ts03yF3xk
Mkm7dlPVR5MkmcF2YO5/nCf/DFuAD5KE9/WPebkOn1X1+ih5ucnLNHlf5lm1
pU+zvIXz+M7lP8HD/EnVlS0eEj1LH7ltmhdHCZ7QTy+ePf+fGX7T0STzrMQl
0GO0jEtahszF67jcdGluPoWVpGX+K13PyJLC28p189Uf/jB8XZLUFQKUW+Zt
VT90H2aRF/PkPF7jRVqGjx62wB08Xqfl2PLuXc2krOotzH/j8AYvXr388vnz
b48mkwlCZvzNi6+e/VF//eabZ/LrN199/UJ//frFV/rrH7/VT7999o3/9csX
f9BfX7z4En89m53Mc9euAOCrHUJ4upsBnGZu1/qva/oa8KFkaJwtGfNmLWDe
DGExminL0i0gTlvO2mpXzfZwOmPfC2Ll212a1wjZ9HhRrfcyZDKfzyeT2WyW
pIumrdOsnUyuNnmTAL52hApL12R1vnBNkiZFoCjTxN3gfMsaDq9MmkACVn2a
Ut1FU5JHQEGaL+bJ1caZoXl545o2XwN6N8mmuk10krRcAkqnZbOr6pbX0CS7
utql+GySZkjoEjnEpECC19CgvGwd7i+5zdsNLou+w6Gty3DhU4DzrkUshru5
cfXawQ1N9YWrVZ4lNeAAnFK+6HDAHI8qXjSQvJqW3G5q55Is3aWLvMjbHD6C
bys4Q4DdVe6W9sRgDZlrAFOWbufKJbx3P0tvgVjx/vz2aJFZ2jVwDllV1UsA
bpqgWsGGaKV6TAu3SW/yCvYOX6fw9HZbRbfU5ltX5KVscJUv4a82vDYtOj91
C5usXdMVdDiNq2/yzCUIU1nbzIW18GmGDcA+M1e3Kex6T6/YVvAKgKAt3D3O
DLeCb/plV+SAwMUeT72BZcAZJ3hQN1W+hEmaboc3DR/CEuAo8VLw0azokCc0
g0voGgRVAeYDYNO0dElwVRtYdAu0D6eE7XVV1/gx5th59bDZsxbWQa9wvwAo
4IGcnV69ShSteKuBkXgKA3PcwssAQne443RROHpW9geLcfC+ZZfl+M3tJm1n
+QqeSIt9kzfTBHASqC+tKy8zOKcSV7KDY+cbDHA8w60DIOKJwh3VeQOgigtf
VrDsskKUXsHNA5LcekTB4VVWFbD7Ovnr8du/4I67wjU8uwEchgS+PZosr+G9
cH+0Mb483gk9Li9ohMps8+WycJPJ58kZUGh9ajLpgW+4Kh1P72MwhnfxCS+T
tAF4hD0i6jOuMyGB6Tx638BhNYrbU4/LrlzDIbiaPrx0a+b7+tQqbfB8cVSP
BsB9Ao4s6anbTQ6XNQ5jQnpkAQhfJd7PDWDZFA+x6mqA5LQoqkwwO75GvAh4
DC6dz93SEjjM4wIkkm69QexsnCd0NS7H8RCYe58sCUozoNfwYF4bwkAHWlSN
I9zrdoVbzkFq3G0A4HA7K+C7HTyzTeFuVytYVbJFGgAP0vnm5YemfwRm+TiM
1x9vHlawws8A5zwRllfNls6PdhlgZd5s4UTz9Zou9iWRZVzvFBdgr4gOa0i9
aRFVlnW1rLOobl0tL7WHCwwPjqlA3MI9rOE72NsONgNUgc4RyS7O3uFO4Nu0
3nuQ2FY3jO2wCgKAHP+AdayRhxGjuOxAmFQW5KnfMsfxcKiINEJ0XcIv4vMh
aIdplZPT3wEb58klUtMsyQwR9rQoq+raFQo+sEukGvlqH8g08iVgZvgt4PI0
WeyTvIUTXk2JMgP1JuZrrtUvH6lCzApgB1VxA3dxg4sA/iK0eYvT1CpR/9zx
oSTpconHDFgMb20jmSNvjiaPk+/hzbjsSO4YlSI88XTErIRFRse9gGEOBBWL
rABESv88WihEpxkJkXgTKMYACgExLQA+LY+z1B0ntNwNGCfcE5DEPrdnVvIP
cDaVngFvX0+GUNVwNHjzAkgVnvmDGJuw2ljO0Q1GMsCmJhLi5QMLRSx6eDyc
01XikcLel8QuVQ5C7EFOkBJH8dDHq4A3pnTXOZMkf+I0Q1V4zgMsqmxaly6n
AII4ZRodmgNyt+SJ8T6QUtTbvMT7gQsDuFKSypjFBIthC95Pm5kSLMfSzOD+
g5zowZgpcwf7ruVdsHbeTzMuHM0YIxK8zy2JGgjHC2dlHMDMHKWAeV/gXnR5
sWySbkc35EhdJTW7disYiWQNESlHjOxqliJwepBKwuEr3jebfOeZEJ3G5dmb
Y2a2QYI5f+oZb3R7yGj+F6EDcxk/wq1WJLQodzMLQs4BmLPk109HqdHUij50
n0OBJ6YIK/gFpS45E/eLyxj2GtAPAU0zQjiP8bDEGNEtUMPkVji1Yh7J6Ms9
aKlAU3uXmQKtapotARJOGglsQLvzpZeYDeAqYA3kVC+NATCwPIYbIygr9riB
3lUQcyEWTrtcpRnJAZ8nF+7nDmSwLWlCr0Gr60A04rd9cPsEXgbQ9Nnjx2/e
X149fvzZVH9P3r7zf1+c/vD+7OL0RP++/P749evoD/v05ffv3r8+if+KZ3v5
7s2b07cnYUL4Nhn5+M3xX+lXPE/489351dm7t8f4ZuTEMQggWsPtLJgK1bva
tSwBqoaKOl7y3cvz5PnXyb+Ilv+v9Ns3z//49b+i/C2QR1yU/4QjJdEVmBMO
B16PkhZyFhR9QSwAmgFMEBCPDjsYzI4NDsI3nyevqzUB3CsALoL9/o0jxUvz
UpXDQp5f6fPI84AlWWuafJU8Oju/fPXFkX4HkDMg7FPkUUW3JI4lopuXp0Bg
+st5rNf2RF4QdkAtASxFQxCK/bEEPK4BKyIc0g1hQ9YI+c6g5JXnWZfEs8JW
X7+7or1eAH4B0UGoFlyeJu+u3oqcrFJqIPssNsHyMoSMIGKzsjcdEWKmRN5r
0XFQwEZTEh4BEhFQDRokLLHuVDO23acvGhENDsFaX18aoSxs+uXrl7jnN0iS
CEayca06outT5vwMEGIKUTnHGmQUwGSfajnQQYaaiujp5QEWpPgptRgIJcMV
I5smgQu+r/tGCX1t//xArIRbMSqiSAKFWmr8syoi4CuGKiWs429/+1vSul/a
yZPZb/95MvmYDH/Irg37Av25Qs0DXzPyWPJxdPRDf3A0cN+r0+RKqf1HRZOn
AOxoiBbw/ogoQzgYjT4JsHFmpNGPySnDAwwDoRQu9byuVsDJGzP67lO759vJ
fTu7+/ubf7s7eyB2xef2239o9Njin4x/HD9Bo6Nr+0ud7jb4Gfz3khGO7i75
oXOdsy/2o0cWNf7x6GiFKaA2ux2CBo/ml76rl2QTOTj6EqgjsNqLvPnQmHfL
yk+sZjky+r0RvOxoc4VXQtPw5qLRv+PM/76QHs/35J7Z7rq34dw3dzx9N07d
d1SIU4e4tVzTAemEV/rxME/n0SzEHNjnR2X8Y9/eA9x347Ou/MQbl54mry4u
otG616coYfDqLXCj8PQ0+Y7+vbxIzllU8qPPg2TxFLHLm5V4tEpYL41hyrzb
o+NLFUCilSvVhzeLdHXG+sgQrnt/De77bki8jyb2YbEPTIO///NwCPmxVOY0
uDhG1/Z7OUREyeEO4d4+9m9QiekMiWly+suuakBq73F1SzE/Jm/IqPJK3DUH
3n1hNVMjxKg34K6V/8fKBCMfHi9vYM31HvGEHA/vQHlDyW/yf46Sz1f5evY8
oZCHP31Ghz07YY+kiVG4L/jhs/87YZk2revqFk1AcMJrVKCek5ZPWghJoaqz
WZ+1usi8ojdPTjpioUEGZ5MeiczuF1GxVGInUwjRy263JMKzyNmpojZ8suSR
KQgIKD1PpHIuR2LddWSsL5qKrEGkJ29BY8PJVQ1CwZr031WO5jj+GGRpVGEH
Ai++a1zCnExO02xj1Qw02TVNleHblrzmNGl0xkxmFCWYDBywo0XakFLhrR1B
1VyiZWcJK1atslr8RE4E3AUIebBr8oEJ9bQ2bXFOwwHsulbUHuN3a1kiJj2S
SflOhGN0rETgMpDTvEOJDX/WyiaqIXnA1D7pyObYczvwghUMjH/FK/W8VXZm
Nf33kCmfdH12xAhMikOGFHZrJCKtOejJU6+v4gJKh3aOVb6AIc0uRR2Rzgj+
j+oWnn7e154pbKbp6eENU7IaKZmufjI5GbeV45bJjqNGdTRerByI7stpItb2
sgH1m+w+7NIH1ABw4j3AuVQxZjbOGGX7BnT2ga27vIEH0TpZRyeaSKgSAM7R
BLT1H0EARqM9xlBFzwVfNFqVb9K8YDcuBQeR4f+GPFEVupVv88abBck05beP
FoEz2e7gHSh938Dzq7rawiAmBADO6LvJaHbr1ak7AtrHiLArgGTc5mBKtq+i
3TqsWbVKNeDyVcAY/LK31vflh7K6LQfztptUPUd4myD3wNR4xkuxI+AthFcy
MlqgyBX6kWBlQHz3si5aFhAOMlS1bgunDiBGh0nuUzZjlCs5FDwmdqI26MEc
/SZYFdR/lxd7A0MpUUKy+Ii/r8gXNV0dLGbBrte9tX2QPZpBL23ZJAYfoFUx
8k7QIag3IlirqpX3S+CabwTmrK0H8Vxt5Ck77QEXxbhmYiDENYEvWrqsIPWM
nS9Aj7vtTnCCwg9S8iJ1fKMMTR5w7LvZe8umrrSA3ZQM3Zv9rqI9N+LZMQEc
uAyhemoUhPM6KxMQO1p0c6b11L7dUkXzarVNj1h6PRoQ6LW3FdI/gNoNO32U
GLHb+6cKRs+JrxkZanZMES4igSEgXYS4kmNv4pd7vosT4BEJNztMyezxRlRc
SbtxJZGvkxnBohKOLy5bBWL0LbD+HQygpIiTG5DNZN4GCQ/bIxZxg1wcntEY
/u3o1cOAGiRm7LKP6aj1oeSlvUF/TUTEes/FDrPRoB66tM/tiX/vwQ4dUq4k
fLCIIjSoK/OfOwxoMMTIyF4ZB/o0bd3h5Ru4NrMZEDdcyMtggaBVC5RMNJgJ
LsAjcXzTIirpvHkTyA56OUHqb4jsHjD5EjkDaVSsquwGCiQFkUtF0GAZ/XF0
KYwl+OoaeYxw1nRJAba4hLD3uWdRUwvEBNSKwPHciA/qhT9wtNFWULboSFJA
gUln1LgYhOfgOcQrQwgaQqcn60Dr8nWZlN3W1WqOX4ToO3gF02pzvV1ZoPM9
9TFEADiBY/vxyBOEoKKMq/cPS/k+XKmRwcXXS8EALA0KzAvp97KrfAMSMF+l
QUYvN5tQuBB4AkQXo0yC7oFEoo6Oeo00ShDpCv1Nsx9hge4guXuF5DxZk+rk
D74p012zqVqrvkiUCnE6Cp8DCK7zLS4LKTHL2iDXZx+6HX/SIF9d7Zk+Cdma
LXOM5UEdtg7+S8KynLFbGJmVK5us2qn7IXhjFejQOez4QNC9BmIw0GQR6R4/
9kLd48fJudJO5RIlggFeohFhNDgiEPYxHh3F9/Hi23h1tOgpe295RvfLJu0a
wg0DNehoZHkhbckNiYEDNQcfGQwdJ1T2iEdPdi6nkFfoLaJTOO6zEiu8908D
BF6/fSXvtKnDm2l+21ZueIn3buW9kTZwO29dTuC4G73cksCb5zY4araIDDlv
VLFCbtxQ0C7GNOG9mAigQ2ITaZ4Y08UWdIXAO+ms6DtNhzovxY0ZPpFhDEq6
Rpg/DnLTJ8pKgBGjZzJPiJOSLSBFUtw4YiSjy0w2KfoWXekJAPAFL5Ti7Rt5
VC4LwDLsCiRxWXbQZv5H0JSmRi5A2LO3O8R44J8oFKtwJNq4yMoUn+JBtCuR
8BY3Fm1zDWv1lNgIyvPke5B3pl4LhGHAXuQVI+TLLEsuPIorxlGMOSLCoZrR
qfyP+gkstcOrGXfysmUmEmHR3hxHrASjVqRyR5JXI2pWiEAiVcULjHBq90qL
QUREduFQqrkbn/PGsI7eddnoSi/NhMBSEuunNs5QYntJ/212KDfTTRNE8cII
rVvc1sIFQDXaqDi0+7H3y65WvhJEU13TLEQSuLZR2wXHVouxJ8jFwm1QHceE
i+WI6ofE6q7vOdBlUzUYBo7/isJ3B0WO4jnhZhZ7S5c3Y1IKyHcsOphvkQAw
CfQ8z6xKF8raJpw7CiL+jM00uH7GUKZEEkwg0k4YojIOGq0MxgSaYgBjTsd6
PgYy0cEGf7mHNlpDb/XAlwqHAS4oMowQvLyZC5O57zX2SlIUKftvKgpDZkYl
bcamnzuMYxMjUi/0bOtakGkHdi1W0okUEvVEeyISFg3RrxaI/EHQj48/WgHF
J9dskNTIfmsoMcaR2L7SogpUMGpae4pe7iyQfc8Pg72i2blsIFNFxJimJQUg
bzHQ28D1AsMMmxDMdXB/zEcjScReBStgIbSewzElbp7ChYqCxZlILVbBXHwt
FDeDhKZwUdrKDkOmMk0AKQ8Jj4R3gV+q0jhKU5OAyZ66MTPxZ21VCfItcIST
Cef5maILCNNA5flVTY50K7DHYJnXm5xrSElwWKgJWyRwhXlEKrPaZcUKGps2
4vBNYoMkBVjc874eCuVdr2u3pq2yrLJqBXoM9xylcT5phIjZcj7gpGIMunAi
N6D1P0p1Idyy9vYg3McZSczVp1YGGTGIjIsjg6guUqECEqClER5nn9I4MRer
yMHwYxZKfXCYFT9Z7hqTpyKuwiyXEYZtEMiaeF7cWhPxT2XEQ8MRSuHKtqxu
50XzKZlEhM5HjzhxkMoBUTC8SrhG0gxGwipQZysCi+SmmB5STQDO0fVxKIsN
5gOMBSUaJw8WOhW7vdHN2nEMiKiJLgL+3o3ZsEEMNxUv8rgDk0ybIxFDp/4F
lxocPZ4kZ143u0UvwMhkbWUCBtV19LSfgTkNMmLtUhtt2NugtZmxOCd0qAm5
BW3Vy+fwHgBDxGLbkwK2Js/GobENqebAfkQzUWmwlwsyFjJJQETniTcNEnL2
oWndTkgJH5QPVA2JIOe1C4ZdpCqUgcxk1ppc2UtpDIKaDYNIhlyHxXJ28AUv
g0iZ/PozxdqatXq2gQZkrq1hwr5cwYRFncsMRJiugAVc5VuHU10ZhzcGf6LU
xH4kZrSyduASa08WepO+q+E7PpKrtF67Vuet6AtWO/SwGa378hbKs5qlwbaJ
udn8FdYEoG3r8zPLmqYW4EZCgEPOr4ItGzWCJYM9NCzUM+SdY8A+SkYAWCwL
KgnkLC7ikSy5N12GD666wmB9bjzFkgsXzhPpJqkkKvKe/rLj8+CQqh+RdlUl
bZmTmSipJqSG9KyNcho3PCxKYgkvvQXBde1KR+4ue7rnKVIMoG+0UQ4kDTrB
NPKg+0cH9k0ynZIUKoTtWCGfnH8+Nagw/hTMJiNIQEEPgQ/2sd1x8H64UfON
CoCeKRlxxkN2uASTnmYlPSRDSGtaXP7CIa3h26Ekwlq5TRrYiUdzTjInqTus
j7OPPG0MrGZUxkbchDe7qvNOA49lg9AKg8AoY/p1zJPj8j7kNDJzTlozAfbO
AHYClNOITn5z/m4Fy4L3qnaU58eWyJykLTIS/JLiHNPAbVjLx/SCmWZvpiFl
lHmv5vnIArykeFfKqPhSQa1Vum4zPGF5oASwYBPKIVgEVOcEiWY6abjevAl7
Y6kJF8qCXrQEsRCQJQhInA87gQOxGaypJFeQ8K56BlCh5d4cuyxvbEO5xtO3
dZVmoi7zLjGPt9yzSQ9YAWJiP1N1CzoUmjF6jEdlcaF6IcA+RGZ9clAeR4Xh
sD9HQXUjwsajH3rhnxwx9tH/8yk/0VjkaclTednZCfw6Qs0PDR6nwX66QCUH
Yw8d1sFDfBLGPmBfh35uDjzyya/9mJw7a2cTSUIffVsdHGcEDQyO+RX+f/UP
g9DoB6wzGvHkU0/irzYMvb/I+4ff9e1Dht8RrX1o+OE7etj4jxgxiZEzPiGN
YH/w6B3jgdcxpfYBqyOPHh4vsRVkczkTA9HDxz/w7v/b3t4leYMlMgXp9ehW
Do9nuga84JS02aUQqf9/+g8Yr0kwP4Zs3tGtHB5/aMEPHf9y47IPsfr4G8bH
fOrTx590JLTAHKdstPuvAT2HXv/g23/QSkaHn5UUODIc/GP/43+PtyeHsaX3
eTz80zKqnvSHA7H6kO9ADpLdI8BQzspxW2ECPYPhe4pq52yW3vCnyQloZgpr
8t2BgxgZPv4QB8cf9XJ6RoZfAJLVy+SdeG11OAbZY4lDzOUR+Xzk7eGMntgD
Mkf35K6ji5Z8aL/Rn584/M57PzD8ofd+YDimrWDwcvLW3aqvIBk5uoPDR38e
PtwneD01CVkPH24St55eiGL64OF/93v/nbTuISt54PD/ED4tuCtKHOdXDR+9
Q8oSm9AQVh82/pGYH1G0/vOfQBG6/eITxv9d+eQ9OVv3Df/NP79z+Ggy2OjP
PVrtQ34+Jq8wGyr/1fVy9B6+icOy3ydMMZI1+KlT6PqfUoq2+DY/bQpOMrzk
QKXfspE7bsQm7n2piXsjbi4+guDKeqOmU0zW4+hwybGg8FzBZ03relmVbK9t
BblN3sbW19hIk7IqZ0uXYV6E9bQY40WGLp/g+q5NuC6HvaLlFouFUUlAMXnn
tTE694puov275dip3jdkyJ5GJutaa4M6Y8r1oVloEK0wX38sUD2vQxCtGHit
Q1ddxr6kXxygR28g52uICAhb6q124FfUmj1iSg3X1OZutoDT/kAuF5hrnlDk
SaVVB/ImtmxTyZrS29d9tDdWVttHdvihWzDUfPP5WHaT6lQSd2Vscedillxy
jYVZTs4M/hW1g3ujdoizQAOw+lNs6TM+VngRMJ0iPLLU88ZxLbnJwqFTlg0b
ZUf8k+RCjaCNrkYzItAv4CRqQfFhBMYFLAXGw7JSsw7jg6EcAoZKjPho8wKu
BJZUs+lYwRSHzchvKNtjD8EcKWtBVmgJ0mg2VVeo0T3O/RsBXCnGRsE/8P5f
QVIzb9HVm6CILNACvxAqtRcF8cYBLRqZjzsP7i7jQMVrURAxeCYTUshg0fkU
Pa7lyXVeKQHKB4FYSiODJS7XeoN04eIdJMe4hl6YuCo+Jgo9LoUEGJcPolgf
X+XofWFIE4SbNh4rZ1hRnSLy2GUfzgAh1tettEkfJrxKZ+GMsR3j7U8Yw8Wu
FEMsPBlgp+K8R+Qj6pEWGGbkCUKI9LBxumFGjMsIgDDE/atBenUvhkXKGd64
upCyKWikoSjIQKO5dqRk2KhvKGyAC/ZiuF1UKGssnsuHlmj+ti5ZahdLNAlS
+ZBPY8MoycVHt0153lr7S+hUFMDg1Xcls8H+c9ntcDcNhZsce5dXcFaPOLpC
MJ6pZhct3+PZwP+NJ8HhFhr23WMu445tPg+tlm2NZxi0o9ANQzz7xKRL83cA
JLhnxQSFlh6Nn1LJ1JxYcO/gUJDAXykCVoIvJfIirqWFoh2mwvqD5s+bcNw+
Yjuk/ViHNJGm0Vq9CxN9qyknnsunQKi2hImmSHWzB2q7bQILkOyIZTDOLP2l
2iBPvxDZXPCST5WRBerp43vYsT/Iyo8u1EtcUaAIevTVXT/YfMNOTckE3Aqw
VwX6Rc3J7W0gYkTgBwBHxx8nPRL1ZuhVjk+r4tqn/AGXAGb2DOK3o+ODZfkc
AI3+F3/vTCtnW9zQqMnSSQoZl0HGw3fiQ+8HXGk+W8+ZzYTL5On69Ax4cIsZ
uqswq41d02mV46i3umqyvBCmxakwWAlvwET7vIYRopHIwXBIDZVZ9CjmC9Va
YoZCQS11xj2OMJXcUglIhdNGCFtkGEBAC5qE2PtMDkOQZqRObH/hGdXQjGNJ
uIIqkyqWjqZjgRTT/qHEFRO9SCjgzilTqGV8yHc7ZI+exkhGce1+YvWDYmMR
Qnl9Ghgy4PsiHQzyG2SxRIp86OMgxjkUsvD5fuUQ9iiESEBUIgmibJI4Jgu5
kwmSAfDkKvZwG3WBAWtxXMRUUs1NPWcv2huePmTHGuFpaK5WLFykGEG7Yrks
FMvxaZdaWp9LhcxcXdMatDitxnIO07OjrJYlRXvYsDNbkzqKrzgusAJFu9km
z4/Gwj57+jDm1e86ah+SJJfJnzSQexD4TQ/8YB4YBoHTI1fwSE8lUMf9ZNJe
A0jfxE/A7DUXhZxMWOz5QWNS3HbX7o84ZqSFUT/MS9jjtVchHn3B3+Ur+PrP
ydWRNyyQdMdfpt4LfS0xpNcsLT26hGuhBcH/ZaZTegtHv1wzTl2n7SP4Gr/F
iM0GnnjGD/NqT8dWiz8Onjyd76rddSau1GvGjqWuW9ZOwPT23dvTo8gwwsz3
Ogj511Z9eXT6RfQ0YxcV6DGBvfqtrpz//yR5Hi2AP/1z8ub4f1//8+nFu+ur
szen15dXp+eXo0tCXYlu4TrbZ4V79CkrodfhZQiDvs6ba5KfHmEt2S/670OK
hN98dvb2x+PXZyfHV6cnn8XvC4TNH1Ard/fIxY8Ki3HRciI57xpu8trHZ92z
pst/Ojs//zdfDxyIZ0PXLOPcs46T05P356/PXo4czvANQCXbFECBNKhrNkpc
By7Kr5oM30LjDOAizcsAA5ZctAEdNn6XvNrecqXeLQ6Zt2LvbuOHYPfm+z/B
9/Ge8ed0Dszf1e0jejLerSsaNxzxQ28E0xMlRbCEB5GIKxgIokdXl/wGRupr
4gZTJg/RWP6MhKZrzuogmyUxz2CW03BCtuOpRZCJqg88jbUlzK4TfUc4FBm8
Wi/qDgwvPf0jDniNzTA2xBtl2ihumyLWQd8ZsZl4MWHdpTUlK/FagoFlxKwy
1F7DTSw57scnhllO3dDLbtzohrAqu9d8Y23Rlu6q+Mh1/rnxPaP9QOUmtZiI
FG2Uuj6DnFpVum8BxUM2ApivGFFGxg52/fdtVXsuly8SKejaHAl7FFWI5AJr
Kh1whDXFiVKSLkk9RdFRRx86OJVP8lJLOkVyluqBpIg1CEd9nv7MN7goOQy3
H0YbIl5vyTa0cCHuFSd88SwBBTJf9SNpd8gXeLuSWapRq7bdioiYPso/6gwD
s3/1AmdX8QoWeCAUt6xg3yUqRA8Mys2b6CLxDSWVDwpRuHlPhCVZXCNhD4QV
59yzwofs0pl/i0c0lR34gi7DIGFNLPGnys08WNGz8dL9SGFN3R9ZUAj6LUIg
cWPT66VHTjh2UThxRSwkolIr1txh/5C+kdGqmmK2Q2m20Cp7aNeSpNIIlEn7
lyh47QGCub8pJv55yZ1xBmsBcg0YTsRP21iMDWSMTADSu0VYXYqNntY9s5BU
ELtDd8BEK7RVGlqNCaRIIfOqa1ARDXkFkvQhWUZiyQimIVsax9ZxkVJ3pNna
65bLNjqyFGi0GoGEWZpyycbJZQrDH9LD7i8FZQhyv7JMKMHGN9+aos1SlI70
6w1yFTXQTKPHTLZhlP4flzOUMgCj3Qp8HYdQIOB72OwN2rnH6WKoFtSBAJVq
sTe+aS4qNqgwICUJxNJJKd6+BFDy2ryk1/xK6yyFRl7Yb0tbQw36YUVepVHK
HLJHxOGAvgd5TI67qVbY3g2uaNmvO0oERxJC4VSzD66dFZgVjrmVU1bCAWbr
PA1pUD4Dx/dGgLuWKvwMGygd7uhmel0Too51W5di4uaWUwVNaT3LP6QEp3To
oCZmVT3j3ihkyXTNpiqWXKMTDnf26vRlwor5fWX++H6pVhzuO8F9Cw1FDmu7
Y8602mjkSRRVMWSZih2KrKxDe5F4erzAZWpmicxkjVuU6sv547G7YMuOBuud
iMi7NIYZswR6xPWEYOmxuoe6nvj6VjXJd69OZrR/Y4+bSgqRpPOIp9fMgzZl
yfQKMCu3Gu8XUxRRjSRpSbsWcoahz3rGbBnb06xPX3y+UUhhlWICmffBYpmO
AGt8JgYqo1xU8YeojPaKKqK+ErJBIQUDY4wpw2JFNqmmqiSHaZuk6BuOzcmN
RHN8D0gqYIXHWA8ru/Y7pAanU4+193t4kX2Vs0kxcfT5PHn82G5M4yRD0Jwm
abIbTKsSR3Jb3F2FibCww2asG2CvmaEurBc3EXEUFh8EgOB+vsSFD2/B8D9d
d7/azKC6jMGPu0o8+hopY6yEHAqNsWUuCiPuBZpiSLAqeIw4lsf0c4JRW7uT
fw2pGxEydRYqzwrc4Ss8PVge7/RCKAWe2PsdpcdlLr/xjsdAlo1FnAiQ0Jze
ZQ2ZVSAmZwdVBQkeYPniIRl3vAKMkhAhOW5SNNq/FyDvQKsjFPq2u65VtfZr
PKK+cjb0kOKZReJ3xM0pu5eYvayZkche/QARpiYjty+9cdfgUrDQuH1Mwqec
8D3q3CGtKb0nkdHqTfPwft8IcpC0GBWZ1GINUTqivygRRPtJnx6uglyumsUL
vCQxQMxEBA61/JUCBDIZ6hXGZFIzIm0fS3Gtc+M/75IOnZJDgy0yP9TdjkUO
ccDf3SXLl/m0IQTDnlSDtFnkiC4WU+BS1hS/NqLe07tYc9eigPdr+latz40q
fyiZNtJ2Y5XdrBIL2BUurT9NNaeXHnyZqNYjajX71RSyQuPXQQotQxQLVY37
91NTtdkkV541TbcOK2RRr8IgzflSlFbnbXzEY698lvZjFumR7WW6fWUkQlRK
DwPw3ZBpoMppYunPjAMOlxqHyk58h9C+k24MhKKtWgeZDYXRjbN1TvqgBkEW
+ZbaRQwaH2y5qLXvQu3Se+HIwtBUavCwP5KqEMWF/RmyGN31DeNUx+dhI1G2
5oAF8AlUMdICVv/uTkrh6ypFqqwplZXG/diwnm3htlwh3XyucWeEh6FoWlxW
SyV7e71BAlJHp/iasQwSmiYbrpBFkpE/0mkINuifxnS0ezIdd78XJzfWFZ3P
1BMLlvhQjrfOqeaXVaPgrDJppEiEniNCqpUvIBPjJVLXflcKLnbLlgCqDW+6
esNGC+kOEhkoTAuLuWJPUFvED47KqYYJCPczBZCVKaPOUEhxO28VPrzrQ/pB
VLTYlmlS3E3DrjztQJ0FCyelzQe2lB5AAz8ilN2JgweopFSo5yQ55hQfIlfC
Wp4pNu5Deajd67Aps1RAjCqqcgTMSprmcEl40wdGio31in/5qsIpRw6kHHrt
D0xqZsWK7bCrIVmI605Ln1yFalumrNgRfzEMEUuGPeFte/PQkvF4UKZw6mvj
92xk6r4ZVAmzAo63RDE0CmhapIwBtNcyM9QflxrDVKX+nmqsttaWrQE48W1p
NNpvOrQHTHsKo8xJVz/TzhFxZwsRAIAsYWMKrvInjgs2PsXxL75xDlEMLQkR
tzylyEAKyhHvjKniFiIUo8bkvpO2xHkhcvnmCZ9LLsaPcZihaV71JjTGZiDC
gq5VQ+X84qj8B3QOp3BJbTlhm65bomG7z5/ZOj1UaJmvlUimZYGMggjyobSX
h7FhE24Be+4tHQLoAZdoOQu3r2wDa4O2wC6xHsomRP80ijtdW3Ab9UE3cVXu
UHCMaIVcGp+21pC1rc8xrJix9sAREbHpde0KtzmZvInfp3WpvQi02EssUs94
pWcGKEtMW20aPhgsNFTyF06xn1EVrFC9ra+TxdXbACEIcaj+UWw2C4Yif7Nj
Iq7xZagHclQ4HjNfeW8gGkCHHZC9oMwmsl5wnSeSESOWDsW+QCQRKYqf4+1h
xGYPKmGvFwqxtuMW12Y1pNxUJ2OShAU1APX2qJ2ehIqJ/V694pb0CwjLZwd5
THJ92Lcp2DWj7p3J8bp2JFBJqWHOpsj2pjW561UDZc0cFxUfAn+rUfRSKS7W
vg/tLjf1KO9Wl4PEExiMOXZ8pzHN2fe9FN/ZMA5vrK7ysF8V8yXs5DBuFlZp
iypwYilENSfbHmJ0RjPLkUIxNIxPMBVw7dSSe6GzWzrExLN2UbMJsTlJGAYs
FPtwEQ3v4MZ69WMP+SQGfYEGnNcKNFmReu3Yd8Xw5WxTuQgQZfclDEKXha/p
TCdHlT73UToX3RdxCmSVosKE5A27Pz8/uz4JS1kpD/zvIM8TQhrjNnYM8nVt
A6cgbZiKurKROzAcsgocIPKCOJbUU6MNOzGTF624rtZ3bE2IgkSQQRGW36g3
Z6x9+6hpUzj4iMnJu6I17Hu82RLnAZJhHbM9YZoDvZTJTtww0VV2cqCQsU24
OICEsUzIcOBbfvdrjR62GgwNJPc2Licr+J1FVZmqkKHBFoKdpVQpWDNMvONn
etgo00MsmaFfotfW8D3W5SsAhHCfJhCJzPfxBH53W6mXyDS9Cl2xOIMzLW0m
Tugc5VMzNCKI8wxt7xZs+2DUrND/YPTyaQ9jfgsu76pVogkXTf7ayEUPhXmt
hmpYL6mARpQe2puEV0ZgM8Audk4JhmmziYDDXeNsfi2crY+FYWfISMvKcZ1f
iXooCdhnmKG5lKU0Fr1S8gJpxpysNoAEQEhG4j5AMksitsXsWcQmxZFBd77J
l0vsBuGrJA8zLlUBR7gw/S9C3w8ld5qoEYxJzMMv9Dq+k/OzCxhSVp+619OB
oysn8CY+0Trbz0/fGZsoR0QU4Wdq2hoKKX2dd5zgytuCHnIqnJjllNOo8OgU
hMZtJXYdYcRTI0qYkCM8sI1LlyR8hpronq0BGUIDwyG3NlkqQ35qKBPLckBf
yEjejxauH7Z0MDEw/VCGfE0dB2qCM0w44BANtq+LdyPkXIjlDNXpOt9Kdi6V
9hg0oSIzxBjV6Xd7HdAO3mwwHpAcDf9UW0BStxzBS0YrQ2pADmoG6TDl3bpf
6BVrJAoVahLNJ2FSRcejhFj5J5UkwC5icplk+CKV0Fq+0jbVLaqO7+HJODjT
IgBT8rZKrEoHzKg2Fmn2OS1DPJtprOMvingeV1pHT8Hk86gONghpBhnUgNOw
6c1QpCjCIsTjKamI4iqCyqv+0t/D/dBOh7bwdpPXqAyVSy5g9bu4HweJ+xjd
NtgQfWQu+2pFBOJFBBXaeNe97DTWPLjRHgFaE9jQx+B597EQYnRrDnSMiaM3
xiLg4v4/3lErGWRBvuJmn3AdrhjGDIyItbH//oCfPrJIHJB3Q0CHdwHc2eX5
Ko4EH3a1GzNpS/69hPVZt//UeJQORBQP3ULenxXkFLUJ1q5XOsIoxsEbgiAv
DEsIK0V8EUAj/E7Flj7k6ntjWFeL7KBrsums2Nlk47iJ2PG9XTRFhw42LSa3
UXOwIOD4oPkrn7uuBnMVy8d88z25WlrgTO9pNuEtz94sbRs2WBu02BIVtwee
XrP1n7vU2A5lmQgOdGq+ddGhPhFGoBJXBQZ1noSgTukw4BH+kpYBnPKlFwPj
FIJew28JbCdKznIQR4wiGTFMQal/FFhk43kHxj9pacrxPGG50qCmn7ofLIJJ
1IstYkwc2FnVjaFmpjbLeOhmZIqRAMR7U1nF4YSXbNt8Eyn2so7heN6X2G6c
JSA2McQbtINHVKsPeWuyRqAzCWTqxcW8m02+ijqRKfFjB7QqRL1Qzn6wcMP9
NIiYDwmfCJJNzzAaVJrIlWl9TyEulDEouLF7luSQEDJenMebE2IA1xBlH07H
l+P1kKmQgZ5DTphn4IzW1lX5mbh31D2GvyjY1lgBxVZkaXngOiOwZ4yETAhY
WoubnHiT62gYw0HaQ+daFWKkGgusjmLu7xNZh41SJBMRq9CYuE7ff5C2wnoz
UCrQcmokfUp9+DAHcRjShhm5ii8tYxwWntMAX6hTdp9S3x85mlgSsBIYGofx
asT5OiXpmDS7Na0rIIgvPwF7qXPpZbBiyZvJtwStaz8+rQPj4ZzEHU3eoIIa
aGnDcyJFhF+NYFRgghA1D1JNtdftTPpHsgNWJhyxNOE78gZni6rPUBgjjF+K
OyChzHBrS1ZvGsBPyeQx4xI6tTPtLpp05SgLcEw+Km/yuipD6wCJvg7SN3Ad
ditQ9qPxg6vULlcyV73A17uIPEMDL9Qw7iW6/ZnD7B7HhoLeSXAdhRAfTs7b
yJYC89gOqj50SgtywKWN7MRx9SpKRIjjGmPrNUvjaUPBNHFfMdbkfSGO0IEa
o3ko7V7uPNyiKHR0LjMNLhBLAfo2Ed+kRAUsg/UMar7GtiJM2+x3Nmukg+CN
Q6Qe84xwnpzs28goty79UHL0ORt01ZUh14V0V2O7CzLgJ2fHb49H6IJZYiJ1
uShOlR73MZH/D7SWpfPYqAAA

-->

</rfc>
