<?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.29 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ma-bess-bgp-mobile-core-extensions-00" category="std" consensus="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="BGP Mobile Core Extensions">BGP Extensions for Service Routing of Mobile Core Networks</title>
    <seriesInfo name="Internet-Draft" value="draft-ma-bess-bgp-mobile-core-extensions-00"/>
    <author initials="Z." surname="Ma" fullname="Zhuoran Ma">
      <organization>CNIC, CAS</organization>
      <address>
        <email>mazhuoran@hnu.edu.cn</email>
      </address>
    </author>
    <author initials="Y." surname="Li" fullname="Yanbiao Li">
      <organization>CNIC, CAS</organization>
      <address>
        <email>lybmath@cnic.cn</email>
      </address>
    </author>
    <author initials="L." surname="Lu" fullname="Lu Lu">
      <organization>China Mobile</organization>
      <address>
        <email>lulu@chinamobile.com</email>
      </address>
    </author>
    <author initials="G." surname="Xie" fullname="Gaogang Xie">
      <organization>CNIC, CAS</organization>
      <address>
        <email>xie@cnic.cn</email>
      </address>
    </author>
    <date year="2025" month="December" day="28"/>
    <area>Routing</area>
    <workgroup>BGP Enabled ServiceS</workgroup>
    <keyword>BGP</keyword>
    <keyword>5G Core</keyword>
    <keyword>Service Routing</keyword>
    <keyword>NRF</keyword>
    <abstract>
      <?line 68?>

<t>This document describes a new route propagation and service discovery mechanism by proposing BGP extensions for mobile core network service routing. The proposed solution introduces a Service Route Address Family, hierarchical Network Identifier allocation, and path-aware routing mechanisms that enable scalable inter-domain service discovery while preserving compatibility with current 3GPP standards. These extensions provide the foundation for efficient service propagation, route aggregation, and loop-free routing in large-scale distributed mobile core deployments.</t>
    </abstract>
  </front>
  <middle>
    <?line 72?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>Service discovery in the 5G core network control plane is primarily communicated through the HTTP/2 protocol <xref target="TS29.500"/>. The 3GPP Service-Based Architecture (SBA) defined in <xref target="TS23.501"/> enables flexible deployment models, including multi-access edge computing (MEC), hybrid cloud scenarios, and distributed network function placements. However, these distributed deployments fundamentally challenge existing inter-domain communication and service discovery mechanisms. Current HTTP-based control plane protocols were designed for centralized environments and lack the path awareness, aggregation capabilities, and scalability required for distributed operations.</t>
      <t>This document proposes a new service discovery mechanism by proposing BGP extensions for mobile core network service routing. The specification introduces a Service Route Address Family Identifier (AFI) and Subsequent Address Family Identifier (SAFI), hierarchical Network Identifier (NID) allocation schemes, and the NID_PATH attribute for path-aware routing and loop prevention. These extensions transform BGP into a capable control plane protocol for mobile core networks, enabling efficient inter-domain service discovery, intelligent route aggregation, and reliable propagation of network function capabilities across distributed domains.</t>
    </section>
    <section anchor="terminology">
      <name>Terminology</name>
      <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

<t>This document uses the following terms:</t>
      <dl>
        <dt><strong>Network Identifier (NID)</strong>:</dt>
        <dd>
          <t>A hierarchical identifier used to uniquely identify network domains, extending the concept defined in <xref target="TS23.501"/>.</t>
        </dd>
        <dt><strong>NID_PATH</strong>:</dt>
        <dd>
          <t>A BGP path attribute that records the sequence of NIDs traversed by a route in non-BGPsec environments, providing basic loop prevention and path traceability. This attribute is superseded by BGPsec's BGPsec_PATH when cryptographic protection is available.</t>
        </dd>
        <dt><strong>Service Route</strong>:</dt>
        <dd>
          <t>A new BGP Address Family Identifier (AFI) and Subsequent Address Family Identifier (SAFI) for propagating mobile core network service information. Service routes carry aggregated service-level information derived from multiple NF instances.</t>
        </dd>
        <dt><strong>Service Route ID</strong>:</dt>
        <dd>
          <t>A 16-byte UUID version 7 identifier that uniquely identifies a complete service route across all its fragments.</t>
        </dd>
        <dt><strong>Service Route Fragment</strong>:</dt>
        <dd>
          <t>A portion of a service route that fits within a single BGP UPDATE message. When a service route is too large for one UPDATE message, it is split into multiple fragments.</t>
        </dd>
        <dt><strong>Service Attributes</strong>:</dt>
        <dd>
          <t>Network Function attributes that describe the properties and capabilities of services offered by a network domain, such as PLMN, SST, SD, locality, etc.</t>
        </dd>
        <dt><strong>User Equipment (UE)</strong>:</dt>
        <dd>
          <t>A device that provides access to network services for a human user or an application, as defined in <xref target="TS23.501"/>.</t>
        </dd>
      </dl>
    </section>
    <section anchor="problem-statement">
      <name>Problem Statement</name>
      <t>The evolution towards large-scale distributed 5G mobile core networks introduces fundamental challenges that existing HTTP-based control plane mechanisms cannot adequately address. These challenges span from basic connectivity and discovery to advanced requirements for multi-path optimization, load balancing, and security.</t>
      <section anchor="current-control-plane-limitations">
        <name>Current Control Plane Limitations</name>
        <section anchor="http-based-service-discovery-and-propagation-limitations">
          <name>HTTP-Based Service Discovery and Propagation Limitations</name>
          <t>Current 5G core networks rely on HTTP-based route propagation and service discovery mechanisms through the Network Repository Function (NRF) as defined in <xref target="TS29.510"/>. While this approach works adequately in centralized deployments, it presents fundamental architectural limitations that become critical in large-scale distributed environments.</t>
          <t>HTTP-based route propagation provides no path or topology information, making it impossible to optimize routing decisions or understand network connectivity patterns. Without this fundamental routing information, networks cannot make informed decisions about service placement or access paths. This topology blindness forces networks to rely on static configuration or sub-optimal fallback mechanisms when multiple service paths are available.</t>
          <t>Each Network Function (NF) profile is propagated individually without aggregation capabilities, leading to excessive signaling overhead and inefficient route lookup operations. This lack of aggregation becomes particularly problematic as networks scale, creating bandwidth consumption issues and processing bottlenecks at NRF entities.</t>
          <section anchor="bgp-as-a-solution-foundation">
            <name>BGP as a Solution Foundation</name>
            <t>The Border Gateway Protocol (BGP) directly addresses these HTTP-based limitations through proven mechanisms that have been refined over decades of Internet operation. BGP's path vector architecture provides complete topology information and loop prevention capabilities that are essential for distributed networks, directly addressing the fundamental topology awareness gaps in current HTTP-based systems.</t>
            <t>BGP includes native support for route aggregation, enabling efficient summarization of service information and reducing signaling overhead. The protocol's proven scalability to global Internet routing, makes it well-suited for large-scale distributed core networks that may encompass thousands of domains and millions of service endpoints.</t>
            <t>Additionally, BGP benefits from a rich ecosystem of security extensions through BGPsec, multi-path routing capabilities, traffic engineering mechanisms, and sophisticated policy enforcement frameworks. Rather than attempting to retrofit the existing HTTP-based control plane with complex modifications to address these fundamental limitations, adopting BGP directly provides a proven, immediately available solution that inherits decades of Internet-scale operational experience and continuous enhancement.</t>
          </section>
        </section>
        <section anchor="nid-allocation-and-management">
          <name>NID Allocation and Management</name>
          <t>The existing NID definition in <xref target="TS23.501"/> uses a flat 44-bit identifier space with significant limitations that hinder scalable network deployment. NID allocation requires coordination between operators or assignment by IANA, creating operational overhead and deployment delays that prevent dynamic network expansion. This manual coordination requirement becomes particularly problematic in cloud-native deployments where network domains may need to be created and destroyed dynamically in response to changing traffic patterns or infrastructure requirements.</t>
          <t>The flat NID structure lacks semantic information about network hierarchy or domain relationships, making network management, troubleshooting, and automated route aggregation impossible. Without hierarchical semantics, network operators cannot implement efficient routing policies or perform automatic aggregation based on organizational or geographical boundaries. Additionally, static allocation schemes cannot support dynamic domain creation and deletion required for modern cloud-native deployments and edge computing scenarios, where network domains may need to scale elastically based on demand.</t>
        </section>
      </section>
      <section anchor="example-network-topology-illustrating-current-limitations">
        <name>Example Network Topology Illustrating Current Limitations</name>
        <t>To illustrate these limitations, consider the following hierarchical network topology with both Parent-to-Child (P2C) and Peer-to-Peer (P2P) relationships:</t>
        <artwork><![CDATA[
                    A
                   / \
                  /   \
                 B     C
                / \     \
               D - E - - F
]]></artwork>
        <t><strong>Network Topology:</strong></t>
        <ul spacing="normal">
          <li>
            <t>Node A: Central domain (root)</t>
          </li>
          <li>
            <t>Nodes B, C: Regional domains (children of A, peers to each other)</t>
          </li>
          <li>
            <t>Nodes D, E, F: Edge domains (D and E are children of B, F is child of C)</t>
          </li>
          <li>
            <t>Direct peer connection exists between E and F</t>
          </li>
        </ul>
        <t><strong>Routing Table of Each Node Example:</strong></t>
        <table>
          <thead>
            <tr>
              <th align="left">Node</th>
              <th align="left">Next Hop</th>
              <th align="left">Route Info</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">A</td>
              <td align="left">B</td>
              <td align="left">B&amp;D&amp;E</td>
            </tr>
            <tr>
              <td align="left">A</td>
              <td align="left">C</td>
              <td align="left">C&amp;F</td>
            </tr>
            <tr>
              <td align="left">B</td>
              <td align="left">D</td>
              <td align="left">D</td>
            </tr>
            <tr>
              <td align="left">B</td>
              <td align="left">E</td>
              <td align="left">E</td>
            </tr>
            <tr>
              <td align="left">C</td>
              <td align="left">F</td>
              <td align="left">F</td>
            </tr>
            <tr>
              <td align="left">D</td>
              <td align="left">E</td>
              <td align="left">E</td>
            </tr>
            <tr>
              <td align="left">E</td>
              <td align="left">D</td>
              <td align="left">D</td>
            </tr>
            <tr>
              <td align="left">F</td>
              <td align="left">E</td>
              <td align="left">E</td>
            </tr>
          </tbody>
        </table>
        <t><strong>Current HTTP-Based System Limitations:</strong></t>
        <t>The current HTTP-based system exhibits severe limitations in topology-aware path selection. When domain A needs to consume services, both domains B and F can provide the required service. However, without topology information, A cannot determine that B is topologically closer (1 hop) compared to F (2 hops via C), leading to suboptimal service selection that wastes network resources and increases latency.</t>
        <t>Loop prevention failures in peer-to-peer propagation represent another critical weakness. When domain D needs to discover services from domain F, the lack of loop prevention mechanisms prevents route information from being safely propagated along P2P paths. Without an AS_PATH equivalent, route information cannot be transmitted from F through the E-F peer connection to E, then to D, forcing D to rely on the inefficient hierarchical path D -&gt; B -&gt; A -&gt; C -&gt; F instead of the optimal direct peer path D -&gt; E -&gt; F.</t>
        <t>The absence of route aggregation capabilities creates both scaling and security concerns. Parent domain A receives individual, non-aggregated NF profiles from all downstream domains (B, C, D, E, F), exposing detailed internal topology and creating excessive routing overhead. This lack of aggregation not only increases bandwidth consumption but also reveals sensitive network topology information to upstream domains.</t>
        <t>Security vulnerabilities in route propagation present significant operational risks. Each NRF can freely modify and tamper with route information received from peers before propagating it to other peers. Without cryptographic protection mechanisms, there is no guarantee of route integrity or authenticity, allowing malicious or compromised NRFs to inject false service information or manipulate routing decisions.</t>
        <t>Finally, the missing path metrics capability prevents intelligent routing decisions. HTTP-based discovery provides no path cost, latency, or reliability information that would enable intelligent path selection based on network conditions, forcing networks to make routing decisions without crucial performance data.</t>
      </section>
    </section>
    <section anchor="bgp-extensions">
      <name>BGP Extensions</name>
      <section anchor="hierarchical-network-identifier-nid-extension">
        <name>Hierarchical Network Identifier (NID) Extension</name>
        <section anchor="assignment-mode-3-extension">
          <name>Assignment Mode 3 Extension</name>
          <t>This document extends assignment mode 3 of the NID specification to support hierarchical allocation. The hierarchical structure enables efficient route aggregation at parent domains while allowing automatic sub-domain creation without external coordination. This approach provides clear representation of domain relationships that can be leveraged for routing optimization and network management purposes.</t>
        </section>
        <section anchor="hierarchical-encoding-scheme">
          <name>Hierarchical Encoding Scheme</name>
          <t>The NID hierarchy supports up to three levels in the current specification, with provisions for extension to support additional levels through the reserved field. The reserved field functions as a hierarchy level indicator, enabling the scheme to scale beyond three levels when needed for complex network deployments. This flexible approach allows networks to adopt appropriate hierarchy depths based on their organizational structure and operational requirements.</t>
          <table>
            <thead>
              <tr>
                <th align="left">Level</th>
                <th align="left">Mode Bits</th>
                <th align="left">Reserved</th>
                <th align="left">Address Space Distribution</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left">1</td>
                <td align="left">3 (011)</td>
                <td align="left">1 (0)</td>
                <td align="left">39 bits for global domains</td>
              </tr>
              <tr>
                <td align="left">2</td>
                <td align="left">3 (011)</td>
                <td align="left">2 (10)</td>
                <td align="left">12 bits + 26 bits for regional/national domains</td>
              </tr>
              <tr>
                <td align="left">3</td>
                <td align="left">3 (011)</td>
                <td align="left">3 (110)</td>
                <td align="left">7 bits + 12 bits + 18 bits for local/edge domains</td>
              </tr>
              <tr>
                <td align="left">4+</td>
                <td align="left">3 (011)</td>
                <td align="left">4+ (1110+)</td>
                <td align="left">Future extension for deeper hierarchies</td>
              </tr>
            </tbody>
          </table>
          <t>The reserved field serves as a hierarchy level indicator, enabling the scheme to scale beyond three levels when needed for complex network deployments.</t>
        </section>
        <section anchor="nid-allocation-example">
          <name>NID Allocation Example</name>
          <t>Consider NID <tt>3.6.1.1.0</tt> encoded as:</t>
          <artwork><![CDATA[
0011 110 0000001 000000000001 000000000000000001
]]></artwork>
          <t>This represents:</t>
          <ul spacing="normal">
            <li>
              <t>Assignment mode: 3 (0011)</t>
            </li>
            <li>
              <t>Hierarchy level: 3 (110)</t>
            </li>
            <li>
              <t>Level 1 domain: 1 (0000001)</t>
            </li>
            <li>
              <t>Level 2 domain: 1 (000000000001)</t>
            </li>
            <li>
              <t>Level 3 domain: 1 (000000000000000001)</t>
            </li>
          </ul>
          <t>The parent domain is <tt>3.6.1.0.0</tt>, and this domain can allocate sub-domains following the pattern <tt>3.6.1.1.x</tt>.</t>
        </section>
      </section>
      <section anchor="nid-attribute">
        <name>NID Attribute</name>
        <section anchor="attribute-definition">
          <name>Attribute Definition</name>
          <t>The NID attribute is an optional transitive BGP path attribute that carries the Network Identifier of the originating domain. This attribute enables receiving domains to identify the source of service routes and make routing decisions based on domain hierarchy and relationships.</t>
        </section>
        <section anchor="encoding-format">
          <name>Encoding Format</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Attr. Flags  |Attr. Type Code|          Attr. Length         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                        NID (6 octets)                         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          <ul spacing="normal">
            <li>
              <t><strong>Attribute Flags</strong>: Optional (1), Transitive (1), Partial (0), Extended Length (0)</t>
            </li>
            <li>
              <t><strong>Attribute Type Code</strong>: TBD (to be assigned by IANA)</t>
            </li>
            <li>
              <t><strong>Attribute Length</strong>: 6 (fixed length for NID)</t>
            </li>
            <li>
              <t><strong>NID</strong>: 6-byte Network Identifier of the originating domain</t>
            </li>
          </ul>
        </section>
        <section anchor="processing-rules">
          <name>Processing Rules</name>
          <t>When processing a route with NID attribute, receiving domains must follow specific procedures to maintain route integrity and enable proper policy enforcement. The NID attribute identifies the originating domain of the service route, allowing receiving domains to make routing decisions based on the source domain's identity and characteristics. Receiving domains may apply import and export policies based on the originating NID, enabling fine-grained control over which service routes are accepted and propagated.</t>
          <t>The receiving domain may validate the NID against known domain hierarchy for operational purposes, though such validation is not required for basic protocol operation. This validation can help detect configuration errors or potential security issues. The NID attribute may be used in best path selection algorithms to prefer routes from specific domains or hierarchy levels, allowing networks to implement policies that favor certain service providers or geographic regions based on operational requirements.</t>
        </section>
      </section>
      <section anchor="nidpath-attribute">
        <name>NID_PATH Attribute</name>
        <section anchor="attribute-definition-1">
          <name>Attribute Definition</name>
          <t>The NID_PATH attribute is an optional non-transitive BGP path attribute that provides basic loop prevention and path traceability in environments where BGPsec is not deployed. In BGPsec-enabled networks, this attribute is not necessary as BGPsec's BGPsec_PATH attributes provide superior cryptographic protection for path validation.</t>
          <t>The NID_PATH attribute serves two primary functions in non-BGPsec environments:</t>
          <ol spacing="normal" type="1"><li>
              <t><strong>Loop Prevention</strong>: Detects and prevents routing loops by checking if a domain's NID already appears in the path.</t>
            </li>
            <li>
              <t><strong>Path Traceability</strong>: Maintains complete propagation history for troubleshooting and audit purposes.</t>
            </li>
          </ol>
        </section>
        <section anchor="encoding-format-1">
          <name>Encoding Format</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Attr. Flags  |Attr. Type Code|          Attr. Length         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                       NID List (variable)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          <ul spacing="normal">
            <li>
              <t><strong>Attribute Flags</strong>: Optional (0), Non-transitive (0), Complete (1), Extended Length (as needed)</t>
            </li>
            <li>
              <t><strong>Attribute Type Code</strong>: TBD (to be assigned by IANA)</t>
            </li>
            <li>
              <t><strong>Attribute Length</strong>: Variable, depending on the number of NIDs</t>
            </li>
            <li>
              <t><strong>NID List</strong>: Sequence of 6-byte NIDs in reverse propagation order</t>
            </li>
          </ul>
        </section>
        <section anchor="processing-rules-1">
          <name>Processing Rules</name>
          <t>When processing a route with NID_PATH, receiving domains must implement loop detection and path management procedures to ensure routing stability. If the receiving domain's NID appears in the path, the route must be discarded to prevent routing loops that could destabilize the network. This loop detection mechanism is critical for maintaining network stability, particularly in complex topologies with multiple interconnection points between domains.</t>
          <t>When propagating the route to other peers, the domain must prepend its own NID to the path before transmission. This prepending operation maintains the complete propagation history and enables downstream domains to perform their own loop detection. Receiving domains may validate the path against known topology for operational purposes, though such validation is optional and intended primarily for troubleshooting and audit functions.</t>
        </section>
      </section>
      <section anchor="service-route-afisafi">
        <name>Service Route AFI/SAFI</name>
        <section anchor="afisafi-definition">
          <name>AFI/SAFI Definition</name>
          <t>A new AFI (value TBD) and SAFI (value TBD) are defined for Service Route with the following characteristics:</t>
          <ul spacing="normal">
            <li>
              <t><strong>Address Family</strong>: Service Route (TBD)</t>
            </li>
            <li>
              <t><strong>SAFI Value</strong>: TBD</t>
            </li>
          </ul>
        </section>
        <section anchor="service-route-nlri">
          <name>Service Route NLRI</name>
          <t>Service Routes carry aggregated service-level information through Service Route Fragments. Due to the large size of core network routing entries, a fragmentation mechanism is used to split service routes across multiple UPDATE messages.</t>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
|                    Service Route ID (16 octets)               |
|                                                               |
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Fragment Seq |  Total Frags  |  NF Type Len  |   NF Type     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Attr. Count  |               Service Attributes              |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                Service Attributes (continued)                 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          <section anchor="service-route-id">
            <name>Service Route ID</name>
            <t>A 16-byte UUID version 7 identifier that uniquely identifies a complete service route. All fragments belonging to the same service route share the same Service Route ID.</t>
          </section>
          <section anchor="service-route-fragment">
            <name>Service Route Fragment</name>
            <t>When a service route is too large to fit in a single UPDATE message, it is split into multiple Service Route Fragments:</t>
            <ul spacing="normal">
              <li>
                <t><strong>Fragment Seq</strong>: The sequence number of this fragment (1-based)</t>
              </li>
              <li>
                <t><strong>Total Frags</strong>: The total number of fragments for this service route</t>
              </li>
            </ul>
          </section>
          <section anchor="nf-type">
            <name>NF Type</name>
            <t>A single Network Function type supported by this fragment, as defined in <xref target="TS23.501"/>:</t>
            <ul spacing="normal">
              <li>
                <t>AMF (Access and Mobility Management Function)</t>
              </li>
              <li>
                <t>SMF (Session Management Function)</t>
              </li>
              <li>
                <t>UPF (User Plane Function)</t>
              </li>
              <li>
                <t>PCF (Policy Control Function)</t>
              </li>
              <li>
                <t>UDM (Unified Data Management)</t>
              </li>
              <li>
                <t>UDR (Unified Data Repository)</t>
              </li>
              <li>
                <t>NRF (Network Repository Function)</t>
              </li>
              <li>
                <t>NSSF (Network Slice Selection Function)</t>
              </li>
              <li>
                <t>AUSF (Authentication Server Function)</t>
              </li>
              <li>
                <t>etc.</t>
              </li>
            </ul>
            <t>The complete list of Network Function types is specified in <xref target="TS23.501"/>.</t>
          </section>
          <section anchor="service-attributes">
            <name>Service Attributes</name>
            <t>Each Service Attribute follows this structure:</t>
            <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Attribute Type (4 octets)                  |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|     Flags     |    Defined By Length   |    Defined By        |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|   Value Len   |                 Values                        |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
            <t><strong>Attribute Types</strong>:</t>
            <t>The following attribute types are mapped to numeric values for encoding in the Attribute Type field, based on Network Function Profile attributes defined in <xref target="TS29.510"/>:</t>
            <ol spacing="normal" type="1"><li>
                <t>PLMN (Public Land Mobile Network)</t>
              </li>
              <li>
                <t>SST (Slice/Service Type)</t>
              </li>
              <li>
                <t>SD (Slice Differentiator)</t>
              </li>
              <li>
                <t>Locality</t>
              </li>
              <li>
                <t>GPSI (Generic Public Subscription Identifier)</t>
              </li>
              <li>
                <t>SUPI (Subscription Permanent Identifier)</t>
              </li>
              <li>
                <t>Routing Indicator</t>
              </li>
              <li>
                <t>TAC (Tracking Area Code)</t>
              </li>
              <li>
                <t>DNN (Data Network Name)</t>
              </li>
            </ol>
            <t>Additional attribute types <bcp14>SHALL</bcp14> be defined to cover all NF Profile attributes specified in <xref target="TS29.510"/> and related 3GPP standards.</t>
            <t><strong>Flags</strong>:</t>
            <ul spacing="normal">
              <li>
                <t>Optional (O): Whether this attribute is optional for matching</t>
              </li>
              <li>
                <t>Transitive (T): Whether this attribute should be propagated</t>
              </li>
              <li>
                <t>Encode Type (ET): 3-bit field indicating value encoding format
                </t>
                <ul spacing="normal">
                  <li>
                    <t>000: Value is a numeric list</t>
                  </li>
                  <li>
                    <t>001: Value is a string list</t>
                  </li>
                  <li>
                    <t>010-111: Reserved for future use</t>
                  </li>
                </ul>
              </li>
            </ul>
          </section>
        </section>
      </section>
      <section anchor="domain-routes">
        <name>Domain Routes</name>
        <section anchor="definition-and-purpose">
          <name>Definition and Purpose</name>
          <t>Domain Routes represent a special category of service routes designed to address specific privacy and accessibility requirements in distributed mobile core networks. A Domain Route contains only PLMN (Public Land Mobile Network) information as its service attribute and uses a fixed all-zero Service Route ID (00000000-0000-0000-0000-000000000000).</t>
        </section>
        <section anchor="use-case-and-motivation">
          <name>Use Case and Motivation</name>
          <t>Domain Routes serve critical scenarios where private network domains require selective visibility within the broader network ecosystem. In certain deployments, private network domains prefer to maintain operational privacy by not exposing detailed service capabilities or internal network function profiles to external domains. However, these private domains still need to enable User Equipment (UE) that belongs to their PLMN to access services when roaming or connecting from external network locations.</t>
          <t>The primary use case involves UEs whose subscription services or information are associated with a private network domain but are currently registered to a public network domain. The public network needs to discover and access subscription services for these UEs within their home private domain through NID and PLMN. Without Domain Routes, external domains would have no knowledge of the private domain's existence or basic accessibility information, preventing proper service routing for roaming UEs.</t>
        </section>
        <section anchor="domain-route-characteristics">
          <name>Domain Route Characteristics</name>
          <t>Domain Routes have several distinctive characteristics that differentiate them from regular service routes:</t>
          <t><strong>Minimal Information Disclosure</strong>: Domain Routes contain only essential PLMN information, revealing no details about internal network functions, service capabilities, or network topology. This approach preserves privacy while enabling basic connectivity.</t>
          <t><strong>Fixed Route Identifier</strong>: All Domain Routes use the same all-zero Service Route ID (00000000-0000-0000-0000-000000000000), simplifying identification and processing across network domains.</t>
          <t><strong>No Fragmentation</strong>: Due to their minimal content, Domain Routes never require fragmentation and always fit within a single BGP UPDATE message.</t>
          <t><strong>Universal Propagation</strong>: Domain Routes are typically propagated more broadly than detailed service routes, ensuring that UE accessibility information reaches all relevant network domains.</t>
        </section>
        <section anchor="domain-route-format">
          <name>Domain Route Format</name>
          <t>A Domain Route follows the standard Service Route NLRI format but with specific field values:</t>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
|             All-Zero Service Route ID (16 octets)             |
|                 00000000-0000-0000-0000-000000000000          |
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Fragment=1   |  Total=1      |  NF Type Len  |   NF Type     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Attr.Count=1 |            PLMN Attribute                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                PLMN Attribute (continued)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          <t><strong>Field Values for Domain Routes:</strong></t>
          <ul spacing="normal">
            <li>
              <t><strong>Service Route ID</strong>: Fixed value 00000000-0000-0000-0000-000000000000</t>
            </li>
            <li>
              <t><strong>Fragment Seq</strong>: Always 1 (single fragment)</t>
            </li>
            <li>
              <t><strong>Total Frags</strong>: Always 1 (no fragmentation)</t>
            </li>
            <li>
              <t><strong>NF Type</strong>: Set to a reserved value indicating "Domain Route" (TBD)</t>
            </li>
            <li>
              <t><strong>Attr. Count</strong>: Always 1 (only PLMN attribute)</t>
            </li>
            <li>
              <t><strong>Service Attributes</strong>: Contains only one PLMN attribute with the domain's PLMN information</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="operation">
        <name>Operation</name>
        <section anchor="bgp-session-establishment">
          <name>BGP Session Establishment</name>
          <section anchor="peer-establishment-between-nrf-entities">
            <name>Peer Establishment Between NRF Entities</name>
            <t>When two NRF entities need to establish a BGP session for service route exchange, they follow the standard BGP session establishment procedure with extensions specific to mobile core network requirements. Instead of using traditional Autonomous System (AS) numbers, NRF entities use their respective NIDs for session identification and loop prevention, aligning the session establishment with the hierarchical domain structure used throughout the mobile core network.</t>
            <t>The BGP OPEN message must include several mandatory elements to support Service Route operations. The local domain's NID is included in place of the AS number field, establishing the domain identity for the session. Capability advertisement for Service Route AFI/SAFI support is required to indicate that the peer can process Service Route messages.</t>
            <t>The OPEN message format for NRF BGP sessions:</t>
            <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|    Version    |               |    My NID (first 2 octets)    |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                 My NID (remaining 4 octets)                   |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|          Hold Time            |         BGP Identifier        |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    BGP Identifier (continued)                 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Opt Parm Len  |                Optional Parameters            |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          </section>
        </section>
        <section anchor="service-information-base-sib">
          <name>Service Information Base (SIB)</name>
          <section anchor="sib-structure-and-management">
            <name>SIB Structure and Management</name>
            <t>Each NRF entity maintains a Service Information Base (SIB) that stores service route information in an organized, efficient manner. The SIB contains local service routes originated by the local domain based on registered NF instances, remote service routes learned from BGP peers, and route state information including metadata such as route origin, next hop, and propagation path. This comprehensive information storage enables efficient route lookup and policy application during service discovery operations.</t>
          </section>
          <section anchor="sib-entry-format">
            <name>SIB Entry Format</name>
            <t>Each SIB entry must contain the following essential information elements:</t>
            <ul spacing="normal">
              <li>
                <t>Service Route ID for unique identification across fragments</t>
              </li>
              <li>
                <t>Origin NID identifying the domain that originally advertised the route</t>
              </li>
              <li>
                <t>Next Hop NID for forwarding decisions</t>
              </li>
              <li>
                <t>NID_PATH for loop prevention and path traceability (only in non-BGPsec environments)</t>
              </li>
              <li>
                <t>Fragment information including total fragment count and completion status</t>
              </li>
              <li>
                <t>Network Function type and associated service attributes</t>
              </li>
              <li>
                <t>Route status and timestamp information for operational management</t>
              </li>
            </ul>
            <t>This information enables efficient route lookup, policy application, and fragment reassembly during service discovery operations. In BGPsec-enabled deployments, cryptographic path information is maintained through BGPsec's BGPsec_PATH attributes instead of the NID_PATH field.</t>
          </section>
        </section>
        <section anchor="generation-of-service-routes">
          <name>Generation of Service Routes</name>
          <section anchor="nf-registration-and-aggregation-process">
            <name>NF Registration and Aggregation Process</name>
            <t>When NFs register with the local NRF, a systematic process generates service routes that aggregate service capabilities across multiple NF instances. The NRF collects NF profiles from registered NF instances according to <xref target="TS29.510"/>, ensuring compliance with existing 3GPP standards for NF registration and profile management.</t>
            <t>For each NF type, the NRF aggregates all unique service attributes across registered instances of that type. This aggregation process creates a comprehensive view of the services available within the domain for each Network Function type. The aggregation algorithm examines all NF instances of a given type and collects their unique service attributes, avoiding duplication while ensuring complete coverage of available capabilities.</t>
            <t>Each aggregated service becomes a single service route with a unique Service Route ID generated using UUID version 7. The generated service route is stored in the local SIB and marked for propagation to appropriate BGP peers based on configured export policies.</t>
          </section>
          <section anchor="service-route-fragmentation">
            <name>Service Route Fragmentation</name>
            <t>If a service route exceeds the maximum BGP UPDATE message size, it must be fragmented using a systematic approach that maintains route integrity while enabling efficient transmission. The service route is split into multiple fragments, where each fragment contains the same Service Route ID, sequential fragment numbers, total fragment count, and a subset of service attributes. This fragmentation approach ensures that receiving domains can properly reassemble the complete service route while processing fragments in any order.</t>
            <t>Fragmentation follows specific rules to maintain consistency and enable efficient processing. The minimum fragment unit consists of one NF Type plus one Service Attribute, ensuring that each fragment contains meaningful information. Each fragment contains exactly one NF Type to simplify processing logic, while Service Attributes can be distributed across fragments as needed to stay within message size limits. All fragments share the same Service Route ID, enabling receiving domains to associate fragments with the correct service route during reassembly.</t>
          </section>
        </section>
        <section anchor="service-route-transmission">
          <name>Service Route Transmission</name>
          <section anchor="mpreachnlri-propagation">
            <name>MP_REACH_NLRI Propagation</name>
            <t>Service routes are propagated using MP_REACH_NLRI through a systematic procedure that ensures efficient and reliable route distribution. The NRF selects service routes from the SIB for propagation based on multiple criteria including route origin (local vs. learned), configured export policies, and peer relationships. This selection process ensures that only appropriate routes are propagated to each peer according to established network policies.</t>
            <t>For each selected route, the NRF performs attribute processing to maintain routing integrity and enable proper loop prevention. The system adds or updates the NID attribute with the local domain NID, identifying this domain as the most recent propagator of the route. The local NID is prepended to the NID_PATH attribute to maintain the complete propagation history. Any configured attribute modifications are applied according to local policy requirements.</t>
            <t>When fragmentation is required, the system generates multiple UPDATE messages with specific handling characteristics. Each UPDATE contains one fragment of the original service route, and fragments may be transmitted in any order since no inter-fragment dependencies exist. This approach enables efficient parallel transmission and processing of large service routes while maintaining protocol simplicity.</t>
          </section>
        </section>
        <section anchor="service-route-withdrawal">
          <name>Service Route Withdrawal</name>
          <section anchor="withdrawal-procedure">
            <name>Withdrawal Procedure</name>
            <t>To withdraw a complete service route, the originating NRF sends an MP_UNREACH_NLRI containing only the Service Route ID, providing a simple and efficient withdrawal mechanism. The MP_UNREACH_NLRI contains the appropriate AFI/SAFI for Service Route and the NLRI consisting of only the Service Route ID (16 octets). This streamlined approach eliminates the need to transmit detailed route information during withdrawal operations.</t>
            <t>Receiving NRFs process withdrawals by locating all fragments with matching Service Route ID and removing them from the SIB. The withdrawal implicitly affects all fragments belonging to the service route, regardless of how many fragments were originally received. The receiving NRF then propagates the withdrawal to appropriate peers according to configured export policies, ensuring that the withdrawal information reaches all domains that previously received the service route.</t>
          </section>
          <section anchor="withdrawal-message-format">
            <name>Withdrawal Message Format</name>
            <t>The MP_UNREACH_NLRI attribute for service route withdrawal has the following detailed format:</t>
            <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Attr. Flags  |Attr. Type Code|          Attr. Length         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                              AFI                              |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|      SAFI     |    Withdrawn Routes Length (2 octets)         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
|                    Service Route ID (16 octets)               |
|                                                               |
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
            <t><strong>Field Descriptions:</strong></t>
            <ul spacing="normal">
              <li>
                <t><strong>Attribute Flags (8 bits)</strong>: Optional (1), Transitive (0), Partial (0), Extended Length (0)</t>
              </li>
              <li>
                <t><strong>Attribute Type Code (8 bits)</strong>: MP_UNREACH_NLRI (15)</t>
              </li>
              <li>
                <t><strong>Attribute Length (16 bits)</strong>: Total length of the attribute value (23 octets)</t>
              </li>
              <li>
                <t><strong>AFI (16 bits)</strong>: Address Family Identifier for Service Route (TBD)</t>
              </li>
              <li>
                <t><strong>SAFI (8 bits)</strong>: Subsequent Address Family Identifier for Service Route (TBD)</t>
              </li>
              <li>
                <t><strong>Withdrawn Routes Length (16 bits)</strong>: Length of withdrawn routes field (16 octets)</t>
              </li>
              <li>
                <t><strong>Service Route ID (128 bits)</strong>: 16-byte UUID v7 identifier of the service route to withdraw</t>
              </li>
            </ul>
            <t><strong>Processing Notes:</strong></t>
            <t>The withdrawn routes field contains only the Service Route ID, providing a simple and unambiguous identification of the route to be withdrawn. No additional NLRI information is required for withdrawal since the Service Route ID uniquely identifies the complete service route across all its fragments. All fragments sharing the same Service Route ID are implicitly withdrawn when this withdrawal message is processed, ensuring complete cleanup of the service route from the receiving domain's routing tables.</t>
          </section>
        </section>
        <section anchor="partial-service-route-updates">
          <name>Partial Service Route Updates</name>
          <section anchor="incremental-update-mechanism">
            <name>Incremental Update Mechanism</name>
            <t>For efficiency, NRFs can perform partial updates of service routes without withdrawing and re-advertising the entire route, reducing network overhead and improving convergence times. When service attributes change, the system generates new fragments with the same Service Route ID, includes only modified attributes in the update, and increments fragment sequence numbers if needed to maintain proper ordering.</t>
            <t>The attribute replacement mechanism follows specific semantics to ensure consistency across all receiving domains. The update contains the same Service Route ID as the original route, updated service attributes, and follows replacement semantics rather than additive semantics. This approach ensures that receiving domains can precisely understand which attributes have changed and how to update their local routing tables.</t>
            <t>Receiving NRFs process partial updates by identifying the existing route by Service Route ID, replacing specified attributes entirely while maintaining unchanged attributes from previous advertisements, and propagating updates according to local policies. This processing approach ensures that partial updates are applied consistently across the network while preserving routing table integrity.</t>
          </section>
          <section anchor="update-message-semantics">
            <name>Update Message Semantics</name>
            <t>Partial updates follow specific rules that ensure consistent interpretation across all network domains while maintaining routing table integrity. Updates operate at the service attribute level, providing fine-grained control over which aspects of a service route are modified. Updated attributes completely replace previous values rather than being merged with existing values, eliminating ambiguity about the final state of modified attributes.
Non-updated attributes remain unchanged during partial update operations, ensuring that unrelated service characteristics are preserved.</t>
          </section>
          <section anchor="example-update-sequence">
            <name>Example Update Sequence</name>
            <t>Consider a service route update scenario where an AMF service needs to support an additional network slice:</t>
            <artwork><![CDATA[
Initial Advertisement:
  Service Route ID: 550e8400-e29b-41d4-a716-446655440000
  NF Type: AMF
  Attributes: PLMN=001-01, SST=1,2, Locality=Region1

Partial Update:
  Service Route ID: 550e8400-e29b-41d4-a716-446655440000
  NF Type: AMF
  Attributes: SST=1,2,3

Resulting State:
  Service Route ID: 550e8400-e29b-41d4-a716-446655440000
  NF Type: AMF
  Attributes: PLMN=001-01, SST=1,2,3, Locality=Region1
]]></artwork>
            <t>In this example, only the SST attribute is updated to include slice type 3, while the PLMN and Locality attributes remain unchanged from the original advertisement.</t>
          </section>
        </section>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The BGP extensions proposed in this document inherit the security framework of the base BGP protocol and can leverage existing BGP security mechanisms to ensure route integrity and authenticity.</t>
      <section anchor="bgpsec-integration">
        <name>BGPsec Integration</name>
        <t>The Service Route extensions defined in this document are designed to be compatible with BGPsec, which provides cryptographic protection for BGP route advertisements. BGPsec can be applied to Service Route advertisements to ensure:</t>
        <t><strong>Route Origin Authentication</strong>: BGPsec validates that the originating NRF domain is authorized to advertise specific service routes, preventing unauthorized route injection. Each Service Route advertisement includes cryptographic signatures that verify the identity of the originating domain using its NID.</t>
        <t><strong>Path Validation</strong>: BGPsec's BGPsec_PATH attributes provide cryptographic path validation that supersedes the need for the NID_PATH attribute. When BGPsec is deployed, the BGPsec_PATH mechanism ensures that each domain in the propagation path has legitimately forwarded the route through cryptographic signatures, providing both loop prevention and path authentication. In BGPsec deployments, the NID_PATH attribute becomes redundant as the BGPsec_PATH provides superior cryptographic protection for path validation and traceability.</t>
        <t><strong>Route Integrity</strong>: BGPsec protects Service Route content from modification during propagation. Service attributes, fragmentation information, and route identifiers are cryptographically protected, ensuring that receiving domains can trust the accuracy of service information.</t>
        <t><strong>Non-repudiation</strong>: BGPsec provides non-repudiation capabilities that enable audit trails for service route propagation. Network operators can verify the complete history of route advertisements and identify the source of any security incidents.</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="bgp-afisafi-assignment">
        <name>BGP AFI/SAFI Assignment</name>
        <t>IANA is requested to assign a new AFI value for Service Route from the "Address Family Numbers" registry.</t>
        <ul spacing="normal">
          <li>
            <t>Suggested value: TBD</t>
          </li>
          <li>
            <t>Reference: This document</t>
          </li>
        </ul>
        <t>IANA is requested to assign a new SAFI value for Service Route from the "Subsequent Address Family Identifiers (SAFI) Parameters" registry.</t>
      </section>
      <section anchor="bgp-path-attribute-type-codes">
        <name>BGP Path Attribute Type Codes</name>
        <t>IANA is requested to assign new path attribute type codes from the "BGP Path Attributes" registry:</t>
        <ol spacing="normal" type="1"><li>
            <t>NID attribute for network domain identification
            </t>
            <ul spacing="normal">
              <li>
                <t>Suggested value: TBD</t>
              </li>
              <li>
                <t>Reference: This document</t>
              </li>
            </ul>
          </li>
          <li>
            <t>NID_PATH attribute for loop prevention and path traceability
            </t>
            <ul spacing="normal">
              <li>
                <t>Suggested value: TBD</t>
              </li>
              <li>
                <t>Reference: This document</t>
              </li>
            </ul>
          </li>
        </ol>
      </section>
      <section anchor="service-route-id-format">
        <name>Service Route ID Format</name>
        <t>This document uses UUID version 7 as defined in RFC 9562 for Service Route ID generation. No IANA action is required for UUID usage.</t>
      </section>
    </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>
        <reference anchor="RFC4271" target="https://www.rfc-editor.org/info/rfc4271" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4271.xml">
          <front>
            <title>A Border Gateway Protocol 4 (BGP-4)</title>
            <author fullname="Y. Rekhter" initials="Y." role="editor" surname="Rekhter"/>
            <author fullname="T. Li" initials="T." role="editor" surname="Li"/>
            <author fullname="S. Hares" initials="S." role="editor" surname="Hares"/>
            <date month="January" year="2006"/>
            <abstract>
              <t>This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol.</t>
              <t>The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems. This network reachability information includes information on the list of Autonomous Systems (ASes) that reachability information traverses. This information is sufficient for constructing a graph of AS connectivity for this reachability from which routing loops may be pruned, and, at the AS level, some policy decisions may be enforced.</t>
              <t>BGP-4 provides a set of mechanisms for supporting Classless Inter-Domain Routing (CIDR). These mechanisms include support for advertising a set of destinations as an IP prefix, and eliminating the concept of network "class" within BGP. BGP-4 also introduces mechanisms that allow aggregation of routes, including aggregation of AS paths.</t>
              <t>This document obsoletes RFC 1771. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4271"/>
          <seriesInfo name="DOI" value="10.17487/RFC4271"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="RFC9562" target="https://www.rfc-editor.org/info/rfc9562" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9562.xml">
          <front>
            <title>Universally Unique IDentifiers (UUIDs)</title>
            <author fullname="K. Davis" initials="K." surname="Davis"/>
            <author fullname="B. Peabody" initials="B." surname="Peabody"/>
            <author fullname="P. Leach" initials="P." surname="Leach"/>
            <date month="May" year="2024"/>
            <abstract>
              <t>This specification defines UUIDs (Universally Unique IDentifiers) --
also known as GUIDs (Globally Unique IDentifiers) -- and a Uniform
Resource Name namespace for UUIDs. A UUID is 128 bits long and is
intended to guarantee uniqueness across space and time. UUIDs were
originally used in the Apollo Network Computing System (NCS), later
in the Open Software Foundation's (OSF's) Distributed Computing
Environment (DCE), and then in Microsoft Windows platforms.</t>
              <t>This specification is derived from the OSF DCE specification with the
kind permission of the OSF (now known as "The Open Group"). Information from earlier versions of the OSF DCE specification have
been incorporated into this document. This document obsoletes RFC
4122.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9562"/>
          <seriesInfo name="DOI" value="10.17487/RFC9562"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="TS23.501">
          <front>
            <title>System architecture for the 5G System (5GS)</title>
            <author>
              <organization>3GPP</organization>
            </author>
            <date year="2023"/>
          </front>
          <seriesInfo name="3GPP TS 23.501" value=""/>
        </reference>
        <reference anchor="TS23.502">
          <front>
            <title>Procedures for the 5G System (5GS)</title>
            <author>
              <organization>3GPP</organization>
            </author>
            <date year="2023"/>
          </front>
          <seriesInfo name="3GPP TS 23.502" value=""/>
        </reference>
        <reference anchor="TS29.510">
          <front>
            <title>5G System; Network Function Repository Services</title>
            <author>
              <organization>3GPP</organization>
            </author>
            <date year="2023"/>
          </front>
          <seriesInfo name="3GPP TS 29.510" value=""/>
        </reference>
        <reference anchor="TS29.500">
          <front>
            <title>5G System; Technical Realization of Service Based Architecture</title>
            <author>
              <organization>3GPP</organization>
            </author>
            <date year="2022"/>
          </front>
          <seriesInfo name="3GPP TS 29.500" value=""/>
        </reference>
      </references>
    </references>
    <?line 655?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+196XIbyZngf0boHXLVEW5SBtAEdXQ3d9pjikeLERKbS1Dt
tWcn7AKQAGpUqMLWQYo98j7LPss+2X5nHlUFUpqWPBOeocMtoFCVx5fffdVw
OHy0U6d1Zg/Nyx8vzen72uZVWuSVWRSlmdjyJp1Zc1U0dZovTbEwb4ppmllz
XJTWXNj6tijfVY92kum0tDc8RniHH+/RzryY5ckaJpqXyaIerpPh1FbVcLrc
DNf0yHAGjwyte2S4vw9PJTU8crB/8Hw4PhgefPdoZwZXlkV5d2iqev5o59FO
uikPTV02VX2wv//9/gEsp7TJoa760Q4uclkWzUY2mSfTzM51d5NHO+/sHdwz
PzT/BL8PzPMfafWD9v4H5uLq7J9xyqSpV0V5+GjHAPwM/KV5dWj+NDJvEv7O
O/3TqinKJHdXi3J5aI4vzo8H5vhowtfsOkmzQ7NOfuGbf7/Km5GdN6NZ3hr+
jyPzOg2H/2OST9OkcFfvGT67m66TevX7WZ7OuiO/hpGbcOTXjbvAg67SPJGT
jcdtsub3M/yVz3A0K9atwX8cmf+Z2nD0H5NimQA6ucv3LPx9av2iH+3kRQn7
SG8swt5cnR0fjMff6+dnB9+O9fN342+f6efvn784OCRMyRfR89eTg6ej5/v8
kDFCCI8nd1Vt1yYpYWO1ndUNYDKSQ72yiBvy8+7zHyd7j/lJjw/G7efpj5eX
fMHh8FP+XtkytRUuhu+CdRheSLCog9aiLstiBmhR2upvs5YDWcv3o+fj/dZa
3MT/XXmAOWvyWQ1Ua67spqjSGghUyaf6fAujxfiF7bcXZoKVXdvZChAnyWBJ
SZb+ktDygIUpVb9MKuACR8Epf9pCD+5fKHIv/N9wODTJtKrLZFbj9+tVWhlg
hs3a5rWZ22pWpsAJTWJye2uATdXWbMpikyx5xUk+xzloyfO0mhU3FmC7ht0l
eVqtzfSObgegA0khf7MxE2fCNMhcYQY+LR2vZMY2MtcrK6MASKoia2jqNK/L
Yt7MaHUhM7TmaD4HVKzMWbJOs7uBWaW2JIJBgCtSnM9hi+kCfjJJlhUz2tCA
drQBbjRMboFT6yL8lirA7qQ2lvi0qWBE+gCrseVwXgBjyHsgcrvCbW5gVfgT
jAesCGZJYfdpDT+n9crMmrJEqNM5VTUsJCnnFW2/siHgABY36dwSmS2KBu4j
gCA87WKRzlIcRdcQnNZADjBZLku7DPabFcVmuCit3y5sIkvKpR3iBmkjNSAC
PDyPjmxuN1lxh7hSjRSd1ul8joz40c5X5lzOCKfCK5MOYGAi4RYRDswKfDIz
myzJAbi453SdlHCaCLl1g7SDi6lXsOLlisZ4dX19+c0BbrguZvDsv/6rEuJf
/8pIRJCVNQy7FGZ2Jy+P9mBTizSHn2BpNAQxv7/+VY4c8Daz71M8c797AMrc
ZtUAnpllzZwQpsnqdJjMZoiIdr60dOQM3d03p8d7gJZ30zKdm1lWNIDXMxi/
TIuKjySEuAJloWwMoDKzDHXzqri1AMkBgqCKTyo4HXx2nuBHwHWA4Qr+sfkS
0Qoe4BMPENjD+COIHBZxLKiLRzCcEmDjE9RDqcytJbyp0iXCGHEWNg78B5gg
fLf5TVoWOa+ZUDOZvaPTRZo0RJM5QHQQIrGZJZuEKAl4HYOP6ZKJq7T/u0lL
mSyET7EBtoADMPLGvE8YjrK+vwmTqzZ2BhxJwP7RDC5kZbtHZ+d7BIJJM61g
57iXe26f4P0Pc8jdi/OTvYBPAoBXgIECbTwfuOHPl0fXr0xSC4Bp7z2sVDkO
ssMbnKHIe5gcoEReoUZEEAVYFAAFOmgCZR9ybQM2rJJoFyf3DPJ+jj2g37Ms
XeK9W/hmabOU1hOKRBDiHYINEdQks7KAw4golVbBaPgVKAflOs2LrFjeMV5a
A0aAQSugMo/fvJ1cPx7wv+biJ/p8dfo/3p5fnZ7g58mro9ev3YcduWPy6qe3
r0/8J//k8U9v3pxenPDDcNVEl3Yevzn642Pe7uOfLq/Pf7o4ev2Y2XZILnjA
cERTkYRwtLivpNpRHYL46cvjy//3f8fPgK/+N1GPga/yF9SJ4cvtygpwizy7
k6+AX3c7yWZjkxJHATREiKbAyxABK1OtitvcrICzjHZ2nvwTQuafD80/TGeb
8bPfyQXccHRRYRZdJJh1r3QeZiD2XOqZxkEzut6CdLzeoz9G3xXuwcV/+EdA
Z2uG4+/+8Xc7Xe7VIOdi/QBo9hYxH05lXZGl8eTJNgp/8gRuODRHMT9I/V0N
snY4ZxAOwFrggOS3O4fzgsoDpmUShbgOoNiZ3dTbhOtI1iVMxK0DaZ85v+Mq
pH6VdkbUgEMzlwPiBcqDAYh1AAnjSoEzJ0K8MGFe5EMYsLKzSM4MRKHCpYLs
Smdt7uR0Qhx5ZkWuIM8CkPuFwZeq2dDEPDXP9XUlH5g9IkabWXm3qYtlmWwA
wsS/LDMKHPAGbEvkKgKTiPM7wKBMQuB8ZknAPFu5Gaox98guZ7EiA58EAg1w
b5aUICOVY1qnQAwzgGoWPgooUYLNC+K5LNasNm1gxosztNBBCwb51wcJc37i
gDF+MZzewaW3b89PDB49DvttiLeENG2kJWZMalkG3CoSyVa5NPKaFPWnMll6
Pbe9ljP51a1oU5QqDJLWwLSUBY6JWj+yM4OKA2wZz/Pt5cnR9SkoF1WVLO3I
/AHRpT0EYEldFKyh04kVwAriJ0F+1YSRmyytWXw60G7by5GiciX76NjPDtnF
ClLmzhpaiQoVizjAukjmARxkC/h5YUslzphtDICCZitk6Zev31wMzGRyDf85
GRjUO5DogK3UM1n2WxjRnIJutyGWt/v21POvuaUd0SLFXELBS8o4gKKFyaym
JWbVrJMceRxAFL7DfjcAPmcZVvdyr6/MZVkA2a7NpAaMxzWp9LY3arTWxS0a
dVuNK7CD+hSYUBcMNHmvx6tVqtr8VkU8sGNnSZ4XILnnwBtgwUAXCXMH1caC
0asNQIMIlDkkDJojy7pBBVvsFdGLUVGb3yDdzlX1FhMEtTOyioiXFps6XYvn
Aw84AYwApT2fkTOTbQ4wiZHTEni/clbGsezoknb0GkapWY3n+77i3bN9p7h9
4taHI18G+lrreZ2kZZFWqOzdAaGFoP1kf0gVGaxKXoFXylHa7sXV2V4fypGX
CQ3aP5BLgbQwQNOySIBweKXBiaItF5hXgUVIDIIcEi3zMHQtwrfMg4dxbAqi
dw3IASfD2sF2V0EoZekQ74Wdo9O8YGmLnkQwq1APDgXGwKyTd2SyAmNbA+gq
ssYB7wSlvKkxB3uKzQkYC7YIogH9KqGbwaMxzAk6Emjh5g/AmGEEBm4IGu8e
CVbjMEQIClanspFArktIpjim88uoDU+shjkT7roSvcLtHO2WOdq8SEDIANx8
sGNFygqPiMhykS6bUiyREtjpdEhQgcUvgJqnaE4H6EjaiBMMbm24DlLpY2Xk
FHGsIxR2LwBT4fAWiI/kquEzJaSdA2znDTkdbgWq2y33zCasMBbAyRAioBcY
9BQkZLshMa3gFqIyIApnyjEugdb2rtmEVj1DklwIKIiDeRmJEeIgsGYNIHBG
Rjzyb4JkEsCZEHsAGG9ZJ5rC/LfpHF12MEuz3ojqVjUi+jboDq/IHTAt6hp4
qJ0hXdYYozGoe+B+R+yC/Qo5For+hOx8lRRnzrGnUuQlaLwgmX4EyN4md8jD
2OrdhYf3gO5AJ649E2f9v7Ihv4ppmRkRUh3iQMu/uQIVGqAEv5TCgBD6iM3J
nOX5Odp5ACMP8BFu42tGY1DDZjViduhfcxTudK4++u5zEMTaBK0Q0RP3Cb8n
Wce3403/NmDUIgnp2i3DOZjMMtlUxD67rq2KnPh8fuycQKcfUiZFb9AKQP2P
1tTjOejxRQASoXfThwF6VGzxOIASgM92qcL5yQkrvq70ZENXGBDWMitAzPrT
KzV8iGyrQp56a7NsWDVpLS6zbdw9Fo90JmvASzDF0LeNihaQewWrJnQRu5B2
AbZHxlzZ7xRsxU2RqqAAOyXFTSPjGBB1TOFYFqyJgxYCVl0KvAiomA+DR2J1
IfIiCZazBTYI9Q/l5TELAlGJpwLLWQLWg2US+f5FLynAbKtqcUED5qQz3Dax
Z+LooGCvLYFlZK5gLjZASH22yC2YxZW2RqZZEzY+rLlxjIAI5z36m52jsGKV
iw07pvkQtwOih+XPC54fQeoow2vIgjSgHKxBeKWiFqoQ8MEXOu00h53hkfRw
BcEXxxtgIfb9BqNRaKmTfQC7S/MGUARgt0J9ERc8Uh0OLHlz5P2N+MSbJAfL
JlKsFWp4N2lKqbhOY9d9w47cRQarfvZsOEXNwRuHoNzOBL5IVgRYOMWO5gPG
GjJgF/NxtovTqka0kMBNKgowcjzg3mmu0qe+RdbK0ClKUk+AYmBywh+wjM6P
Lo4CkRPCMRKDQQxibrPkrlKbhzinmd/lYOnP3FLhDBIiDZGNYO80aEeEqwuU
9oflJHJIjF8MhfeFMYdb9Mi1HUPEI4Cy5uIupC1a3Qxwl+IOtSZeN+kNKS6p
2sAxkJKHtLgkEhJSVb0NgQj8skxgkIYFTmh/jBRpCAvwnPx9qCKAnIc95byp
gOuS1qabUL/YHU4mvmPQwRhLVummcsqpPrF2SIvMpWgwhLQqitpZOUlTwzi1
U4lDNcWrt14pjVxzuuTKqaEBUok+miLLoNOMNSZcJTEvMtBLA8+Rv10WhEpQ
qDERSyKtcgnM8BeHjaVZWnVlwfcp6S0YdR6ZmIuLjtoNIuhCVW4q0mowiohA
eAAguQ2xdC5OfyDMezARn2zF4IJ428N4yswMzpm4PiKlA8ccT2CuJurp+2RN
3isZ7FoVi/MsazDMTnOrjdkyPa8Lk+ptVjh5xL1R3Uzntmx5diOM0G04lYb4
GqihK3OJuk09rIvhMdiOc7N7eXDMHsJLkHR4Hf/Fy6BPRlhNbuP/A3+adhD/
HfVe/sb8r77r38D/+354Sf897v4C49C/3YdOzNCcwv+H5kyXF3q3FfiHT55Q
cNpcAJqYo0NzzCaxIthuCfS4pzdU5uXAHB+CVb5kDFeE2J0h1EpLChow5w0A
i2SvRbOoQDEfDHIyMKcDc3ZoThHv3BgnBO9T0l7D8WDOMzSe6BpeOKaxTkhE
01TOWAWkI7lXOTlySoOe8e41H+6aZBSMxFYbbl2wU+DxgS/CP6AwmVegb39Q
1yrwP/MB7hjSn/zT+ghfcIwjPIgPcnr88TcnvzmVL8Edx/6O49+cuS94x0u+
fOLvcB/jO079HaetO475sh/Yf5Q7Th4c4/TBdZw9MAYeQBQMFy8UK6kBvcsZ
oDzaamHAMa/SKSpYFYb4I2ZAETjBb4mvklZbAX+csTFGrmNB8SNiZYStbLM6
Yx/YCjEHxdCXjEvIk6NEE8dv5bkg80AN+35nzZGy97mtKbApbtmXxns5hKkC
/0bf6+7YrIrNHufIlMyBz8zuAV6tzE2aGMyeCJwFVTNVJ4eaEw4OPNktcG7v
OkF9omjImcKuBBQxqCICywP9lB2Or1sW6AKUYMpwA3BuhF8SXYY+rNKKSw0G
Jo7g/WS3NnmXk3c1PJgTfzDqLwy80mjqyI1nFAZ1zoy2fRzY73K1coEvr8yw
B9eS/EsWlnU5ddYkWQHXgfmrH0o1DsCEowlHrxAJbkAWojbTHV4OGuMBGL0H
ZK01rnMWeT5Ph2cdngYQOKU90kdgn2hP4UpPQkcXPh26fiLZRxQAQuF3gFzw
nyP8zzH+h2NJqDMD6HAIRZd5wF/906f0jFMYk2ml8cWuihY5JliZrZiiUGnQ
fAdnm1IclJyMLI09gcJCLOgtVeA0G1DIMgiiXZypo03t4Azl0y1sDmZeezGD
ImygMmgPg7GSngJECHhMrjlUmiPfBxplanB4/5uqiqGfYYtXDQ+fwvaeovp9
ZVPEqqzCY72x8AHgA5oNqW0d/SVEMIw8b+K9jjivTMB702Q5IIQ7EFTPexzN
TKKhsRcaWGVaoeXOcvOKWSFmx8HGyO5mUNUgSwFrSL3qkoKcpmA/qwpTuyhK
G4VX0fovWHfgmzzVbY0Rh+6ImlTXlHzmyyYBqqttgKh4yEsCDBqYDRIXMCOK
oyWqPQIZwCU0wzEXC1guLDhFIQRbJ76U5v+CNLKAc7K9jilUwGFBmwbZZ9f3
Tid0looVgNQH4xMyEsWtbV2CAeMJ6c5zsHYOTjxuKDF9sKUTRpgVFXArYe0D
XC3n7fBcEXqRqCiabK75neECYvnqLYAgmMDmTuV5V+irp7hANzJx6867maEn
U8wwdIhgOm8iwcW4AkLMjVcflbblHlPfypF3NbxBFfBpfEucSsJ5HFXon1jz
Q8JLyZSOMtdIJLMtF/Fnb/qxszI2ZZ01romWbQd/yGrQxxEy0EpSbB1aeysW
YyBtU1KBjpsjLhh6QDSzQ6Nq3m2dYQaSk/HOW9vnCGBkQtYB4hCTHspkKdaq
46hBBNSEYSnvMzCbpqQ0ROcXi478NJ8VpARNyJJWgYUn4j0VchQVsE48GZDD
lleUVZp+qypodIys2PHufTKjc66Gp5w4Q18HDqU9Zz3j5lObiZ86vuYy5SqO
gvjFa7rIHBdVlIH3nFJ/aNveQp/au4LyEYMtUogLlSxNNxUXatd7pwEjl+Dr
MICwKo68kSeV79iU6CgNFg1DYgDNcQhYalq2HSce3ynbLZQ/ba/VB/OawPCB
yfUlmgRgqykIP7i0ngl5Mk/USY+n5M24yHjbZtO1/8jqGYut89Ts7o/He/R5
DJ/35PL3hqwUhK6EF5Qo6fGDnscPQMvfl5EO+PHfmoMXfqBSzO9vcgVLNObT
njHh85gG/WC+1SH94OPv/OCUTvKNDS1zGvXZb7ujwjUYdrz/2z20KRvmUI4I
KO5kLWoCjpvZik3BHjynL//OSL7Fwy7OAcqBUD8T3vKXp6MXozH8b/8vFNuZ
U15n4BHaB1AZAJDZp7+x/Nv9Ipe8q4aozbFTHnMYSicUNId0Gngc+OOrGGiH
euj4GxPJWI70kFCUpwx+Puj+3Lnn6ZZ7/J18uJEEQi1MYLUPsNLMaBKlLHyS
XCWgDYRSFeZocqI7yiQP9/d/Ue8inZimYDlh7hIQT1wAJBQEUYJikpPUIXoi
G42V7m1plpjFl0omaY96ocZUmS5JdKJeQ3vq5EaqSGe12N/ICqbmkBK2k2Ee
RgYlo5ACh/0qlHfGMqQ9ZUmWthfLDvud6Dwj9S9wcO6b7t+459pBz7Wn9PwY
fntqnpnn5gVwou/M959y7dHOb4e/8n/IyggvRuYsS5YVsDH+dn23weLXuf3g
l8y/vLb5Es4/cGV9nlX0/yFe7r4wxay2dbW37a4vvYqP/Ps8q1CeNzRPnniS
peN58uTQ/KRUuTsGc/3akyZ9v8TwG/64D19IV0cuLGe2y9wvHNadMw59/RKA
zcE21uE59xIjjJ0HeUh86oXZXaTvMWmEZ0GpgtYEP3FB2bdG8m4/hTUo/V36
HJmrBlgDXifHWJA8o7nbpIdGvGzQw0nWTVULL3WKLI/GlalkgoFBlzingDeP
KUCUu1oOtMY7YX1WXFss1WcS929XARExs8D67mWID7G5gE/yU19XshLZymyV
YEWnLSlNAbMQutBK7ii99Y6CjKjDIwje00cXFYxmDDcHUAi0FEwQGi7LhPKE
NGuBXJlglM1WHU6OOu8MywEk7uudkCOvN8ULpvXeJFk6l9gYH8QS91KbdzkW
gHS4P6VGB4q1GlMDSk0B64SyjWVUSb9HH1YUW+SEV1djFGQ7kYwLnkYBv7LZ
hjzds7qVjWfLUiL9m6KWrCXnFuTksT4Mw30D5VLhRYrGZNXxRCTZEs6mXq0J
eUCbWthSYU3uJ0cNevhF2dY+qwAnQzPHB48dUnACe3JDpXtlHZZPiaXM2/Rh
YVHmA3y619xhTYcdzp+q7rRr0Fo6D/pTP0LvcRb/J9SD4OlE5YscVpaCE8Es
1sMBz815Lj8NrbR88ClrdaewBJ/NLfLFBFOYq/7akiA9X0M3VJGS4lFtcydq
lV6AyaN7ACoWDCxVanLvAuN9e5EN6fbjEYgOiqtcOmCiGDkhetHcySB6gdiI
wK9QYIEZNOO8XyyqcIyPM25Km8yJodmkdG4N3Bbs5QCnvcQtXgfnhRO/EXkQ
ZCSGjmLM8sKsbOppEOduSOrGPO1x0fyXail//w6qJWLDazg2s3uTlFSc2a9e
/o2VOtTbLmLeQ9eOFe1IzetodpSFjEb9l9DwfhYADZArSameiPq8WU9ZicOC
OqfyEWTx0UlQcqc6IFbekROUau/iklhMXP41ih8xoa06n5dRxKhZ+kZ8OnSo
RgqhzasmKE2ualfcd74Q32U8pTKcLqPh0Aavm5Y15RKQpJxzCFtz8mLGxnY2
xRww/Y3m/4U1HBEIGnCL9+bLzzFrRIPMlAwlTC3MQnMbG8SpfFzrT64iDcVb
Dkn4qgCKFAaBWk7TdcknYRxOz9HFtzxI4jAXA0tVO4QWQAeRkIrtUJlDKJO3
WhIbJHgmgeUqyGGUJ6M0SQeESqpP7+HuXvev+mKpeHKSGSd+XFhdfBjb9OtI
X2U9I1JYXYzz36KoOp2GUxiEc/g+GfcLLSezVeNqNRg4O/8GC0Kd1iXfW0oX
16HidWC3WWORE0nNaecitX3gUoJ2+y4h9DirrWXDHDo+G5WwMjcKh9rF6fhW
WsTPuAbhkrqd+ImL11fnYXeSq08uYdVoR39VKOj1J41VbOaqzQqJHLhnVFir
nAHT07iVhavVTLpEr7XYXOLZtrG4fNURcVwdyqf+96WU/Kq/D1uGaJccg5ze
5rbaNsRnWMWnDfF5wKnIi7LewPfrAosJ8CrqfAZTUUgHAX2CvrsLn3UVrEEe
Fw0sxLRh061b/kKweHDaXSlmAEXtC52IappfddnX+Qmz4i9QBT/CAJGvFwch
jDliknVHXqhk3S6cr1bUC0R/bK91tGUXim9Ojbi36B2mX1Bdu6+e//j69y1c
2kmYEPVJcIRNJrxqzNWheu/umDNRRPQE5KJD1HTJP+/Byj3zcLXhjh2ghLL4
lGW3nSrMGmlP4vGs/kfru698XeNub87M7hFXolK5TSGODV9346ajXU7wgYkl
XWzrTW8v4SYq1edy7ejHy2P48ZI9rVrVHT998gaexiwtWPZJUifBPHLDVesG
X03N2dhXMMU9ldZ802QS3DXJ8Awmzr8W3Xr0Fm890lwqlsuIUbDD6EZtVHAd
6p8ZmqZoVvUdX8UIS766bU0GQsLxDMgV53Z+EoWqEvzSnIPD/wzyv2Ut7z7b
HnD6nKJC/CJGBNaJEN3LO+8Jaf/w2VdBSi/L5o7YlF+rzuXPugpfjhEfA/cW
kUosp+wH/lciBBQhazSyScMFnglmwMzc8LopDUl9bGKBt86asi0G3t/cobdL
qVcPXKZbOi2o5xI7kgCzAnsKVvLaMUjHivfI0TiZXANPRAbyjdIiLgh+fAo/
nshv5iSlJigYBQBuBL8+G5nX0uPk0c7zkfnxcgL20482p43LrNjIB0x9zqH1
wTZ4/AUM/vYSnohuubSYR4gsObr525FrmnyuOSePdr4Dc/roGMwnsLrIzXoE
ZjC5mOCR78GEuYDtE4dVYF6AfN+Lq3U7B8nts6be9qMKhBtuuomSrecguixQ
jsKH8+G3VptMxjV1vbFE8/63n/YOMe1eSnHb3nVnSrP7pMaewUscIIzDXm8f
Auxr9N9MbRDJwsfJEazc5xQHeEq1p5wLJPk+CGq2kx1OL8RvbMwQ82cOhZxT
akYotICSRO8YR3dg8he6l/wN4/3heDw+9BljuM8FpzKBFSkegBP2xrD1q5ay
t/e5UIwdE/hrdHtY+MDnhzmV0gy7J5nDNYAMSpeDmG16k8zYMcOdMdK4leNa
koO39iXVUAror9G2KDjJETBMU3+QpONK0MpwLQ7vxB8/PqgVxhQyB9Qe/mLL
osd81CSiYc9/9G/PRRJAbzLHwMNEHwNEdB0hYvDTuXo3oCtulCAUQbTu1jgK
PDWWCENgqmfQlFa467QsEswHc2XEWndPcSyNAkbdZbZNKeHJMBgfeb7k7EF/
xZhXt25BwR+3lyp9PUO3W6pWTFBbEblLvZbt/qm6bF1uVadZ5upAJUWgp/OU
9sZB+6gS6ygtGcMQx1mtdpU9lK8HQF2T19LXwSDxY8TWrVN3o2l6voxZo28N
dmpCHEnzmyLD2NzbU5ygqCjLzEsD34CrjPG6pLBBMUuJr5IrLtlyfly5UbqM
4eyOYruAClKnBQ8yOcXPSXOK+Kdu5ZOn+C1Ll+7isDXapMNQAPUKuxLFx+f8
cuSyR/YFx+ErLCISGnRwQyoBqBNKXpDLNqOUUUnpiOf6uuKqTA6LaNpAzL6i
ujiNJ2MdBKectHrCSq444whs13GFiKMdx27SLmug9VMBIdU7Yb8EJvWWg1U6
ugWKCVnxa0ZIOGUMGbT4uLSTfAMiYk1NRTxWYcOtrMDoCkV4oyUJF2Ym7Hu4
ELFEMOLyIApkFMICtI/SVnqHk+zjEVT40S4u6mb6W4lvKx/iqgKX6dLtfqaK
BzF+4fNO2cKtowcl3j5SrPOP/FpZAbvF+Fe6uCNtWKYOumaEYTV2CrdYsvbe
LJwrJHGBeee2BgJbyynj6ZFHId5VjijmJErstya6zm6xPQW6bT6i8aG0+MtT
dGQhbvjATRefyOF0t5Eq0qCkcY3KAAmv7I5bsHTkSKnUj5FADlkBGbw93U66
sEfAFcu9IUEbtTdYQNYH1A6x+oSAll7irXTrdNqeKIVohsSFuV+J6kysUrKB
9J/CuP+Ev45bHUhy+Kd+mtvi3u/1zH8MfT4wxCdv5POAUwn9B0QFde7/IHjx
t3Xuk28fpo5gQ5LAm/RfFBbxX2vm+xz7n28V3ldyRmT8s/dzRIzONbLo7YVr
WAaxLfkxuNnv7T5iPj02u8KdlZX3e7b97SCiI66vqcKMOhyorVlHdFUxvNjA
En4cbvhxGMwNQkHxvN6UcybZXgykqLEtOZq9DYitc+OHfTDaaXZtzUQs5p/U
cFFmj4JMHeKnmHMBRvhKoxrku6UOK9FP5qUkUqCn+lR6A7ooCObZhU0DvSmi
YwA4cdpKpkWkiQMn9j21TLLcR10zpCNJEw5go8W5dBmGStBazYkeNOV6ukRH
aZ2gGrr6+6aS7k3OaXTU1EVerLEGWd8ZdDTZk1BJNYgBINpTWlJXKDFbKfuI
t8676FGEWlmcmPCKBeBaZdW7fYcKUamqvjTAVfBxKJ6NDW4cavtg4mw3hPdP
l6cXqu5IHhP3EXTKOjYWSihYYTPxeQQ1lzEHiLteWq5wi3OW0kpnIMcaNSBV
W+ZoooEp8Zw6MCh8tMhJ08z1PU8CN6BMX7+dzG+wEXQl3fA62R4um0T3klY+
55oqzokfSDIu2VrULCJxSWKtAaO0Btx+BFxRmqiCATApQPa/T1XpZ4n9mq7v
n76/ueMCnEVaAtYdhArPl0rO1ClLfHMa0dw9wZjPv4pXBUjV63QdqRL+d8SI
oHblS63CbJvwy6cPfEBfOJYRrb1OF/05VzncA2ZpjTn8n30VQRKDI+DQZ4DN
kszu5Pzlno91nr80k6hSOu4C6Zp0CFvyeX/JA1Mwc8EUQFu1Uw2CB9BOdU3v
LHJG15UA+HNuS+a3uE7nXGbm23J5a/mMBudjHu1DVYE/LXwHAjpD1kU7QaPC
Nkhlrn1GqJ6B8yspVMIJGdiOvrUn95YqMIexyYTru8+P8Fqxp+D7GrsuDaIy
HXKqYmo9e0+oZ4hdoV5wE8+DwEUGvK2hg3RsprE5CSBouG/mbI9326m33tvk
8ASUJwzsOxubI+Lwg6UfSMaq6ynONfQ+qHD5KnUlmtQxFhfUVByzaTrqBjta
XIYHBaMIpiyJpeC1JVsJIQVNsiwQo3OfR0vZCtqv7UIWAf/H1wpE1WJ0o5Zv
cM37xxSx7Er/nm11HKRZO5OhH6k40cVlxswoe4tbvlIaRCoNyxteZG8mC3mM
vFO6E3ShR68cfjecslIDi6+wMU/c9aqVXbtu9ZElxSg49nuxddCDqkwebsPY
+gh0nykA8mNwuKcUKIqktCp38MgiuFeO6QUvxHuoPqjVD8tjCrXoUCZN8WfX
5iTOjw3Tk66IZ5Ve1z4KWrVIwr8zaS7OKsfkvILNzBA4OWa9cnCJureowrfk
pbR5tTYD1yzd/vhQOxs2erkMF91hnyfgB1SH1GmztYUno4+wKLULXRipDvyJ
hPQptfMRE0p6FscBbFZPz2SqAJTaWd9jLTdUwiQIEn5nRDGcUY/bcLBgD6Vw
qC4FKVSCzfmdEV6g8g1Dq5c8OFM9FW14lrSkwE1qb1ulr8GbjcLQovC+hdtO
HzvgM4r6/2jNI8ATIySy2eh06OU7yxSboDue4s6YTcitwAEsvCn4nVDzxssk
DQeEZ2sprswNfmhOt80QB/0LFLoZ5a7NsvOIx/qIhORksR05pKQxF9M6TgBl
2Pl7OlmVpALNNZGG6RClJjdcKN9JvkAo/dGJE3S+cWqH12K09tV2ioofSgB1
DpXz7ruTsCudldd+rZP36bpZ9wQPKLmeEkC1DkdZswNRxGJc+Ed62KsG2S4S
b8WCvHxoF6W0z++h9zBpC2IigEBuBhUsvbm0A0lL5Tcg6HPObdInh6XnNIVX
bR1mZnjc1zZIcQhHgcQlU8J3uxVZYqSDeKPYsEhCG5fhtNBbXo7r4lQ+M5a0
7zsuIGO2Fy1KwybOF1U2WavSn3omU1g2qvL3h+fn5aOjMFez9nADsqt1GGIq
6DJUh/gmw8Z5ue1mXrZDSlsOd20TtIcXTaR7SvfB7u3A7ahlf7gGdApJDDCE
IvVVHQh0e5LWpTdZmEPT1luNK0CkSerEZYWEpMZ9aat2svgDieBB/4DeJghO
+wuGdNoCiF1q3BkjkmhbXv8ata1Nnvw6oFfHjd5c/vnq9Oj41Z8p0BbEG8PS
oKCDQRBmZJ4SD6CKWFeZIW+qvESaSckjY/RWUdlU0M3L6yqcsdNRhkhbqcUe
bXNtx5wdB8KEIQs8PFDeQwPQ7LI0uIGzFTtzb3APaxcz0VIcOGy6wwzFdyxQ
9SHiJWR5hGKlH9jacJumiRQw57P0xfSx1HE6E69EW+571UkK/cLcvoCg2g1E
OP10ewuRvpfcamvnZD7nl1Jt5kmtHZaixg8tzVj0JGq8EduPvsNUIpKxqJgz
y2uMEXCFa8kihR3eSSy+YSmjZAhHNkGQ0xlA4KG6SmAH+V2ILEFPi+jtJZR/
hMYUMaDgPHl5Ym51ukSQLRHLqMCNzGcqwPa2w7Z6uFY0fQWHmfUUIQpbloeD
ZELPpFqdb1puoNhSrLS7R9guORR5qA7OKPuI31bsJuGKbRBqaN2QRdFOZela
sRvYCii/WaSutFNEsLU0FyjGjIWlSFha7DqisOyZ+Rf1tdkt5lvNy+Q2yRyz
9ZfYPESeKK9AuJWfthYlDbrdaIghUpPSHNnw24uAEcspcXV7xp63rizyr4BN
eENsLnjo3foVuypMpqItEzIthvzMhT26ERH3Fm0ZoBIbkbSNLYsOkxWUw1Lp
ckaeAI8JKJ5zx2U0gKg451Nius5PEajB3lu+N1/3TN2Cla/7B6hzBycvImwj
BYHLzCXdurs9loXr4kbcZOtIujHsg5UpFqIQWSy4n8gDxWsxVqFRVs4zXD+A
fVXcosl9F64XdfTAP6c9nrWjaQAKHN9Xwgvkg8W2DCg2niLmd5+UjRXL1tDb
MpWcaqXvB8Kez8EuuiAZ9ZHrG1H8vJu1jwbil8B3rVkZbJW031LtkJE38XcY
n/sP3DxFZwYWde/fZ13FRKej74ppLrdPW6EcdOKF/2G6A/5X5bgHZzuV6cS6
LO4wfanVLMfscnPevftbIe7/mlaI0RxtfrU7fr6lUw6dm3uOk5+kJaJoep7X
cTbT7sFTPWgZElthhKNsfwt7VzNot7MId/FRL3a/d8it5BYu97Xb7q27Xe1N
OuQAtfuz0+COg2DdcaV6VKLe1y4RxaHOzLgV9BC6KHxiXKgRtJYYF/58kg7Y
5Ml6CqIY05Nacb7QpJL32bn5R7C0sDE64VkrcBM1GgzkIqv9vUpfX/n+Pb61
ra+x73HWuFSoPncNmWmBjuXhTLUsZIZGOjKrCalTCil23nWcZzbJ8a29fefu
9L2eLkxqgNdk5jjLQ9lDvPy3bGU7feYc308i78fk30CvEaXeOQpE9cd3RpBy
S55N6QS0kWnUfO9WuOkbBhQm2n6ntEON6yq88RzLQA2VV7y6F/pFrz1eE5YS
CHP4YUn1JhT3lBcL9QR6gvy/rkmMHXx6PGxbfHbuXbdER2zIh7a9a4nFkBn4
FyxJqwO1YFsNFSrs6uddjc7LIK4UsobRReveyeOYbmn9q7R9f5yOZ9i9KTFo
+xX5hj2hdNyRrODzjj7CLa9+GOcCkJPlAfqC2eIWkDWHO/LLLsMXyRJboboe
+blr/n+Elx5zBZCVBG9G54atwXFS+RAjEGMgGkb0Hh7tbJVKP/0+ktxiH7bJ
Z3rXyYlwYVJmBXBHFxkZUBRgdyXDwdKZrrK7HudFk7st+fv5VT1iGcVJjFUr
AwaHkLVvc1mlLpASVuD0nk8bHKFHzOEoGbaMpEFzOBc8oYxqhZc7Be+f9Mac
Y3jMoSeKQnjDZWsl7XbKEl/xzutgfeyjgpVoxMhTVLsItHsg21atrFscD0g0
kaDwfIC6coVC/KGuxAllD0uYuCU1S+t4my4hQhWVX2Q/cyatQxzpUhDSK79y
bY3set7KAuC7B85LQ1hC+gY5laeaTrxgZyLlcsGKezgvnDC2mGy6q+WsywDp
xa8T413g22m7GJpcq+5dekWreJCd9JLW73FN34cqOKd9I6OXTLSBL6vRGmaJ
jeJL6N6cuVtd7ah7BU0eKluu7yF2WwicCOdYy44Z5yFxH2KZfJu7HJrnz/ft
d8/294f24Pvp8Nl4/myYfAuq67NnL148f/7sGZdQuNqYQ1wffvchtkMqHPhh
f3883B8PsDfED+PBwcB1eviB3zE6DimPIfUFl6SreMr8uUKPOLrf6i87bS8k
nvbBQk3Ic9EqLePQIFDdJ9dxAwfFecodlyR66rNBeR9PNQiKz3KtB/Bynfhe
QnEaqJPlkViQd3O5188pTgfv9JVs/6BwAoVIUWnGRfiqLXmhujA4GdO9TF51
ZAzjccqFeuApsQUIQF8z5bkL57rLSME7IuPWp+1O+OGb4rQ/pOQCntONLi56
3TFRgo0GDVXifXIvSN8BYsrmC4yqyUEy3UBYtX8D131drHGzwr8j2T3SxUvE
W0Vr3S4AjB/zQJIyZ75J8jjjDlBo1cok2vSz8t7ZdqzCvzAGIQ2//qKdMGT+
UG2Ny1SDqnGwS/3Teoz/oh1Jo3ZQPdvzmnwMUzyVpPa6CTyir2ZxtR9bX+4g
kXC0NC+k1Zt03v7Z9S71oHq4e3lP6mPQBJUTuLHBOVBTGN3Q2pRuBFNsJN+U
XRuys3EULsfbEpGuRvFjPUDp/tvKiya3dgbsDN8xSjqCJOiGibwuQWAb+ENV
ht4nujWBN4lQMcgnjfNIt8R0NfcM7c58jqXMYr6EwHAE+G/qJ8/hrSDNeBQS
1LnynoCIZLx2nY+UnjNbDqPITqPxRzFyz4Z2VitgHDYb8Bnz3h/Fik20V60x
rymDoK0p9ZtadYmJaOQsnAEzxsYCgccgzPvRWvx8CHplM0/b3CV4u2V0S5zv
Kgo66dLc7xegj70TutGYCGKafMmaIL6uAlcfsADnt9Hmyf6duDHvJLO//71O
GFTzL77IZ3SbeHCoZ3mPGJXaShdB9e8II00BHxJ3mq1EEeBO6NgxSVoUs3e2
6w51Mv5xy4l6wZ6Jx5qTy2g7NJNmueRpaEjpLDw0V5ZaZ8zwSijvPm6Jk49b
48f4fCuzi6PtBcU8rU04iBJz7vGWVw8tGpfcfnUGPowdr4I8pMfdSYK1aG+1
OPNlEXTqiMoOldpRtzTbzoF+uu8oDkZ9bPCjSyR+3eQ93VujUGqoJlFPqVY3
17iL59XZsfn++YuDHozxecFM2QWTVjLr9T3TLI3rvDEcDkHNnL3Dz/8f8G4e
CoenAAA=

-->

</rfc>
