<?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-yxl-cats-protocols-applicability-02" category="info" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  
  
  
  <front>
    <title abbrev="Protocols Applicability for CATS ">Protocols Applicability for Computing-Aware Traffic Steering (CATS)</title>
    <seriesInfo name="Internet-Draft" value="draft-yxl-cats-protocols-applicability-02"/>
    <author initials="H." surname="Yao" fullname="Huijuan Yao">
      <organization>China Mobile</organization>
      <address>
        <email>yaohuijuan@chinamobile.com</email>
      </address>
    </author>
	
	 <author initials="L." surname="Dunbar" fullname="Linda Dunbar">
      <organization>Futurewei</organization>
      <address>
        <email>ldunbar@futurewei.com</email>
      </address>
    </author>
	
    <author initials="Q." surname="Xiong" fullname="Quan Xiong">
      <organization>ZTE Corporation</organization>
      <address>
        <email>xiong.quan@zte.com.cn</email>
      </address>
    </author>
    <author initials="C." surname="Lin" fullname="Changwang Lin">
      <organization>New H3C Technologies</organization>
      <address>
        <email>linchangwang.04414@h3c.com</email>
      </address>
    </author>
    <date year="2026"/>
	
    <workgroup>cats</workgroup>
    <abstract>
      <?line 51?>

<t>This document analyzes the applicability of protocols related to a CATS system, and describes how to build a CATS system by extending existing IETF protocols.</t>
    </abstract>
  </front>
  <middle>
    <?line 54?>

<section anchor="introduction">
      <name>Introduction</name>
      <t><xref target="RFC10053"/> introduces a framework for Computing-Aware Traffic Steering (CATS). 
This document analyzes the corresponding protocols in control plane, management plane 
and data plane, and evaluates how far the existing protocols or be extended 
to support CATS such as metrics distribution and their operational requirements.</t>
    </section>
    <section anchor="conventions">
      <name>Conventions Used in This Document</name>
      <section anchor="terminology">
        <name>Terminology</name>
        <t>The terms defined in <xref target="RFC10053"/> can be used in this document.</t>
	   <t>
        This document uses the terms "Service Contact Instance (SCI)", "Service",
        "Compute Resource", "Shared Resource", and "CATS Metric Levels (L0/L1/L2)"
        as defined in <xref target="RFC10053"/> and
        <xref target="I-D.ietf-cats-metric-definition"/>.
      </t>
      </section>
      <section anchor="requirements-language">
        <name>Requirements Language</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in BCP
   14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they appear in all
   capitals, as shown here.</t>
      </section>
    </section>
    <section anchor="cats-applicability">
      <name>CATS Applicability Overview</name>
      <t>As defined in <xref target="RFC10053"/>, the CATS framework structure consists of the C-SMA (responsible for maintaining service metrics), 
	  the C-NMA (responsible for maintaining network metrics), the C-PS (responsible for maintaining forwarding table entries), and the 
	  C-TC (responsible for traffic classification).</t>
	  
   <figure title="CATS System Applicability " align="center">
         <artwork align="center"><![CDATA[
		 
+-------------------------------+   +---------------------+
|   Control Plane               |   |   Management Plane  |
|  +------+  +-----+  +-----+   |   | +-----+  +-------+  |
|  | PCEP |  |C-PS |  |C-SMA|   |   | | OAM |  | YANG  |  |
|  |      |  |     |  |     |   |   | |     |  | model |  |
|  +------+  +-----+  +-----+   |   | +-----+  +-------+  |
+-------------------------------+   +---------------------+
  ^          ^         ^                         ^
  |          |         |               | PING    |
  |BGP-LS    |PCEP     |BGP-FS         |TRACERT  |YANG
  |          |         |               |
             V         V               V
------------------------------------------------------------------
                                                       Data Plane

+--------+    +----------+    +--------+      +----------+
|Ingress |----|Forwarder |----|Egress  |<====>|Service   |
+--------+    +----------+    +--------+      |Contact   |
   ^                              |           +----------+
   |           IGP/BGP            |           
   +------------------------------+

	   ]]></artwork>
  <postamble></postamble>
 </figure>
 
<t>Figure 1 depicts a high-level CATS system architecture illustrating component placement and representative 
control management plane protocol interactions.</t>

<t>Metrics Distribution:</t>

<t>Centralized mode (Controller as C-PS):  The egress C-SMA advertises Metrics to the C-PS via BGP-LS extension or YANG.</t>

<t>Distributed mode (Ingress as C-PS): The Egress C-SMA  advertises Metrics to the C-PS via IGP，BGP extension.</t>

<t>Path Selection:</t>

<t>Centralized mode:  The controller-resident C-PS computes CATS?aware optimal paths and delivers candidate paths to the Ingress CATS-Forwarder 
via PCEP or BGP SR Policy or BGP-FS extensions.</t>

<t>Distributed mode: The C-PS resides locally on the Ingress node. It computes optimal CATS-aware paths locally based on received metrics without 
controller-driven path delivery.</t>

<t>OAM:The controller MAY leverage extended PING and Traceroute mechanisms to perform CATS-specific OAM operations. </t>		 
		 
      <section anchor="control-plane-applicability-analysis">
        <name>Control Plane Applicability Analysis</name>
		
<t>Control plane protocols realize two core CATS functions:  metrics distribution , and selection of forwarding paths 
for CATS service destinations. Compute-related CATS metrics are formally defined in  <xref target="I-D.ietf-cats-metric-definition"/>
as referenced by <xref target="RFC10053"/>.Nevertheless, standardized protocols and end-to-end mechanisms for transporting metrics from 
egress gateways to ingress gateways remain an area for further development.</t>

<t>For CATS traffic classification, two control-plane mechanisms are applicable. BGP-FS acts as a distributed control 
mechanism for service mapping and flow classification, while YANG models provide a centralized control alternative. 
.Besides metric distribution and traffic classification, control-plane protocols implement path-selection and 
path-delivery functions for the C-PS. PCEP allows a C-PS functioning as a Path Computation Element (PCE) to compute 
CATS-aware paths and deliver them to ingress forwarders operating as Path Computation Clients (PCCs). BGP SR-Policy 
enables a centralized C-PS to advertise service-aware SR candidate paths to ingress nodes, where each candidate path 
carries associated CATS-relevant context for subsequent local evaluation.</t>
	  
	  </section>
      <section anchor="management-plane-applicability-analysis">
        <name>Management Plane Applicability Analysis</name>
		
        <t>The management plane handles configuration, operational monitoring, and lifecycle management for the full set of CATS 
functional components. Existing diagnostic tools such as PING and Traceroute MAY be extended to support CATS-specific 
troubleshooting, enabling operations based on CATS Service Identifiers (CS-IDs). Complementing control-plane functions, 
YANG models may be augmented for CATS to expose flow level statistical data and support monitoring of CATS service behaviors.</t>
      
	  </section>
      <section anchor="data-plane-applicability-analysis">
        <name>Data Plane Applicability Analysis</name>
        <t>The data plane forwards CATS service traffic toward target servic-contact instances leveraging mature existing forwarding
		protocols, including native IPv4/IPv6 and IPv4/IPv6 over SRv6.</t>
		
      </section>
    </section>
	
	<section anchor="protocols-applicability">
        <name>Protocols Applicability to CATS</name>

	<section anchor="bgp-applicability-for-metrics-distribution">
        <name>BGP Applicability for Metrics Distribution</name>

<t>As defined in <xref target="RFC10053"/> section 4.2, the CATS Service Metric Agent (C-SMA) collects computing-related 
capabilities and metrics, associates them with a  CS-ID and/or one or more Service Contact Instances (SCIs), and distributes 
the computing metrics to the CATS Path Selectors (C-PSes). The CATS Network Metric Agent (C-NMA) collects network-related 
capabilities and metrics and distributes the network metrics  to the C-PSes. The C-PSes use the combination of computing 
and network metrics to determine the appropriate egress CATS-Forwarder that provides access to a service contact instance 
and invokes the compute function required by a service request.</t>

<t>BGP can be used as a distributed control plane mechanism for carrying service and compute information among CATS nodes.
 However, CATS introduces requirements that differ from conventional reachability distribution. In particular, a CATS Path 
 Selector may need information for multiple candidate Service Contact Instances that provide the same service, together 
 with metrics whose scope, lifetime, and update behavior differ from ordinary routing information.</t>

<t>Section 4.1.1 describes the CATS-specific requirements that a BGP extension for CATS metric distribution needs to address. 
Section 4.1.2 discusses the applicability of BGP mechanisms to those requirements.</t>	

<section anchor="cats-Specific-requirements-for-bgp-extensions">
        <name>CATS-Specific Requirements for BGP Extensions</name>

<t>A BGP extension used for CATS metric distribution needs to provide sufficient information for a C-PS 
to identify candidate service instances and evaluate them using both computing and network information. 
The specific encoding may be based on a BGP Path Attribute, a new NLRI or SAFI, or another BGP extension 
mechanism. Independent of the encoding choice, the following requirements apply. </t>

<t>-Candidate and metric association: </t>

<t>A CATS metric needs to be associated with the object to which it applies. Depending on the deployment, 
a metric may apply to a CS-ID, an individual SCI, an egress CATS-Forwarder, a site, or a shared resource. 
The BGP encoding therefore needs to identify the scope of the advertised metric unambiguously. </t>

<t>When multiple SCIs for the same service are reachable through the same service prefix, the BGP mechanism 
needs to preserve information for the individual service candidates required by the C-PS. Ordinary BGP 
route selection may otherwise select a single best route and hide alternative service locations that the 
C-PS needs to evaluate using CATS metrics. </t>

<t>-Metric semantics and granularity: </t>

<t>The receiving CATS node needs to determine the type and granularity of an advertised metric. As described 
in <xref target="I-D.ietf-cats-metric-definition"/>, CATS metrics may represent different levels of abstraction, including 
L0, L1, and L2 information. The BGP extension therefore needs to provide sufficient semantics to distinguish 
the metric type and the resource or service scope to which it applies. </t>

<t>For example, an available-resource metric could apply to an individual SCI, all instances of a service at a site, 
or a shared accelerator or compute-resource pool. The encoding needs to avoid ambiguity between these cases. </t>

<t>-Metric freshness and validity: </t>

<t>Compute and service information may change independently of service reachability. A BGP extension for CATS therefore
 needs a mechanism that enables the receiving CATS node to determine whether advertised metric information remains valid. </t>

<t>The mechanism needs to support updating or withdrawing stale information when a metric changes, when an SCI becomes 
unavailable, or when the originating node can no longer provide the metric. Where metric validity is bounded in time, 
the encoding or associated procedures need to provide sufficient information for the receiver to identify expired or 
stale information. </t>

<t>-Independent metric and reachability updates: </t>

<t>A change in a CATS metric SHOULD be advertisable without unnecessarily changing the underlying service reachability. 
Conversely, withdrawal or invalidation of one metric SHOULD NOT unintentionally withdraw unrelated service reachability 
or metrics associated with other SCIs. </t>

<t>This separation is particularly important where multiple service instances share the same service prefix but have different
 compute-resource conditions. </t>

<t>-Scalability and update frequency: </t>

<t>CATS metrics can have different update frequencies. A BGP extension needs to operate with BGP incremental UPDATE processing 
and route-reflection mechanisms without introducing excessive control-plane churn. </t>

<t>Highly dynamic raw L0 measurements, such as instantaneous CPU load, memory pressure, queue depth, or rapidly changing utilization, 
SHOULD be collected locally, smoothed, thresholded, aggregated, or converted into normalized metrics before being distributed 
through BGP. BGP SHOULD NOT be used as a sub-second telemetry transport for CATS. </t>

<t>Distribution scope and policy control:CATS service and compute metrics may expose information about resource availability, site 
preference, operational state, or shared-resource utilization. Such information needs to be distributed only to authorized CATS nodes. </t>

<t>A BGP extension for CATS therefore needs to support policy-controlled propagation and administrative scoping so that CATS 
information does not unintentionally leak outside the domain in which it is intended to be used. Existing BGP mechanisms such 
as route filtering, route-reflection policy, community-based controls, and appropriately scoped or non-transitive attributes 
can be used as part of such controls. </t>

<t>-Relationship to BGP route selection: </t>

<t>CATS metrics are inputs to the CATS Path Selector. Unless a specific BGP extension explicitly defines otherwise, CATS metrics 
SHOULD NOT alter the normal BGP best-path selection procedure for the associated reachability. </t>

<t>The BGP mechanism needs to make the relevant candidate information available to the C-PS so that the C-PS can apply CATS-specific 
policy and combine computing and network metrics when selecting an egress CATS-Forwarder and SCI. </t>

<t>These requirements are independent of a particular BGP encoding. They can therefore be used to evaluate existing BGP mechanisms as 
well as proposed CATS-specific BGP extensions. </t>

</section>

<section anchor="applicability-BGP-cats-metric-distribution">
        <name>Applicability of BGP for CATS Metric Distribution</name>

   <t>BGP is applicable to CATS metric distribution when the metrics need
   to be distributed among multiple routing or control-plane nodes
   within a controlled administrative domain.  BGP already provides
   scalable mechanisms for distributing routing information, including
   route reflection, policy-based propagation, incremental UPDATE
   processing, and attribute filtering.  Similar to the use of BGP-LS to
   distribute link-state and traffic engineering information to external
   consumers, BGP can be used in CATS to distribute service-related and
   compute-related information from egress CATS-Forwarders, controllers,
   or metric agents to the nodes that perform CATS path selection. </t>

   <t>In a CATS deployment, BGP can be used to associate service or compute
   metrics with reachability information for a service prefix, a CS-ID,
   an SCI, an egress CATS-Forwarder, or a site.  The Edge Metadata Path
   Attribute defined in <xref target="I-D.ietf-idr-5g-edge-service-metadata"/> provides
   an example BGP-based mechanism for advertising edge-service-related
   metadata, including availability, preference, delay prediction, and
   resource status.  These metadata elements are relevant to CATS
   because they can represent normalized compute capability, available
   resource level, service processing delay, traffic load or
   utilization, operator preference, and site or shared-resource
   availability. </t>

   <t>BGP is most suitable for distributing CATS metrics that are
   relatively stable or moderately dynamic, especially abstracted L1/L2
   metrics as defined by the CATS metric definition draft.  Examples
   include normalized compute capability, normalized available-resource
   level, service delay prediction, site preference, and site physical
   availability.  Such metrics can be used by the C-PS or ingress CATS-
   Forwarder to compare candidate service locations without exposing raw
   infrastructure details. </t>

   <t>BGP is less suitable for distributing highly dynamic raw L0
   measurements, such as instantaneous CPU load, memory pressure, queue
   depth, per-flow utilization, or other rapidly changing telemetry
   values.  Advertising such values directly through BGP could cause
   excessive UPDATE churn and may negatively affect routing stability.
   Therefore, highly dynamic measurements SHOULD be collected locally,
   smoothed, thresholded, aggregated, or converted into normalized
   metrics before being advertised through BGP.  BGP SHOULD NOT be used
   as a sub-second telemetry transport for CATS. </t>

   <t>The applicability of BGP also depends on the granularity and scope of
   the metric.  A metric may apply to an individual SCI, to all
   instances of a service at a site, to an egress CATS-Forwarder, to a
   site, or to a shared resource such as a resource pool, accelerator
   cluster, rack, room, or data center.  When multiple SCIs are
   reachable through the same anycast service prefix, the BGP encoding
   needs to make clear whether the metric applies to the aggregate
   service, to a specific SCI, or to a shared resource that affects
   multiple SCIs. </t>

   <t>BGP-based CATS metric distribution is expected to be used primarily
   within a limited domain.  CATS service and compute metrics can expose
   information about resource availability, site preference, or
   operational state.  Therefore, such information SHOULD be distributed
   only to authorized CATS nodes.  Existing BGP mechanisms, including
   route filtering, route reflection policy, non-transitive attributes,
   community-based controls, and administrative boundary filtering, can
   be used to constrain propagation. </t>

   <t>In summary, BGP is applicable to CATS when the objective is to
   distribute abstracted service and compute metrics within a controlled
   routing domain, reuse existing BGP scaling mechanisms, and
   synchronize path-selection input across multiple C-PSes or ingress
   CATS-Forwarders.  However, additional CATS-specific BGP extensions or
   encoding rules may be required to support explicit per-SCI metric
   association, resource-type identification, metric freshness or
   validity indication, and shared-resource scope identification.
   Detailed analysis of the applicability of the BGP Edge Metadata Path
   Attribute to CATS metrics is provided in Appendix A. </t>
   
</section>
	
    </section>	

      <section anchor="igpbgp-ls-applicability-for-metrics-distribution">
        <name> IGP and BGP-LS Applicability for Metrics Distribution</name>
		
		<section anchor="igp-applicability"><name>IGP Applicability</name>

<t>As defined in <xref target="RFC10053"/>, the CATS Network Metric Agent (C-NMA) 
 maintains information about the state of the underlay network. Existing IGP Traffic 
 Engineering extensions, such as the OSPF TE metric extensions defined in <xref target="RFC7471"/>
 and the IS-IS TE metric extensions defined in <xref target="RFC8570"/>, can advertise network 
 characteristics  associated with links, nodes, and prefixes. These characteristics 
 include delay, delay variation, packet loss, residual bandwidth, available bandwidth, 
 and utilized bandwidth.</t>

<t>However, most CATS metrics describe the condition or capability of the sites  
where services are hosted rather than the state of the network. Previous work 
<xref target="I-D.dunbar-lsr-5g-edge-compute"/> explored the use of IGP extensions to advertise
 site-capacity and site-preference values and to make those values available to 
 routing computations.  Feedback from the LSR WG concluded that IGP (OSPF, OSPF-TE, IS-IS) 
 is not suitable for distributing CATS metrics for the following reasons:</t>

<t>IGP floods link-state information to every router in the domain. CATS  metrics 
from a specific service site or datacenter are only relevant to C-PSes making 
forwarding decisions, not to every router in the network.</t>

<t>IGP has no native mechanism to constrain which nodes receive which information.  
CATS metrics from one operator's datacenter must not leak to another operator's 
domain, and IGP has no capability to enforce that boundary.</t>

<t>IGP was designed for topology and link metrics, not for frequently changing 
 compute/service metrics from potentially many service instances. Flooding 
 dynamic CATS metrics (CPU load, memory availability, etc.) across an entire 
 IGP domain would cause significant churn and instability.</t>

<t>IGP metrics are fundamentally tied to links and nodes in the network topology.
 CATS metrics are associated with services and compute resources, which don't 
 map naturally onto IGP's link-state model.</t>

<t>One exception worth noting is that aggregated values — such as a single 
normalized service delay metric associated  with a node — could in principle 
be carried within existing IGP extensions without requiring new semantic constructs. 
However, even in this limited case, IGP would flood such values to all routers 
in the domain, imposing processing and database overhead on  every intermediate 
node regardless of whether it participates in CATS forwarding decisions. This u
nnecessary burden on non-CATS routers further reinforces the conclusion that IGP 
is a poor fit for distributing CATS metrics, even in simplified aggregated form.</t>

  </section>	

<section anchor="bgpls-applicability"><name>BGP-LS Applicability</name>

<t>BGP Link State (BGP-LS) <xref target="RFC9552"/> provides a mechanism for exporting network 
topology and traffic engineering information  collected by IGP from within a routing
 domain to external consumers, such as a Path Computation Element (PCE) or a Software
 Defined Networking (SDN) controller, without those consumers needing to participate 
 in the IGP itself. In the CATS context, BGP-LS could  be used to export network metrics 
 collected by the C-NMA to the C-PS.</t>

<t>While BGP-LS addresses some of the IGP limitations described in Section 4.2.1, i.e. 
by targeting specific consumers  rather than flooding to all routers , it inherits a 
fundamental constraint: BGP-LS was designed to carry network topology and link-state 
information, not compute or service metrics associated with sites and service instances. 
Extending BGP-LS to carry CATS  metrics would therefore require new TLV definitions to 
represent service and compute attributes that have no natural counterpart in the existing 
BGP-LS schema.</t>

<t>Furthermore, BGP-LS does not natively support the administrative boundary enforcement 
that CATS requires. CATS metrics originating within one operator's datacenter must not 
leak into domains  managed by other operators. This can only be addressed if the BGP-LS 
attribute carrying CATS metrics is marked as non-transitive, ensuring that such metrics 
are automatically dropped at administrative boundaries and do not propagate beyond the 
domain in which they originated. Without this constraint, CATS metrics risk leaking 
across operator boundaries, violating the privacy and policy requirements of individual operators.</t>	

    </section>		
	
</section>

      <section anchor="pcep-applicability-for-service-aware-computing">
        <name>PCEP Applicability for Service-aware Computing</name>
		
<section anchor="cats-Specific-requirements-for-pcep-extensions">
        <name>CATS-Specific Requirements for PCEP Extensions</name>

  <t>As defined in <xref target="RFC10053"/> section 3.4.4, C-PSes can be used to determine the best paths to 
   forward traffic based on both computing and network metrics.  A standalone C-PS may be 
   implemented as a Path Computation Element (PCE), leveraging the Path Computation Element 
   Protocol (PCEP) <xref target="RFC5440"/> to communicate withPath Computation Clients (PCCs), such as 
   ingress CATS-Forwarders. </t>

   <t>PCEP primarily supports the path computation function within the
   CATS framework, specifically enabling the C-PS (acting as a PCE) to
   compute and distribute optimal paths that consider both network
   information (from the C-NMA) and computing metrics (from the C-SMA).
   It needs to ensure that traffic is steered to
   the most suitable egress CATS-Forwarder and Service Contact Instance
   (SCI) based on composite metrics.  It is required to convey compute-
   related parameters (e.g., CPU load or service delay) in path requests
   or responses, and select an egress router associated with the
   service instances in CATS. The CATS-specific requirements for PCEP extensions may consider: </t>

   <t>o  Network topology and metric information (e.g., from C-NMA) for
   underlay path computation. </t>

   <t>o  Computing metrics (e.g., from C-SMA) associated with CS-IDs or
   SCIs, such as normalized compute capability, resource availability,
   service delay, or load conditions. </t>

   <t>o  Identifiers for the selected egress CATS-Forwarder, SCI, or shared
   resource (e.g., CS-ID, CSCI-ID), to specify the service destination.</t>
   
   </section>
   
<section anchor="applicability-of-pcep-for-cats-service-aware-computing">
        <name>Applicability of PCEP for CATS Service-aware Computing</name>

<t>PCEP is applicable to CATS service-aware computing when the C-PS is realized as a centralized 
controller or PCE and needs to compute, optimize, and deliver egress/SCI-aware paths to ingress
 CATS-Forwarders acting as PCCs. PCEP <xref target="RFC5440"/> already provides request/response messages, 
 capability negotiation, metric and objective-function objects, and ERO-based path delivery. 
 Similar to PCEP extensions for Traffic Engineering, PCEP can be extended for CATS so that a 
 PCE acting as C-PS combines underlay network information (e.g., topology, delay, bandwidth, 
 and other TE metrics obtained from the C-NMA, BGP-LS and IGP) with computing metrics (e.g., 
 normalized capability, available resource, service processing delay, load, and site preference 
 obtained from the C-SMA) to select both an optimal egress CATS-Forwarder and a specific Service 
 Contact Instance (SCI). </t> 

<t>In a CATS deployment, PCEP can be used by an ingress CATS-Forwarder to send a path computation 
request that identifies the target service by CS-ID and, when required, by CSCI-ID, egress CATS-Forwarder, 
site, or shared-resource scope. The request may carry  network constraints (e.g., bandwidth, latency 
bounds, SRLG or link diversity) together with CATS computing constraints (e.g., minimum normalized 
compute capability, maximum service delay prediction, maximum resource utilization, or operator 
site preference). The PCE/C-PS returns one or more computed paths, for example as an ERO or SR 
path/SID list, and indicates the selected egress CATS-Forwarder and SCI identifiers so that the 
ingress can steer service requests to the most suitable compute endpoint. Where multiple SCIs 
provide the same service, PCEP can return alternative or weighted candidate paths per SCI rather 
than a single aggregated route, thereby preserving the candidate set required by the C-PS. </t> 

<t>PCEP is most suitable for applying relatively stable or moderately dynamic, abstracted L1/L2 CATS 
metrics during path computation. Examples include normalized compute capability, normalized 
available-resource level, predicted service processing delay, site preference, and shared-resource
 availability. Such metrics allow the C-PS to perform composite optimization, for example minimizing 
 a weighted function of network delay and compute/service delay, without exposing raw infrastructure 
 telemetry to every forwarding element.  </t>

<t>PCEP is less suitable for continuously distributing highly dynamic raw L0 measurements, such as 
instantaneous CPU load, memory pressure, GPU queue depth, per-flow utilization, or other rapidly 
changing telemetry. Carrying or querying such values on every change would cause excessive PCReq/PCRep 
exchanges and unnecessary PCE recomputation churn. Therefore, highly dynamic L0 measurements SHOULD be 
collected locally by the C-SMA, smoothed, thresholded, aggregated, or converted into normalized L1/L2 
metrics before being supplied to the PCE or referenced in PCEP requests. </t> 

<t>For multi-domain or multi-operator CATS scenarios, hierarchical PCEP procedures may be used. A parent 
PCE can receive domain-level network and abstracted compute summaries from child PCEs and compute an 
inter-domain egress/SCI-aware path sequence, while child PCEs compute intra- domain paths subject to 
local compute constraints. This follows the H-PCE model <xref target="RFC8685"/> and limits leakage of detailed compute
 and topology information across administrative boundaries. PCEP-based CATS path computation is expected 
 to be used primarily within a controlled administrative domain or among authorized PCE/PCC entities. </t>

<t>In summary, PCEP is applicable to CATS when the objective is to perform centralized, service-aware 
path computation that combines network and computing metrics, deliver egress/SCI-bound paths to ingress
 CATS- Forwarders, and support reoptimization as metrics change within a controlled domain. However, 
 additional CATS-specific PCEP extensions or encoding rules may be required to support explicit per-SCI 
 identification, compute-metric types and objective functions, shared-resource scope, metric freshness 
 or validity indication, and the return of selected SCI/egress information together with the forwarding path. </t>
 
</section>

      </section>
      <section anchor="bgp-fs-applicability-for-service-mapping">
        <name>BGP-FS Applicability for Service Mapping</name>
		
<section anchor="cats-Specific-requirements-for-bgp-fs-extensions">
        <name>CATS-Specific Requirements for BGP-FS Extensions</name>
		
  <t>As defined in <xref target="RFC10053"/> section 3.4.4, a standalone
   C-PS may be implemented as a functional component of a centralized controller. 
   The C-PS may apply the BGP Flow Specification (BGP-
   FS) for the traffic classification and steering
   within the CATS framework. It may enable the C-PS to
   distribute fine-grained traffic steering policies to ingress CATS-
   Forwarders and facilitate the mapping between service
   characteristics (identified by CS-IDs or CSCI-ID) and the appropriate
   forwarding actions that consider both network paths and computing
   resource availability.  </t> 

   <t>BGP-FS allows the steering policies of C-PS to adapt dynamically as computing resource 
   conditions change across multiple SCIs. It is required to distribute the compute-aware steering
   decisions and fine-grained mappings for CATS services. The CATS-specific requirements for 
   BGP-FS extensions may consider: </t>

<t>o  Traffic classification parameters for matching CATS service, such as  CATS service identifiers (e.g., CS-ID, CSCI-ID). </t>

<t>o  Computing metrics (e.g., from the C-SMA) associated with CS-IDs or SCIs, such as normalized compute capability, resource 
availability, service delay, or load conditions. </t>

<t>o   Forwarding actions toward the selected egress CATS-Forwarder and SCI, such as redirection, marking, to specify the service destination. </t>
		
</section>

<section anchor="applicability-of-bgp-fs-for-cats-service-mapping">
        <name>Applicability of BGP-FS for CATS Service Mapping</name>
		
<t>BGP-FS is applicable to CATS service mapping when a centralized C-PS or controller needs to distribute fine-grained, 
compute-aware traffic classification and steering rules to ingress CATS-Forwarders. BGP-FS <xref target="RFC8955"/> for IPv4/IPv4-VPN 
and <xref target="RFC8956"/> for IPv6 provides NLRI-based matching on packet-header fields together with traffic-filtering/forwarding 
actions carried as BGP attributes or extended communities. BGP-FS can be extended for CATS to match CATS service identifiers 
and to invoke forwarding actions toward selected egress CATS-Forwarders and SCIs.  </t>

<t>In a CATS deployment, BGP-FS can be used by the C-PS to install a steering rule that matches one or more CATS identifiers, 
such as CS-ID and, when required, CSCI-ID, together with optional network classification fields (e.g., source/destination 
prefix, DSCP, VPN context, MPLS label, or SRv6 SID). The rule may carry compute-aware conditions derived from the C-SMA, 
for example minimum normalized compute capability, maximum normalized resource utilization, maximum service processing delay, 
load threshold, or operator site preference, and may bind the matching traffic to an action such as redirect to a specific 
egress CATS-Forwarder/SCI, marking/DSCP rewrite, SID or Binding-SID association, or handoff to a precomputed BGP SR Policy 
candidate path. This allows the controller-resident C-PS to push per-service, per-instance steering policy to ingress nodes 
without requiring every ingress to perform full metric-based path computation.  </t>

<t>BGP-FS is most suitable for distributing relatively stable or moderately dynamic, abstracted L1/L2 CATS conditions as policy
 match or action criteria. Examples include normalized compute-capability thresholds, normalized available-resource levels, 
 predicted service delay ranges, site preference, and shared-resource availability. Such rules enable ingress CATS-Forwarders
 to select among candidate SCIs based on up-to-date compute posture while keeping the matching space small and the installed 
 rule set manageable.  </t>

<t>BGP-FS is less suitable for expressing or continuously updating highly dynamic raw L0 measurements, such as instantaneous CPU 
load, memory pressure, GPU queue depth, per-flow utilization, or other rapidly changing telemetry. Installing, modifying, or 
withdrawing BGP-FS rules on every L0 change would cause excessive rule churn, frequent policy recomputation on ingress nodes, 
and potential forwarding instability. Therefore, highly dynamic L0 measurements SHOULD be collected locally by the C-SMA, 
smoothed, thresholded, aggregated, or converted into normalized L1/L2 conditions before being reflected as BGP-FS matching 
criteria or as inputs to rule regeneration. </t> 

<t>When multiple SCIs provide the same service behind a common anycast prefix or shared network match, the BGP-FS encoding needs
 to differentiate per-SCI rules (e.g., via CSCI-ID, instance-specific label/SID, or distinct redirect action) rather than 
 installing only one aggregate rule, so that the ingress can still steer to the most suitable instance.  </t>

<t>In summary, BGP-FS is applicable to CATS when the objective is to perform distributed, fine-grained service mapping and traffic 
steering based on compute-aware conditions, to adapt forwarding policy dynamically as SCI compute posture changes, and to deliver
 egress/SCI- bound actions to ingress CATS-Forwarders. However, additional CATS- specific BGP-FS extensions or encoding rules may 
 be required to support explicit CS-ID/CSCI-ID matching, compute-metric thresholds and objective conditions, shared-resource scope, 
 metric freshness or validity indication, and forwarding actions that identify the selected egress CATS-Forwarder and SCI. </t>

</section>		


      </section>
      <section anchor="bgp-sr-policy-applicability-for-service-aware-candidate-paths">
        <name>BGP SR Policy Applicability for Service-aware Candidate Paths</name>
		
<section anchor="cats-Specific-requirements-for-bgp-sr-policy-extensions">
        <name>CATS-Specific Requirements for BGP SR Policy Extensions</name>
		
  <t>As defined in <xref target="RFC10053"/> section 3.4.4, a standalone
   C-PS) may be implemented as a functional
   component of a centralized controller.  The C-PS may apply the BGP Segment Routing (SR) Policy to distribute SR policies for computing-
   aware path selection and traffic steering in SR-MPLS and
   SRv6 networks. </t>

   <t>BGP SR Policy applies to the path computation and traffic steering
   functions within the CATS framework, specifically enabling the C-PS
   to distribute service-aware candidate paths to ingress CATS-
   Forwarders.  It facilitates the association between
   computing resource availability and optimized network paths, allowing
   for the creation of end-to-end paths that consider both network
   conditions and computing metrics.  BGP SR Policy enables the C-PS to
   implement dynamic path selection that adapts to changes in both
   network topology and computing resource distribution across service
   locations. It is required to support the candidate path selection and
   distribution to incorporate computing metrics and service identifiers
   as primary selection criteria alongside traditional candidate paths.   
   The CATS-specific requirements for BGP SR Policy extensions may consider: </t>

 <t>o  Identifiers and SR binding information for the selected egress CATS-Forwarder and SCI, such as CS-ID, CSCI-ID, policy color, endpoint SID, 
 or Binding SID, to specify the service destination. </t>


<t>o  Update information reflecting changes in network topology and computing resource distribution, so that the C-PS can dynamically adjust 
candidate-path preference across multiple SCIs. </t>
		
		
</section>

<section anchor="applicability-of-bgp-sr-policy-for-cats-service-aware-candidate-paths">
        <name>Applicability of BGP SR-Policy for CATS Service-aware Candidate Paths</name>
		
<t>BGP SR Policy is applicable to CATS service-aware candidate paths when a centralized C-PS or controller 
needs to compute, advertise, and reoptimize SR-MPLS or SRv6 paths that bind a CATS service destination to 
selected egress CATS-Forwarders and SCIs while taking computing metrics into account. BGP SR Policy distribution
 is specified in <xref target="RFC9830"/> and builds on the SR Policy architecture in <xref target="RFC9256"/> and the Segment Routing base 
 in <xref target="RFC8402"/>. BGP SR Policy can be extended for CATS so that each candidate path carries service identifiers 
 and compute-aware context in addition to segment lists, endpoint SIDs, Binding SIDs, and policy color, 
 enabling an ingress CATS-Forwarder to steer classified CATS flows onto the most suitable compute-aware path. </t> 

<t>In a CATS deployment, the C-PS/controller can originate one SR Policy per CS-ID or per CS-ID together with an 
egress/SCI scope, and can advertise multiple candidate paths toward different egress CATS- Forwarders or SCIs. 
Each candidate path may be identified by the policy tuple (headend, endpoint, color) and may include an SR-MPLS 
label stack or SRv6 SID list that reaches the selected egress, a Binding SID for local steering, and associated 
identifiers such as CS-ID, CSCI-ID, endpoint SID, and color.  </t>

<t>BGP SR Policy is most suitable for relatively stable or moderately dynamic, abstracted L1/L2 CATS metrics that
 drive candidate-path selection and periodic reoptimization. Examples include normalized compute-capability and
 available-resource scores, predicted service delay, site preference, and shared-resource status. Such metrics 
 allow the controller to optimize a weighted function of network and compute criteria, for example minimizing 
 combined underlay delay and service processing delay, without exposing raw infrastructure telemetry to every
 forwarding element. This keeps path computation on the controller, limits installed segment-list churn on 
 ingress nodes, and reuses existing BGP propagation, route-reflection, and policy filtering mechanisms. </t>

 <t>BGP SR Policy is less suitable for continuously pushing highly dynamic raw L0 measurements, such as instantaneous
 CPU load, memory pressure, GPU queue depth, or per-flow utilization, on every change. Frequent rewriting of 
 segment lists and repeated BGP readvertisement driven by L0 churn would cause unnecessary control-plane overhead, 
 route- reflector replication, and potential forwarding instability. Therefore, highly dynamic L0 measurements 
 SHOULD be collected locally by the C-SMA, smoothed, thresholded, aggregated, or converted into L1/L2 metrics
 before influencing SR Policy candidate-path preference or triggering updates.  </t>

<t>In summary, BGP SR Policy is applicable to CATS when the objective is to deliver centralized, service-aware SR 
candidate paths that bind CS-ID/CSCI-ID to egress/SCI-specific segment lists, support weighted or 
preference-ordered alternatives, and adapt path selection to combined network and computing metrics within a 
controlled domain. However, additional CATS-specific BGP SR Policy extensions or metadata rules may be required 
to support explicit per-SCI identification, compute-metric types and thresholds, shared-resource scope, metric 
freshness or validity indication, and the association between color/ Binding SID and the selected egress CATS-Forwarder/SCI.  </t>		
		
</section>


      </section>
      <section anchor="yang-model-applicability-for-service-configuration-and-management">
        <name>Yang Model Applicability for Service Configuration and Management</name>
		
<section anchor="cats-Specific-requirements-for-service-configuration-management">
        <name>CATS specific Requirements for Service Configuration and Management</name>

        <t>As per <xref target="RFC10053"/> section 3.3, the CATS management plane is responsible for monitoring, configuring,
and maintaining CATS network devices. The CATS data may be required to be maintained in the management plane and configured 
to the control plane, data plane and C-SMA. A YANG data model may be required for the configuration and management for CATS system.</t>

<t><xref target="I-D.ietf-cats-data-model"/> defines a YANG data model for the management of Computing-Aware Traffic Steering (CATS) systems. 
The model extends the "ietf-routing" YANG model defined in <xref target="RFC8349"/>, is agnostic to specific protocol  extensions, and conforms 
to the framework definition to serve as a critical diagnostic or control mechanism. </t>

        <t>The routing data model and ietf-routing YANG model primarily support defined for the configuring and managing a routing subsystem
as per <xref target="RFC8349"/>. The model contains all the basic network-related configuration parameters to operate the CATS networks. 
The data model may be required to augment for the CATS computing information.</t>
       
	   <t>
	  In summary, the CATS data model requires configuration management functionality, 
	  traffic steering policy configuration functionality, service metric management 
	  functionality, and event reporting functionality,  and as detailed below the data model may consider:</t>
	  
   <t>o It provides Interfaces for the functionality of the C-PS component, which 
     can be used for communication between the Control Plane and the C-SMA, as well 
     as for the interface between the Control Plane and the CATS-Forwarder.</t>
   
   <t>o It provides Interfaces for the functionality of the C-TC component, 
     which can be used for communication between the Control Plane and the CATS-Forwarder. 
	 The Control Plane can directly distribute the CATS traffic-classifier table to the 
	 CATS-Forwarder, allowing the CATS-Forwarder to proactively select paths according to 
	 forwarding policies.</t>

   <t>o It provides Interfaces for the C-SMA component, which can be used for communication
     between the Control Plane and the CATS-Forwarder, as well as for transmitting service 
	 metric information from the C-SMA to the Control Plane. It is also used for distributing 
	 service metric information from the Control Plane to the CATS-Forwarder.</t>

   <t>o It enables the CATS-Forwarder to report events to the Control Plane.</t>
   
   </section>
   
   <section anchor="cats-Specific-requirements-for-oam">
        <name>CATS specific Requirements for OAM (Operations, Administration, and Maintenance) Support and Enhancement</name>
		
<t>Beyond the configuration and monitoring capabilities described above, the CATS OAM effectively supporting 
both fault management and performance management processes. Specifically: </t>

<t>o  Fault Management: The model utilizes standardized notification mechanisms (e.g., metric-limit-exceeded, 
connectivity-loss, etc.) to report in real-time events such as service instance anomalies, network path degradation, 
or resource overload. These proactive notifications replace traditional polling, enabling the management system to
 quickly locate the source of faults. Additionally, they can be integrated with extended OAM tools such as PING/Traceroute 
 to perform CS-ID-based targeted diagnostics, thereby significantly reducing Mean Time To Repair. </t>

<t>o  Performance Management: The real-time state data provided by the model (e.g., service processing latency, resource 
utilization, traffic statistics, etc.) serves as the core data source for performance monitoring. Performance thresholds
 can be defined through the YANG model to trigger alarms or automatically adjust policies. Furthermore, the model supports 
 the collection and reporting of CATS-specific performance metrics (e.g., traffic distribution across different CSCI-IDs, 
 variations in service processing latency, etc.), providing data support for network optimization. </t>
		
    
      </section>

      </section>
      <section anchor="data-plane-protocols-applicability-for-forwarding-cats-packets">
        <name>Data plane Protocols Applicability for Forwarding CATS Packets</name>
        <t>As per <xref target="RFC10053"/> section 3.3, the CATS data plane is responsible 
		for computing-aware steering the packets along the paths to the service contact instances. 
		It needs to classify and forward the packets in routing 
        networks such as IPv6, SR-MPLS and SRv6 networks. </t>
		<t>
		The ingress CATS-Router needs to encapsulate the corresponding headers from itself to the egress CATS-Router. 
		It is required to indicate the interface associated to a specific service
        contact instance which connected to the egress CATS-Router, and the CATS data plane may consider:</t>

   <t>o  The egress CATS-Router decapsulates the encapsulation of the packets. </t>
   
   <t>o  Since there might be multiple service instances which provide the
   same service deployed under the same CATS-Router, a mechanism is
   required to ensure that the packets are forwarded to a corresponding
   service contact instance.  </t>
   
   <t>o  Utilize the existing forwarding mechanism to forward packets from the Ingress CATS-Router to the Egress CATS-Router through appropriate
   encapsulation. </t>
   
   <t>o  On the Egress CATS-Router, the packets can be forwarded to the corresponding service contact instance. </t>
		
      </section>

      </section>	
	
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The security considerations described in <xref target="RFC10053"/> and related routing protocols 
are applicable to this document. This document analyzed the applicability for some protocols 
which do not introduce any new extensions and new security considerations.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>Currently this document does not make an IANA requests.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC10053">
          <front>
            <title>A Framework for Computing-Aware Traffic Steering (CATS)</title>
            <author fullname="Cheng Li" initials="C." surname="Li">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Zongpeng Du" initials="Z." surname="Du">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Mohamed Boucadair" initials="M." surname="Boucadair">
              <organization>Orange</organization>
            </author>
            <author fullname="Luis M. Contreras" initials="L. M." surname="Contreras">
              <organization>Telefonica</organization>
            </author>
            <author fullname="John Drake" initials="J." surname="Drake">
              <organization>Independent</organization>
            </author>
            <date day="20" month="November" year="2025"/>
            <abstract>
              <t>   This document describes a framework for Computing-Aware Traffic
   Steering (CATS).  Specifically, the document identifies a set of CATS
   functional components, describes their interactions, and provides
   illustrative workflows of the control and data planes.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-cats-framework-19"/>
        </reference>
      </references>
	  
	  
      <references anchor="sec-informative-references">
        <name>Informative References</name>
		
		<reference anchor="I-D.ietf-idr-5g-edge-service-metadata"
                 target="https://datatracker.ietf.org/doc/draft-ietf-idr-5g-edge-service-metadata/">
        <front>
          <title>BGP Extension for 5G Edge Service Metadata</title>

          <author>
            <organization>L. Dunbar, et al</organization>
          </author>

          <date month="Sept" year="2025"/>
        </front>
       </reference>
	   
	    <reference anchor="I-D.ietf-cats-metric-definition"
                 target="https://datatracker.ietf.org/doc/draft-ietf-cats-metric-definition/">
        <front>
          <title>CATS Metrics Definition</title>

          <author>
            <organization>C. Li, et al</organization>
          </author>

          <date month="Oct" year="2025"/>
        </front>
        </reference>
		
        <reference anchor="RFC768">
          <front>
            <title>User Datagram Protocol</title>
            <author fullname="J. Postel" initials="J." surname="Postel"/>
            <date month="August" year="1980"/>
          </front>
          <seriesInfo name="STD" value="6"/>
          <seriesInfo name="RFC" value="768"/>
          <seriesInfo name="DOI" value="10.17487/RFC0768"/>
        </reference>
        <reference anchor="RFC2119">
          <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="RFC8174">
          <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="RFC7471">
          <front>
            <title>OSPF Traffic Engineering (TE) Metric Extensions</title>
            <author fullname="S. Giacalone" initials="S." surname="Giacalone"/>
            <author fullname="D. Ward" initials="D." surname="Ward"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="A. Atlas" initials="A." surname="Atlas"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <date month="March" year="2015"/>
            <abstract>
              <t>In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network performance information (e.g., link propagation delay) is becoming critical to data path selection.</t>
              <t>This document describes common extensions to RFC 3630 "Traffic Engineering (TE) Extensions to OSPF Version 2" and RFC 5329 "Traffic Engineering Extensions to OSPF Version 3" to enable network performance information to be distributed in a scalable fashion. The information distributed using OSPF TE Metric Extensions can then be used to make path selection decisions based on network performance.</t>
              <t>Note that this document only covers the mechanisms by which network performance information is distributed. The mechanisms for measuring network performance information or using that information, once distributed, are outside the scope of this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7471"/>
          <seriesInfo name="DOI" value="10.17487/RFC7471"/>
        </reference>
        <reference anchor="RFC8570">
          <front>
            <title>IS-IS Traffic Engineering (TE) Metric Extensions</title>
            <author fullname="L. Ginsberg" initials="L." role="editor" surname="Ginsberg"/>
            <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
            <author fullname="S. Giacalone" initials="S." surname="Giacalone"/>
            <author fullname="D. Ward" initials="D." surname="Ward"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <date month="March" year="2019"/>
            <abstract>
              <t>In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network-performance criteria (e.g., latency) are becoming as critical to data-path selection as other metrics.</t>
              <t>This document describes extensions to IS-IS Traffic Engineering Extensions (RFC 5305). These extensions provide a way to distribute and collect network-performance information in a scalable fashion. The information distributed using IS-IS TE Metric Extensions can then be used to make path-selection decisions based on network performance.</t>
              <t>Note that this document only covers the mechanisms with which network-performance information is distributed. The mechanisms for measuring network performance or acting on that information, once distributed, are outside the scope of this document.</t>
              <t>This document obsoletes RFC 7810.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8570"/>
          <seriesInfo name="DOI" value="10.17487/RFC8570"/>
        </reference>
        <reference anchor="RFC8571">
          <front>
            <title>BGP - Link State (BGP-LS) Advertisement of IGP Traffic Engineering Performance Metric Extensions</title>
            <author fullname="L. Ginsberg" initials="L." role="editor" surname="Ginsberg"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <date month="March" year="2019"/>
            <abstract>
              <t>This document defines new BGP - Link State (BGP-LS) TLVs in order to carry the IGP Traffic Engineering Metric Extensions defined in the IS-IS and OSPF protocols.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8571"/>
          <seriesInfo name="DOI" value="10.17487/RFC8571"/>
        </reference>
        <reference anchor="RFC4271">
          <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="I-D.ietf-idr-bgp4-rfc4271bis">
          <front>
            <title>A Border Gateway Protocol 4 (BGP-4)</title>
            <author fullname="Yakov Rekhter" initials="Y." surname="Rekhter">
              <organization>Retired</organization>
            </author>
            <author fullname="Tony Li" initials="T." surname="Li">
              <organization>HPE</organization>
            </author>
            <author fullname="Susan Hares" initials="S." surname="Hares">
              <organization>Hickory Hill Consulting</organization>
            </author>
            <author fullname="John Scudder" initials="J." surname="Scudder">
              <organization>HPE</organization>
            </author>
            <date day="14" month="October" year="2025"/>
            <abstract>
              <t>   This document discusses the Border Gateway Protocol (BGP), which is
   an inter-Autonomous System routing protocol.

   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.

   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.

   This document obsoletes RFC 4271.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-bgp4-rfc4271bis-00"/>
        </reference>
        <reference anchor="RFC5440">
          <front>
            <title>Path Computation Element (PCE) Communication Protocol (PCEP)</title>
            <author fullname="JP. Vasseur" initials="JP." role="editor" surname="Vasseur"/>
            <author fullname="JL. Le Roux" initials="JL." role="editor" surname="Le Roux"/>
            <date month="March" year="2009"/>
            <abstract>
              <t>This document specifies the Path Computation Element (PCE) Communication Protocol (PCEP) for communications between a Path Computation Client (PCC) and a PCE, or between two PCEs. Such interactions include path computation requests and path computation replies as well as notifications of specific states related to the use of a PCE in the context of Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering. PCEP is designed to be flexible and extensible so as to easily allow for the addition of further messages and objects, should further requirements be expressed in the future. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5440"/>
          <seriesInfo name="DOI" value="10.17487/RFC5440"/>
        </reference>
        <reference anchor="RFC8955">
          <front>
            <title>Dissemination of Flow Specification Rules</title>
            <author fullname="C. Loibl" initials="C." surname="Loibl"/>
            <author fullname="S. Hares" initials="S." surname="Hares"/>
            <author fullname="R. Raszuk" initials="R." surname="Raszuk"/>
            <author fullname="D. McPherson" initials="D." surname="McPherson"/>
            <author fullname="M. Bacher" initials="M." surname="Bacher"/>
            <date month="December" year="2020"/>
            <abstract>
              <t>This document defines a Border Gateway Protocol Network Layer Reachability Information (BGP NLRI) encoding format that can be used to distribute (intra-domain and inter-domain) traffic Flow Specifications for IPv4 unicast and IPv4 BGP/MPLS VPN services. This allows the routing system to propagate information regarding more specific components of the traffic aggregate defined by an IP destination prefix.</t>
              <t>It also specifies BGP Extended Community encoding formats, which can be used to propagate Traffic Filtering Actions along with the Flow Specification NLRI. Those Traffic Filtering Actions encode actions a routing system can take if the packet matches the Flow Specification.</t>
              <t>This document obsoletes both RFC 5575 and RFC 7674.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8955"/>
          <seriesInfo name="DOI" value="10.17487/RFC8955"/>
        </reference>
        <reference anchor="RFC8956">
          <front>
            <title>Dissemination of Flow Specification Rules for IPv6</title>
            <author fullname="C. Loibl" initials="C." role="editor" surname="Loibl"/>
            <author fullname="R. Raszuk" initials="R." role="editor" surname="Raszuk"/>
            <author fullname="S. Hares" initials="S." role="editor" surname="Hares"/>
            <date month="December" year="2020"/>
            <abstract>
              <t>"Dissemination of Flow Specification Rules" (RFC 8955) provides a Border Gateway Protocol (BGP) extension for the propagation of traffic flow information for the purpose of rate limiting or filtering IPv4 protocol data packets.</t>
              <t>This document extends RFC 8955 with IPv6 functionality. It also updates RFC 8955 by changing the IANA Flow Spec Component Types registry.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8956"/>
          <seriesInfo name="DOI" value="10.17487/RFC8956"/>
        </reference>
        <reference anchor="RFC8402">
          <front>
            <title>Segment Routing Architecture</title>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
            <author fullname="L. Ginsberg" initials="L." surname="Ginsberg"/>
            <author fullname="B. Decraene" initials="B." surname="Decraene"/>
            <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
            <author fullname="R. Shakir" initials="R." surname="Shakir"/>
            <date month="July" year="2018"/>
            <abstract>
              <t>Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment can represent any instruction, topological or service based. A segment can have a semantic local to an SR node or global within an SR domain. SR provides a mechanism that allows a flow to be restricted to a specific topological path, while maintaining per-flow state only at the ingress node(s) to the SR domain.</t>
              <t>SR can be directly applied to the MPLS architecture with no change to the forwarding plane. A segment is encoded as an MPLS label. An ordered list of segments is encoded as a stack of labels. The segment to process is on the top of the stack. Upon completion of a segment, the related label is popped from the stack.</t>
              <t>SR can be applied to the IPv6 architecture, with a new type of routing header. A segment is encoded as an IPv6 address. An ordered list of segments is encoded as an ordered list of IPv6 addresses in the routing header. The active segment is indicated by the Destination Address (DA) of the packet. The next active segment is indicated by a pointer in the new routing header.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8402"/>
          <seriesInfo name="DOI" value="10.17487/RFC8402"/>
        </reference>
        <reference anchor="RFC9256">
          <front>
            <title>Segment Routing Policy Architecture</title>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <author fullname="D. Voyer" initials="D." surname="Voyer"/>
            <author fullname="A. Bogdanov" initials="A." surname="Bogdanov"/>
            <author fullname="P. Mattes" initials="P." surname="Mattes"/>
            <date month="July" year="2022"/>
            <abstract>
              <t>Segment Routing (SR) allows a node to steer a packet flow along any path. Intermediate per-path states are eliminated thanks to source routing. SR Policy is an ordered list of segments (i.e., instructions) that represent a source-routed policy. Packet flows are steered into an SR Policy on a node where it is instantiated called a headend node. The packets steered into an SR Policy carry an ordered list of segments associated with that SR Policy.</t>
              <t>This document updates RFC 8402 as it details the concepts of SR Policy and steering into an SR Policy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9256"/>
          <seriesInfo name="DOI" value="10.17487/RFC9256"/>
        </reference>
        <reference anchor="RFC9830">
          <front>
            <title>Advertising Segment Routing Policies in BGP</title>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <author fullname="P. Mattes" initials="P." surname="Mattes"/>
            <author fullname="D. Jain" initials="D." surname="Jain"/>
            <date month="September" year="2025"/>
            <abstract>
              <t>A Segment Routing (SR) Policy is an ordered list of segments (also referred to as "instructions") that define a source-routed policy. An SR Policy consists of one or more Candidate Paths (CPs), each comprising one or more segment lists. A headend can be provisioned with these CPs using various mechanisms such as Command-Line Interface (CLI), Network Configuration Protocol (NETCONF), Path Computation Element Communication Protocol (PCEP), or BGP.</t>
              <t>This document specifies how BGP can be used to distribute SR Policy CPs. It introduces a BGP SAFI for advertising a CP of an SR Policy and defines sub-TLVs for the Tunnel Encapsulation Attribute to signal information related to these CPs.</t>
              <t>Furthermore, this document updates RFC 9012 by extending the Color Extended Community to support additional steering modes over SR Policy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9830"/>
          <seriesInfo name="DOI" value="10.17487/RFC9830"/>
        </reference>
        <reference anchor="RFC8349">
          <front>
            <title>A YANG Data Model for Routing Management (NMDA Version)</title>
            <author fullname="L. Lhotka" initials="L." surname="Lhotka"/>
            <author fullname="A. Lindem" initials="A." surname="Lindem"/>
            <author fullname="Y. Qu" initials="Y." surname="Qu"/>
            <date month="March" year="2018"/>
            <abstract>
              <t>This document specifies three YANG modules and one submodule. Together, they form the core routing data model that serves as a framework for configuring and managing a routing subsystem. It is expected that these modules will be augmented by additional YANG modules defining data models for control-plane protocols, route filters, and other functions. The core routing data model provides common building blocks for such extensions -- routes, Routing Information Bases (RIBs), and control-plane protocols.</t>
              <t>The YANG modules in this document conform to the Network Management Datastore Architecture (NMDA). This document obsoletes RFC 8022.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8349"/>
          <seriesInfo name="DOI" value="10.17487/RFC8349"/>
        </reference>
        <reference anchor="I-D.ietf-idr-flowspec-v2">
          <front>
            <title>BGP Flow Specification Version 2</title>
            <author fullname="Susan Hares" initials="S." surname="Hares">
              <organization>Hickory Hill Consulting</organization>
            </author>
            <author fullname="Donald E. Eastlake 3rd" initials="D. E." surname="Eastlake">
              <organization>Futurewei Technologies</organization>
            </author>
            <author fullname="Chaitanya Yadlapalli" initials="C." surname="Yadlapalli">
              <organization>ATT</organization>
            </author>
            <author fullname="Sven Maduschke" initials="S." surname="Maduschke">
              <organization>Verizon</organization>
            </author>
            <date day="28" month="April" year="2024"/>
            <abstract>
              <t>   BGP flow specification version 1 (FSv1), defined in RFC 8955, RFC
   8956, and RFC 9117 describes the distribution of traffic filter
   policy (traffic filters and actions) distributed via BGP.  Multiple
   applications have used BGP FSv1 to distribute traffic filter policy.
   These applications include the following: mitigation of denial of
   service (DoS), enabling traffic filtering in BGP/MPLS VPNs,
   centralized traffic control of router firewall functions, and SFC
   traffic insertion.

   During the deployment of BGP FSv1 a number of issues were detected
   due to lack of consistent TLV encoding for rules for flow
   specifications, lack of user ordering of filter rules and/or actions,
   and lack of clear definition of interaction with BGP peers not
   supporting FSv1.  Version 2 of the BGP flow specification (FSv2)
   protocol addresses these features.  In order to provide a clear
   demarcation between FSv1 and FSv2, a different NLRI encapsulates
   FSv2.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-flowspec-v2-04"/>
        </reference>
        <reference anchor="I-D.ietf-idr-flowspec-mpls-match">
          <front>
            <title>BGP Flow Specification Filter for MPLS Label</title>
            <author fullname="Lucy Yong" initials="L." surname="Yong">
              <organization>Huawei</organization>
            </author>
            <author fullname="Susan Hares" initials="S." surname="Hares">
              <organization>Huawei</organization>
            </author>
            <author fullname="liangqiandeng" initials="" surname="liangqiandeng">
              <organization>Huawei</organization>
            </author>
            <author fullname="Jianjie You" initials="J." surname="You">
              <organization>Huawei</organization>
            </author>
            <date day="20" month="October" year="2022"/>
            <abstract>
              <t>   This draft proposes BGP flow specification rules that are used to
   filter MPLS labeled packets.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-flowspec-mpls-match-02"/>
        </reference>
        <reference anchor="I-D.ietf-idr-bgp-flowspec-label">
          <front>
            <title>Carrying Label Information for BGP FlowSpec</title>
            <author fullname="liangqiandeng" initials="" surname="liangqiandeng">
              <organization>Huawei</organization>
            </author>
            <author fullname="Susan Hares" initials="S." surname="Hares">
              <organization>Huawei</organization>
            </author>
            <author fullname="Jianjie You" initials="J." surname="You">
              <organization>Huawei</organization>
            </author>
            <author fullname="Robert Raszuk" initials="R." surname="Raszuk">
              <organization>Nozomi</organization>
            </author>
            <author fullname="Dan Ma" initials="D." surname="Ma">
              <organization>Cisco Systems</organization>
            </author>
            <date day="20" month="October" year="2022"/>
            <abstract>
              <t>   This document specifies a method in which the label mapping
   information for a particular FlowSpec rule is piggybacked in the same
   Border Gateway Protocol (BGP) Update message that is used to
   distribute the FlowSpec rule.  Based on the proposed method, the
   Label Switching Routers (LSRs) (except the ingress LSR) on the Label
   Switched Path (LSP) can use label to indentify the traffic matching a
   particular FlowSpec rule; this facilitates monitoring and traffic
   statistics for FlowSpec rules.


              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-bgp-flowspec-label-02"/>
        </reference>
        <reference anchor="I-D.ietf-idr-ts-flowspec-srv6-policy">
          <front>
            <title>Traffic Steering using BGP FlowSpec with SR Policy</title>
            <author fullname="Jiang Wenying" initials="J." surname="Wenying">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Yisong Liu" initials="Y." surname="Liu">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Shunwan Zhuang" initials="S." surname="Zhuang">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Gyan Mishra" initials="G. S." surname="Mishra">
              <organization>Verizon Communications Inc.</organization>
            </author>
            <author fullname="Shuanglong Chen" initials="S." surname="Chen">
              <organization>Huawei Technologies</organization>
            </author>
            <date day="4" month="August" year="2025"/>
            <abstract>
              <t>   BGP Flow Specification (FlowSpec) [RFC8955] and [RFC8956] has been
   proposed to distribute BGP [RFC4271] FlowSpec NLRI to FlowSpec
   clients to mitigate (distributed) denial-of-service attacks, and to
   provide traffic filtering in the context of a BGP/MPLS VPN service.
   Recently, traffic steering applications in the context of SR-MPLS and
   SRv6 using FlowSpec are being used in networks.  This document
   introduces the usage of BGP FlowSpec to steer packets into an SR
   Policy.


              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-ts-flowspec-srv6-policy-07"/>
        </reference>
        <reference anchor="RFC9552" target="https://www.rfc-editor.org/info/rfc9552" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9552.xml">
          <front>
            <title>Distribution of Link-State and Traffic Engineering Information Using BGP</title>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <date month="December" year="2023"/>
            <abstract>
              <t>In many environments, a component external to a network is called upon to perform computations based on the network topology and the current state of the connections within the network, including Traffic Engineering (TE) information. This is information typically distributed by IGP routing protocols within the network.</t>
              <t>This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism applies to physical and virtual (e.g., tunnel) IGP links. The mechanism described is subject to policy control.</t>
              <t>Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs).</t>
              <t>This document obsoletes RFC 7752 by completely replacing that document. It makes some small changes and clarifications to the previous specification. This document also obsoletes RFC 9029 by incorporating the updates that it made to RFC 7752.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9552"/>
          <seriesInfo name="DOI" value="10.17487/RFC9552"/>
        </reference>
        <reference anchor="RFC8685" target="https://www.rfc-editor.org/info/rfc8685" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8685.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for the Hierarchical Path Computation Element (H-PCE) Architecture</title>
            <author fullname="F. Zhang" initials="F." surname="Zhang"/>
            <author fullname="Q. Zhao" initials="Q." surname="Zhao"/>
            <author fullname="O. Gonzalez de Dios" initials="O." surname="Gonzalez de Dios"/>
            <author fullname="R. Casellas" initials="R." surname="Casellas"/>
            <author fullname="D. King" initials="D." surname="King"/>
            <date month="December" year="2019"/>
            <abstract>
              <t>The Hierarchical Path Computation Element (H-PCE) architecture is defined in RFC 6805. It provides a mechanism to derive an optimum end-to-end path in a multi-domain environment by using a hierarchical relationship between domains to select the optimum sequence of domains and optimum paths across those domains.</t>
              <t>This document defines extensions to the Path Computation Element Communication Protocol (PCEP) to support H-PCE procedures.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8685"/>
          <seriesInfo name="DOI" value="10.17487/RFC8685"/>
        </reference>
        <reference anchor="I-D.dunbar-lsr-5g-edge-compute" target="https://datatracker.ietf.org/doc/html/draft-dunbar-lsr-5g-edge-compute-07" xml:base="https://bib.ietf.org/public/rfc/bibxml-ids/reference.I-D.dunbar-lsr-5g-edge-compute.xml">
          <front>
            <title>IGP Extension for 5G Edge Computing Service</title>
            <author fullname="Linda Dunbar" initials="L." surname="Dunbar">
              <organization>Futurewei</organization>
            </author>
            <author fullname="Huaimo Chen" initials="H." surname="Chen">
              <organization>Futurewei</organization>
            </author>
            <author fullname="Aijun Wang" initials="A." surname="Wang">
              <organization>China Telecom</organization>
            </author>
            <date day="25" month="January" year="2022"/>
            <abstract>
              <t>This draft describes using additional site capacity and preference related metrics to influence the SPF and using Flexible Algorithms to indicate the topologies those metrics are applied. The purpose is to differentiate multiple paths with similar routing distance to one destination in 5G Local Data Network (LDN)to achieve optimal performance.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dunbar-lsr-5g-edge-compute-07"/>
        </reference>
		
		<reference anchor="I-D.ietf-cats-data-model" target="https://datatracker.ietf.org/doc/html/draft-ietf-cats-data-model-00" xml:base="https://bib.ietf.org/public/rfc/bibxml-ids/reference.I-D.ietf-cats-data-model.xml">
<front>
<title>Data Model for Computing-Aware Traffic Steering (CATS)</title>
<author fullname="Huijuan Yao" initials="H." surname="Yao">
<organization>China Mobile</organization>
</author>
<author fullname="Changwang Lin" initials="C." surname="Lin">
<organization>New H3C Technologies</organization>
</author>
<author fullname="Zhenqiang Li" initials="Z." surname="Li">
<organization>China Mobile</organization>
</author>
<author fullname="Quan Xiong" initials="Q." surname="Xiong">
<organization>ZTE Corporation</organization>
</author>
<author fullname="Luis M. Contreras" initials="L. M." surname="Contreras">
<organization>Telefonica</organization>
</author>
<date day="23" month="September" year="2026"/>
<abstract>
<t>This document defines a YANG data model for the management of Computing-Aware Traffic Steering (CATS) systems.</t>
</abstract>
</front>
<seriesInfo name="Internet-Draft" value="draft-ietf-cats-data-model-00"/>
</reference>
		
      </references>
    </references>
    <?line 188?>
	
	
    <section numbered="true" toc="include" removeInRFC="false" pn="section-appendix.a">
     <name slugifiedName="bgp-applicability">BGP Edge Metadata Path Applicability</name>
    
	 <section numbered="true" toc="default"><name>Summary of 5G Edge Service Metadata Mechanism</name>
     <section title ="Attribute Structure"> 
        <t>
          The Edge Metadata Path Attribute is an optional, non-transitive BGP Path Attribute
          consisting of a set of Sub-TLVs. Each Sub-TLV carries one metric or an abstracted value
          about the running environment or capability of an edge service or its hosting site.
        </t>
        <t>
          The base document defines Sub-TLVs including (but not limited to):
          Site Preference Index, Site Physical Availability Index, Service Delay Prediction,
          Raw Measurement, Service-Oriented Capability, and Service-Oriented Available Resource.
        </t>
        <t>
          The attribute is carried with selected service routes, typically anycast service prefixes,
          and can also be used in standalone UPDATEs for site-wide values.
        </t>
		</section> 
	        
		<section title = "High-Level Distribution Behavior">
        <t>
          Edge Metadata is intended for limited-domain distribution.
          The attribute is non-transitive and is expected to be filtered at administrative boundaries.
          Route Reflectors (RRs) can further constrain propagation using NO-ADVERTISE or an in-attribute AS-Scope Sub-TLV.
        </t>
        <t>
          The metadata is propagated in BGP UPDATEs, subject to a minimum advertisement interval (default 30 seconds) to control churn.
        </t>
      </section>
	</section>	
		
	    <section title ="Applicability of 5G Edge Metadata to CATS Metrics">

        <t>
          The 5G Edge Metadata Path Attribute provides a ready-made container to carry most CATS-defined compute and service metrics, especially those that must be synchronized across ingress nodes for service-instance selection. The mechanisms align with CATS in several dimensions:
        </t>
        
       <section title ="Compute/Resource Capability (CATS L1/L2)">
	   <t>The Service-Oriented Capability Sub-TLV is directly usable as a normalized compute capability indicator.</t>
		<t>It already conforms to the CATS requirement that compute metrics be abstracted and comparable across heterogeneous hardware.
       </t>
       </section>
        
        <section title ="Compute/Resource Availability (CATS L1)">
		<t>The Available Resource Sub-TLV corresponds to CATS L1 availability metrics such as CPU headroom, memory availability, or accelerator capacity.
        </t>
		<t>Where CATS defines a family of resource-type-specific primitives, the 5G mechanism provides a unified normalized format suitable for routing-level decisions.
		</t>
        </section>
 
        <section title ="Service Processing Delay (CATS L0 or L1)">
		<t>The Service Delay Prediction SubTLV supports both, raw time values (L0), when expressed in milliseconds; and normalized delay scores (L1/L2), when expressed as a 0-100 index.</t>

		<t>This flexibility matches CATS' need for both precise measurements and abstracted comparative metrics.
         </t>
         </section>
 
 	  <section title = "Traffic Load / Utilization (CATS L0-L1/L2">
		 <t>The Raw Measurement Sub-TLV offers input signals for evaluating congestion, load, and resource pressure.</t>
		<t>These serve as L0 primitives from which CATS-compliant L1 or L2 metrics can be derived.
         </t>
         </section>
         
		 <section title ="Site Preference (CATS L2 policy metric)">
             <t> Although not defined by CATS, the Site Preference Index aligns with the CATS concept of operator-defined L2 composite metrics (e.g., policy-driven affinity, regulatory guidance, cost-based biasing).
            </t>
         </section>
		  
		 <section title = "Site Physical Availability (CATS Shared Resource)">
			<t>Site Physical Availability Index (SPAI) Sub-TLV provides a site/pod/row/floor/DC availability percentage
			that applies to a group of routes sharing the same physical characteristic. This directly aligns
			with the "Shared Resource" concept in [I.D.ll-idr-cats-bgp-extension], where a single metric update should influence multiple SCIs without per-service replication.
            </t>  
		  	
			<t>
			The SPAI is naturally suited for use as a CATS Shared Resource
			metric because it reflects conditions that affect all service instances within the same facility.
			SPAI represents substrate-level constraints such as power redundancy, cooling capacity, rack/row
			availability, and environmental health - factors that are not tied to any individual service
			instance. When the physical state of a site changes, all hosted services are simultaneously impacted,
			meaning a single SPAI update conveys a facility wide condition without requiring per-service updates.
		    </t>
			<t>
			This behavior matches the CATS Shared Resource semantics defined in [I-D.ll-idr-cats-bgp-extension], which aims to avoid churn by enabling one update to apply to many SCIs. SPAI's value is also normalized and abstracted (0-100), satisfying CATS's preference for L1/L2 metrics that can be compared uniformly across egress nodes. Additionally, SPAI is disseminated using the same limited domain, non-transitive BGP propagation model recommended for CATS, without requiring new identifiers or mapping constructs because the site itself serves as the implicit shared resource boundary.
			</t>
			<t>
			Therefore, SPAI can be used directly as a Shared Resource metric in CATS deployments, helping reduce protocol overhead, avoiding per service metric replication, and improving responsiveness to physical site level events.
			</t>
		  </section>
		  
		  
        <section title ="Expressiveness, Granularity, Update Semantics">
         <t> CATS recommends distributing normalized L1/L2 metrics due to their stability and comparability.</t>
		<t>The 5G Edge Metadata model already restricts itself to abstracted values, with raw L0 metrics not directly exposed except through Raw Measurement.</t>
		<t>Thus, the overall expressiveness aligns well with CATS' guidance and operational constraints.
        </t>
		</section>
		
	  </section>	
	
		<section title ="Metric Lifetimes">
        <t>
          The Edge Metadata model uses BGP UPDATE propagation,
          with default minimum advertisement interval of 30 seconds in iBGP domains. This is consistent with typical CATS control plane expectations for "moderately dynamic" metrics (seconds-to-minutes scale), but may be insufficient for
          highly bursty L0 measurements unless operators apply dampening and aggregation.
        </t>
        <t>
          For L2-style normalized values (capability/availability/delay prediction),
          BGP timeliness is generally adequate in a limited domain where topology diameter is small. For raw L0-style signals (if added later), asynchronous collection
          and local aggregation before BGP export is RECOMMENDED.
        </t>
      </section>
	
       <section anchor="granularity-semantics-issues">
          <name>Granularity Semantics Issues</name>
          <t>
            CATS separates metrics by scope: per-SCI (service instance),
            per-service (aggregate over instances), per-site, and shared-resource.
            The Edge Metadata mechanisms currently mix these scopes:
          </t>
          <ul>
            <li>
              Service-Oriented Capability and Available Resource are per-service at a site
              (implicitly per-service aggregate over instances).
            </li>
            <li>
              Service Delay Prediction is per-service at a site, but can represent either a
              normalized score or raw time; consistent semantic interpretation across ingress nodes
              is required.
            </li>
            <li>
              Site Physical Availability Index is per-site or shared-resource and supports
              standalone updates. This matches CATS shared resource needs.
            </li>
            <li>
              Raw Measurement is a per-service route signal, not a standardized CATS L0 set.
            </li>
          </ul>
          <t>
            If CATS requires explicit per-SCI differentiation (e.g., for multiple instances behind one
            anycast service prefix), the 5G Edge Metadata encoding needs augmentation to carry an
            instance identifier or to bind distinct metrics to distinct NLRIs.
          </t>
        </section>
	
	
		<section title ="Scalability and Churn Considerations">
        <t>
          The 5G Edge Metadata draft deliberately limits scope to a small subset of services
          in a limited domain, and applies a minimum advertisement interval to avoid route churn.
          This is aligned with CATS concerns about frequent metric updates causing cascading BGP UPDATEs. Operators SHOULD:
        </t>
        <ul>
          <li><t>Prefer L1/L2 normalized metrics for distribution.</t></li>
          <li><t>Aggregate L0 signals locally and export only on meaningful change.</t></li>
          <li><t>Use shared-resource/site-wide updates (e.g., Site Physical Availability Index) whenever possible.</t></li>
        </ul>
        <t>
          In large deployments with many services per site, the per-service Sub-TLV updates could still
          create noticeable churn. Mapping to the generic CATS BGP metric container may reduce the
          need for new Sub-TLV types and simplify extensibility.
        </t>
       </section>
	
	<section title ="Gaps and Extensions Needed for CATS Compliance">
	<t>The following additions would allow the 5G Edge Metadata mechanisms to serve as a fully compliant CATS metric container:</t>
	<dl>
	<dt> Per-SCI Differentiation:</dt> 
	<dd> <t>Add an Instance-ID field or tie individual metric Sub-TLVs to distinct NLRIs so ingress routers can distinguish metrics for different service instances behind an anycast prefix.</t>
	</dd>
	
	<dt> Explicit Resource-Type Identification (for L0->L1 transitions): </dt>
	<dd> <t>CATS defines specific raw metrics (CPU load, GPU usage, memory pressure). Adding optional resource-type enumerations would allow Raw Measurement or Capability TLVs to expose more structured CATS L0 primitives when needed.</t>
	</dd>
	<dt>Metric Lifetime / Validity Interval:</dt>
	<dd> <t>CATS defines explicit metric-freshness semantics. The 5G Edge Metadata mechanism can be extended with: TTL or "valid until" timestamps, change-threshold indicators, or explicit "stale" flags.</t>
	</dd>
	
	<dt>Scope Identifier for Shared Resource Metrics:</dt>
	<dd><t>Allow SPAI-like metrics to reference a named resource pool (e.g., "DC-Room-A", "GPU-Cluster-2") when a site contains multiple independent shared resources.</t>
	</dd>

	<dt>Support for More Dynamic Metric Classes:</dt>
	<dd><t>For highly dynamic CATS L0 metrics, support for sub-second updates is generally not appropriate in BGP. Guidance should mandate local smoothing/aggregation before exporting updates into the control plane.</t>
	</dd>
	</dl>
	
	</section>	 
	
	
	</section>

    <section numbered="false" toc="include" removeInRFC="false" pn="section-appendix.b">
      <name slugifiedName="name-contributors">Contributors</name>
      <t indent="0" pn="section-appendix.a-1">The following people have substantially contributed to this document:</t>
      <contact fullname="Peng Liu">
        <organization showOnFrontPage="true">China Mobile</organization>
        <address>
          <email>liupengyjy@chinamobile.com</email>
        </address>
      </contact>
    </section>	
	
	
	
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8VazXLbOBK+q0rvgEoOa1eJmthWkokPW6PIdqIq/2gsp2qz
W3uASEjChCI4BClFk/LUPsBe9n32afYF9hW2u/FDkJKcmcxhD04oEmg0+ufr
HyCKom5nfc7Oup1ExRlfiXOWFHxeRtvPaRTzUkd5oUoVq1RHPM9TGfOZTGW5
jV686HZgwDmT2Vx1O7qaraTWUmXlNgcq48uHq26nlGUKPyaOBhuGNNhcFWyk
VnlVymwRDTe8EOwBlp/LmE1LIQp4zY5Gw4fpcbfDZ7NCAK9/7nbY0xRhfLez
WZwz3EC3A1OrcqmKc3yMmNnl+0r+VPGMfeQK6akCho+WMuPsRgEtgS/Fisv0
nG25WprRP8Q4YkUD+rFa4aCa5I9I7y8ggYWn+NeHS9hgkauCl/AhIPoZx/V/
RqK/lESsH2cs5HC05NliA3/sWuIXS/JWbNj7sxF7EPEyU6laSKFZQDiVWexm
9l8MBieDH5ZnMS5A1LudTBUr4GYtznHWOLroS1HOjbLnBSy9UcUnkhVqNhx7
fzV6/ep793h6cvLGPX9/8nrghwxen/j3L1+/CJ79+8GpffbLy6SIZot8EBXz
GL/OpHaDXw4GNZE3L18Gz6/88+DFqXt+c1q/f/P9WT33bPBmd9F5qjY6F3G0
Pn3i4yoHBwBRxMu9bNcDUz4T6e4YlK0boov1qyhXYLXbc2NBoPQoYnymy4LH
Jf5+WErNwCWrlchKxjOebn8BPZdLwRpuyNSceQ9lhUh5KRJWKsbJDZje6lKs
/vvvf/IsYYnQcSFnQGepNjhoVsk0aQ5lsy0Tn0uRJeh74rPU6JvkzvVCfcPw
SiYJekq385yNs7JQSRWjmbMvz2Xw87Hb+fLlgJ09PjI3FNjizH/4PdjQZ08K
LFZFIXSuzJZqaYFXxQoXT1me8kz02ArmLQRRoDdAl+TGS+6G4G+x5mkFgjZy
nPOClvGyqleALcyEFSeoBfBQMV3lAAellXkVLxnXbCXKQsawASABGqpIirgU
EJYFU7kwAMJT0PHPlSyISdQDyn6ksjX8hO+afdCwEOyM5HHh5PHleVyPeaRZ
zwFBipUkCNkakxOshFfAhZjLzJB5SnExwB1sr7IrlqEG+naN+4Bbdg2QVIGA
8RtjDBf8JLYMyCWaPbv5MH141jP/s9s7er6//PHD+P7yAp+n74fX1/7BjCA6
8OLuw7Udg0/17NHdzc3l7YUhAG9Z69XN8OMz0qkhdDd5GN/dDq+f7eyHofmh
xwi0V1HkhUBH49o7Fcng7WhClE4GIDmLkSApekaMhOfNUmTGjFSWbu1PUPMW
HVuALQEZnqZEJua5LHmqe7iQBmPL2FIUwqkdLagZ/u7WolhLiBCgcFRXAytA
78OGcv92QLd/J4YM/dohwTLBn6sCHSrTYKgawYcGRtObITsyTqblLBXkvRCP
shL+0Cc08hULZ+jHdoXo9msTM1HS6u2Jk+nT8+A3QAZ5fMlxACixgFB53HN+
BUQeRrtESosxccohnYEncjzCGLLokYWMCQFEU/xDhB0QjXGmBrgEqICmRE4D
9uQdXtQid2AA0rVi68G3DIfHS6VFuLecl0uNX/xsO+VPZJmAR8g+AsVbjksC
rDyl9jUvpKookADIgdnHDoE9V8j9YRsyoyIaIFFwQHSzlIByLbRAXvvsvdoI
MFmj1EBCqKEwv0HF1NgYcDMvIK8h9F2AIjVbACxv+NZJBIY2XiPzIJQ0ZRUg
cgH71OBy8bJ/iRhtjCAMEHFaJYJ9HN6+67G37yY1xvPSqq0HFrqhbzxJaK05
X8l022NXEO+nEO97GAZgQHQNGx5nOI4k0yMAdKP8sk5QPmpgMI9BDysFcciY
iQb1mEgLNhJq3dgDaLuxThkaY8MMAWDIOYCMHZCSx+z1AS8PzzPqCYXDgDeR
9psbkhjPa/tOPAugu6VKyC5Ss5+ahpkVo7PyVP6yM4vWABcAUKglRjP1PsHZ
DWyNkCiO271pF6Fu6pj/tEvftJOD/R5tcggSDbA+lwtEzCDB0n126axoMoZ9
48iH++HoMiC4AltFZwFTJSFYh3FoqJ0Y6hmxqiCVa23f5A0CvR4zT9SkoTO1
5jJOMCeYS1FoyKWm//nHv8YXGrBumEKMyyjzR1Ou9XNgoUJQTqNLmAJbiyFP
8cUDZjIzVdmMh7Jgg9YKEEJRGpdXUCJp4XVygYp6Whtka3VidkAZFilrdDTa
BzFYgGjmhjViAkxSImwV5YmPJ+vBd/DPK3Tq4AeAGJver1/Z0HyoPIVViQ0b
ng/U1i5BG7+bfGeAY0+Ve2MRcAQ+a8AAZw1/c/amLYKc9Qf9syDg39qAa+iz
4QIN/ogi9TF6pxNttwOgCtnIHkUTRJVkeCZBILBNwaat/RqkMNHf2FNsdkGj
WyG/20kxRvAFIVOYaIN82NEY0zEJAnlnMd7J/pgdif6i32N308lV9HBJSRgW
p7B59LnxNBpPGRToJjuDSvXx8Zi+QNafwIpgygRPq0Z8ncCuwX+QW1j0CDMR
yCrge6GqxdICPTt6C0mt2GUKa/lPUL/A62O/MHDUN2Xgt6nvNFCf8+y2+qa/
XX0ulmiJJQ4KBN+YaKmqAgo1ykc3AsIo117blc8HEzmfQ5qa1aRkBiMymGlK
NZcyIsyFmq+H1zw5weaFXKNJUfo951Quaq1iSRXvRoJWVlVayjyt6WDsgIK6
Xt7UcxatGqolNba1KExWgHUVulwriXVohcH/sH9eBCXdt6m4VjAJLRMioZQv
lJzP0yLbA8DmXG74kVaLlu1eLTcjApIdZyPwhwsa2EpKd3PAhtD6TqO3h5iz
Du1YY09wtrt6Cw1MER2sbqGE1GewpNKe75lDc0pw3DZwlTZZzMVFSRWxmT2D
WACLXZoEEn0rujLRBDyhpOxjLSEZgtwMB1DL5ZDd0YoyW6tPoUQhka8yo2Jb
1CP0QNipCeF74IMsDc3sEKyQa/PMOEc0rEqVqRUm8lPT1DkaTo8hiFWN/gSw
wkuoizAD1NZxg/YDiKzbcXMaKBEXSutQOaCFcemyDQ2iKzcCCpYaB4ZTVwZg
dHazbBIO24UlUuq2JCB/ZML6vgIXpG5mbQeF4PDGOlqDLepw7ajQVEhUQNj0
L9O2U+3ASHwGqMNdooh93bF18YNgGnuSNnAEPruna4lBJKx1dou8bqdtfL6K
MU6018AdXv4+5/SIZuynBWhUhFkUm4wu98GYjScRpwacb8h9e7Aa9BxrXlm6
ra0wc7OlCJ/DYIcqxEBz93t8GtLYDLub6IMJT1Vm+wZWO9y7H2SrSAgGgKmC
2XMUBjuiSG92bCzsMqX0/9jZzaEBdbQ/QqkeY5QE3zCGhN1s7HrWodh4oN2L
hyuqiHEB502GK5uf7K49SiWF+sloBJkPaE5ReIc5tncR4KRxRWABe0WmjWWo
o2gcODV0YkzUldMtNDw6QG90TImG2Dtp5voRIciXKjeuFzo2LU2e0Wdvq9IV
Q73QzNEz5rLQZbq11bF1tf2LuxaQi0g7eYqt32pJkBDaCcc+B2yw3u1Y5qfI
/E6k4qneQYda5Kbcdllvs1KpgzUUTti3gBJ3OhrDy9DlyadrnwdXZy5jia72
FRU+e4R6xHk5oSJW9Wxqa0iztyNDxYWeLCqrPPXNQWSSGliYukOJjkcn+C4u
JObr3AQf54rIiHGG8cS7PB4qmvY4coCFo69iDQdAGvfFTtjR1XR90vQzPCmy
gO3GnTq/OkAPqZziSaMjc+igCPP1YW00mklXRydYNsKm8gKQ8bPpDwcQ2eTL
/X4FvzFfawQNjWccxK2TB1AA6fjgCQtdn/mPc4klO9WqVeqixs0Eklg6kWp/
b4QoSqlIQ+31DomgPg6zWylbq6kiyGJWxppMjkSjnL+bXbuE7RrnRtzEiv2h
Zf95G+oDEhByp2YO6GyXOlJeqjmPPwk8GoZ8SaG6pvdsQgdybL/uDxzf4bp/
KBJ+U3AKu2MgQNu3E4XRufVtBMSlSPNGLrADNpje7Smk9nR9sQpsWySgm00i
nKpdthK+cs0stAJj2ofgDAHIKyIsxa6mTRTzZVc9/KuZC+xAUgMVI6d2AdFF
tEwlgmRfb9IaCTM2UjfQTCSIYQOJNWocPRULCv33NmG2bB15Dgmdup02HOBh
deBDzU0dziNhDJmgFD7hWwoOKJQ0QBCPv8FIrY22DPv/YJxEpZXF7tkK2c84
TDZQrBi3v2qodFVieh8RzKBUsSvX7Jv6FbfONMMuNdauvCi25vwg6I+2Wu3m
/NhbVW6sarbdo8Zd2/2I1zpuqOF9OAiPbPu4Lm+CFvTvVmnY49s555Z45NM6
TPPt2Z5vZOMP00IJj9rCzjTgYBsHqOyygvZ1rjlKdVTcAbLY5azRR0/q6r91
ch90gnGGTbiGpnNtOCBpt/mgEz9DriXrmpO+AwtXDAf0qLBHybtvzaMM5+24
TCDEegH64QnramYOCYIcxF5cwVCDPBjS1GCAZBVPik3WyDVA006jpbGrnKNh
lGjLwdmAN4raR8xun5AaAmJl8M4JkEjU7hgkwX1z7ci19Y2Snrq/dVUfb9qO
q43Wf8DiA/vYY+t198wEC+3ul8D8bscFAgTChS8GPFgdbDZSTlI3xNxRFOo+
PJeo44y3A98h0P6GCB4z9NhXgE3ugUzPgMhinusq5b5zEETgbofCR2F7EbKE
Imrudih2qNLWSJC1RUggFDvivksbQnYzjlq5mSDR6JbZA2OVZaDLOmXYw4Y1
LYDMGBwL7GeEak3sbRnNvjzX9ksUN748Op9231nze/Nax1P2ZhrKxt/aHTYM
+GhP7nQnFWYv4UUZtvfmUrLnqhe1oNVKNMgbWSUKMpiyvkoFZLZ0MB00fEyH
ZHNox/bkajy8He5KUQJb+yQ4qgrs76Xb1m2ZRAlNHK34J2TGkLXdTG3VhlfI
ZmD8/hKTicGq0Oa+kv/plTWHVEJtSMJCYbG55GtBqAmGU0oAwy3zE53hBHzR
rcZff/0VD1uwPBZ0ubKCfTRufl66m5RVDiO2P23b9z6ZpdPt/A9r7CnzQSsA
AA==

-->

</rfc>
