<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.43 (Ruby 3.4.12) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-rtgwg-overload-alleviation-01" category="info" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="Overload Alleviation">Common Approaches to Link Overload Alleviation</title>
    <seriesInfo name="Internet-Draft" value="draft-li-rtgwg-overload-alleviation-01"/>
    <author initials="L." surname="Zhang" fullname="Li Zhang">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>zhangli344@huawei.com</email>
      </address>
    </author>
    <author initials="A." surname="Farrel" fullname="Adrian Farrel">
      <organization>Old Dog Consulting</organization>
      <address>
        <email>adrian@olddog.co.uk</email>
      </address>
    </author>
    <author initials="P." surname="Psenak" fullname="Peter Psenak">
      <organization>Cisco Systems</organization>
      <address>
        <email>ppsenak@cisco.com</email>
      </address>
    </author>
    <date year="2026" month="November" day="18"/>
    <area>Routing</area>
    <workgroup>Routing Area Working Group</workgroup>
    <keyword>congestion</keyword>
    <keyword>congestion mitigation</keyword>
    <keyword>bandwidth</keyword>
    <keyword>link capacity</keyword>
    <keyword>traffic steering</keyword>
    <keyword>segment routing</keyword>
    <abstract>
      <?line 67?>

<t>Network links may become degraded because of physical conditions or owing to partial link failure: this can result in a reduction of available bandwidth. Alternatively, traffic volume may increase significantly and unexpectedly. These circumstances may lead to links becoming overloaded which can result in dropped packets or degraded delivery such as increased delay.</t>
      <t>Traffic adjustment techniques can be applied to alleviate these link-overload situations by steering some of the traffic onto other paths that are less loaded and have available bandwidth.</t>
      <t>This document examines the scenarios in which links can become overloaded, the requirements for steering traffic to reduce link-overload, and the techniques that can be applied to alleviate overloaded links.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-li-rtgwg-overload-alleviation/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        Routing Area Working Group Working Group mailing list (<eref target="mailto:rtgwg@ietf.org"/>),
        which is archived at <eref target="https://mailarchive.ietf.org/arch/browse/rtgwg/"/>.
        Subscribe at <eref target="https://www.ietf.org/mailman/listinfo/rtgwg/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/zhangli-abcd/Common-Approaches-to-Link-Overload-Alleviation"/>.</t>
    </note>
  </front>
  <middle>
    <?line 75?>

<section anchor="sec-intro">
      <name>Introduction</name>
      <t>Network links may become degraded because of physical conditions or owing to partial link failure. For example, a microwave link can see a reduction in available bandwidth during inclement weather conditions. Alternatively, changes in the available network resources may directly result in link overload or could cause traffic to be rerouted within the network leading to links becoming overloaded. These situations may result in the traffic volume on the link exceeding the available bandwidth.</t>
      <t>At the same time, traffic volume may increase significantly and unexpectedly above predicted levels such that traffic volume on the link exceeds the available bandwidth.</t>
      <t>Any of these circumstances may lead to links becoming overloaded which can result in dropped packets or degraded delivery, such as increased delay.</t>
      <t>Traffic adjustment techniques (such as Traffic Engineering <xref target="RFC9522"/>, Flex-Algo <xref target="RFC9350"/>, and LFA <xref target="RFC5286"/>) can be applied to alleviate these link-overload situations by steering traffic onto other paths (that is, using other links) that are less loaded and have available bandwidth.</t>
      <t>This document examines the scenarios in which links can become overloaded, the requirements for steering some of the traffic to reduce link-overload, and the techniques that can be applied to alleviate overloaded links.</t>
    </section>
    <section anchor="sec-problem">
      <name>Problem Description</name>
      <t>Links may become overloaded when more traffic is dispatched to the link than can be transmitted on the link, or when more traffic arrives at the egress end of the link than can be processed immediately or buffered without the buffers/queues becoming full. If a link is overloaded, traffic (that is packets) will be discarded, and even those packets that are not discarded may be delayed by unacceptable amounts.</t>
      <t>Link overload may arise when traffic flows that comprise more bits per second than the link has capacity for are routed or steered onto a link. This may happen because of normal shortest path routing, errors in traffic engineering planning, flexible bandwidth mechanisms, poor policing of flows at the network edge, or recovery from network failure conditions. Such overload may be short-term (for example, quick bursts of traffic) or may be longer-lasting. Short-term overload may be detected, notified, and rectified by congestion notification and mitigation mechanisms (see <xref target="sec-congestion"/>), but more permanent overload situations need more strategic solutions.</t>
      <t>Various solutions (see <xref target="sec-approaches"/>) provide mechanisms to detect and alleviate link overload. The objectives are to determine when traffic load reaches a threshold, to notify the situation, and to steer traffic so that it takes other acceptable paths (that is, not resulting in excessive path cost, delay, etc.), but balances the traffic load in the network so that no link is overloaded and that traffic load remains below loading thresholds on all links where that is possible.</t>
      <t>Ideally, when the traffic load on any previously overloaded link drops below a second threshold, traffic will revert to the originally preferred path.</t>
      <section anchor="sec-overload">
        <name>Definition of Link Overload</name>
        <t>A link is considered to be overloaded when the amount of traffic (measured in bits per second) has reached a configured threshold on the link. The traffic is usually measured over a sample period that allows short bursts to not trigger the link to be considered as overloaded. The threshold can be set as a percentage of the capacity of the link or as an absolute value. In the absence of a configured threshold, a link will be considered overloaded when the link is full, i.e., when the amount of traffic is equal to the capacity of the link. When a link is full it is likely that traffic will be dropped, and that transmitted traffic may be delayed.</t>
        <t>By setting the configured threshold appropriately, a router may detect an increase in traffic levels before the link is full and may take action to alleviate the link overload, thus preventing any impact on the traffic.</t>
        <t>Except when referring to congestion as defined in <xref target="sec-congestion"/>, this document uses the term "link overload". Note that "Distributed Congestion Mitigation" (DCM) discussed in {sec-approach-DCM} is a prior term, but is described in this document in terms of link overload.</t>
      </section>
      <section anchor="sec-alleviate">
        <name>Link Overload Alleviation</name>
        <t>Link overload alleviation involves redirecting (steering) traffic so that it takes another path that avoids the overloaded link. It should be careful to not cause secondary overload on links of the other paths.</t>
      </section>
      <section anchor="sec-required">
        <name>Required Responsiveness</name>
        <t>While, "As soon as possible," is always a good target for alleviating network overload, the situation is not regarded as highly urgent partly because the threshold triggering action can be set to rectify the situation before serious situations occur, and because it can be that only "best-effort" traffic will be affected.</t>
        <t>Link overload alleviation can be considered as a traffic planning or optimization activity, and the target response times are in the order of thirty seconds. This should be factored into how the overload threshold is configured so that there is no immediate urgency to alleviating the overload.</t>
      </section>
      <section anchor="sec-reversion">
        <name>Traffic Reversion</name>
        <t>It may be assumed that the path originally taken by the traffic was preferred because it was shorter, more cost-effective, better protected, lower delay, etc. Thus, in order to alleviate link overload, traffic has been steered onto an equally or less preferred path. It follows that, if the link overload situation has been alleviated, it may be desirable to revert traffic back to its original path.</t>
        <t>In order to avoid flip-flop of traffic from one path to another, it is important that the link-no-longer-overloaded state involves a threshold markedly lower than the link-overloaded threshold. Further, reversion of traffic to its original path should be subject to local and network-wide policies such as delays (hold-off timers).</t>
        <t>Note that switching traffic from one path to another may introduce some disruption (for example, out of order packet delivery, or jitter) and even risks delivery failure.</t>
      </section>
      <section anchor="sec-failure">
        <name>Comparison with Link Failure</name>
        <t>It is worth noting that link failures are an extreme version of link overload. When a link fails, it is equivalent to the link suddenly having no available bandwidth.</t>
        <t>There are plenty of available techniques for mitigating link failure. These include:</t>
        <ul spacing="normal">
          <li>
            <t>IGP routing convergence <xref target="RFC4750"/>, <xref target="RFC5340"/>, <xref target="ISO10589"/></t>
          </li>
          <li>
            <t>End-to-end protection in MPLS-TE networks <xref target="RFC4427"/></t>
          </li>
          <li>
            <t>Segment protection in MPLS-TE networks <xref target="RFC4427"/></t>
          </li>
          <li>
            <t>Fast Reroute (FRR) for IP <xref target="RFC7841"/>, MPLS-TE <xref target="RFC4090"/>, or Segment Routing (SR) <xref target="RFC9855"/>.</t>
          </li>
        </ul>
        <t>Solutions for link failure cannot be directly applied to link overload scenarios since they switch all the traffic to the backup paths, whereas link overload does not generally require redirecting all of the traffic. However, it may provide a basis for, or conceptual input to, solutions for link overload.</t>
      </section>
      <section anchor="comparison-with-strategic-traffic-optimization">
        <name>Comparison with Strategic Traffic Optimization</name>
        <t>Traffic Engineering and traffic optimization may be categorized as tactical or strategic <xref target="RFC9522"/>. These two classes of mechanisms are distinct in timescale, scope, and objective. They are complementary and may coexist within the same network deployment.</t>
        <t>Tactical mechanisms aim to react quickly once overload is detected, on the order of a few seconds, and apply local traffic steering actions.
They can rapidly bring an overloaded link back within acceptable utilization limits by locally adjusting forwarding for selected flows.</t>
        <t>Strategic mechanisms operate over a longer timescale, ranging from minutes to hours. They perform network-wide traffic re-optimization, typically relying on a global view of topology, traffic demand matrices, and long-term resource constraints. Strategic optimization addresses persistent overload conditions that cannot be fully resolved by local tactical adjustments, or rebalances traffic after short-term overload events have subsided.</t>
        <t>A network may combine both modes of operation: tactical mechanisms mitigate short-term overload events, while strategic processes run in the background to correct persistent imbalance and restore traffic to its optimal long-term placement.</t>
        <t>All the overload alleviation approaches described in this document can be categorized as tactical mechanisms.</t>
      </section>
      <section anchor="sec-congestion">
        <name>Discussion of Transport-Level Congestion Control</name>
        <t>Congestion detection, reporting, control, and mitigation have been the subject of RFCs since the earliest days of the IETF. In general, congestion notification aims to be very responsive to, or even take place in advance of, the congestion actually becoming a problem. Early Congestion Notification (ECN) <xref target="RFC3180"/> aims to provide information to the head end of network flows so that they can moderate the rate at which traffic is presented to the network and so avoid congestion harming those traffic flows. The assumption is that notified traffic sources will behave reasonably in their own best interests (reduced throughput is preferable to recovering from dropped packets) and in the best interests of the network as a whole (i.e., not deciding that other sources will back off and increasing traffic to use the capacity they make available).</t>
        <t>Over the years, many other TCP/IP congestion notification and remedial techniques have been proposed and some have been standardised. These predominately operate at the transport level, moderating the rate at which traffic is delivered to the network in order to avoid or mitigate congestion. Response time can be as short as detection time plus notification time, plus time for in-transit packets to reach the point of congestion: effectively the detection time plus the round-trip time.</t>
        <t>Active Queue Management (AQM) <xref target="BCP197"/> is a method that allows network devices to control the queue length or the mean time that a packet spends in a queue. By carefully calibrating queuing behaviors, network nodes are able to mitigate high traffic levels (in particular traffic bursts) and so reduce the effects.</t>
        <t>The problems discussed in this document (see <xref target="sec-problem"/>) are similar to those that have been addressed previously (i.e., link overload is equivalent to congestion on that link). The use cases (see <xref target="sec-applicability"/>) are somewhat similar, but the requirements, solutions, and especially the responsiveness (see <xref target="sec-required"/>) are different.</t>
      </section>
    </section>
    <section anchor="sec-functional-model">
      <name>Functional Model</name>
      <t>The functional model is split into abstract functional actions and key action points that realise those actions. It may be observed that the different approaches described in <xref target="sec-approaches"/> take link overload alleviation measures at different places in the network and so might not require all of the functional actions to be performed.</t>
      <section anchor="sec-funct-acts">
        <name>Functional Actions</name>
        <dl>
          <dt>Configuration:</dt>
          <dd>
            <t>The capacity of each link may be known a priori or configured at the link ends. The overload and reversion thresholds need to be configured to the link ends.</t>
          </dd>
          <dt>Measurement:</dt>
          <dd>
            <t>In order to determine the load on any link, the link ends measure the traffic over a period of time designed to dampen any peaks caused by short bursts of traffic.</t>
          </dd>
          <dt>Capacity-Aware topology Database Construction:</dt>
          <dd>
            <t>To correctly balance traffic and avoid overloading other links, it is important that the load on other links be known across the network. Depending on the solution approach taken, this information may be needed just locally within the network (for example, a router may need to know the loads on links one or two hops away) or may be needed with wider vision to enable network-wide load distribution. As with the construction of the capacity-aware topology database, this may be achieved by leveraging TE-enhanced IGPs, link affinities of Flex-Algo, or through reporting to a central controller.</t>
          </dd>
          <dt>Overload Trigger:</dt>
          <dd>
            <t>The overload condition is triggered when the load on a link crosses a configured threshold. This may be an absolute value or a percentage of the link capacity.</t>
          </dd>
          <dt>Overload Notification:</dt>
          <dd>
            <t>Depending on where the overload alleviation is to be performed and where the overload condition is triggered, it may be necessary to send an overload notification so that remedial action can be taken. For example, in controller-based overload alleviation scenario, the centralized controller performs the alleviation process. In this case, the node with an overloaded link needs to send an overload notification to the controller.</t>
          </dd>
          <dt>Traffic Steering:</dt>
          <dd>
            <t>To alleviate link overload, traffic is steered away from the overloaded link onto links that have less load. This is achieved by using tunnelling techniques that place the traffic onto a path that it would not normally follow or by modifying the next hop routing/forwarding decisions. Only a part of the total traffic is steered onto an alternate path so as to keep the overloaded link in use while reducing the load it carries.</t>
          </dd>
        </dl>
      </section>
      <section anchor="sec-funct-points">
        <name>Key Action Points</name>
        <t>The functional actions described in the previous section can be enacted at key points in the network.</t>
        <dl>
          <dt>Traffic source:</dt>
          <dd>
            <t>This is where traffic for a particular flow or set of flows enters the network. Flows are routed or steered from the traffic source to the traffic sink.</t>
          </dd>
          <dt>Traffic sink:</dt>
          <dd>
            <t>This is where traffic for a particular flow or set of flows leaves the network.</t>
          </dd>
          <dt>Link head end:</dt>
          <dd>
            <t>In the direction of traffic flow, the link head end is where traffic enters the link. In the context of IP networks, the link head end is a router or a host.</t>
          </dd>
          <dt>Link tail end:</dt>
          <dd>
            <t>In the direction of traffic flow, the link tail end is where traffic exits the link. In the context of IP networks, the link tail end is a router or a host.</t>
          </dd>
          <dt>Point of local alleviation:</dt>
          <dd>
            <t>A point of local alleviation is a router that steers traffic onto an alternate path to avoid an overloaded link. Such a router is (of course) on the path of the traffic that will be steered. Further, the router is upstream of the overloaded link.</t>
          </dd>
          <dt/>
          <dd>
            <t>Where tunnelling is used to steer the traffic onto the alternate path, the point of local alleviation is the head end of the tunnel.</t>
          </dd>
          <dt>Merge point:</dt>
          <dd>
            <t>The merge point is a router or host where traffic that has been steered to avoid the overloaded link re-joins the original path.</t>
          </dd>
          <dt/>
          <dd>
            <t>Where tunneling is used to steer the traffic onto the alternate path, the merge point is the tail end of the tunnel.</t>
          </dd>
          <dt>Central controller:</dt>
          <dd>
            <t>A central controller, such as a Path Computation Element (PCE) <xref target="RFC4655"/>, is responsible for determining optimal paths for traffic within the network. Where traffic is to be steered onto alternate paths to alleviate link overload, the central controller may be used to compute those alternate paths.</t>
          </dd>
        </dl>
      </section>
    </section>
    <section anchor="sec-approaches">
      <name>General Approaches</name>
      <t>This section outlines five approaches to link overload alleviation that have been proposed and experimentally implemented. While the overall objectives are the same in each case, the approaches vary somewhat.</t>
      <section anchor="sec-approach-DCM">
        <name>Distributed Congestion Mitigation</name>
        <t>Distributed Congestion Mitigation (DCM) described in <xref target="I-D.psenak-lsr-igp-dcm"/> is a distributed and integrated IGP mechanism to mitigate link overload. Its primary objective is to dynamically offload traffic from local overloaded links onto less loaded alternate paths in Offloading Flex Algo (OFA) topologies.</t>
        <t>In DCM, each router continuously monitors local link utilization. When link utilization exceeds the configured "Congestion Threshold", the router advertises "Congestion Affinity" via IGP link attributes, which causes the overloaded link to be excluded from a dedicated OFA topology. Additionally, the router also performs traffic offloading to divert the traffic onto the shortest path that avoids any overloaded links. A separate IGP link attribute, "High Utilization Affinity" signals routers participating in the IGP to stop sending new offloaded traffic to the link without impacting existing offloaded traffic. DCM leverages Unequal Cost Multipath (UCMP) to divert traffic from the primary to the offload path (i.e., to offload traffic) in progressively periodic iterations. When link utilization on the overloaded link falls below a configured "Restore Threshold", traffic is gradually moved back (reverted) to the original primary path.</t>
        <t>DCM depends on IGP (IS-IS or OSPF) for affinity advertisement, and IGP Flexible Algorithm (<xref target="RFC9350"/>) to construct the OFA topology. Participating nodes must implement threshold based link state signaling and obey IGP LSP/LSA update throttling rules.</t>
      </section>
      <section anchor="sec-approach-EBR">
        <name>Elastic Bandwidth-aware Routing</name>
        <t>Elastic Bandwidth aware Routing (EBR) specified in <xref target="I-D.czz-rtgwg-elastic-bandwidth-routing"/>, is a distributed dynamic mechanism to alleviate link overload that responds to unexpectedly overloaded links in the network before centralized TE completes global re-optimization. Its core goal is to mitigate in a timely way link overload that was triggered by unexpected reasons by distributing traffic among the shortest paths and load-balancing alternate paths through Segment Routing Traffic Engineering (SR-TE) <xref target="RFC9256"/>.</t>
        <t>In EBR, each router monitors local link bandwidth usage and advertises available bandwidth and utilization metrics via extensions to IGP-TE when specific conditions and thresholds are met. Then, each router pre-computes loop-free, preferably disjoint, load-balancing alternate paths for each destination. When the link utilization exceeds the configured "Congestion Threshold", the router uses UCMP to divert specific flows to alternate paths. The diverted traffic is encapsulated using an SR-TE strict path for loop-free forwarding. Path weights are derived from the bottleneck link on each alternate path. Traffic fallback (reversion) is performed when bandwidth utilization on the originally overloaded link drops below a dynamic "Restore Threshold" to restore flows to primary paths.</t>
        <t>EBR depends on IGP (IS-IS or OSPF) with existing TE metric extensions (<xref target="RFC8570"/> for IS-IS, <xref target="RFC7471"/> for OSPF) for bandwidth information dissemination. SR-TE data plane capability is mandatory for steering offloaded traffic.</t>
      </section>
      <section anchor="sec-approach-TTE">
        <name>Tactical Traffic Engineering</name>
        <t>Tactical Traffic Engineering (TTE), described in <xref target="I-D.li-rtgwg-tte"/>, is a distributed, reactive traffic engineering mechanism designed to alleviate unexpected link overload. TTE operates locally, adjusting the forwarding of selected traffic flows in response to loacl link utilization. It is complementary to conventional bandwidth engineering mechanisms, separating tactical mitigation from strategic optimization to allow networks to react quickly to unforeseen traffic demands without replacing their existing bandwidth management architecture.</t>
        <t>When overload is anticipated or detected, TTE selectively distributes traffic across primary and alternate forwarding paths. The alternate paths may be derived from existing protection mechanisms, including Loop-Free Alternates (LFA) <xref target="RFC5286"/>, Topology Independent Loop-Free Alternates (TI-LFA) <xref target="RFC9855"/>, RSVP-TE Fast Reroute <xref target="RFC4090"/>, or paths computed by a Path Computation Element (PCE) <xref target="RFC4655"/>. TTE activates these alternatives through modifications to Forwarding Information Base (FIB) or MPLS Label Forwarding Information Base (LFIB) entries, allowing traffic to be redistributed without requiring network-wide routing convergence or global traffic engineering reoptimization.</t>
        <t>When utilization returns to acceptable levels, or when longer-term traffic engineering optimization has corrected the overload condition, TTE can deactivate the alternate paths and restore normal forwarding.</t>
        <t>TTE builds upon existing loop-free backup path computation capabilities such as LFA, TI-LFA, RSVP-TE FRR, and PCE. Forwarding planes must support FIB/LFIB modification for dynamic path adjustment. Deployment of TTE must account for the potential for secondary overload on alternate paths, particularly when reusing protection resources.</t>
      </section>
      <section anchor="sec-CA-SR">
        <name>Congestion Avoidance using Segment Routing</name>
        <t>While many approaches to overload alleviation may make use of Segment Routing to tunnel traffic around overloaded links, <xref target="I-D.he-rtgwg-sr-ca"/> specifically utilizes this mechanism and is applicable only in an SR-enabled network.</t>
        <t>Based on the concept of Topology Independent Loop-Free Alternate (TI-LFA) Fast Reroute (FRR) (see <xref target="sec-failure"/>), the traffic can be steered away from an overloaded link while avoiding the formation of micro-loops by moving the traffic to the bypass paths that have been predetermined for link-failure protection.</t>
        <t>This approach requires no new protocol extensions, and switches traffic based on its destination address so that it is possible that large amounts of traffic are steered away from an overloaded link in one action. As with normal FRR procedures, this mechanism is applicable both to immediate adjacency overload and to remote adjacency overload.</t>
      </section>
      <section anchor="sec-approach-LCM">
        <name>Local Congestion Management</name>
        <t>Local Congestion Mitigation (LCM) specified in <xref target="LCM"/> is a controller-based tactical solution to mitigate link overload, designed to handle short-lived transient link overload while complementing capacity planning. LCM mitigates link overload by diverting the minimal necessary amount of traffic away from the overloaded interface to bring it out of overload state. LCM acts as a tactical complement to capacity planning and network engineering. It supports monitor-only and human-in-the-loop workflows for operational safety.</t>
        <t>LCM operates as a closed-loop controller-driven workflow. Crosswork Data Gateway (CDG) collects interface-level statistics from network elements. The controller maintains real-time network state and detects when a link is overloaded when measured utilization exceeds user configured thresholds. It computes how much optimizable traffic volume needs to be offloaded to relieve the link overload. A Segment Routing Path Computation Element (SR PCE) calculates suitable alternate paths and deploys temporary tactical SR-TE policies on headend nodes. ECMP splits traffic across multiple parallel tactical SR-TE policies to achieve the target offloaded volume. After the link has become less loaded and once hold-margin conditions are satisfied, the controller removes temporary tactical policies and reverts traffic back to native IGP forwarding to avoid persistent policy churn.</t>
        <t>LCM relies on BGP-LS <xref target="RFC9552"/> or the active IGP to collect real-time topology information. PCEP <xref target="RFC5440"/> is required between the SR PCE and PCC routers for installation and removal of PCE-initiated SR-TE policies. gRPC or SNMP is used for statistics telemetry collection. Headend routers must support PCE-initiated SR-TE policies with autoroute steering and ECMP over multiple parallel SR-TE policies.</t>
      </section>
    </section>
    <section anchor="sec-applicability">
      <name>Applicability to Different Scenarios</name>
      <t>The approaches described in <xref target="sec-approaches"/> share the common objective of alleviating link overload, but they differ significantly in their architectural assumptions, deployment requirements, and operational characteristics. This section identifies the scenarios in which each approach is most applicable.</t>
      <section anchor="sec-scenario-dcm">
        <name>Scenario 1: Distributed Alleviation with Flex-Algo Support</name>
        <t>Characteristics: The network operates a single IGP domain (IS-IS or OSPF) with Flexible Algorithm capabilities already deployed or easily enabled. The operator requires a fully distributed solution that does not depend on a central controller or external TE policy management.  The network can tolerate the overhead of a dedicated offload topology.</t>
        <t>Applicable approach: Distributed Congestion Mitigation (DCM) <xref target="sec-approach-DCM"/>.</t>
        <t>DCM is the natural fit when the network has already adopted IGP Flexible Algorithm <xref target="RFC9350"/>. DCM provisions a dedicated Offloading Flex-Algo (OFA) topology that excludes congested links via affinity advertisements, allowing offloaded traffic to be natively routed around congestion without explicit TE tunnels. This makes DCM attractive for operators who want to avoid the configuration and state overhead of SR-TE policies on every headend. The affinity advertisement may introduce additional control-plane activity, but it avoids using already heavily loaded links for offloading, thereby preventing secondary congestion from occurring as a result of the offloading process.</t>
        <t>Key deployment considerations:</t>
        <ul spacing="normal">
          <li>
            <t>Requires IGP-wide support for Flex-Algo and extended administrative groups.</t>
          </li>
          <li>
            <t>Requires extra Flex-algo and its SIDs to be provisioned and advertised.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-scenario-ebr">
        <name>Scenario 2: Distributed Alleviation with SR-TE Capability</name>
        <t>Characteristics: The network operates a single IGP domain (IS-IS or OSPF) with Segment Routing (SR-MPLS or SRv6) capabilities already deployed or easily enabled.The operator requires a fully distributed solution that does not depend on a central controller.</t>
        <t>Applicable approach: Elastic Bandwidth-aware Routing (EBR) <xref target="sec-approach-EBR"/>.</t>
        <t>EBR is designed for scenarios where the network has already adopted IGP TE extensions and Segment Routing. EBR computes alternate paths with explicit consideration of available bandwidth on each path, using UCMP weights derived from the bottleneck link on each alternate path. This makes EBR react quickly once the overload is detected. It leverages existing IGP TE extensions (RFC 8570 for IS-IS, RFC 7471 for OSPF) for bandwidth advertisement, meaning it can be deployed incrementally as IGP implementations support these extensions. The bandwidth advertisement may introduce additional control-plane activity, but it avoids using overloaded links for offloading and distributes traffic based on available link bandwidth, thereby preventing secondary congestion from occurring on other links.</t>
        <t>Key deployment considerations:</t>
        <ul spacing="normal">
          <li>
            <t>SR-TE data plane capability is mandatory for steering offloaded traffic.</t>
          </li>
          <li>
            <t>The threshold for triggering bandwidth updates and minimal advertisement interval need to be provisioned according to the network conditions.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-scenario-lcm">
        <name>Scenario 3: Controller-Based Alleviation with Human Oversight</name>
        <t>Characteristics: The network is managed by a central controller and the operator requires visibility, auditability, and control over any traffic steering actions. Regulatory or operational policy requires human-in-the-loop approval for traffic engineering changes. The overload events are transient and localized, and the operator wants to offload the minimal necessary traffic volume to restore the link to acceptable utilization. Existing SR-TE policy infrastructure is already deployed or can be deployed.</t>
        <t>Applicable approach: Local Congestion Mitigation (LCM) <xref target="sec-approach-LCM"/>.</t>
        <t>LCM is the appropriate choice when operational safety and human oversight are paramount. It operates as a closed-loop controller-driven workflow: the controller collects interface statistics, detects overload against user-configured thresholds, computes the minimal offload volume, deploys temporary SR-TE policies, and later removes them once hold-margin conditions are satisfied. The monitor-only and human-in-the-loop workflows allow operators to preview recommendations before committing them.</t>
        <t>Key deployment considerations:</t>
        <ul spacing="normal">
          <li>
            <t>Requires BGP-LS or IGP for topology collection;</t>
          </li>
          <li>
            <t>Requires SR-TE policies and ECMP over multiple parallel policies.</t>
          </li>
        </ul>
      </section>
      <section anchor="scenario-4-distributed-alleviation-with-existing-alternate-paths-sec-scenario-tte">
        <name>Scenario 4: Distributed Alleviation with Existing Alternate Paths {sec-scenario-tte}</name>
        <t>Characteristics: The network requires distributed mitigation of unexpected link overload and has suitable alternate forwarding paths available. The network may use conventional IP routing, RSVP-TE, or Segment Routing.</t>
        <t>Applicable approach: Tactical Traffic Engineering (TTE) <xref target="sec-approach-TTE"/>.</t>
        <t>TTE is particularly applicable when existing loop-free alternate paths and forwarding-plane capabilities can be leveraged to redistribute selected traffic locally. It provides a tactical response to overload without requiring changes to the underlying routing or traffic engineering architecture. In RSVP-TE networks, TTE complements existing bandwidth-engineering mechanisms, including bandwidth reservations, admission control, Auto-Bandwidth, and CSPF-based path selection. It can provide localized overload relief while these mechanisms perform bandwidth adjustments or global LSP reoptimization.</t>
        <t>Key deployment considerations:</t>
        <ul spacing="normal">
          <li>
            <t>Alternate paths must be suitable for carrying additional traffic.</t>
          </li>
          <li>
            <t>Offloading must avoid creating secondary overload.</t>
          </li>
          <li>
            <t>Forwarding-plane capabilities must support the required traffic distribution, and appropriate hysteresis and reversion policies are necessary to prevent instability.</t>
          </li>
          <li>
            <t>Where RSVP-TE protection paths are reused, the impact on reserved bandwidth and failure-protection capacity must also be considered.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-scenario-summary">
        <name>Summary</name>
        <table>
          <thead>
            <tr>
              <th align="left">Scenario</th>
              <th align="left">Primary Criterion</th>
              <th align="left">Recommended Approach</th>
              <th align="left">Key Prerequisite</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">Scenario1</td>
              <td align="left">Distributed, Flex-Algo available</td>
              <td align="left">DCM</td>
              <td align="left">Flex-Algo + extended admin groups</td>
            </tr>
            <tr>
              <td align="left">Scenario2</td>
              <td align="left">Distributed, SR-TE available</td>
              <td align="left">EBR</td>
              <td align="left">SR-TE data plane + IGP TE metrics (bandwidth related metrics)</td>
            </tr>
            <tr>
              <td align="left">Scenario3</td>
              <td align="left">Controller-based, human oversight required</td>
              <td align="left">LCM</td>
              <td align="left">Controller + SR-TE policy support</td>
            </tr>
            <tr>
              <td align="left">Scenario4</td>
              <td align="left">Distributed Alleviation with Existing Alternate Paths</td>
              <td align="left">TTE</td>
              <td align="left">Existing bandwidth-engineering and protection mechanisms</td>
            </tr>
          </tbody>
        </table>
        <t>These scenarios are not mutually exclusive. A network may deploy LCM for policy-controlled offload while also relying on DCM or EBR for autonomous distributed reaction to sudden events. The choice of approach should be guided by the operator's existing infrastructure, operational model, and the specific characteristics of the overload events that need to be mitigated.</t>
        <t>In some deployments, multiple approaches' prerequisite may be satisfied by one network. When several mechanisms are technically viable, operators can compare them using more evaluation criteria, including but are not limited to: responsiveness, scope of action, bandwidth awareness, compatibility, oscillation avoidance, secondary congestion avoidance, and multi-point congestion. These criteria help identify which approach best matches the operator’s priorities and risk tolerance.</t>
      </section>
    </section>
    <section anchor="sec-deployment">
      <name>Deployment and Implementation Experience</name>
      <t>TBD</t>
    </section>
    <section anchor="sec-security">
      <name>Security Considerations</name>
      <t>There are two main security exposures introduced by link overload alleviation.</t>
      <t>Firstly, the network can be destabilised causing traffic to be steered off the optimal path resulting in degradation of traffic delivery and potential packet loss. For example, if the configuration of overload and reversion thresholds can be compromised, then traffic steering can be induced. Further, a flip-flop with reversion can be forced by setting the reversion threshold higher than the overload threshold, resulting in interruption of traffic flows.</t>
      <t>A more complex attack may cause traffic to be sent to an authorised network exit where it can be exfiltrated. This attack requires a tunnel to be set up to that exit point, and then overload steering to be triggered so that traffic is placed on the tunnel.</t>
      <t>The most important protection against these attacks is security applied to the configuration/management protocols.</t>
      <t>It may be possible to force link overload alleviation by introducing bogus, high-volume traffic flows to the network. Such an attack, however, is actually mitigated by link overload alleviation because otherwise it would simply result in overload with delay to or loss of other, legitimate traffic flows. In any case, this sort of attack should be adequately protected against by appropriate traffic policing at the network edge.</t>
    </section>
    <section anchor="sec-operational">
      <name>Operational Considerations</name>
      <t>TBD</t>
      <ul spacing="normal">
        <li>
          <t>configuration of thresholds</t>
        </li>
        <li>
          <t>monitoring traffic flows (where is my packet?)</t>
        </li>
        <li>
          <t>reporting traffic steering</t>
        </li>
        <li>
          <t>complexity and instability versus alleviating overload</t>
        </li>
      </ul>
    </section>
    <section anchor="sec-iana">
      <name>IANA Considerations</name>
      <t>This document makes no requests for IANA action.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-informative-references">
      <name>Informative References</name>
      <reference anchor="ISO10589">
        <front>
          <title>Intermediate system to Intermediate system intra-domain routeing information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode Network Service (ISO 8473), ISO/IEC 10589:2002, Second Edition. &lt;https://www.iso.org/standard/30932.html&gt;</title>
          <author>
            <organization>International Organization for Standardization</organization>
          </author>
          <date year="2002"/>
        </front>
      </reference>
      <reference anchor="LCM">
        <front>
          <title>Local Congestion Mitigation. &lt;https://www.cisco.com/c/en/us/products/collateral/cloud-systems-management/crosswork-network-automation/local-congestion-mitigation-wp.html&gt;</title>
          <author>
            <organization>Cisco Systems Inc.</organization>
          </author>
          <date year="2021"/>
        </front>
      </reference>
      <reference anchor="RFC9522">
        <front>
          <title>Overview and Principles of Internet Traffic Engineering</title>
          <author fullname="A. Farrel" initials="A." role="editor" surname="Farrel"/>
          <date month="January" year="2024"/>
          <abstract>
            <t>This document describes the principles of traffic engineering (TE) in the Internet. The document is intended to promote better understanding of the issues surrounding traffic engineering in IP networks and the networks that support IP networking and to provide a common basis for the development of traffic-engineering capabilities for the Internet. The principles, architectures, and methodologies for performance evaluation and performance optimization of operational networks are also discussed.</t>
            <t>This work was first published as RFC 3272 in May 2002. This document obsoletes RFC 3272 by making a complete update to bring the text in line with best current practices for Internet traffic engineering and to include references to the latest relevant work in the IETF.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9522"/>
        <seriesInfo name="DOI" value="10.17487/RFC9522"/>
      </reference>
      <reference anchor="RFC9350">
        <front>
          <title>IGP Flexible Algorithm</title>
          <author fullname="P. Psenak" initials="P." role="editor" surname="Psenak"/>
          <author fullname="S. Hegde" initials="S." surname="Hegde"/>
          <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
          <author fullname="K. Talaulikar" initials="K." surname="Talaulikar"/>
          <author fullname="A. Gulko" initials="A." surname="Gulko"/>
          <date month="February" year="2023"/>
          <abstract>
            <t>IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9350"/>
        <seriesInfo name="DOI" value="10.17487/RFC9350"/>
      </reference>
      <reference anchor="RFC5286">
        <front>
          <title>Basic Specification for IP Fast Reroute: Loop-Free Alternates</title>
          <author fullname="A. Atlas" initials="A." role="editor" surname="Atlas"/>
          <author fullname="A. Zinin" initials="A." role="editor" surname="Zinin"/>
          <date month="September" year="2008"/>
          <abstract>
            <t>This document describes the use of loop-free alternates to provide local protection for unicast traffic in pure IP and MPLS/LDP networks in the event of a single failure, whether link, node, or shared risk link group (SRLG). The goal of this technology is to reduce the packet loss that happens while routers converge after a topology change due to a failure. Rapid failure repair is achieved through use of precalculated backup next-hops that are loop-free and safe to use until the distributed network convergence process completes. This simple approach does not require any support from other routers. The extent to which this goal can be met by this specification is dependent on the topology of the network. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="5286"/>
        <seriesInfo name="DOI" value="10.17487/RFC5286"/>
      </reference>
      <reference anchor="RFC4750">
        <front>
          <title>OSPF Version 2 Management Information Base</title>
          <author fullname="D. Joyal" initials="D." role="editor" surname="Joyal"/>
          <author fullname="P. Galecki" initials="P." role="editor" surname="Galecki"/>
          <author fullname="S. Giacalone" initials="S." role="editor" surname="Giacalone"/>
          <date month="December" year="2006"/>
          <abstract>
            <t>This memo defines a portion of the Management Information Base (MIB) for use with network management protocols in TCP/IP-based internets. In particular, it defines objects for managing version 2 of the Open Shortest Path First Routing Protocol. Version 2 of the OSPF protocol is specific to the IPv4 address family. Version 3 of the OSPF protocol is specific to the IPv6 address family.</t>
            <t>This memo obsoletes RFC 1850; however, it is designed to be backwards compatible. The functional differences between this memo and RFC 1850 are explained in Appendix B. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4750"/>
        <seriesInfo name="DOI" value="10.17487/RFC4750"/>
      </reference>
      <reference anchor="RFC5340">
        <front>
          <title>OSPF for IPv6</title>
          <author fullname="R. Coltun" initials="R." surname="Coltun"/>
          <author fullname="D. Ferguson" initials="D." surname="Ferguson"/>
          <author fullname="J. Moy" initials="J." surname="Moy"/>
          <author fullname="A. Lindem" initials="A." surname="Lindem"/>
          <date month="July" year="2008"/>
          <abstract>
            <t>This document describes the modifications to OSPF to support version 6 of the Internet Protocol (IPv6). The fundamental mechanisms of OSPF (flooding, Designated Router (DR) election, area support, Short Path First (SPF) calculations, etc.) remain unchanged. However, some changes have been necessary, either due to changes in protocol semantics between IPv4 and IPv6, or simply to handle the increased address size of IPv6. These modifications will necessitate incrementing the protocol version from version 2 to version 3. OSPF for IPv6 is also referred to as OSPF version 3 (OSPFv3).</t>
            <t>Changes between OSPF for IPv4, OSPF Version 2, and OSPF for IPv6 as described herein include the following. Addressing semantics have been removed from OSPF packets and the basic Link State Advertisements (LSAs). New LSAs have been created to carry IPv6 addresses and prefixes. OSPF now runs on a per-link basis rather than on a per-IP-subnet basis. Flooding scope for LSAs has been generalized. Authentication has been removed from the OSPF protocol and instead relies on IPv6's Authentication Header and Encapsulating Security Payload (ESP).</t>
            <t>Even with larger IPv6 addresses, most packets in OSPF for IPv6 are almost as compact as those in OSPF for IPv4. Most fields and packet- size limitations present in OSPF for IPv4 have been relaxed. In addition, option handling has been made more flexible.</t>
            <t>All of OSPF for IPv4's optional capabilities, including demand circuit support and Not-So-Stubby Areas (NSSAs), are also supported in OSPF for IPv6. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="5340"/>
        <seriesInfo name="DOI" value="10.17487/RFC5340"/>
      </reference>
      <reference anchor="RFC4427">
        <front>
          <title>Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)</title>
          <author fullname="E. Mannie" initials="E." role="editor" surname="Mannie"/>
          <author fullname="D. Papadimitriou" initials="D." role="editor" surname="Papadimitriou"/>
          <date month="March" year="2006"/>
          <abstract>
            <t>This document defines a common terminology for Generalized Multi-Protocol Label Switching (GMPLS)-based recovery mechanisms (i.e., protection and restoration). The terminology is independent of the underlying transport technologies covered by GMPLS. This memo provides information for the Internet community.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4427"/>
        <seriesInfo name="DOI" value="10.17487/RFC4427"/>
      </reference>
      <reference anchor="RFC7841">
        <front>
          <title>RFC Streams, Headers, and Boilerplates</title>
          <author fullname="J. Halpern" initials="J." role="editor" surname="Halpern"/>
          <author fullname="L. Daigle" initials="L." role="editor" surname="Daigle"/>
          <author fullname="O. Kolkman" initials="O." role="editor" surname="Kolkman"/>
          <date month="May" year="2016"/>
          <abstract>
            <t>RFC documents contain a number of fixed elements such as the title page header, standard boilerplates, and copyright/IPR statements. This document describes them and introduces some updates to reflect current usage and requirements of RFC publication. In particular, this updated structure is intended to communicate clearly the source of RFC creation and review. This document obsoletes RFC 5741, moving detailed content to an IAB web page and preparing for more flexible output formats.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7841"/>
        <seriesInfo name="DOI" value="10.17487/RFC7841"/>
      </reference>
      <reference anchor="RFC4090">
        <front>
          <title>Fast Reroute Extensions to RSVP-TE for LSP Tunnels</title>
          <author fullname="P. Pan" initials="P." role="editor" surname="Pan"/>
          <author fullname="G. Swallow" initials="G." role="editor" surname="Swallow"/>
          <author fullname="A. Atlas" initials="A." role="editor" surname="Atlas"/>
          <date month="May" year="2005"/>
          <abstract>
            <t>This document defines RSVP-TE extensions to establish backup label-switched path (LSP) tunnels for local repair of LSP tunnels. These mechanisms enable the re-direction of traffic onto backup LSP tunnels in 10s of milliseconds, in the event of a failure.</t>
            <t>Two methods are defined here. The one-to-one backup method creates detour LSPs for each protected LSP at each potential point of local repair. The facility backup method creates a bypass tunnel to protect a potential failure point; by taking advantage of MPLS label stacking, this bypass tunnel can protect a set of LSPs that have similar backup constraints. Both methods can be used to protect links and nodes during network failure. The described behavior and extensions to RSVP allow nodes to implement either method or both and to interoperate in a mixed network. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4090"/>
        <seriesInfo name="DOI" value="10.17487/RFC4090"/>
      </reference>
      <reference anchor="RFC9855">
        <front>
          <title>Topology Independent Fast Reroute Using Segment Routing</title>
          <author fullname="A. Bashandy" initials="A." surname="Bashandy"/>
          <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
          <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
          <author fullname="P. Francois" initials="P." surname="Francois"/>
          <author fullname="B. Decraene" initials="B." surname="Decraene"/>
          <author fullname="D. Voyer" initials="D." surname="Voyer"/>
          <date month="October" year="2025"/>
          <abstract>
            <t>This document presents Topology Independent Loop-Free Alternate (TI-LFA) Fast Reroute (FRR), which is aimed at providing protection of node and Adjacency segments within the Segment Routing (SR) framework. This FRR behavior builds on proven IP FRR concepts being LFAs, Remote LFAs (RLFAs), and Directed Loop-Free Alternates (DLFAs). It extends these concepts to provide guaranteed coverage in any two-connected networks using a link-state IGP. An important aspect of TI-LFA is the FRR path selection approach establishing protection over the expected post-convergence paths from the Point of Local Repair (PLR), reducing the operational need to control the tie-breaks among various FRR options.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9855"/>
        <seriesInfo name="DOI" value="10.17487/RFC9855"/>
      </reference>
      <reference anchor="RFC3180">
        <front>
          <title>GLOP Addressing in 233/8</title>
          <author fullname="D. Meyer" initials="D." surname="Meyer"/>
          <author fullname="P. Lothberg" initials="P." surname="Lothberg"/>
          <date month="September" year="2001"/>
          <abstract>
            <t>This document defines the policy for the use of 233/8 for statically e assigned multicast addresses. 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="53"/>
        <seriesInfo name="RFC" value="3180"/>
        <seriesInfo name="DOI" value="10.17487/RFC3180"/>
      </reference>
      <referencegroup anchor="BCP197" target="https://www.rfc-editor.org/info/bcp197">
        <reference anchor="RFC7567" target="https://www.rfc-editor.org/info/rfc7567">
          <front>
            <title>IETF Recommendations Regarding Active Queue Management</title>
            <author fullname="F. Baker" initials="F." role="editor" surname="Baker"/>
            <author fullname="G. Fairhurst" initials="G." role="editor" surname="Fairhurst"/>
            <date month="July" year="2015"/>
            <abstract>
              <t>This memo presents recommendations to the Internet community concerning measures to improve and preserve Internet performance. It presents a strong recommendation for testing, standardization, and widespread deployment of active queue management (AQM) in network devices to improve the performance of today's Internet. It also urges a concerted effort of research, measurement, and ultimate deployment of AQM mechanisms to protect the Internet from flows that are not sufficiently responsive to congestion notification.</t>
              <t>Based on 15 years of experience and new research, this document replaces the recommendations of RFC 2309.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="197"/>
          <seriesInfo name="RFC" value="7567"/>
          <seriesInfo name="DOI" value="10.17487/RFC7567"/>
        </reference>
      </referencegroup>
      <reference anchor="RFC4655">
        <front>
          <title>A Path Computation Element (PCE)-Based Architecture</title>
          <author fullname="A. Farrel" initials="A." surname="Farrel"/>
          <author fullname="J.-P. Vasseur" initials="J.-P." surname="Vasseur"/>
          <author fullname="J. Ash" initials="J." surname="Ash"/>
          <date month="August" year="2006"/>
          <abstract>
            <t>Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains.</t>
            <t>This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed. This memo provides information for the Internet community.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4655"/>
        <seriesInfo name="DOI" value="10.17487/RFC4655"/>
      </reference>
      <reference anchor="I-D.psenak-lsr-igp-dcm">
        <front>
          <title>Distributed Congestion Mitigation</title>
          <author fullname="Peter Psenak" initials="P." surname="Psenak">
            <organization>Cisco Systems</organization>
          </author>
          <author fullname="Jakub Horn" initials="J." surname="Horn">
            <organization>Cisco Systems</organization>
          </author>
          <author fullname="Bruno Decraene" initials="B." surname="Decraene">
            <organization>Orange</organization>
          </author>
          <author fullname="Guillaume Gryszata" initials="G." surname="Gryszata">
            <organization>Orange</organization>
          </author>
          <date day="2" month="November" year="2026"/>
          <abstract>
            <t>   This document describes the Distributed Congestion Mitigation (DCM)
   mechanism using the Interior Gateway Protocols (IGPs) such as IS-IS
   [RFC1195], OSPFv2 [RFC2328], or OSPFv3 [RFC5340].  DCM is a tactical,
   distributed mechanism, designed to mitigate network congestion by
   offloading traffic to an alternate, congestion-free paths.  DCM is
   fully integrated in IGPs.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-psenak-lsr-igp-dcm-01"/>
      </reference>
      <reference anchor="I-D.czz-rtgwg-elastic-bandwidth-routing">
        <front>
          <title>Elastic Bandwidth-aware Routing Framework</title>
          <author fullname="Weiqiang Cheng" initials="W." surname="Cheng">
            <organization>China Mobile</organization>
          </author>
          <author fullname="KaZhang" initials="" surname="KaZhang">
            <organization>Huawei</organization>
          </author>
          <author fullname="Li Zhang" initials="L." surname="Zhang">
            <organization>Huawei</organization>
          </author>
          <author fullname="Luis M. Contreras" initials="L. M." surname="Contreras">
            <organization>Telefonica</organization>
          </author>
          <author fullname="Jie Dong" initials="J." surname="Dong">
            <organization>Huawei</organization>
          </author>
          <date day="27" month="October" year="2026"/>
          <abstract>
            <t>   IGP normally computes the shortest paths in a network for packet
   forwarding, without taking the traffic demands and available
   bandwidth into consideration.  When there is a link degradation or
   partial link failure in a network which causes throughput reduction,
   or the volume of specific traffic flows increase dramatically,
   unexpected congestion may happen if only the shortest paths are used
   for IP forwarding.

   Conventional centralized Traffic Engineering (TE) focuses on long-
   term bandwidth and routes planning based on traffic demands, which
   can not react to the congestions in networks timely.

   This document describes a distributed path computation and load
   balancing mechanism named Elastic Bandwidth-aware Routing (EBR),
   which can alleviate congestions timely before TE finishes the global
   optimization.  It allows IGP-enabled nodes which face congestion to
   distribute traffic among the shortest paths and load-balancing
   alternate paths through Segment Routing (SR) strict path, with
   weights determined based on the bandwidth utilization and available
   bandwidth of these paths.  It provides an efficient, accurate and
   backward compatible approach for dynamic link congestion avoidance.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-czz-rtgwg-elastic-bandwidth-routing-01"/>
      </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="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="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="I-D.li-rtgwg-tte">
        <front>
          <title>Tactical Traffic Engineering (TTE)</title>
          <author fullname="Colby Barth" initials="C." surname="Barth">
            <organization>Juniper Networks</organization>
          </author>
          <author fullname="Tony Li" initials="T." surname="Li">
            <organization>Juniper Networks</organization>
          </author>
          <author fullname="Andy Smith" initials="A." surname="Smith">
            <organization>Oracle Cloud Infrastructure</organization>
          </author>
          <author fullname="Bin Wen" initials="B." surname="Wen">
            <organization>Comcast</organization>
          </author>
          <author fullname="Luay Jalil" initials="L." surname="Jalil">
            <organization>Verizon</organization>
          </author>
          <date day="3" month="December" year="2024"/>
          <abstract>
            <t>   Conventional traffic engineering approaches for resource management
   used by RSVP-TE and SR-TE often leverage estimates of the ingress
   traffic demands, during path placement.  Unforeseen and/or dynamic
   events, can skew these estimates by significant enough margins to
   result in unexpected network congestion.  Recomputed paths that
   address the new demands may take a considerable amount of time,
   leaving the network in a sub-optimal state for far too long.

   This document proposes one mechanism that can avert congestion on a
   real-time basis.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-li-rtgwg-tte-02"/>
      </reference>
      <reference anchor="I-D.he-rtgwg-sr-ca">
        <front>
          <title>Congestion Avoidance Using Segment Routing</title>
          <author fullname="hexiaoming" initials="X." surname="hexiaoming">
            <organization>China Telecom</organization>
          </author>
          <author fullname="Lijie Deng" initials="L." surname="Deng">
            <organization>China Telecom</organization>
          </author>
          <date day="13" month="October" year="2026"/>
          <abstract>
            <t>   This document describes a generic solution of congestion avoidance,
   which is aimed at providing local link congestion avoidance within
   the Segment Routing (SR) framework.  Based on the concept of Topology
   Independent Loop-Free Alternate (TI- LFA) Fast Reroute (FRR), the
   selected shortest path can bypass the congested link while avoiding
   the formation of micro-loops.  The advantage of this solution is that
   it does not require any protocol extension.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-he-rtgwg-sr-ca-00"/>
      </reference>
      <reference anchor="RFC9552">
        <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="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>
    </references>
    <?line 364?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The authors would like to thank Daniel King and Colby Barth for input to this document.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8193XLcxpLmfT8Fgr4YMqbRtGXp2Nbs7jkUJdmMoSyOqDMn
Yjc2NtBAdTcsNNCDQpNqW4qY19jX2yeZ/K3KQoOS7eOZWN9YRAOFqqz8/TIr
kef5bKiHxj3NTi677bZrs4vdru+KcuN8NnTZdd2+y17fub7piiq7aBp3VxdD
3bUns2K57N0dPDj9c9WVbbGFgau+WA15U+f9sL5f553cnRfx7vzLr2YzPxRt
9X+KpmvhoaHfu1m96+lffnj05ZffffloVvSugBe+6fZD3a5PZvdd/27dd/td
vJhdwD3Z3+AH/ON7/PFk9s4d4Nbq6SzLs7Jr187jW9O/sm091OtCf1jCZO7r
atjgHw1SoSx2RVkPB7wwwJpWdZn5wbkeXoTXvFtvXTtkPU9kNiuLwa27/vA0
q9tVN/P75bb2HsYfDjtY4tWLty9nZVfBvU+z/bDKv53t6qfZ/xq6cp75rh96
t/Lwr8MW//G/Z7M71+4drCH7NUvOMn7LydH1bVE3cJ124y+1G1aLrl/jD0Vf
buCHzTDs/NPzc7wPL9V3bqG3neOF82Xf3Xt3TiOc45Pretjsl/Dsz5uiXcNW
F8uyOmeGyiND5UOXI0PlyjF5wjGzYj9suv7pbJbDmHXrn2bXi+x/4pDwNzPT
dR0uwHSeZj/si3tXw19lt28HpPXlpm4LuOB4nTKjrx8//suG7l2U3da84WKR
vSz63jXhFRdVXxdtvErved1U2fNunV12rd83tL/hFQU98JeuqapuDcMv9u/M
C24W2Y13bfEuvODGDa6PF2n8y9qXXXZ7AIba+jj0bkd3/aXEn3nmyEv9Fkh2
B7wAd17dvv7qyyfffoeMAZvOwnzVwiu2rgLSOuAgHBWleepyDWQr8qqDF7bE
uw65JbwFBMO9L5GILoN9BObsmgx+y/bewV30UvkPZOmnfVvSM/fAEdmwGT0D
f9zVyPD0E9zfOrq9cd7n265y2Y9uQKHObl1/V5cuO4XlZd8+/ubrs7l9FVw9
v3pxmfHKQTs8msMjMGCVvahqHHKR/Tdl5Pv7+0XtO+JfUjJFX51//eV3Xz9a
bIZt8z9o4ApI8jTDkehPZUV+Xc6bdEL0a4kqRZO97tdFW//MRMLl3crgcu0E
t+f68lWyM9ddCY9eRrXzKqid0ZTDnp+X56493/tzIF+1Lwd/DvRsYL590ZyX
Tbevct5LoGHRFmuHaui87DvvkZZ5yzTNYU0db+l5g7PIo/LLo/LL73cTZHn0
1SfIkjAvMFm5gKXneZ4VSw/MVQ6zme4ralIPKuiQLWG7ti6r3LovKlfh3wXy
VLfKdpuDr5FMuKG0mx7elHX3xDldtiv6oYafSS2vQFD2PZqMTe1BSQMTOxRR
YM6sgH8jxZDOMG5xhypt2bio3RdgtGRP71xzmAfNftc1e5gezrRuS1CwMDVf
r9safizaoTlkMES2b937HfCwq5rDInsLOg7Yuu7L/RYZrXS81MaBcYR58+Jp
4bgStYSw+PtNXW5Gk6/6breD38DqvHMDUSAQq3INzLc/ZH4PzxU+zJF+Kg6L
2eytLKSofgIDSpZpcOWmrf9t75hOS5cVu11TO5qcmmOHsgnLwMkGYw1LH/YF
78TyEMwemKkt7RiKs1IO7FuXdXAF5L0YNuBGbIoBjAsMCWKeyYqRepvizk1u
CsweNxNciD1N3L0vgGLokcB7fAkqsa87XLQQjgnLayKuiqSd0zO9+7d93ZNg
eBLVsAKdNcyZeGW08DlNlJYXiUcL+hQFzc7S1BYsDtu6qho3m32BiphlGTnz
ly+8K3PUw93H/wJJAYMHtyBJd42D9cG0QFfc416In9OCL+MS4UFZOt6nrNr3
bCzKhmib3buCNj5O50jA2JbQ5iFZ47CiplACun2vslPBtpUoblEwaJaBMzt8
2x7MMxPF7OcS950sWkX2SN6o70GpFDI9KJgq04b9cVJxLpbxRWV0fJVmCabT
uWDwpln9YmC2Bt8AjMTW/T06CDQuTB7sLLwUr8Aigeqe1QSx7Wcn6z811fYg
0v5frOfmv1vRneqDetuLdg2qhIX/l1/+/Obl5XdPHj36+HGevWzce/BI151e
//rJl3gdiXz98kKuPnn07Z8+fjz7ozTog1rzlLarhghg74mK9BuR9uz/b5U6
ZRT+s9XrF9lN38GKt9lz58u+3hnNuuNfQLdej3VqwpoOYsCuj3NGctUedgNi
F5pBkBSYYaszhLtbD+4TSpuRpjny8fGYEFQAQ/usYKEHPscNdEAEIdjR+DB7
kC9k+HorrjvIOQy+3K9WrhfdBlqOHueL/hwIiaQMMrjaN80iuwIfiN8Aa0s2
VKanTKfCeAaDNw1OAyhRgmvrZMtAreBaO2BzldvAk203xNuF2iytaLwOoLCK
snS7gTi02GLghlt4nah1fAxYEsYnIuoEVw2EnsIh3XZHNxCBlzVMYQcS4jkM
IBIGgm4KH+J3Ylacp5gGZV3aP+QzegQ1f828sgEmdK01uy3GRk3mwRcewIEm
idW4f565vu96NnAya2d0zq4p2pbuW4G+qVODunVoHmu/BbHfdRgxdU1dkviv
ZO3COWrFXLV2xGtgJjtyCVd9tw0/i81PDPItasSE0LA/tJYcw8PsdGX9A5Dy
8h3wVe9RN690TWf4Tnm2wTiiz5vCIwHgBXGs8WsqiH3RMM2RS8COKT+hkac/
kUEMKMN3lRxj4Y0xUDHEAi0PDssvv6C0x4dBS89h4gMzCPAGREeo+qZUMuxO
xfdhxDK4NYI7YCKZZLPZv6J63Pt4zb6yCAgHGgYOcp2dHnAVL5yWEBVZ4smQ
r5F1y5+QFKQjUG/wkz3q6lQSaAVgCgmpK4AnQJNsugaFuWOyHVi36yJF13bM
7RHC6licauCr4h2MxYbGiOjYHqF8s/lm548cB+/rO74Vts8PcxZ4EIahXMg2
LIuGfQVrGGgZI89Mp9R2E8pKLIZxZYQSCGCgxgMpoUvsdQlVPOpmILzYNaAk
EleVHUTKKIiwz1eVg7tg3kzr8USJCQ/oX90hO6AiTm0ReTM6iyIqo7g5Mhzp
VRjG9YOalq6vQU3g6/EFoMZ78orIeH/xBRi2Vd3WGsumwCwbOp0LWLqLQDmY
gAd27NmELY9tHrl7pIWNeGenW/Cy9vgUbM5IuZ6RPmXeg/3AV6zqNd0cVmpt
IXO2Mat7v6dlhnfgnJBcpHPwTXUnmwz3odYj9aRaiBkcBqzXa+TkYDZpfWbB
hR/78maCYl+9G/C+At8KbtBQrIPzEiyGtc1oPOD2FsENVAYuuyuaPURVV0LK
pXfA5YQ3TFJmrjZYTauZ8NTe6EaiCZ9n9cIt5p/aOLgTPDOwTsJVU4tYZH/D
AYpkbNQA8M+mfocORiJhwQlgV32eyGDwfvTu1OID8z47IJUHg/sdswvpULDn
5N4gicg6s4kJujOGQca4SoizdCtytEYUY6MBg6ByA61G8jN21lNFjP4tqHoU
cuAHnDXKfL0FOg7K1vJyWNyL96goeUdYaiWoNFYMGKZC6WVpOrZTcwavgnMO
boZoSbShJ8nsThbZj90gyuvkeQ32ql6SIzMJKp5kp88vX52RQ7ZnNxJmYK1W
Dr9/RHKBCIDc9fRS1tg4J3Knl06UtJ0lXoBbyStILRnpqwdTR6Ktwg58HPt+
JjMEL4FIFa0hhrTkJQB1TzXWOHvYjBVtjKZEldx1tYS3I60NwjugikEYAQUS
LC/wjuoZdvtY9RX9wUAPrZgTES0TvjEJ3nCMVME//A6lHBgK/X0mgERQqK7/
tqnR1zq5QA+DGUaN0vyE9qa5Lw64ResONWPRr0FtkSOrtAKyqP20jGwcAByH
bfeaXXN4y6Zeb0Da9zBeOxBc1ByCpzsk+lLULckDi5HRoBTflcdOh4qld+I/
RZerK8t9z6pEX1iHuI82rGthMidL4OncrWCY4eRII8Ff5E8exQ+Wh2TM1DAU
YSz1yAk5g8Bxq5g+LvMOVKeJUpnwPW8n4zXsqIkL0wFhe+aHuh8OwjVeoonI
YisYu2PrCqTbgLNg2dJQnS246kvl8oH8F9rPGBbyLpYHq95U56aiqVjIG/Q/
fBTJXv8GlgSJEEVeeA8CX4U3s0gZbwUFrkXH3fpL94U3bozZYfyBIyfYfXK5
0WHEHWbHF1QPGAtH2SINFsAHcL11KYGee3BFgepM8USjj7W5zAidlqWDmabh
Xsv2koNqwlNG3hcqh1XXhMgTXrs6thqG58OLwpRgFvUQDaOve/KsSWrYBZQ5
LiGYxss1AWFMYfUBr+xiUZdBRFjvcggLd9YBoPiva2WbaIWkmOZi4MGQAfEL
hMl0QwmTabtcAjmjHf2ABA1K2MQZsJr+HWGOvDlJwG2HCE8sspf7nmcSGM1O
fGrZRmT8nkIjAhgpiYZCqbmte4y4OFh2PoCFxDAQuuDb8261Innt/RkQM9pQ
f18P5cZicQ9RUJBYhu4d41xgV/s9o01p3IyIDCyOd4wxEgNnwp0/odfUn0U4
pa/9Ox9TOwrXk8ReduB+wA2aWiVl91KCexZeuZ9FF/YZ6AI3YiRIOgBWarMA
rLWQ+d8PiOJlZkNGYan1FfFpr5yE9gucX0JcDTrm91XlUHVvijsyS92DiCRq
MZzHDgc5pDk6gwgiYTXwhwHTbAYj9JiD2FeYEs+zq+9vFI1B5QkLWZNLzgDu
428Y1hU49+vH8pcm0j9+hCFetBVWKyAwJ2pI0iCvbq5v87cvlPG8Dvr40Tf0
4K1Ugfy2p14WfgBtTD5vdvryzZszWvPVjdz4zbePv8JZ6jjy+Jff0dwx9Syv
1ZKQ01sYQmDsb588+fgRyH0bsAsc2xIRLSR6BoTzSb7FIK8jPRfAYl8jVWHf
DyJEFGGPYF9CJYH99zv2jOYcfBd+NGzVOXZPYK8ws00pH3KQEtcP35Biy4vs
B1BAd6LgUEQVgSngxb6m5c45T9Sir47BUd3uEDHt5gbRCVRJjeVY9G4DQKRm
9LVxGmI+wiYayH9QpN+6GGISpFSo/pl9kwE9D1RxhE3q62y2Qtke2CkrG7DQ
jrxQgzmhWIFyAqKV7KqjqwJjgmryZbdz7NQEuIkGPNBTCKxyPg+9XY2fys69
h+FsJo1SVup0Vm7XdAd8CiVbF2AnVG/Z4GEYRagimlwKlZUHKN5Qm9+NPKoi
W7l7dah49sijB7EG45IscVLBE6eFUc6p2NVosJayJ0fgDVlfWaABwIA/Gt2w
BvZuoBQOvRYFhfJOBLJ3/T2Wf/A/YaoNLYWBWxTAsJWGLLAVvSY1UMuSCba7
BRH2moZEq7StW1ARBIGAYey9bBuMgfU6qTlUivQutzw3x8qwuhQJaw7k+aKC
XzfdEgh5VwOZUcQ6sKfd2tREVG7L3AChQOlkD3DCjPVq4pYcbXimRlzfiEvq
W1cVpj4c4UogpEOCzJp0tmaDRD9hTE8JWHRIqrAPUWRiGtALLh5xR03CrNC9
9BMoNUX8nrNo4G9guIBa4CJwOUvCdolw7LJDxL6rWPR4H2HKT+NczDaL+XKf
eC1qRggDjcRr7gei332rIQYyKVYAMphbdj2qRkvFeisrFmTdDzYDpV4WbgZW
BoTtgzCodCK/F6LHJ8OpCHd/Ch3QoOsBzRZJI+gm4xPigbxFWAnd1Pwa0R0L
bcA/wQFrxOkxKMpsZu5iNULc3jsciDIuJT87H2cSaL/JYye1Jo4mzAP0rTFz
mSt6sImgBCt0K8UMYR0noX9iuOYP5y9qzgUsyds6aBiJwDlaIvQeKa2GSBXt
BtVdVHcF44lzRc8CrFQOHLiENB9COJTsXGQvYK4HS7gf7VROX1z+qA7C1199
C25EmJ1aT1sCKHZ8gwl+SVaGDBPjszEwZV2LctErvEb/KAZJLRukEiItD8wS
06s6Km6Q1zDHLHlT9Fv2ZztT7MEKlvBdClZ3CndIGkFSSxEr4voSARFo99Ej
6VpQ9weRsxrLaJCFPZpPkBCH0PMpZ7Epqun2682OUTKOGGNMR6m4oLRHFQ7s
8qs0p+MLTwUyYMh1D+ELeIWM/FJy1ZVaRYkoCYUm6ZrQjmG8wy8izHRU7KT4
ToCHaee2BJKqC45xEgJ4dOMBmB9U1BaxUH7l28ubc/BQP5Wtw8iiwgIk48xH
YUPEt/OS0qFoKv6mhZq1j1U4WNaCfC4pcDGcEsMOqjIYEJ4rByoC8iAPSsB1
zIP1UbwdwxArhwuF9xgPCqULmrUofFRHfMeu2fuUWFz4Q9fpDvQf6janRdVD
zLGz/ySltV3N0H+cytMswCgNwzFTbyZyoAGB8esd/YA6nx7L/gUrB7JXoZA0
O734l1ekKp5d3nz1HcQrjBVvHchgmqSJriDW7noBwUlb4yupJgF2p10TfETX
tq6QmfFAGin7HagZzzWc9Nwie3ZQYLbBfzX1UnYXf8f/kyTXHXKpzqQl60yR
rshm2D9EPsc5hFN4H5XMlfumiClSTjudqVKSQhYyCERtz7Gs6l6fgu2pWTRp
Y61L+XhGM/TgHNFbO9VuSJEoEeoxVTb9KFohDaWOQnMjouRVCxZwxioTVUFZ
eDfOaTfAnEvwfIdDmCLI6D1hJjxXzhKMq4FMTCXFIrCbZc1QId2bgOHmpQER
l/dVNZW4kEvyRfZSistBnbyCfVUXYBUuUwl585E3I14mTdAgVTysaWDIVUuT
7X0SMdCc32EwxIJDcia2BKSvqWlvcIc0xMgiWNotvevvLFoaFvGg43RcRcA+
QPMgoi2JU6oGieOTzxAqK0emdAv8Pgj+z2G1CaUniMB+igQWTmJhswUXcp/Z
hBye9eyHEWDN7vDsKXGZzUOSCqPVCdXetWhrJQFVS6yuoLcBKdH5EEMf6UJ2
RuErk/Gnmo6QEw4px2402mz2iqmJzIuztThrLL6gh0wNABd5JUPptiQQiMR1
ktPuGIMkDHjd8nSqYov1RVRY4Aqqutt7jm2StHeESmHOl0LO/OKe60Q4WMue
FxCzYob0koIwrt+lPQixAjqMEiCEiAiDaTZxQtZRyeGnwGMhirnbbCkdQ7D8
uMieO1TuEnaSwy3qIggIZxQkK2r9UGEX3FkgEAZ6IQyfqPBNAdkkpay8gbMM
q/Amo9c6MlH3GGfvQM7ui4MteZIZECCEwXYPYbMXT9m1tp6ZY3GGuDRZS07D
hY+nZEqzWePqg7xId7iSHRbyaJKm3NROI2KUhoJAg7cvctducK8rhEW9mArc
dawl4dA1FL7O2SyTZxvjJvJ/MqyN6LnSHC1643rxDmlpbzk5qMJ+HMiTN843
JcUNKlFSe47cQnmGqSIBU5O3dMclGFSaMVHGkZzes5O2ERHOPGFMLRF6IAiu
jzQkCdHEU9MksAmh1mGUj2AbVmdhfGWwqdRP1DgrONZpKpbkZlTgD0IR9yxf
Uu305JIU2JU4k/ebAvf4vC5XqsTN04JVSB0MHcVhHnXkhTGvT2BuLdecf27h
Ws1iuU+R1luB/ETNfTYRiJ6ApABRrjlImygL4AQhK4TojIWSa2FH9IaN8HG1
9rBvW9c09M9RZTNH9omJ4LLTWKmAWVJKe6G55mLT5iA5SCr9PaBPU68OGty0
7v2AikrTHucGisRo0bOb8hqzMgW5uAFE7wYDnhrKaHK0kOMbkg3DoJy2651z
u0miAb/tqWwXsSzylXWW7JwiNNT3oHrYpfhncLTYl8hu2NGyHgX7XscunXop
IwDKBd8YgWIrGcDahMUCddG1E58uNRiGpTicZnXGeyySrYgD65oYK6xka7AY
ItTqIrTRj6zfS67inaw/DoyYIhXK/OEqlqyYucKff+9MG1fcOT8iBiUZFfMR
z4g92t5FU2UwGOMPBajoaEKGKFJ70wbRRjaGMa9uQqbsgSGDMafVgTM+6HyH
om5+x3z1sYn5vq+H3zNdO+LkdG80fpd0dlSmOPeLGN8f/Z4MyUls5CA/0ihH
whuAjGM9LGXhYVR4wylBC+B7ujP11LjyY3S0A9+v9TjCySbVL2CDjLnfgZ/j
im0omRrNAhb+N6Z+VKBUMOps6fJYd7ItskudpwjJJAXHiCYNS6+lmKBfywDq
1GzjpfGe4o6O2EYMxqjkJOzAlObsXf5TV7dSopZWf6R0+fvIMloIFzYJs47p
cHnk9jFzHruD8YxWkd0gn2DidD8wuV/IAcHTm8sXijs//hMmpuc4BYUE0G9e
0QEwDrvIF5NMBZeh46+xCGzs8i+UStGesZeWWrWEJv7TxUPRFbJukHhuugEl
LTXAAun4BF58z8kB215DyiBj2C9ntNRyAXc1dERrhbhckfTleBgaGKFGCcaK
BwX7mjK76FDUmud1VOWB9lrZkrCB0VEEzfhixX9Bx/jUwTNzu0M3VnGikNr5
dI3qiBJUkDqbff4xqWxNoZQ/X+XPF9w2IW98n9frXV6VW4UtKzMqo+MDHjYc
OD6KaakEKxwVxFxhNTzQkYpBlUjCa9WhLbaSXe1WK67ms3VFrIrGR9jE1bSn
+UZMCot7zeOhUGDIltFZxdPXLy/ONDpkrwosFFBmzrskSgp5t273jBpuOwj+
8IwST4aWZ5LcUvIzvpwcEDXx2YnZnbcaq50kmr+osMqtxtDO3n3BYejhBKLn
gujP0ekgW8QpUWK1UBI9Vpos3zA1LP8RFwq2GQ/A0q4CeULsDEF3xbEYH/Kw
M2zAs43BjarRSHHc25pr9ab0bHoWzNYbU8JkfGIRNKh34JTh/h6ve56d/IDw
9F8N8SOtEDmC6crMvfh29a7Q8ziUlYRByTJAUOAlqm0psb/Sury0RkeOJPBR
Qi52x2eo6IMPoI0eXCCTKdYAm/PXls8dXKItfIWng4gUp3+9fHVzZslnpYFd
dhYlPQYjUsNPM76NZ2NTYTrDhYK+oAOUnO5giA21/iCpeP8QJ2ttyYiXVsAW
8fCOZfE3kkVP+DsaGTyuLEdaOooDMQF3yrWdrjobn/AJS5bKTiRk5TjlAVPD
vTu9us2vbtG3eH1785LLwQS1OURxQuXNGDs+81IPFKJi6GErt9mpPcp8JrkA
hppoRql03CScxMmTLYJswVJEMCZjJIEr/qhKlPlSy526JYRZOKvr25vz69sL
cP0qzgf33TDQbf2+0SjwBR0eLLNnWh4oqJfWs40sxItnb8BCHD2UpQ+dwm1n
GSUfKP8b7UP588/SjsrxGHmoS8wlhBbPJLUYot1TM/GA76BADXo2jHAkJ/WP
LMAIvJTCeQvDvH0htVlYASTVOqPiHjZOJT657opGjFIwZJRPQwAaAdPiMDVh
LM+OQB0d19VZS5Kcqp8ilmnyygUYlvWxOvRSKFRUOQPPXMg3csIEdhxXMk6V
053evsnfBj/yu0dP/kQFjmD3YMdTuzdl6uJ5271HnJDQ72ihpjpdUKMFo0C2
DmugPNktiAJd6zVpAiyPFZqEcArrlbaeqbDnAdmzgsEop9GmU9/B3opjidPv
dvmqd5gl1mID2gWMGIb556hLSDiOXaHpba2ZD8r/jzH1ZKhR5xuVH+ggx7eP
XHBO6fDdxjRhIrMti53fN2TLGVuD4JX2Hwul6lIsLhVvKo1MJd6CY5F7h+kv
qYp0eAbfoC1LVEjgn5fvFPZjWqWTXARWRDNhNDxu/RlVgQQomHbfsNmE6YnH
Jz59hFRVzoQJ4nIAvhooa00LKleQiM/ZFoJmg6EHwjJ3W8YWO/Ltk2+wVIhq
k3EMraL+5vE3X8n1aK7i+m0KB1gW7FZgQd5JzGnQORxOe3DWOSOsv4Xfuv6Q
tpg4dkb4XItWl002+0hNyNu3Lz6aQtVJNQP3nM0nA4zQznAY3JSlmHOdK5V2
TTQBiPbDJgKjITE6d3xGHKgllS9ec19zU4NK2dwI/kI4H8pQ0x4KdWuOMeGR
iqKcigT4LEFaEsxeBB2OJDA2bvTkGrEggH1dmmCoAIyBHEliLHtMCkWZLiAK
oXb+qIiYTCtaS+/MAXmuVvXBp+0dIu9Co7qPDG/aL8SqF+p8iKUzfASDNKUt
sCha8ZQYwY1ly7hBTHL2SiNTmAJUzoqqqHJTANU1ZveMbhwr9HCWyOiysCJz
+MDuAp+RwBuuUVO+RE2p3Zmw+uMaI0nb5QZWo1nHq5aVCNJm+um3V7kZgE8d
zLM3t/9K9jA54XB0fIHXJMaOvI7fhCGxWJC80VwGKhcrYuOp6F5Q3kSSSsRK
LyO5r4yaeoY59NOXV88o64vnLrLrAnTyp++/pgfQZaupPhoZd1R4t+TzDNGn
jPyJZRnmHCdnjqcOssCMxP2bUi69SzxCYV5rg3oHbM3LN2XuXAQVG9fIaTAq
Dp56TyKm1GGF6wtcim5G54eFAxMyldPNmgApfVK3LL1WjEUHrQ3DLPc1+k/7
HXkrwvjRAzBHToSv9CyomBd7Tgz4FuZG/Gs49s0bDq2A3RZ228lOSWDk9zuq
OYR9P8fNT/iLoUyx3zSTWJxOZRByYIIqntHs4oiwIXSkfyUVcrsOi7prJsED
p5BH9JubdA86+nw0nZ0noxpCozU95xJxGUQuqECEHxr75GxKLy/y2zd6eJkL
Q1OQcrp0qZAyU+mlMx4bQ2UCn03PJCp2HwdMc7XFGye22Pd5WYAbou4meVfM
96QB0J8IhreQzIzUuTWOjxtjhET+JVdxVCYd9oxT5yH9Q+f+cet+pY6MKnLi
uJepgtODfNi+xmJNetz6KHU9kVXn7CshUMYrEF2FB4Ww51+O4uI5m3ynt42P
bh12BZqq2MnRYssu1EdV4fiUzt+wmnYfC/U9UoJG55cRlQpdYqPLybLH58qM
6VzqJmBSzgQzWh5pGwGY1i58rcHj29pyyiYDqbjx19AVa4JbLfyLNTyipGAn
uQ6iwuK8+ZjlUnaj4yODPb8N2qEo6QR3UtxG/s62m7xBWi0cNZWNjszI7b0m
bP0TXWjBiCGqPkJN8DFB0I+KSYJHF+q4HsTO54m/C2SpGj0R05AfwwXPOO8U
mmB+jm4oWUStKNQD/AvsthvePD5gSKAFBfnC6Zhfwl2L5TfH3VQerA+hkv1V
wcl5PlAGHKeHfsNZSQTGeFpYGyl9B5RecTnkUo+XYw84W8PL3SrY8HgFOHLS
XtQCcA+qOMficVCMKOF4EvgdO/0ranEg6CjuWLFyVBOFMwxhBc2ybDBtxAOY
La/Q32zDkIvsUvsMU+lh9j2MgDQ7vXz+/VmGjYqxQDqSKycvgwiDNrv0ab8y
x/QQpzdJuMEQ1OEJS3BzKqIM/aIIfsS1sxvu2eRNtbqTlnzad2gK8gC7lJSf
RrCGCB8QGWzasKVWauIHkZpJ22uG4qalszErCnSDFUMRfIkR3sWRSXzYE759
k5EzDNxUEkaCPk0tnfUmnCo+pAkzcljHSbGcMiMH4uEIPbp0DmaLLIg48CJ7
gZgOVVAfBTJbQvupVRhmDl3z4LDkcW7C0qWfRiQN0w2IsBpsZyfOo1PLxnHH
SzpBSgf8IZZac7FbwNpQrSOjcaO5tICMlCqFBsfECPMNxcWDNUHco4FDC0JU
TMwWMvzmRB4Nd8jKDXjdImzEAETmZ9/f5BBd6OneJ49A0YrvJwiC5HJEmIwA
hJpQA7AskCP03PiTx3i6nTPs0opmCUKjJ92YfcTJvQwJJT584jFJnBzl6e4K
qhiHZ3IqH6XoN93hRbZ+c3NJR9J/BH7RIgVGb4LMDyTnQ3/QRdHEfxCG03kk
HvanXirFhXvQg+RSxTPA2BAe+ZaqsI/ZdDR3TNRf2IMPSPbnob7+Npx8D0bV
nJHgGrXfUOPvN5pWL/nTGzGXjMedTQeXkQ2VQxcHKf0f9QQOx9cMhIHFL+Fg
nJ+bw9qjkxskUcZAgOuCpySAmrRx2sdGOxugq4tewoNtZBlHVbcPvSHMDkYv
iP0XJWz21dOkWsA2jaItji16b4UteCf0zZTpn80u01lz+U7ojhTMHFbOrRuW
L/kAwiQ0OpFXS8LIogGRrA5CVQaE8MQdbIZEEXJkgd5MZ5LF/S3kPLPFA6IX
hS5raIvAoQXXSk8UpFDFLyn8JlOWPhhAa5ElRMBYYuiaeEQTuYuKoeikfUyf
h7SrJglns4vow+rOPv0VRR5crfHLce+xj5IBlVIkUKvEsKt6iHXiOm80BEru
ogLL6x5MfdrMJ+eq6WQr49lJhUBaVpEfl1VIOzwpMvB6niqk7jALNJ2ctSDQ
ZOp96TLtja4FoRLvmkNbChG590h5oAvsMAfJPtTEY88zXCQWEYjdiN4eJsDu
N112X7CvGWvQSntWh0OuQdsRKD8cuwaOzi+LgyAA5eT6Ry1zilB+obybM+of
W21R37lQPCEZH9lxeOFdTR0fTN6UVhm2kKx875YH278voiaGqNzlB5uQsamg
ij7uSq7FiZExtLp9NsN6ZaM+takYA4rUfuaNSjemAgnDUxuGU40sxhVZAwIG
mH/EcIQwcNw6+sQPfTcgDoedegp+vtDn0Rm7vXoeDiMoh4tzFPaiGinaR59R
tLzllzEXM9Kzbtn/8Xp2oolNTsgrehNv7v509pvV7n+y1n1IGX6umoELE0aq
EGsaPkrCjhsvcqBMrlOwrPGAyedUIuyfSeAhN4zou8BseYxnxvGCZAVF4yR8
/sDHVELilEtNWXYpFazp19+feo1KDic90UQmgZxNIxkK2mKVUoCKj0l0CuYi
wwynzW/iNcxuPpjbHNXi4IFmAQMErwvsSQfxQ/FlQfohVtZIRkJVBacw4uxY
yT7w2j9Gyx5VpKSalQPIiWxWgOQiS6RlFr9bJ6enCn+V8v3j8sn5qF8wVx6H
Hpgmu0+FTV6aijCmlG4PoR93BDWFI6mJqi7LLkSPVrZN2/ZUf3/9VBuhICjD
yPSREv8BkSBqwerp8O9Ihzef95WZYiA4kpObcDy1NeaxmsXlMeXBCdpXCEvo
X204UybnY9vDww2cwAKuEdzAXRvhV+LmhlceY1+kXu8kezKVxZLv0YwOFUsj
oKJ3BpLkKqaSq7HmxytH78ontYqTKOMIIzJFHPHsSPdA/ynQ2arAjFdGAEBf
cF3fnjuDTlnHkUZ6yHx9Hh0ema5r8eKvoxdv+jkDiTv8lhs588foYwQtifzM
qtQUEBiTAFlS4b8HnXw6hnyO8UiDSswDfBjh9zVCjtSQuc8nMcF5NKB2t5UD
eI/nE8Bb6lRLLy38qFvEpTZu++vhLWbg34QGc11FjBCoeshR/y9sYbMF3VXp
J2ukGhEu1qGT9/a3ucMCdKFtZcgshlcRBfqn5JFR5PE5OMcCOUZZPv6MsxtE
KqbqbsgF+iXRlwO1qv6kvgyKyLqWptAF/KaHSnvk8z2TAO64JCRa2kXyenQD
qJuHrc65uomfJpHc9lTLyIeUwecrpMbaACurPkqWvvZpLtrkv0gdTGTup3Dr
SIB8ZNXr+DE7dfIEYI9bcFwCJYVTpFik31WSmbGVUTEHdVSood8yE6sNUTvc
SodytWrjAaOTVBfhiUItOojnCN+Gal/+xNJxuVL+ULVVrPOJTgoWR4ELol1Z
KvkUbWyJdrEfuvxZdNmQ7Jfg70qSjw//uoDVXrF/q83CglmM5CKEeyWZO3Zn
TT887VhoPdrQuM8UuFzf3hwXtHxe6VyMy6UQSqYmwiJcKzKHfU+7ZRxm6/8Z
YIhLM7gbGdjVkQdrsrG5qRSZ4tUE06ayWQXmQ92a6RIR2lwGW7rBr2zCZtYm
N0EbGZVkP+ooIE43Q/rsgtFE+aiccp4pDBG5o86riN5z5iR+AIF5iY452Ppo
yfvnZqSQ02T64RmbpBG7KOr9lurgRv6p58ugcz9EXf4hu5Gqucsez3ngWz6A
wRBzhepd0eYPdLb8pndEYg93Zx9mH/Lwn/nnJ69NX/5gZvUVvOu5Lf40IE+I
iT4QPPfB/PaPI/hHUJ/MDv1oPDSbRDssBsTy34fj+OcfNdLVkvVTqxS4rlp+
Okve/DWMdjnK9c+PHLXAvh8oy/1BZxKfhBkkrqoyv33X43SVv8FEfyBF+SHe
MK0ei7SRs1FEHyhv4232Qj9itt1Lf0UCfj11yU1bgbISopWv9Gtdhzw4nBE+
l3qchtqHhZ6ryBDwGG4gne8BFdx2W+xeYP0HriTmsgrurS3hiSTJ2btGSEY5
PzZNX+/rioM3G6n8gzEnaeQwTxx0apwVA514nCH1gcaHuTV64u6LMeTVyoyK
z2pw//SgxrG5oHp0MU/2D6i+ogDr18rU68WVYUGOPf+Lny+lI6zjdsjciYPL
woC7lk1YLnq/aM5K6vXs2PVmVIS+UOCwwYwUELLaKRIzu49fvqMGwbTkp6NO
Z9J4mXZKepMaBYoAId9FkxhC6Nz5sg6JWC3Mm0/jJ+Z3QiOQntxDI+lXyAyv
K8k2rtlpLu8gibvAS9SgcltIFZZhov/37//XS8OuIaTKa/9O8kowCcqnmjJH
OqeW4F0gtnhqj7uzk/aP/IAJ1WfPcYhbV+57tCKXiaFXeyG/frQN5bFxEwHN
+isimR33TAtAGTdLeugkNcz+Zd37QQ+K2tQZf8WBrSl6R3g+9bjONxw6X4l8
mJPs6RfU+IOnIUaIJezyLQBSX6EQVHokQgjsx71+VhNJHVuQ9GCztPCNlC3s
+7ZWq98ewzJyZ90SCU2nh8J8j4KUdnyRPANKTqhuvwc1MR/qzmg/KnH8ZZR5
SkEK6PVLDKM2H55aOMunRpBQ7zFLhlUc1M554rvBXmqysIUGffKcdjkUKb2v
tdtDhHnd+1Xd0BEGbQwk7zBpBy1s7fSzOfsdxw6UXMQ+n3yYSxRuawvJ9Hux
HX90VA/ohca7pqkuNhgKhaqhkwPDA3yYU3q4GYuoSIeUztPUqZtMECDzQYAj
Hjs3Jye0lpNOooceV7EQs2M2+EQLg2UEs0m7dmv81guyRK6YWfo50AQ01U4m
raxijpVa8n0AH3smB2P0SSUQv/qJPH5fyydsyLx6xO7tx6CTSJE/PkIBZE+i
SnLIktK4dY2qYDhqYXzFfQDL2N/Nd9ysSbgpmvaiwvPW1Ao3fCknbOPykEQN
4VNH+jnRia+IkrZ+baz/pLY17oEq6PxY30TFAr8KJmX1I+/b6b1+xmh7EKX2
5zN4wHSeGykfehdJcC3AoQlq6BMme59UzuiW0EfXL368mF5UDdz7cfyFZM42
tR0JMDVnprQQDlJoVTN+1R3LwahwqMRmguD0EaziZ788bffbJQrpfz9Zgefn
TrREiDSKFy7C7+2JEmixhrKtQUP8s/qsl10DW/ms6OWIo363Iku6yi5m/wGL
TRCwyYcAAA==

-->

</rfc>
