<?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.39 (Ruby 3.4.9) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-nmrg-dtn-data-generation-optimization-05" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.34.0 -->
  <front>
    <title abbrev="Data Generation and Optimization">Data Generation and Optimization for Network Digital Twin</title>
    <seriesInfo name="Internet-Draft" value="draft-li-nmrg-dtn-data-generation-optimization-05"/>
    <author fullname="Mei Li">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>limeiyjy@chinamobile.com</email>
      </address>
    </author>
    <author fullname="Cheng Zhou">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>zhouchengyjy@chinamobile.com</email>
      </address>
    </author>
    <author fullname="Danyang Chen">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>chendanyang@chinamobile.com</email>
      </address>
    </author>
    <author fullname="Qin Wu">
      <organization>Huawei</organization>
      <address>
        <email>bill.wu@huawei.com</email>
      </address>
    </author>
    <author fullname="Yuanyuan Yang">
      <organization>Huawei</organization>
      <address>
        <email>yangyuanyuan55@huawei.com</email>
      </address>
    </author>
    <date year="2026" month="July" day="02"/>
    <area>IRTF</area>
    <workgroup>Network Management</workgroup>
    <keyword>network digital twin</keyword>
    <keyword>data generation</keyword>
    <keyword>data optimization</keyword>
    <abstract>
      <?line 87?>

<t>Network Digital Twin (NDT) can be used as a secure and cost-effective environment for network operators to evaluate network in various what-if scenarios. Recently, Artificial Intelligence (AI) models, especially neural networks, have been applied for NDT modeling. The quality of deep learning models mainly depends on two aspects: model architecture and data.  This memo focuses on how to improve the model quality from the data perspective.</t>
    </abstract>
  </front>
  <middle>
    <?line 91?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>Digital twin is a virtual instance of a physical system (twin) that is continually updated with the physical system's performance, maintenance, and health status data throughout the physical system's life cycle.  Network Digital Twin (NDT) is a digital twin that is used in the context of networking, as defined in <xref target="I-D.irtf-nmrg-network-digital-twin-arch"/>. NDT can be used as a secure and cost-effective environment for network operators to evaluate network in various what-if scenarios. NDT is applicable to various types of networks, such as wireless networks, optical networks, data center networks, Internet of Things (IoT) networks, and vehicular networks.</t>
      <t>Artificial Intelligence (AI) models, particularly neural networks (NNs), have proven to be highly effective in modeling complex network environments for various applications, including performance evaluation, traffic prediction, resource allocation, and service self-healing. AI-driven network modeling facilitates the creation of real-time, lightweight, and highly accurate NDT.</t>
      <t>The quality of AI models mainly depends on two aspects: model architecture and data. The role of data has recently been highlighted by the emerging concept of data-centric AI <xref target="Data-Centric-AI"/>. This memo focuses on the impact of training data on the model. The quality of training data will directly affect the accuracy and generalization ability of the model. This memo focuses on how to design data generation and optimization methods for NDT modeling, which can generate simulated network data to solve the problem of practical data shortage and select high-quality data from various data sources. Using high-quality data for training can improve the accuracy and generalization ability of the model.</t>
    </section>
    <section anchor="acronyms-and-abbreviations">
      <name>Acronyms and Abbreviations</name>
      <t>NDT: Network Digital Twin</t>
      <t>AI: Artificial Intelligence</t>
      <t>AIGC: AI-Generated Content</t>
      <t>ToS: Type of Service</t>
      <t>OOD: Out-of-Distribution</t>
      <t>FIFO: First In First Out</t>
      <t>SP: Strict Priority</t>
      <t>WFQ: Weighted Fair Queuing</t>
      <t>DRR: Deficit Round Robin</t>
      <t>BFS: Breadth-First Search</t>
      <t>CBR: Constant Bit Rate</t>
    </section>
    <section anchor="requirements">
      <name>Requirements</name>
      <t>The modeling performance is vital in NDT, which is involved in typical network management scenarios such as planning, construction, operation, optimization, and operation.  Recently, some studies have applied AI models to NDT modeling, such as RouteNet <xref target="RouteNet"/>, MimicNet <xref target="MimicNet"/> and m3 <xref target="m3"/>. AI is a data-driven technology whose performance heavily depends on data quality.</t>
      <t>Data-centric AI <xref target="Data-Centric-AI"/> shifts the focus from model architecture to improving data through various techniques such as data augmentation, self-supervision, data cleaning, data selection, and data privacy. For example, data augmentation can create additional augmented samples. Self-supervised models can be developed without the need for manual labels or features. Data selection methods can help identify the most valuable samples.</t>
      <t>In many cases, network data sources are diverse and of varying quality, making it difficult to directly serve as training data for NDT AI models:</t>
      <ul spacing="normal">
        <li>
          <t>Practical data from production networks: Data from production networks usually have high value, but the quantity, type, and accuracy are limited. Moreover, it is not practical in production networks to collect data under various configurations;</t>
        </li>
        <li>
          <t>Network simulators: Network simulators (e.g., NS-3 and OMNeT++) can be used to generate simulated network data, which can solve the problems of quantity, diversity, and accuracy to a certain extent. However, simulation is usually time-consuming. In addition, there are usually differences between simulated data and practical data from production networks, which hinders the application of trained models to production networks;</t>
        </li>
        <li>
          <t>Generative AI models: With the development of AI-Generated Content (AIGC) technology, generative AI models (e.g., GPT and LLaMA) can be used to generate simulated network data, which can solve the problems of quantity and diversity to a certain extent. However, the accuracy of the data generated by generative AI models is limited and often has gaps with practical data from production networks.</t>
        </li>
      </ul>
      <t>Therefore, data generation and optimization methods for NDT modeling are needed, which can generate simulated network data to solve the problem of practical data shortage and select high-quality data from multi-source data. High-quality data meets the requirements of high accuracy, diversity, and fitting the actual situation of practical data. Training with high-quality data can improve the accuracy and generalization of NDT performance models.</t>
    </section>
    <section anchor="framework-of-data-generation-and-optimization">
      <name>Framework of Data Generation and Optimization</name>
      <t>The framework of data generation and optimization for NDT modeling is shown in Figure 1, which includes three stages: the data generation stage, the data optimization stage, and the data assessment stage.</t>
      <figure anchor="kelem">
        <name>Framework of Data Generation and Optimization for NDT</name>
        <artwork align="center"><![CDATA[
     Data Generation       Data Optimization       Data Assessment
+---------------------+  +--------------------+  +-------------------+
|                     |  |                    |  |                   |
| +-------+           |  |  +-----------+     |  | +---------------+ |
| |Network|           |  |  | Real Netw.|     |  | | Stat & Distr. | |
| | Topo  | +-------+ |  |  |   data    |     |  | | Verification  | |
| +-------+ |       | |  |  +-----+-----+     |  | +---------------+ |
|           | Netw. | |  |        |       +---+-->         |         |
| +-------+ | Sim.  | |  |        v       |   |  | +-------v-------+ |
| |Routing| |       | |  |    Candidate   |   |  | | Netw. Constr. | |
| |policy +->       +-+--+-->   data      |   |  | | Verification  | |
| +-------+ |       | |  |        |       |   |  | +---------------+ |
|           | GenAI | |  |        v       |   |  |         |         |
| +-------+ | Model | |  | +------+-------+-+ |  | +-------v-------+ |
| |Traffic| |       | |  | | Data Selection | |  | |  DownsTask    | |
| |matrix | +-------+ |  | |                | <--| | Verification  | |
| +-------+   Data    |  | | - Easy samples | |  | +---------------+ |
|  Network  generator |  | | - Hard samples | |  |         |         |
|  config.            |  | | - OOD (remove) | |  |         v         |
|                     |  | +----------------+ |  | High-quality data |
+-----------^---------+  +--------------------+  +---------+---------+
            |                                              |
+-----------+----------------------------------------------v---------+
|                         Data Repository of NDT                     |
+--------------------------------------------------------------------+
]]></artwork>
      </figure>
      <section anchor="data-generation-stage">
        <name>Data Generation Stage</name>
        <t>The data generation stage aims to generate candidate data (simulated network data) to solve the problem of the shortage of practical data from production networks.  This stage first generates network configurations and then imports them into data generators to generate the candidate data.</t>
        <ul spacing="normal">
          <li>
            <t>Network configurations: Network configurations typically include network topology, routing policy, and traffic matrix.  These configurations need to be diverse to cover as many scenarios as possible. Topology configurations include the number and structure of nodes and edges, node buffers' size and scheduling strategy, link capacity, etc.  Routing policy determines the path of a packet taking from the source to the destination. The traffic matrix describes the traffic entering/leaving the network, and leaving the footprint in the paths of the network which includes the traffic's source, destination, time and packet size distribution, Type of Service (ToS), etc.</t>
          </li>
          <li>
            <t>Data generators: Data generators can be network simulators (e.g., NS-3 and OMNeT++) and/or the generative AI models (e.g., GPT and LLaMA). Network configurations are imported into data generators to generate candidate data.</t>
          </li>
        </ul>
      </section>
      <section anchor="data-optimization-stage">
        <name>Data Optimization Stage</name>
        <t>The data optimization stage aims to optimize the candidate data from various sources to select candidate high-quality data, which is verified through the data quality assessment stage.</t>
        <ul spacing="normal">
          <li>
            <t>Candidate data: Candidate data includes simulated network data generated in the data generation stage and the practical data from production networks.</t>
          </li>
          <li>
            <t>Data selection: The data selection module investigates the candidate data to filter out the easy, hard, and Out-of-Distribution (OOD) samples. Hard examples refer to samples that are difficult for the model to accurately predict. During the training process, exposing the model to more hard examples will enable it to perform better on such samples later on.  Then the easy samples and hard samples are considered valid samples and added to the training data. OOD samples are considered invalid and removed.</t>
          </li>
        </ul>
      </section>
      <section anchor="data-assessment-stage">
        <name>Data Assessment Stage</name>
        <t>The data assessment stage aims to verify, from multiple perspectives, whether the data produced by the data optimization stage meets the quality requirements of NDT modeling, and to provide feedback to the data optimization stage to support continuous improvement. It mainly includes sub-modules of statistical &amp; distribution verification, network constraint verification，and downstream task performance verification. The result of this verification is fed back to the data selection module of the data optimization stage , forming a closed loop that iteratively improves both the data optimization strategy and the resulting data quality.</t>
        <t>Data that passes the above verifications is regarded as high-quality data and is stored in the Data Repository of NDT for use in NDT model training and other applications. Data quality dimensions and assessment mechanisms are further detailed in Section 7.</t>
      </section>
    </section>
    <section anchor="data-generation">
      <name>Data Generation</name>
      <section anchor="network-configuration">
        <name>Network Configuration</name>
        <t>This section will describe how to generate network configurations, including network topology, routing policy, and traffic matrix. Then these configurations will be imported into data generators to generate the candidate data.</t>
        <section anchor="network-topology">
          <name>Network Topology</name>
          <t>Network topologies are generated using the Power-Law Out-Degree algorithm, where parameters are set according to real-world topologies in the Internet Topology Zoo.</t>
          <t>When the flow rate exceeds the link bandwidth or the bandwidth set for the flow, the packet is temporarily stored in the node buffer. A larger node buffer size means a larger delay and possibly a lower packet loss rate. The node scheduling policy determines the time and order of packet transmission, which is randomly selected from the policies such as First In First Out (FIFO), Strict Priority (SP), Weighted Fair Queuing (WFQ), and Deficit Round Robin (DRR).</t>
          <t>A larger link capacity means a smaller delay and less congestion. To cover diverse link loads to get good coverage of possible scenarios, we set the link capacity to be proportional to the total average bandwidth of the flows passing through the link.</t>
        </section>
        <section anchor="routing-policy">
          <name>Routing Policy</name>
          <t>Routing policy plays a crucial role in routing protocols, which determines the path of a packet from the source to the destination.</t>
          <ul spacing="normal">
            <li>
              <t>Default: We set the weight of all links in the topology to be the same, that is, equal to 1. Then we use the Dijkstra algorithm to generate the shortest path configuration. Dijkstra algorithm uses Breadth-First Search (BFS) to find the single source shortest path in a weighted digraph.</t>
            </li>
            <li>
              <t>Variants: We randomly select some links (the same link can be chosen more than once) and add a small weight to them. Then we use the Dijkstra algorithm to generate a series of variants of the default shortest path configuration based on the weighted graph. These variants can add some randomness to the routing configuration to cover longer paths and larger delays.</t>
            </li>
          </ul>
        </section>
        <section anchor="traffic-matrix">
          <name>Traffic Matrix</name>
          <t>The traffic matrix is very important for network modeling. The traffic matrix can be seen as a network map, which describes the traffic entering/leaving the network, including the source, destination, distribution of the traffic, etc.</t>
          <t>We generate traffic matrix configurations with variable traffic intensity to cover low to high loads.</t>
          <t>The parameters packet sizes, packet size probabilities, and ToS are generated according to the validation dataset analysis to have similar distributions.</t>
          <t>The arrival of packets for each source-destination pair is modeled using one of the time distributions such as Poisson, Constant Bit Rate (CBR), and ON-OFF.</t>
        </section>
      </section>
      <section anchor="data-generator">
        <name>Data Generator</name>
        <section anchor="network-simulator">
          <name>Network Simulator</name>
          <t>Network simulators make distinct trade-offs among fidelity, speed, and scale, and can be broadly classified into three categories:</t>
          <ul spacing="normal">
            <li>
              <t>Packet-level simulation explicitly models the generation, transmission, and processing of individual packets. This approach achieves high fidelity and enables detailed observation of microscopic behaviors—such as protocol dynamics (e.g., TCP congestion control) and per-packet queueing effects. It is widely considered the reference method for evaluating mechanisms like new transport protocols and latency-sensitive applications. However, the high computational cost typically limits its use to small- or moderate-scale network scenarios. Representative tools include ns-3 and OMNeT++.</t>
            </li>
            <li>
              <t>Flow-level simulation abstracts traffic into continuous flows, described by aggregate parameters such as average rate. This method achieves high scalability and is well-suited for macroscopic studies—such as Internet-wide traffic engineering, routing convergence, and capacity planning. While it sacrifices packet-level details (e.g., burst-induced queueing behavior), it remains effective for analyzing large-scale network properties where fine-grained fidelity is not critical. Typical implementations include flowSim <xref target="flowSim"/> and ASTRA-sim <xref target="ASTRA-sim"/>.</t>
            </li>
            <li>
              <t>Analytical modeling, often grounded in queueing theory, employs mathematical formulations to represent network behavior. This approach offers the highest computational efficiency and is particularly useful for deriving performance bounds and understanding fundamental trade-offs among system parameters. It is commonly applied to analyze idealized network elements, such as a single buffered link. A key limitation, however, is its reliance on simplifying assumptions, which may not capture the full complexity and variability of real-world traffic.</t>
            </li>
          </ul>
        </section>
        <section anchor="generative-ai-model">
          <name>Generative AI Model</name>
          <t>Generative AI (GenAI) presents a novel paradigm for synthesizing network data. By learning the underlying distributions and complex temporal dynamics from existing network traces, generative models—such as Generative Adversarial Networks (GANs), Variational Autoencoders (VAEs), and Diffusion Models—can produce realistic, high-dimensional network traffic data. This capability is particularly valuable in scenarios where real data is scarce, sensitive, or difficult to obtain. For instance, GenAI can be used to generate synthetic packet traces that preserve the statistical properties and temporal dependencies of real traffic without exposing private information, thus facilitating data-sharing for research. It can also model rare but critical events, such as network attacks or flash crowds, to augment datasets for robustly training intrusion detection systems or evaluating protocol resilience under stress. A key consideration, however, is the fidelity and representativeness of the generated data, which hinges on the quality of the training data and the model's ability to capture the full breadth of network stochasticity, avoiding the introduction of subtle biases or unrealistic artifacts.</t>
        </section>
      </section>
    </section>
    <section anchor="data-optimization">
      <name>Data Optimization</name>
      <t>This section describes how to optimize the data from various sources to filter out high-quality data, which includes the seed sample selection phase and incremental optimization phase.</t>
      <t>Candidate data includes simulated network data generated in the data generation stage and real data from production networks. Data optimization supports a variety of selection strategies, including high fidelity, high coverage, etc. High fidelity means that the selected data can fit the real data (e.g., having similar topologies, routing policies, traffic models, etc.), and high coverage means that the selected data can cover as many scenarios as possible.</t>
      <section anchor="seed-sample-selection-phase">
        <name>Seed Sample Selection Phase</name>
        <t>In the seed sample selection phase, high-quality seed samples are selected through the following steps to provide high-quality initial samples for the incremental optimization phase.</t>
        <t>STEP 1: Training feature extraction model and feature extraction.</t>
        <t>(1.1) The training data D' is selected from the candidate data D according to the selection strategy.  For the high fidelity strategy, the real data is used as the training data D'; for the high coverage strategy, the real data and simulated data are used together as the training data D'.</t>
        <t>(1.2) Feature extraction model E is trained using the training data D'. Feature extraction model E is a network performance evaluation model that can be used to evaluate performance indicators such as delay, jitter and packet loss (such as RouteNet).</t>
        <t>(1.3) Use the feature extraction model E obtained in STEP (1.2) to extract the feature of the training data D' obtained in STEP (1.1). A network can be defined as a set of flow F, queue Q, and link L. The link state SF (such as link utilization), queue state SQ (such as port occupation), and flow state SL (such as delay, throughput, packet loss, etc.) are taken as features. Each sample in the training data D' is converted to a feature vector [SF,SQ,SL].</t>
        <t>STEP 2: Clustering.</t>
        <t>Cluster the training data D' after feature extraction. Clustering (such as K-means and DBSCAN) is an unsupervised machine learning technique that can automatically discover the natural groups in the data, divide the data into multiple clusters, and the samples in the same cluster have similarities.</t>
        <t>Repeat STEP 3 and STEP 4 until all clusters have been traversed.</t>
        <t>STEP 3: Calculating cluster centers and nearest neighbors.</t>
        <t>(3.1) Calculate cluster centers. The method of calculating cluster centers is determined according to the clustering algorithm used in STEP 2. For example, using K-means clustering algorithm, the cluster center is calculated by finding the average of all data points in the cluster. These cluster centers are added to the seed dataset DS.</t>
        <t>(3.2) Calculate k nearest neighbors of each cluster center and add them to the seed dataset DS.  Suitable nearest neighbor calculation methods can be used, such as Euclidean distance, cosine distance, etc.</t>
        <t>STEP 4: Expert knowledge verification.</t>
        <t>(4.1) Expert knowledge can be used to verify the validity of samples through the range of indicators such as delay, queue occupation, and link utilization.  If the verification passed, go to STEP 3. Otherwise, go to STEP (4.2).</t>
        <t>(4.2) Randomly select m samples from the seed dataset DS and remove them. Calculate the nearest neighbors of the removed m samples, add them to the seed data set DS, and go to STEP (4.1).</t>
      </section>
      <section anchor="incremental-optimization-phase">
        <name>Incremental Optimization Phase</name>
        <t>The seed samples are taken as the initial training dataset. The filter model investigates the remaining candidate samples to filter out the easy, hard and OOD samples. Then the easy samples and hard samples are added to the training dataset. These processes are repeated to iteratively optimize the filter model and the training data until the high-quality data meets the constraints.</t>
        <ul spacing="normal">
          <li>
            <t>Easy samples: Easy samples are data points where the model's predictions align closely with the true labels, often with high confidence. While training on easy samples can lead to good performance on familiar data, relying solely on them may limit the model's ability to handle complex or ambiguous cases, potentially causing overfitting and poor generalization to unseen data.</t>
          </li>
          <li>
            <t>Hard samples: Hard samples are data points where the model struggles, producing inaccurate, ambiguous, or low-confidence predictions. These samples are crucial for improving model robustness and generalization, as they expose weaknesses and encourage learning more discriminative features. Techniques like Online Hard Example Mining (OHEM), contrastive learning (focusing on hard negatives), and curriculum learning (gradually introducing harder samples) leverage hard samples to enhance model performance, prevent overfitting, and identify potential data issues such as labeling errors or biases.</t>
          </li>
          <li>
            <t>OOD samples: OOD samples refer to data points that significantly deviate from the training distribution, which should be detected and removed. Common detection methods include uncertainty estimation (e.g., Bayesian neural networks), density-based approaches (e.g., VAEs), distance-based metrics (e.g., Mahalanobis distance), outlier exposure, and energy-based models.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="data-assessment">
      <name>Data Assessment</name>
      <t>This section defines the data quality dimensions and assessment mechanisms used in the data assessment stage described in Section 4.3, in order to systematically verify whether the data produced by data generation and optimization meets the quality requirements of NDT modeling.</t>
      <section anchor="data-quality-dimension">
        <name>Data Quality Dimension</name>
        <t>The quality of data for NDT modeling can be evaluated along the following dimensions:</t>
        <ul spacing="normal">
          <li>
            <t>Accuracy: The degree to which the data reflects the actual physical network states or expected behavioural patterns. Accuracy can be assessed by comparing the optimized data against measured data using metrics such as Mean Squared Error (MSE), Mean Absolute Error (MAE), or distribution distance measures.</t>
          </li>
          <li>
            <t>Completeness: The degree of coverage of the data across the relevant time, space (e.g., network nodes, links), and feature dimensions. Completeness can be assessed using metrics such as the missing rate of fields or time-series sampling points, and sample coverage rate.</t>
          </li>
          <li>
            <t>Consistency: The logical consistency of the data describing the same network entity, across different data sources, time points, or after different processing steps. Consistency can be assessed by comparing statistical values of the same metric obtained from different sources, or by performing logical and temporal verification.</t>
          </li>
          <li>
            <t>Timeliness: The delay between data generation/collection and its availability for NDT modeling, which should meet the (near-)real-time requirements of the target NDT application. Timeliness can be assessed using metrics such as the delay between the data collection (or generation) timestamp and the availability timestamp, and the data update frequency.</t>
          </li>
          <li>
            <t>Diversity: The degree to which the data covers different network scenarios, configurations, traffic patterns, and rare events such as faults and attacks. Diversity can be assessed using metrics such as feature space coverage, category distribution statistics, or entropy-based diversity measures.</t>
          </li>
          <li>
            <t>Task adaptability: The degree to which the data is suitable for, and improves the performance of, models developed for specific NDT tasks (e.g., performance prediction, fault diagnosis, decision-making). Task adaptability can be assessed using task-specific performance metrics (e.g., accuracy, F1-score, AUC, prediction error) obtained by training and/or validating models with the data.</t>
          </li>
        </ul>
      </section>
      <section anchor="data-quality-mechanisms">
        <name>Data Quality Mechanisms</name>
        <t>Data quality assessment can incorporate a hybrid approach combining mathematical verification, protocol validation, and downstream task evaluation, corresponding to the steps illustrated in the data assessment stage of Figure 1.</t>
        <ul spacing="normal">
          <li>
            <t>Statistical and distribution verification: This step compares statistical and distributional properties of the optimized data against real network data, mainly addressing the accuracy and consistency dimensions. Typical methods include Q-Q plots, the Kolmogorov-Smirnov (KS) test, and other distribution-distance measures (e.g., Wasserstein distance).</t>
          </li>
          <li>
            <t>Network constraint verification: This step verifies whether the optimized data conforms to protocol behaviors and network operational constraints (e.g., valid ranges of delay, queue occupation, and link utilization), so as to filter out data that, although statistically plausible, is not physically valid, mainly addressing the accuracy and completeness dimensions.</t>
          </li>
          <li>
            <t>Downstream task performance verification: This step evaluates the data by training and/or validating models for the target NDT task and measuring task-specific performance metrics, mainly addressing the task adaptability and timeliness dimension. The result of this verification is fed back to the data selection module of the data optimization stage, forming a closed loop that iteratively improves both the data optimization strategy and the resulting data quality.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="use-cases">
      <name>Use Cases</name>
      <t>NDT can be applied to various types of networks, including data center networks, IP bearer networks, vehicular networks, wireless networks, optical networks, and IoT networks. This section highlights the significance of data generation and optimization in NDT by presenting several typical use cases.</t>
      <section anchor="configuration-evaluation-and-optimization-in-data-center-networks">
        <name>Configuration Evaluation and Optimization in Data Center Networks</name>
        <t>Data centers are essential for the growth of Internet services, consisting of numerous computing and storage nodes linked by a data center network (DCN), which serves as the communication backbone. The DCN faces challenges related to its large scale, diverse applications, high power density, and the need for reliability. NDT can evaluate configurations and technologies to reduce the risk of failures. For NDT to be effective, it must accurately model DCN traffic. A key challenge lies in generating realistic network traffic. By analyzing traffic patterns, data generation and optimization techniques can assist in creating simulated network data and optimize both real and simulated data. Numerous factors, such as the type of business, network size, volume of traffic, and load, influence traffic patterns in extensive DCNs. Moreover, these traffic patterns are dynamic and evolve over time. For instance, workloads that are sensitive to latency, like online transaction processing, tend to peak during the day, whereas workloads for online analytical processing are more prevalent at night.</t>
      </section>
      <section anchor="performance-prediction-in-ip-bearer-networks">
        <name>Performance Prediction in IP Bearer Networks</name>
        <t>Internet service providers encounter challenges in delivering high-bandwidth, low-latency, and reliable services, especially in large networks like metropolitan area networks (MANs) . The widely adopted IP protocol adheres to a best-effort principle, making predictable performance difficult and complicating the stability and availability of network services during failures. NDT can function as a high-fidelity simulation platform for predicting IP bearer network performance.  Accurate network status information is vital for optimizing protocols and identifying faults. Recent advancements in in-band network telemetry (INT) technology have allowed the integration of network performance data into packet headers on the data plane. Utilizing real performance data from INT, data generation and optimization techniques can create fine-grained simulated data, enhancing both real and simulated datasets for better model training outcomes.</t>
      </section>
      <section anchor="task-offloading-in-vehicular-networks">
        <name>Task Offloading in Vehicular Networks</name>
        <t>The rise of vehicular networks has facilitated various delay-sensitive applications, including autonomous driving and navigation. However, vehicles with limited resources struggle to meet the low/ultra-low latency requirements. To address this, computationally intensive tasks can be offloaded to resource-rich platforms like nearby vehicles, edge servers, and cloud servers. The dynamic nature of these networks, along with strict low-delay demands and large task data, presents significant offloading challenges. NDT is an emerging method that allows real-time monitoring of vehicular networks, aiding in effective offload decisions. Additionally, machine learning algorithms are increasingly utilized for task offloading to enhance accuracy and efficiency. Unlike traditional communication networks, vehicular networks are more dynamic and heterogeneous, leading to data shortages and quality issues. Data generation and optimization techniques can simulate data for adaptability and filter high-quality data from various sources, thereby improving model training effectiveness.</t>
      </section>
    </section>
    <section anchor="discussion">
      <name>Discussion</name>
      <t>Several topics related to data generation and optimization for NDT performance modeling require further discussion.</t>
      <ul spacing="normal">
        <li>
          <t>Data generation methods: 1) Generate configurations that cover enough scenarios and scale from small to large networks. 2) Choose data generators that consider accuracy, speed, fidelity, etc. 3) Use data augmentation technology to expand the training data by using a small amount of practical data to generate similar data through prior knowledge.</t>
        </li>
        <li>
          <t>Data optimization methods: 1) Select data from multi-source candidate data, including hard sample mining, OOD detection, etc. 2) Verify whether the data quality meets the requirements.</t>
        </li>
        <li>
          <t>Deployment: Time/space complexity and explainability of the data generation and optimization methods.</t>
        </li>
        <li>
          <t>Directions on standardization: which related research is suitable for promoting standards in IETF?</t>
        </li>
      </ul>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>TBD</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-informative-references">
      <name>Informative References</name>
      <reference anchor="Data-Centric-AI">
        <front>
          <title>Data-centric Artificial Intelligence: A Survey</title>
          <author>
            <organization>ACM Computing Surveys</organization>
          </author>
          <date year="2025"/>
        </front>
      </reference>
      <reference anchor="RouteNet">
        <front>
          <title>RouteNet-Fermi: Network Modeling With Graph Neural Networks</title>
          <author>
            <organization>IEEE/ACM Transactions on Networking</organization>
          </author>
          <date year="2023"/>
        </front>
      </reference>
      <reference anchor="MimicNet">
        <front>
          <title>MimicNet: Fast Performance Estimates for Data Center Networks with Machine Learning</title>
          <author>
            <organization>ACM SIGCOMM 2021 Conference</organization>
          </author>
          <date year="2021"/>
        </front>
      </reference>
      <reference anchor="m3">
        <front>
          <title>m3: Accurate Flow-Level Performance Estimation using Machine Learning</title>
          <author>
            <organization>ACM SIGCOMM 2024 Conference</organization>
          </author>
          <date year="2024"/>
        </front>
      </reference>
      <reference anchor="flowSim">
        <front>
          <title>Bandwidth sharing: objectives and algorithms</title>
          <author>
            <organization>IEEE INFOCOM</organization>
          </author>
          <date year="1999"/>
        </front>
      </reference>
      <reference anchor="ASTRA-sim">
        <front>
          <title>Astra-sim2. 0: Modeling hierarchical networks and disaggregated systems for large-model training at scale</title>
          <author>
            <organization>IEEE ISPASS</organization>
          </author>
          <date year="2023"/>
        </front>
      </reference>
      <reference anchor="I-D.irtf-nmrg-network-digital-twin-arch">
        <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>
          <author fullname="Antonio Pastor" initials="A." surname="Pastor">
         </author>
          <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>
    </references>
    <?line 346?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>TODO acknowledge.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8V963LjSHbmfz5FRnWEW4oi2FNdPeEYzo5tlS7diinVjZqu
sNfeCBBIktkFAhwkIDW7qzb2AfzTj+On8QvsK+y55Q0gS6qJ8Y6iLxIIJDJP
nst3bsksyyad6So9V08u8i5X3+tat3lnmlrldale7zqzNb/whVXTqle6u2/a
D+rCrE2XV+r23tRPJvly2eq7R4zxZFLknV437X6uTL1qJpOyKep8C+8v23zV
ZZXJ6m27zsquzkoYLFv7wbImGij7zW8ntl9ujbXwV7ffwQjXl7dXSn2l8so2
MBdTl3qn4T9192SqnujSdE1r8gr/uD57Af+D9Ty5fnd79WRS99ulbucTeKWe
T4qmtrq2vZ2rru31BFb2fJK3Op+7+5EG67bpd3DFkeQmr/O13uLrJh/0Hq6V
84nKVC2fl0KyDkiG13F5KizPX4qXOZnkfbdpYGbZRMHPqq8qJteNNuqloYtN
u85reWCuzjemztVNszSVpo8L0wG1X2jzk6nXfKXp6w63gO6lS3qbm2quKrPV
Zv/T/p8K/GRLg8yKZjt6/flG12v1L5um/2tP4RcYs8DRHzONi7ze5zARnM5f
eyI4iZLHf3Aeb02t3h8ixQ99fq9NPCyMUc3u+3/a0CcHR/vnHl4L/6p/zmWW
Dw2Kk9zLU7/9bTz2pG7aLTx3B3w9QZELfymF4pqdA8e2psjOruc0ZKwPsoI/
VGdtZ1amAPFR13Wnq8oA5xZw25la9O2d3j+hZx23KiWzhhvOb9R5s931HZBc
brZ0Awmb+vY33/4W5/Ku6TsNspROwl3NrnS7NXOvf26aUlc44HvTbdT3bb7b
wGd9C/OTW+zRGV1fXl5+g9O6bfPa5gUS1SrQVvKkYw0/v+c4vxsQymI0P39V
XeW2U290SxQG0qhLC3IMQ1hSnKQZkdTaK1Gr7nHyNzlyl1Yvdd7W8O7PUnJx
/f3565sbnNUzIGu90i3uQzrfZzjf7fN0pvC3OisKIFGn1VXV3Gcv9Z2uDk0Z
NXdvkbp/6dy+Ozq373BuK3j9wmzTCb4AY3FvSqCI3eQtvGyumuVPukButWRJ
8gosB5Bs+/m9Vdevrl7DTKIXP/vd736HLz5b3L47y+zw1We2a3O8/O1M/WYe
mGtjQDm3QIIC+Kp2u4ZTKY3N1+tWr2H4Utm97fSWN7rK27XOtjgEWI/cINlU
3ikLY+gH5r14c7ZYjHgvyzKVL3GKRTeZHLLA6uTVxe2pKkBlLDVsHUwph3kq
q2G/NU24aGyX6dWK6al0fWfapkZrRbN2RqrZoTlqWqu6Rum7vOqRXdyn8KY7
2JqmB9bd5F1mVrAsXeMlO1PvNGqLaj89pi3Uydn1qSLS2KnSdqfxlmoP45Pk
OgpP1SaHOS61BgSx21UG1kPg4+KWnwaSztTtRqs/93kFKl01K1VqvVOV8Km8
RIF2rGF8BgIk4/AGoA28uQPrzrtEO9zBFUcrNMMzBS8wMILeNvDyAohKz2+a
eySN2e7aBubYwSR4FDeVVdts6TIZcyAnvQxoPuOd3JqyBGs0+QpJ0zZlX7Ch
v4jggTK4e7BDHQwKVLcdiSesEkbc7C3xIzOdOsEHTuGNwGPwGGAXULQ9kbXf
lcSepGZwSoNnv7Y4Pyf9U6JWB9tJfyAhNjqvUB67vIMtpwV1G4A9a7DR3ZER
K7PSqtgXYCnVQbgozEpLjDGRXwLxL/2taTn65w6XXnvtPEXuLvUKNBPd+Ouv
/3idXcyAXCtGj3JrJsNnOHyG2/zp04y46G8sKTgFXD/ydpEvK41juPsRzNpo
wSAOFhARzvPetLrS1kYfIVosEtmhbSrY0oSrKIct/IkDA2PXa6tOrhvYh3AL
Lv5Og7LrQYf568C2jxLnXQ530aNjgYYtf2VPRaxJcGpcMezAxqw3cH8gNxDO
iTjsxHZX6Z89UaOtYF3rSCaEJEM+hSGKqi9xgIi73RbBLVPUyytYEEwFvIKC
r7XaNn0LN4LoNIXciCSxur0zcN3qapWhRJD2ObvOytbgQtzs/LRXeWFAFZDp
Jx4Gz4FsKpAefgV2BJQ9BUFZbzqAafBfkTamRe6MNHAJEH+g5s6u/xq6DQdt
m4pUCvHLBrirFf3Nipdmg5MDEVnuaSHg3LRr3hig6K5zTweUeA2yOACVKHIH
NSmOCGoUjBqO400l+0B10KwjTZ/eeg94GvQITB6nnhMj0cNMx2JPy2Y/q3Ku
bL40frT4PccVfqmtWddDp43Gjh02eBxse2lH9moKesCAFKPmkeeBpcwWBAYp
7J1E0rGNsk0l1gXEBRTEFqe6QwRA0k63WQARHbicwqUVLhx3LXO0orvIHjlB
4eeIz0EN/ckyyBk9AnP3RMYJx9bui8mKpu6sALndbxk7nVG0wLC4AqC5uJ0f
NBSgeK7nx7AEfvj9+RzlUOINQMVztBY1gKTbZjFXt6BIcSoLFuDJ5PXri7l6
3XdZs8ouDAAqs+zZ+F5dX70GCG9awPDXtfwCd04mizdztUBWBnAPNAT4uZ9M
3l+9nav3WqTjKjetetvrHh2HycW7d+CXapxyh04NLPgdOI7wkhdXMKkXoAEA
42b8ioVGAZ1Mzl/AQzB7NPSdeoFPwoKQcu/0n3tgbtJ5rAy8nom1GzDuHREO
9CcQ1HEbXDb1HfISW9T9LjYWoEJcyCJYJ29sdlVe18S5GA/p2l4UJRs++TVw
/lRkQT4E4x/woG22wOwdKGWQKTICDtYFdQZMn8qLm4dzAUG1uF8/fZp6fwwu
u18/faI5bJ/Dte1zVDwwPOMM1Emir0EbbuqmatZ7IFJjdUJH0O93JtWqJBIi
H8DMFw8rPJBMs+pY+ZMmYSE8oJE9kvTqTPBVQAM4W/PnXoeNofvyfo37JqQn
22T7HXK6pSuMAgAP8xay4JOO8HvFABWIAtI8U1cg9PrnHC3udPwKUgNkyGDv
ytLgNWAkuQVdIHoSlMoingp8INsriKtEnxOYhEGpQ5G1FoQPm4CIt8qX+Axc
WMEbgVAw7kWyAq9ncdyNrnbKYKDPrPaieUC4yOAjuHJzm0xAtuEVe3gKtPs0
1bqiFmGDYJrAKa1lzQoaBDZjjzskXIBIGXGoAjktDSKJvurISDgzhJhB416l
tsoZBc/1c/AJQK8kap14Zec9Aw+i5kyCYx8DmGXUT/KFSp0IAJu5FCrD7IFC
OH2EmMwDQZvDqiuQI9jLGTjArQZ9305xhSBAddNFxgcUyaH3w/qLpiIrROsA
zacDRAMdsjLrnpWD/T0s26l8MYKApOcHrqkTPVvPpurVInvO4eSbV/r26dPU
24V3P2BUY/s7Mq4EtwN5ePfp14RG8BZE1mB0gQTglQDDzdQPzb0mUsl7kSYm
7AZivQwVaL8l3Agc6ORnilNAWNZqfzuyE4dNLCwO4CEorLAgFkuY0u5xLOMW
vcFYeMsKKcLKHkwFMYUlHhgHt8tF9YFygX05/EbeLgs22RKCqWOzjP7C9+en
kQKeeigVj+q2/Ps3t7TYly/zm7P/vv2WeI5s+QObnCAggTkxJmSwfHBVxjoB
E7XSIcoGHbHOdxIKfOS2slfQalAnTlf/JZCUGA9Vry7/tugUXtOZTNwvdlB+
GN251VpMahtBInwx6Tq3KSPpXZmOIs+8cxRQgQ97LwDptGcYFGaNTTsynvGX
4GEYHgkeAwxmBgLFV22+1RxLWKmHMmeM/VbxIw9u/GjDgQVhW+5rVOFXqI21
euahInnN5LK2GtEa7B0mwAYMjuPSZ9PwUfJS+RAn42/ILZhbyzgTP4bl/2/4
4QDocOUqXE3Sj9H1Mz/e5Gl26OepUgc/OHL96eSjOvTzkf559PWPMMzT8KbB
7U/Tebjrw/k8pWE+iiX8OBrmI+BqyXLMPobrH8FLyTv1d4ocmxlewWHUbbNr
4tc89cMo3hvl1iLD/Khb9LeE5h8Hi/ro5xIv6unjFhUvhebvh/ELpJ+nPOQ/
qOEHQxLDos12pgbD3EVPJbO5S0mM3gRIxcfRopQ6B/Y1GDyNh3GTJj8tkHjX
gD3dw0vcfJ/i5GX+jsTJMF9G4pQEo0UdJzHIFFifB2jzMIkpG+KGkQ/8546f
jpD4lgNtIxJ/ZDleeDjvr6sL0E/2Nrcf5HYcZpuDb/XzmItHQvhR/Y8se5jE
okbCjmTqMrd75ygMFjsksQOpTiWClvXD/JC35XCYwyQWRDxLpy/DvH59oU7A
xIGROR0Oc5cOc+Dn4OQdzcaW9WOiRP9X9MAjlGj022Qwhy/5SedwWKkf/bnz
vx1T5PhDW/5O7xqLhSB7Z5wfns1f/POUrdyvc/XVB40oifKNf3jyRYbfWfEn
ANc4qwFbt67/8IRD/E8+AZT4ajTKAs0sY4aD1lvlZmsTGF14lUcPnBxGf6dH
4R/+6THfGA4exbKSZ+NZrSgq5ubk8xwD79GBCwJi8EaChVtAMOiCR6uV5Ixf
IgXjk2ViTs7Lc/qS+ZHrLogGzppAJj/LDmwtuzUtmxbFtkHQkCQdWJnRurXV
w9EpFMK5EReEIMcafsV4AkUvQqwOw3SNtWaJ2bZbef1wSDdNirRQoRNjcgrp
IQbEXFNTSpJdl2sKjcAFtezRG7VfA2L+RYB8sdFlT2ASE9KdxtXCn0ClfJcX
hLp1V8y4niOQAPzDDis4asmJ7HIA15zPzIsPulMdR1R89lS8AVg7e5cWBpPA
IjJ1Skz8vGjNUgZ3H5KAwKjfVBjVEx9ANov3JP5g1TTdDm7vXO4R52gda7s9
HoFl/7qvrUx6Gk93ShEAdtp5pUTLMgo/T4eRanVy2yxOmZDAnxcpS8+HF5xn
XH9B8AT++Aaj/DD9x7vgs2MigY4kiyLFmR8Qw5EIOv2VqL2hBhs7GV6HyUeH
BDxNf7gQH+ow9kjD3SNPL4qh3xGaQMGU6Kz3bNwDBzycLEKReO988HdgoiOO
dggpCEMe0eTiaT06eJANYqlz5YkcxVfhwQrTsXfIy+uQzEzXAJRcmQpTzS6W
qwFIYaa3LVnEDuRb1Angm9MQMibQJLFnTEOCzqEtkgtUF8BRWRdrXQnvSplN
45OmoJUlqTtTF33rZNuHYYEgwABYffIzAgH52A+zbeA1m2Q6lF8EfYuBZENR
XnHnMT5HC685Mu+mizuJV1nD154o/gbK9cY4EdeGIUJTapg7hm1NmdydlyVb
hWQtHK9AqHhkINg8GgqHYDBZRtIWnOiRrA252UsaCQJsbwjbwHvjIhcKOWqM
a0Y1MMSEIY18TJxDhMdJ1TDSkyaIiPEpXnkHC1YrsJxLULHeZhx5DXJWv0Nl
5YplUDVISGdL4b7rzmXXg4z2y4xlgmaCJTHA0SRuf5doc1EWroIgQjCWdq5L
bvi///nvFH5Ep6drdQ7GD12fOGIU3y6Ze21RCMgyee1U+NDzCkk9JMRIsuPg
5QEqTVHGthQlVEXVYNC1apqdFOl0YjGQQkw4q5ZNtzk6JEMFr6t4BT4vkmbX
+B07YkIOsS0x2BYvk6KpWH3XllzBM47T4asIVzZt0KBHfABUJ73Vkjx16sAX
72FcjVg6rjORjJR/J1j52np0GknQVhebvDZ2y/K56lsaCwBRbiqe2kK25u8p
LjjA8iSxzvCex4YXJRaXKE9zJYQgIVe34K3uYSgdV8v8ZTDW6bgxlKX5LL8E
GRwE6F9Fy3cQN5RBymSNaL9gM3uv3d8097rNXub3ZIsu9Brjm76WlBRWi2gP
vbIO0yQ4kAWkBkalaYk0MEmq3IFXVmX8TuErX13lMfi/NA3M/b0zAFjxqmiN
+ucCFBUzNgHnpa97FaMWLuAknKnDEaaCSwlHGkwOI2kB3GDKMWH0CL7P1BkX
pbbxVYahW50jw7rPge1zFlLxKvb4GZLPvRQ0gaV1sCaiASOf4DDY9wgYqImm
ceVBPxZgSw9HBLfgatlsKY2KSgtzw84toBeYKBk+rtlQJ1jNAfB5ULahThZv
4OrBsg118v7q7Skz+IHaDXVy8e7dKVbCOUolLo8no92CX5jQkar1QC7WiKJI
fztnznl3NFLV5KWIAri/TVPyTc6VFhcvOH5ALGZRz0V+Luw7gk5GoeMsvQMO
DRaI5DJuxHYrz2CW1C4LTkC6+AIRROfVvaGNnkwGXt4O1o2EKMC1xIodqjED
+nlF0jZdUzSVz0w+5BY+wh9EpA17loNBwaIcTxYuraPRQA/hGry4Og0nxKLx
8y2lNKgEFeAh6nX8+JlouHvKPLIRMT99QIsWdMhIiVEgBObIC0r04uzQ81Rs
dqg0SJ28uFqcMswW24nbU3mCpG+C9eWycEwXmzU2RiDi/xHYJq+xLhAoNJAv
Ls9hAp04WjiuIs+ywDqZmtExkKhWWP936qCpY3xHcd6j7RcTDkFKaxhf3cl8
PUzhDf4cYYGjEaVI6aAnApNAgi1+WFwYTp2WzvSoUVSFvxy/pi/wgZgKBbqV
AAGJeaQ/rYiKxL7VDRlKRteDsAWDt71YyHxQYZyWug8elZ2xVCOPIhdqunZB
uL48KhLgQJC6QUAjQbuyPzK4xCwm73UkD4OJD0FCx8VOXAYt91IdukvHO5oT
nqFkL6lLqY2N7HYUYKGC5BBuwTglFycaLZXOt81igBgSc4+LIu+Jtx6xCEEC
0Kd7a4hRqNAGfHeD5dIxUdzU8haLq6pg8DgHr3P0FomyWURYuAcMElag4r57
BNPUHquTHU1e5M3gmwasKG7OqIhQnZy/eCem7fWr7PXV1WwUMW7aFGYtXAQp
4KwoqLTNP/A0gFfIhpcaPPwVMOG2wRCeQbbFQCA4hVqiANT9wr8K5y5b2ETQ
QUWFFoeiK4QPOf0sbaKwW1wiReTLKupYigptwItHPIAlV66AJYpoSal3BDG4
doZCAETbFbwTDLEpUdvLHkkdMGB9mCFSt9gYjQ4OsZ5bHcdKKSxgA5Zvllj5
5ZP/W1O0jS2aHbD0UgO/ABKx//V//sOXWIo5VOW+zuFmH3e7PX8ToQbyU8GU
ssYF3zAT3v4zoBeNC+H6eUueq0GhKtE1i0IB7HRJaZFUhDAzSlk89swER6Uy
H1An3DP5yFf2plsUHghosc8siam50wPfKCmYIcIV1AOYCyTBJosokk6FMWCe
O8vGomGLkiEkxo1FAc2Ih0KUM2482oFDyaWKmJhocJY+OG/T2CfhBep/G3GT
a7KysR5q4igBYaSpV6wU0vB9YLEqcjvs0JaDzFRgTsRP2QrX5qqnxXO910AA
21PBENdGBmaSWtqIlZwHkuHeR7p+DdiK1P00NmowK6qidhIp2NGV/M7U+43h
eJeFt6LbrZ16FbIxy3uGXfaAWTIQJgr0eL50TH9KlYQtdquC0grdHrguUqm/
4N3cOpduMwJZ3aLaFj8Nu36ytVSteWmUIkWYK8VkZhhS52JFjIz5MtbAFtKC
qH79VX6T4mHfIQif+N8/fSKuOcOZcswnRKG4jgubweuS/S+/euD9psWECMyh
2aPiRFyU8wgYXhHGs+xfChP7pTviDRVSQ0kZL1mIhlLh0rj3BuXT8VLSnAMS
tuppArCLYKGGteRLXAqLOdVwoj0hs7iCP3OiZTVW+9KOFmTAKSOYG9yArqTU
fGO4lvZcY9EuVktFkW/NuxU1PeUO8bLjioEo9EfAq/2gRXOIrt84pWNYlbSw
Rdw4R0WU8PYVlfGCwem3O4l/MFTagr9GDJTvuDAbHaK+qlwPkpNLRiq+yyEO
CrDICfhLqyWphGIySS+eUH3GqZJtJwzXoGghCQG6b2mH7L7G4Ir5JY7QcOT3
xT70O+J8abMqWmEKErirjXupJGQQmRxysWCFtkuCQKAIESpF2SG2sJHOiddT
ojeLxAkN2LDCM2r7IudDePOs7xrgzIbqUU9+PLu0zu02q1WPVpqphe9BpCDB
Y6I0BVynHOvz8baoncFpPdfjhMwHqk22aygGvjwcRDZkVFnJ4NskSWNRNxMI
9raOTo5ICr+bJZaLchG9a9ecSgHO0bpV2tkO29B8NKRw6Q5iilay7HGwOdKH
FI3z2ylnXRTiQNEKHEFcrb1PelDVf6eVPxCAq5HRwrnmNReczaQbm7gRZ4Vu
Kck2+VCVbSRe2iKaxlpzp4QBW6SS7PYp7zpYMdf3A/oDbNA29yXciJqBOwoc
4GbEDOi9twjyfEwWDHPL3IIRBI5/ui7sFNV4jAVzh5UR/uHSdAy4W+sUiQNL
B3QJKYMY97UJ4CDHUSB68CbiFCL2W4amt7iVbZjP8RFyounX1rdUIQ4Z6qYl
BwyiXlGMAgKIQ17hAti7xnhnzkT9xpTD6JcdqlWTU6tbC2TxUobFJmaFWCiE
pIflqFHoOXiaEnZOUrKfTcRG6cPjKdg43W61bzeJsho7WDUHGeFmThmh5xVn
IegWWM5/Xxo2qI3j5S4X4+wIZ6Oo5Rvoo5k1wtIke0Kea3DPE29k6jA2w02p
wfghcVg4SEnahckosVVf1bwynfgJbhUC7jYcJ3Cubgh/DzIEdMW7+67NH2Zy
GhpcQ2Dzwfk8puiFXNkFcsSCOSKUFL7B7aaWnwe4ZpoyXnSnSwXIzOKY6Kqp
ADdyHYzeucYJSkQmo4Fod2gU3YAunP8gly5uL9+oZ/NQjy6tUNiT0OY+lYcd
ZVjlPvoQhjh5Nnt26oJHkY65+JrM2ii4PsjtX4wjIiOm3M8UGT3v5nl2C+VB
KU+5Bv/cHtB+F1//3lMo5ZZjw1FwYdAg03pru+ZU9JF3MYm+PVVXx0h7Sepf
nI2QURoN9MAIITp3uCPdZRxRFgZwwZ8skHR7wj4VHIzxTYEYepyqnwzVJETl
RpSxORk2U57y2p+fqj9JcPYoe10KupFUJbIlUw1nxzcnAxw0a8Byh0Z5dorm
16cmXY8gn+wgBzNQCJ/yZ1dT9q3UW6newhD1Sw6P0u8IlEAFXIX10mVQUa4l
49QNIbe+DbdSlKMpin7n7iTBwhfLzS/DzUJu0Qjge01jeovWI07s8g8cog2t
jJe5LxfxGYkDAsp+eicek6fvHUggiMi//s/F1XTxdrp4+a//5tTFt3N1XgFS
IocfLR3/cfgN+Qo/OqA4ojHCgv+YSZILofqLxfnZKz7CowbUEHd7yoFBwTFx
/auBu3NwAcQLpo43y4qewtA4GRBtOlvNxgaX+npMGQEKis34GpSC52xD54nT
uDIIJTXkriR0SzFhINY7QNAwQyIkR4zo1+9ggcA/lERyL4nOpwGqUR6vdHvw
HOu8qoJcewy2yBu5WpfpVwNx0GuvMUexBClGYXyOuto9qYfPMZNL6AjkofjM
K4wNabUDUe0i7G6SgAqC+e2gG5gVn+OAQ89P45Hd4SPkfsl6KFKGKSzfihXS
m0hZLhRqDPrB7ugXHs2lbkaEbHVaF0V228XpLxZM029jmn4YUx7fT/H4wdxd
agsDNsdeoNSiB09pSdGqdNywP4NWZdHswSe67IsKoyA1+ezsNxbopOnoAidV
mB3n6vJn9ADVh7q5r7BaN60QgmV/h6w0umtgWLiUK+Q5xCMJRXcB67R5zTt1
3O6wUg3aM1LQkfYFkl2zdUhqlqjUB2iybnBiLEUz9RpN971BfBZ9AIv79pQX
CXv7bpDJ3Aac5RPH6a5FxXCSpQz8wYmwAxzCkIMK6MIrpscZRPG7mAjp5J+d
Mma9jvBfUvcqsPU2xaw2tSWMIBlZJoodXsyqQtwqNuGjKk6OxMrxHoL5/M5/
pqSTA+mh4nD2JSWOx6sY3aytdtkZeaQlncxPxUVniXuZLNVp/9TcsQp3qPJY
Y2mo0bMU7417guZphxCVo0Y6i8NGseMezhaCu7Fjg8voYPL+OC48XFTOOnBx
ZN90ynlSDOhoF433S8LEVzwZlGwwuBxewuKRGCtiB0kOhs5gkpIMaas5SGib
imhZMxNjCJSiqcfiDxugLVpaiSRi6H67NGtKjMiBCrsG+6X5ULcilwQmyLpr
wuXSInhy0CgLowOMQHvKRV9pI9U8bat6gPbU2LBek4SyB84BI1ciPA3TpkAe
poICseN9czyZlNdKZQt6KeHoDomAUZiKwkHjZuCpyO2eo3BYoZB/qIXVKZdY
ND2ZxOgQOyp6xtDKlpLEdzpCkbfhZBBK172uK7QaRKpLNt3qhhnm5PUPlzen
U84jYnToLnrLCR1RInxFQltjOguLeQUDA91aDHX22+ipdZuXvbTBdJ7M+DyG
1phipwqTRbSoRBug51BvQj90egwd7MAdHSMQGIfn4Y/48GzmXEobn49CEkVZ
0bYlBd5KjAv5KlJe86R22pedx6xFmBUPfiJjRYdjlXR0kQ4GJmiapKeDI1d2
0/RVyV5Nx+52XI2NJ6NukyCmAwsuT9XXchYByKAOx3NKZOZFvtfW5PXwwLVT
zFFSAUXGVTEueaR9xk5C7w5kyH3w+jbKQ9/km7zK62aJmFLuhIfAMFRGt8zJ
fStpRGT3tXth1Oc+bNkeRA5Xvvor6ah4VEFtfFTg4cr1kKqN6my/mz3HUJrU
I2K2mULH3icRbPTZSvYHu++/rJw9Ksp4K7dfOAqMDoEr48NkwnF5DPBcxADP
S218b5OLVgWyUmHFmZxeID0gXBsLBGHu9QsH4UB8JeXYfIqCP/oxxJ4JX5Dn
sGNelxQm8SYAQ0xRY8DdHZkgM+ZNY7Kidcl934az8y6ys8b8MXJAjmwnV1l5
Oc51WuAGMfUCiIb3XaImUCc3i0vgXvrkbAnmrwc5dh+d4UdNWsjjed69kXHB
OVnAjgL/CeHQMYvqNgNXYubeIS9QiVifw4cA2l2O/V4sbY6Q1IzHbXVOBTs3
PWzfLJnGiJSHiUJG0nDxCyWhMLRidFXSttFZNVKDR2qRI7uGkjgUaGOr4tdI
VQ1MEZiUpZIQJgjGhwuq8/AfJBQRsfR1Zuich2Me+RgeoZo7EqdLjmmSvjo3
OwQjFM8Id0d1PhSincWz/DzrxQk3OkTJewE0UaZqCGiRKQgv9jNEw7N3to0K
HIQqSeZu4L1l6hYWhqY8MBdWE7vTgAZ65xs5c8mpIMx753e58dUkxw4iFMuE
WopWdoKeT3bqD6gcaSuydVih0dF4Ub3PLJryFzBiui7PGtGCTjxSpIgcbTns
zXbnYX6yVP/x4PgRPgcXtglWhJvPJcPumJgHVB8xe8yFowKk6ainwp8vKiqP
50MJUs6JejpQVatYOM6KzsLMHklLpxtYl4QckPuqhVSled5mBsVj65qds9rh
GKRE4dFxDHmZ7zoh9QM0Q/vuQiPAf4LeXKMQ3pZ4KKupq94Lx8NR7QMeEI10
RH7DviiPS+LH40NcuUi4NPm6bqyhSq2CDsTL+MS209l4LUeojO/L/AySI3xS
jBROHrp6ltmCzmQ6+9P5NJoYI9HToDGWUSpbWnFdsWk4vNr7idIIMwIINx4I
SePUgW5UOq4IXIsWlQ0VWW/2y9YERIhqb8kzSeqT0jY2n0UPNbFyiOCgcy0+
ZhfeChy0a+okhUTpMlNhvG2cVh3hN1A87qQiYsVFpJr54K4jrXdzd66A3olm
1zZR7MOn0+IKUXhHAAjln9LjxqRhMC/LVlufKUpOh4qNYWzIXa3aEPu/zd6q
XdWgfcOx/thU2wYEurnLFlvT1s2dOvkjNgeA0ptGXWrxorIRgnFs+x5J3cJs
TIA5p8PzEA61LMaElcZom0DlAc1QOYLouBQps5GvhpWAeHymtqsQ9cEYN2Xu
ZqVopOUj378g9niKx5CS6UniW6VrOISnKqySWW9iLqmoKLKnZPPUH4UoyJeL
iEz5yM2P0Fq0+2SLHtn+GZPewfzIdXqUVnHp1ciU0ztxjswjj9J+x9bcjdQr
meKAD/zS/7/1sv6NWlm/otTqOQYe6JBjb2dCGeRnjnwPhR4sRKPz3N/AWKDT
4mvjw9unjzsyHtdy3dxGVSqJj+6PApcCHB8PKcIB4p/zhKWtdrl3tY6EsSky
VPkzibHuu+AoDRq6pNFVXYZU+eh8HBidjN/gy1XEJMbpIjTvHDZyQrBum3su
oPIdnHLcO6M6K1WRuDX9Vrd8kqn7Mhs+RaUhV4gPUEGlI1Xhh/ZNnVycvzr1
CBwL/KxDw1gm29eO9ZHnl00tbZbwFBbmYah3gx2GpABhX0No3HLxtOuz8OfX
JgfjU1x5R+2cEh0KQNkfwUtFsyy64bsSfBXCoYN43HGeRkshMxVskmwYS2cc
rQCkc9DySrwRbrzzheBUHr4FRBAf5MChQVy7q611pXqOCEBvTvA67kO31pew
DcpCqWA2FJuPMfqDfBydxUx5bIvsga/nE/65ROpQCVk0kmblQgBiXLsCFHds
hsV3TRtVT5J2lYNilohR6RyLcOjLL0DFu6aC5+VcV27IIlvY5CWqlFXVU4x7
uHbljjq1GBkGitv4DOCOguCjZygMz0XEHP6jc8YV5/JByQ+rYXGa0ufqDvQI
3SPAD9JSMuVodsPR7C58RVPk0MOctBz+oHOgcTjoo0RAQAkB/LoM/0ZkbBkx
D0X8UYQAZ0Phdgw+gwgB5oE51qj0WB/FX5P0JgB7IBxo4hesiYPqGWoTVxsG
ioji/KQUIllGDAZyd8dpdcpR+f7cKWUoPHU4fFxxv1xQVtG36cBgrAz80cxE
UTTcWLkHflmN683D5yc3WKitWNlI81BeAscCW8LyPGrLS6Ss5XqUpebvSeHm
ILBXhooF5GhscX5oljF8CGXTHhSRgnKBoAQ2JN59XOUqy3Y7H/SLU1irvpaY
CBYREUFDZVro+AFs19FZLsggzl+DAUfWNV7DTIUv0opjn3iKSKinDkfyE/Ox
9Cc90ElOg5eBwQD3RUpA7Tt8HQdg8EuBamKKoNeoV6IDB//k+tVtfK6ynLGP
MV/p/cKGynXrG9MOlaOFohqpZNronDi2ifwz7BACAvyJcLVTt+NhKCIGk/py
pSpnzCddPqmOnEruiPqLPqNLffW4nNMzONUDwD9wn4MbFBV4vVqhuuB0ofrR
o6kg17ds1EjDjtEWneYcvv2lDF+7gY7KkV65GOphZVTdbOkRacyhDQdXaS2R
Nt9YR6/nA4qABu5kafctNtZnQelYIxfkA4b4BniszTMsaxOdkkT66IQCwfQE
yadpcxHn+8RScExGcG3D1GNE4uaRtYh0nJj5xsK8Xe79CqZ05hzDIVfABTi9
L90l1kvO1tRxmaHVMYylfAfRw/LZD6g5OcxYamDPMurWZk+FGcq34ESpPrce
yqx4TR2+u6kOX4cjZVls1io6RiGEUbdNTV88yijyEETPjWO50BgnL/fxK8ya
+K9dqOgbCAaFduHL8fg4Nqwvyalzai9usAA8Wne0uCgZmzisoYsM5L2mjcOm
L+P98xivfs4JCcY1hgsbLFFrUDNQIh7rF2Q27OPJUZK8Y76amjK9s+QEvMdo
FacZQuZs5KJKTOCBL9AJ2Qe0hMv9qAbA6xe/l4jTOA9qbNFbTugtnPeD7ZwJ
ln9QYbqA/uhUcVbHJMrhlCH/Tg40DAaXiNNcPTt13VwjjM91mwTrdM3xkVCK
71q7mUp8DARhuRh/zBSW4W0arHoYHf/Do3PvTRRLld7x0OBAHQ1Sr8ygOv56
ksj2UVny7nAd0HIv0V13ZEW+RTB24LzSwTcMcI8/x4q4MG6Hx8qE8jp/rN6h
o/eJvtyZEPFUcux9WnufNHqEygm1Nfx1Lli44GsGhDZA4x+P5K0dPx8+Q5+m
rrFFFf+cUzLnG5dMSLofsd0eyDn4mqdHZMKJCvQe+oYUI1+4Sp2lsDz/zbbs
GDtpcN1mw3wCQqht00mmjkYggIRfAP2PKGkL/DY/nOF53NSF9vvFBX3z4tmr
s/FnGPIom6Kn6DOa8rrhO+UrYuULHNE15++0cpvPX87065wPV9XlH56s8spq
PJr39vXFa3g+YpP/B71IBYRzewAA

-->

</rfc>
