<?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.31 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-geng-fantel-fantel-requirements-03" category="std" consensus="true" submissionType="IETF" xml:lang="en" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="Requirements of Fantel">Requirements of Fast Notification for Traffic Engineering and Load Balancing</title>
    <seriesInfo name="Internet-Draft" value="draft-geng-fantel-fantel-requirements-03"/>
    <author initials="X." surname="Geng" fullname="Xuesong Geng">
      <organization>Huawei</organization>
      <address>
        <email>gengxuesong@huawei.com</email>
      </address>
    </author>
    <author initials="J." surname="Dong" fullname="Jie Dong">
      <organization>Huawei</organization>
      <address>
        <email>jie.dong@huawei.com</email>
      </address>
    </author>
    <author initials="Y." surname="Zhu" fullname="Yongqing Zhu">
      <organization>China Telecom</organization>
      <address>
        <email>zhuyq8@chinatelecom.cn</email>
      </address>
    </author>
    <author initials="D." surname="Li" fullname="Dan Li">
      <organization>Tsinghua University</organization>
      <address>
        <email>tolidan@tsinghua.edu.cn</email>
      </address>
    </author>
    <author initials="W." surname="Cheng" fullname="Weiqiang Cheng">
      <organization>China Mobile</organization>
      <address>
        <email>chengweiqiang@chinamobile.com</email>
      </address>
    </author>
    <author initials="C." surname="Liu" fullname="Chang Liu">
      <organization>China Unicom</organization>
      <address>
        <email>liuc131@chinaunicom.cn</email>
      </address>
    </author>
    <date year="2026" month="February" day="27"/>
    <area>Routing Area</area>
    <workgroup>FANTEL</workgroup>
    <abstract>
      <?line 58?>

<t>This document defines the requirements for Fast Notification for Traffic Engineering and Load Balancing (FaNTEL), a mechanism designed to deliver timely network status updates directly from the network device with a change to the device expected to react to it. FaNTEL supports fast failure and congestion notifications, enabling rapid protection switching and dynamic load balancing. By providing low-latency alerts, it helps networks respond quickly to link failures and congestion events, enhancing service reliability and performance.</t>
    </abstract>
  </front>
  <middle>
    <?line 63?>

<section anchor="introduction-to-fast-notification">
      <name>Introduction to Fast Notification</name>
      <section anchor="background-and-motivation">
        <name>Background and Motivation</name>
        <t>In today's increasingly dynamic and complex network environments, efficient traffic management and rapid adaptation to network changes are critical. Traditional network management systems are often limited in their ability to react quickly to sudden traffic shifts, failures, or congestion. As a result, these networks may experience performance degradation, prolonged service disruptions, or inefficient resource utilization.</t>
        <t>The demand for faster, more responsive network management has intensified significantly with the evolution of AI training and reasoning traffic. This new scenario presents unique characteristics, including larger packets (e.g., 4KB), increased overall traffic volume, and a shift towards fewer but larger flows.</t>
        <t>These changes introduce distinct network challenges. Maintaining high performance and availability necessitates high-speed interconnects supporting 200-400 Gbps for GPUs. Furthermore, effective load balancing and congestion control mechanisms are crucial to ensure that these massive, critical data flows are managed efficiently and without interruption. The ability to meet these demands is paramount for optimizing AI workloads and ensuring continuous, high-performance operations.</t>
        <t>Fast Notification for Traffic Engineering and Load Balancing is a mechanism that delivers timely notification of network events (e.g., link failures, congestion, traffic shifts, or load imbalances) to the relevant network nodes. By enabling rapid communication between devices, fast notification facilitates quicker decision-making and faster adjustments to network routing and traffic management strategies.</t>
        <t>The core principle of Fast Notification is to reduce the time it takes for a network node to become aware of a change in its environment and to adjust accordingly. This is achieved through the use of high-priority, low-latency signaling mechanisms that notify nodes of changes in traffic patterns or network conditions almost immediately.</t>
      </section>
      <section anchor="notification-procedure">
        <name>Notification Procedure</name>
        <ul spacing="normal">
          <li>
            <t>Fast Notification Messages: Lightweight messages that convey state changes (such as traffic or network failure events) from one node to others.</t>
          </li>
          <li>
            <t>Notification Propagation Mechanism: A reliable and efficient way to disseminate notifications quickly throughout the network.</t>
          </li>
          <li>
            <t>Triggering Mechanism for Message Sending(out of scope of FaNTEL): A mechanism that detects significant network changes (e.g., link utilization thresholds, delay spikes, packet loss) and initiates the sending of fast notification messages.</t>
          </li>
          <li>
            <t>Action after Receiving the Message(out of scope of FaNTEL): An action (such as rerouting traffic or applying flow control) once the notification is received.</t>
          </li>
        </ul>
        <t>The requirements of FaNTEL focus on the definition of notifications and their corresponding propagation mechanisms. The methods for triggering notifications and the actions taken upon receiving these notifications, whether through existing solutions or new protocol extensions, are out of scope for this document.</t>
        <t>The mechanisms that are out of the scope of current notification requirements could be implemented using existing solutions.</t>
        <ul empty="true">
          <li>
            <t>Note: The detailed mechanisms and implementations (such as message format, propagation protocols) are out of scope of this document and will be specified in separate documents.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="fast-notification-for-load-balancing">
      <name>Fast Notification for Load Balancing</name>
      <section anchor="background-challenges-in-load-balancing">
        <name>Background: Challenges in Load Balancing</name>
        <t>Load balancing is a critical function in AI networks, ensuring that network resources are efficiently allocated and that no single node or link becomes overwhelmed with excessive traffic. Proper load balancing improves network performance, prevents bottlenecks, and ensures that network services remain responsive and reliable.</t>
        <t>However, current load balancing techniques face significant challenges in highly dynamic environments. One of the core issues is the lack of timely awareness and adaptive response to network state changes. Traditional mechanisms often rely on periodic global state synchronization or static policies, which results in delayed and inaccurate decision-making. These delays make it difficult to capture instantaneous changes such as link congestion, node failures, or traffic bursts.</t>
        <t>Moreover, load balancing decisions based on local views cannot perceive downstream contention or routing fluctuations, potentially leading to persistent traffic injection into congested paths and increased queuing and packet loss.</t>
        <t>Fast Notification is supposed to support load balancing by providing fast, efficient notification of changes in traffic patterns, network failures, and congestion. By using high-priority, low-latency messages, Fast Notification allows network nodes to immediately adjust their load balancing decisions in response to these changes, ensuring optimal resource utilization and performance.</t>
      </section>
      <section anchor="requirements-for-fast-notification-in-load-balancing">
        <name>Requirements for Fast Notification in Load Balancing</name>
        <ol spacing="normal" type="1"><li>
            <t>Traffic State Detection: Monitoring of traffic patterns, link utilization, and node load to trigger notifications on significant deviations.</t>
          </li>
          <li>
            <t>Notification Propagation: Propagation from congestion node with event details (e.g., congestion, traffic shift) to relevant devices.</t>
          </li>
          <li>
            <t>Action Adjustments: Nodes can reroute or redistribute traffic immediately upon receiving a notification.</t>
          </li>
        </ol>
        <t>Once a fast notification message is received, the load balancing mechanism is supposed to immediately reassess the routing and traffic allocation strategy. This may involve:</t>
        <ul spacing="normal">
          <li>
            <t>Shifting flows to underutilized paths</t>
          </li>
          <li>
            <t>Splitting traffic across multiple paths</t>
          </li>
          <li>
            <t>Throttling traffic destined for congested regions</t>
          </li>
        </ul>
        <t>In addition, nodes may update their local state or forward the notification upstream to further optimize the network reaction. Timely and coordinated response across the network significantly enhances load balancing effectiveness.</t>
      </section>
      <section anchor="design-gaols">
        <name>Design Gaols</name>
        <ul spacing="normal">
          <li>
            <t>Traffic Information in time: Fast notification provides up-to-date information about the current state of the network, including traffic volume, node utilization, and link load.</t>
          </li>
          <li>
            <t>Precise Load Rebalancing: Enables immediate notifications to the affected nodes for quick traffic redistribution.</t>
          </li>
          <li>
            <t>Optimized Resource Utilization: Supports fine-grained traffic distribution on a per-packet or per-flow basis.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="fast-notification-for-protection">
      <name>Fast Notification for Protection</name>
      <section anchor="background-challenges-in-network-protection">
        <name>Background: Challenges in Network Protection</name>
        <t>Network protection ensures service availability and minimizes disruptions due to failures like link outages or device malfunctions. However, traditional protection mechanisms face several limitations:</t>
        <ul spacing="normal">
          <li>
            <t>Slow Detection and Recovery: Traditional protection often relies on periodic failure detection and centralized rerouting, resulting in recovery times that are not fast enough for modern service expectations.</t>
          </li>
          <li>
            <t>Inefficient Failover: Without fast notification, failover paths may not be activated or optimized in time, leading to service interruption.</t>
          </li>
        </ul>
        <t>In high-reliability scenarios, network protection must be capable of rapid detection and notification of failures to meet performance goals such as sub-50ms recovery.</t>
        <t>Fast Notification enables rapid notification of failures, allowing near-instantaneous and dynamic protection responses, minimizing user impact.</t>
      </section>
      <section anchor="requirements-for-fast-notification-in-protection">
        <name>Requirements for Fast Notification in Protection</name>
        <ol spacing="normal" type="1"><li>
            <t>Failure Detection and Notification: Notifications are generated when failures occur and propagated directly from failed node to the relevant respond node.</t>
          </li>
          <li>
            <t>Precise Notification Propagation: Notifications must reach relevant nodes quickly, such as upstream routers.</t>
          </li>
          <li>
            <t>Optimization of Backup Paths: Failure notifications can trigger optimized rerouting or pre-established backup path activation.</t>
          </li>
        </ol>
        <t>Upon receiving a notification of failure, protection mechanisms may immediately switch to backup paths, reroute traffic, or suppress affected routes. This ensures minimal disruption and quick recovery. Coordinated response strategies may include upstream node notification, service-aware failover, and path re-optimization based on updated network topology.</t>
      </section>
      <section anchor="design-gaols-1">
        <name>Design Gaols</name>
        <ul spacing="normal">
          <li>
            <t>Rapid Failure Response: Enables sub-second (or even sub-50ms) reaction to failures.</t>
          </li>
          <li>
            <t>Improved Service Continuity: Minimizes traffic loss and recovery time.</t>
          </li>
          <li>
            <t>Efficient Resource Utilization: Ensures backup resources are used only when needed, and in the most optimal way.</t>
          </li>
        </ul>
      </section>
      <section anchor="integration-requirements-with-existing-protection-mechanisms">
        <name>Integration Requirements with Existing Protection Mechanisms</name>
        <t>Fast Notification can be integrated with various existing protection schemes to improve their responsiveness and efficiency:</t>
        <ul spacing="normal">
          <li>
            <t>Fast Reroute (FRR): Fast notification enhances FRR by delivering failure notifications almost instantaneously, allowing for faster and more efficient rerouting of traffic. This helps maintain high availability and minimizes service disruption.</t>
          </li>
          <li>
            <t>Hot Stand-by: Fast notification complements Routing Protocol Convergence protocols by providing fast failure notifications, ensuring that devices can quickly switch to backup paths and maintain service continuity.</t>
          </li>
          <li>
            <t>Multi-Path Routing: In networks using ECMP or other multi-path routing protocols, fast notification enables the immediate re-adjustment of traffic flows when a failure is detected, ensuring optimal use of available paths.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="fast-notification-for-flow-control">
      <name>Fast Notification for Flow Control</name>
      <section anchor="background-challenges-in-flow-control">
        <name>Background: Challenges in Flow Control</name>
        <t>Fast Notification enhances flow control by providing a fast, low-latency notification system that can detect and alert network devices to congestion events in time. With Fast Notification, congestion can be identified and communicated to relevant network nodes almost instantaneously, allowing for rapid mitigation actions such as traffic rerouting, rate limiting, or queuing adjustments.</t>
        <t>Note: Unlike traditional host-to-host (end-to-end) flow control mechanisms at the transport layer (e.g., TCP), this document focuses on Layer 3 (network layer) flow control. Specifically, it targets congestion control and buffering actions between adjacent network nodes, enabling upstream nodes to slow down or buffer traffic in response to downstream congestion.</t>
        <t>A key challenge in flow control is the timely detection and dissemination of congestion events to avoid packet loss and throughput degradation. Traditional flow control mechanisms often rely on delayed feedback or reactive responses, which can lead to suboptimal network performance in highly dynamic environments.</t>
      </section>
      <section anchor="requirements-for-fast-notification-in-flow-control">
        <name>Requirements for Fast Notification in Flow Control</name>
        <t>The integration of Fast Notification into flow control mechanisms involves several key processes:</t>
        <ol spacing="normal" type="1"><li>
            <t>Congestion Detection: Network devices continuously monitor traffic flows and link usage to identify potential congestion points. When congestion is detected, a notification is generated and sent through the Fast Notification system. These notifications include critical information, such as the affected link or device, the severity of the congestion, and the current traffic load.</t>
          </li>
          <li>
            <t>Notification Propagation: Once the congestion event is detected, the Fast Notification system quickly propagates this information upstream to adjacent nodes that may contribute to the congestion. This enables upstream nodes to take appropriate actions, such as rate limiting or buffering.</t>
          </li>
          <li>
            <t>Backpressure and Buffering: Instead of relying solely on rerouting or end-to-end rate control, this approach allows upstream network nodes to apply backpressure by slowing down traffic forwarding or buffering packets locally. This helps to absorb traffic bursts and prevent packet loss downstream.</t>
          </li>
        </ol>
      </section>
      <section anchor="design-gaols-2">
        <name>Design Gaols</name>
        <ul spacing="normal">
          <li>
            <t>Congestion Detection: Fast Notification delivers updates about network conditions, enabling relevant network nodes to know the congestion as soon as it occurs. This ensures that corrective actions can be taken promptly before the congestion worsens.</t>
          </li>
          <li>
            <t>Adaptive Node-to-Node Congestion Management: Fast Notification enables adaptive congestion management at the network node level by allowing nodes to dynamically adjust forwarding behavior and buffer usage in response to congestion notifications from downstream nodes.</t>
          </li>
          <li>
            <t>Minimized Packet Loss: By enabling fast congestion alerts within the network, Fast Notification helps avoid packet loss by triggering corrective actions such as backpressure and flow rate adjustments upstream, before congestion reaches critical levels.</t>
          </li>
        </ul>
      </section>
      <section anchor="integration-with-existing-flow-control-mechanisms">
        <name>Integration with Existing Flow Control Mechanisms</name>
        <t>Fast Notification can be integrated with existing flow control strategies to improve their responsiveness and efficiency:</t>
        <ul spacing="normal">
          <li>
            <t>Transport Layer Flow Control (for example: TCP): Fast Notification is distinct from traditional TCP flow control, which operates end-to-end between hosts. TCP reacts to congestion signals that are often delayed due to network round-trip times.</t>
          </li>
          <li>
            <t>Layer 3 Node-to-Node Flow Control: The mechanism proposed here focuses on adjacent network nodes cooperating via Fast Notification to perform rapid congestion signaling and buffering. This reduces reaction time and improves network stability in dynamic environments.</t>
          </li>
          <li>
            <t>Explicit Congestion Notification (ECN): Fast Notification can complement ECN by providing more granular, rapid updates on congestion status within the network fabric, allowing quicker local reactions beyond the transport layer.</t>
          </li>
        </ul>
      </section>
      <section anchor="illustration-host-to-host-vs-node-to-node-flow-control">
        <name>Illustration: Host-to-Host vs Node-to-Node Flow Control</name>
        <artwork><![CDATA[
           HostA ---- Node1 ---- Node2 ---- Node3 ---- HostB
           |                                             |
                   |=====================data===================>|
TCP        |                                             |
Flow       |<+++++++++++++please slow down+++++++++++++++|
Control    |                                             |
           |---------------------data------------------->|
                   

                   |=====================data===================>|
Network    |            |<-slowdown--|                   |
Flow       |===========>|--------------------------------|
Control    ||<-slowdown-|                                |
           |---------------------data------------------->|

]]></artwork>
      </section>
    </section>
    <section anchor="fast-notification-for-capability-announcement">
      <name>Fast Notification for Capability Announcement</name>
      <t>In addition to conveying failure or performance-related events, there is a potential need for a lightweight mechanism to announce certain network capabilities that are not directly related to routing.</t>
      <t>Specifically:</t>
      <ul spacing="normal">
        <li>
          <t>Some types of network capability information (e.g., processing features, service functions, queuing models, etc.) may need to be announced among network nodes;</t>
        </li>
        <li>
          <t>These types of information are not suitable for distribution via existing IGP or BGP mechanisms, either due to scope, frequency, or protocol constraints;</t>
        </li>
      </ul>
      <t>While this document does not define specific mechanisms, it highlights the potential requirement for fast, low-overhead notifications to convey such capability announcements across devices.</t>
      <t>Further analysis and definition of this use case is TBD.</t>
    </section>
    <section anchor="scope-of-notification-mechanism-definition">
      <name>Scope of Notification Mechanism Definition</name>
      <t>To support fast and reliable notification in network systems, it is important to clearly define the boundary of what needs to be standardized or further specified. This section identifies components that fall within the scope of the notification mechanism and those that are explicitly out of scope, in order to guide future work and maintain modularity.</t>
      <section anchor="out-of-scope-elements">
        <name>Out-of-Scope Elements</name>
        <t>The following components are considered outside the scope of the notification mechanism definition. These elements are assumed to be supported by existing technologies, protocols, or implementation practices:</t>
        <ul spacing="normal">
          <li>
            <t>Trigger Event Mechanism: The process of detecting network events (such as link failure, persistent congestion, or threshold violations in delay/loss) and deciding when to send a notification. This function is typically handled by existing telemetry systems, performance monitoring tools, or alarm-based threshold mechanisms.</t>
          </li>
          <li>
            <t>Action Mechanism: The logic that determines and executes the response after a notification is received (e.g., traffic rerouting, congestion control, or flow prioritization). As this is deployment-specific and closely tied to the control or management plane behavior, it is outside the scope of this document.</t>
          </li>
        </ul>
      </section>
      <section anchor="in-scope-aspects-and-potential-work">
        <name>In-Scope Aspects and Potential Work</name>
        <t>The following aspects are considered within the scope of the Fantel notification mechanism and may require further specification:</t>
        <section anchor="notification-format">
          <name>Notification Format</name>
          <t>The encoding format for notifications must be compact, extensible, and interoperable to ensure efficiency across diverse implementations. Candidate approaches include:</t>
          <ul spacing="normal">
            <li>
              <t>TLV-Based Notification: A Type-Length-Value structure allowing flexible expression of notification content while supporting forward compatibility.</t>
            </li>
            <li>
              <t>OPAQUE-Based Notification Structur: Notification encoding structures may draw inspiration from mechanisms defined in [RFC 5250] or similar OPAQUE models used for flexible and structured signaling. Reuse or adaptation of such formats may enhance compatibility and extensibility.</t>
            </li>
          </ul>
        </section>
        <section anchor="notification-content">
          <name>Notification Content</name>
          <t>Notification messages must provide enough information to convey relevant network conditions, which may include:</t>
          <ul spacing="normal">
            <li>
              <t>Network State Information: Metrics such as interface status, delay measurements, packet loss ratios, queue depth, or congestion indicators. The applicable granularity may depend on whether the information is interface-, path-, or flow-specific.</t>
            </li>
            <li>
              <t>Optional Capability Advertisement: Nodes may include information about their supported notification handling capabilities or processing constraints to allow the receiver to make more informed decisions.</t>
            </li>
          </ul>
        </section>
        <section anchor="notification-propagation-and-scope">
          <name>Notification Propagation and Scope</name>
          <t>The delivery scope and propagation mechanism of notifications must strike a balance between speed and scalability:</t>
          <ul spacing="normal">
            <li>
              <t>Point-to-Point (P2P): Delivery to a directly connected neighbor or designated next-hop.</t>
            </li>
            <li>
              <t>Point-to-Multipoint (P2MP): Dissemination to a selected set of nodes, for example along a service or forwarding path.</t>
            </li>
            <li>
              <t>Scoped Flooding or Domain-wide Broadcast: Delivery to all nodes in a defined region or domain. Suitable for critical events, though special attention must be paid to control overhead and duplication.</t>
            </li>
          </ul>
          <t>These in-scope aspects form the foundation for standardizing a modular and interoperable notification mechanism within the Fantel framework. By focusing on propagation procedures and message format while leveraging existing technologies for detection and reaction, the architecture supports fast and reliable awareness of performance-impacting events across the network.</t>
        </section>
      </section>
    </section>
    <section anchor="summary">
      <name>Summary</name>
      <t>This document defines the requirements for Fast Notification for Traffic Engineering and Load Balancing (FaNTEL), focusing on the role of fast notification.</t>
      <t>It outlines how fast notification can be applied in four key areas:</t>
      <ul spacing="normal">
        <li>
          <t>Load Balancing: Enables rapid dissemination of network state to assist in balancing traffic across multiple paths, improving utilization and responsiveness.</t>
        </li>
        <li>
          <t>Protection: Facilitates fast awareness of link or node failures, supporting quicker protection switching and reduced traffic loss.</t>
        </li>
        <li>
          <t>Flow Control: Helps inform upstream nodes of downstream congestion or performance degradation, enabling timely traffic shaping or rate adjustment.</t>
        </li>
        <li>
          <t>Capability Announcement: Supports lightweight and flexible notification of node or service capabilities (e.g., processing features or queue models), which may not be efficiently handled by existing routing protocols.</t>
        </li>
      </ul>
      <t>The document emphasizes core requirements such as notification message structure, delivery scope, and interoperability, which could be defined in following work, while keeping trigger detection and action logic out of scope.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-informative-references">
      <name>Informative References</name>
      <reference anchor="RFC3168">
        <front>
          <title>The Addition of Explicit Congestion Notification (ECN) to IP</title>
          <author fullname="K. Ramakrishnan" initials="K." surname="Ramakrishnan"/>
          <author fullname="S. Floyd" initials="S." surname="Floyd"/>
          <author fullname="D. Black" initials="D." surname="Black"/>
          <date month="September" year="2001"/>
          <abstract>
            <t>This memo specifies the incorporation of ECN (Explicit Congestion Notification) to TCP and IP, including ECN's use of two bits in the IP header. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="3168"/>
        <seriesInfo name="DOI" value="10.17487/RFC3168"/>
      </reference>
      <reference anchor="RFC5880">
        <front>
          <title>Bidirectional Forwarding Detection (BFD)</title>
          <author fullname="D. Katz" initials="D." surname="Katz"/>
          <author fullname="D. Ward" initials="D." surname="Ward"/>
          <date month="June" year="2010"/>
          <abstract>
            <t>This document describes a protocol intended to detect faults in the bidirectional path between two forwarding engines, including interfaces, data link(s), and to the extent possible the forwarding engines themselves, with potentially very low latency. It operates independently of media, data protocols, and routing protocols. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="5880"/>
        <seriesInfo name="DOI" value="10.17487/RFC5880"/>
      </reference>
      <reference anchor="RFC7490">
        <front>
          <title>Remote Loop-Free Alternate (LFA) Fast Reroute (FRR)</title>
          <author fullname="S. Bryant" initials="S." surname="Bryant"/>
          <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
          <author fullname="S. Previdi" initials="S." surname="Previdi"/>
          <author fullname="M. Shand" initials="M." surname="Shand"/>
          <author fullname="N. So" initials="N." surname="So"/>
          <date month="April" year="2015"/>
          <abstract>
            <t>This document describes an extension to the basic IP fast reroute mechanism, described in RFC 5286, that provides additional backup connectivity for point-to-point link failures when none can be provided by the basic mechanisms.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7490"/>
        <seriesInfo name="DOI" value="10.17487/RFC7490"/>
      </reference>
    </references>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8Vca5PcxnX9Pr8CVfkQsjyYUJRlyxPH5eWSlOiQ1IZcWXZS
qRQG6JlpE48RGtjlqFT+7Tn30Y1uDJayrVSFpdLOA2jcvs9zHz15nq/cULTV
/xR115ptNvSjWZXFYA5df95mbqhWbtw11jnbtbfnEy559eL25cqeer7YDU+f
PPnNk6erumgP28y0q9VghxqXvTPfj7Y3jWkHl3X77GXhhuxtN9i9xfpYLdt3
fXbbF3t8kL1oD7Y1prftIQM52euuqLJnBVYt8dGq2O16c7e0aDuYelV1ZVs0
eGiF5Yb8YNpDvuev/J8+ujF/8vmq27muNoNx29V4qgp+8U8ZvdhmT588/VX+
5Gn+9NfZalX0psBzu3Eg0q7wbnXf9R8OfTeettnLq7e3L17jqnE4dv12tcry
VZbZ1m2zP22yr0AH3gppfxqN67CEftj1h6K1PzAnttnXY3FvLD42TWHrbUY7
+Cg3/P7I323KrolW/8Mme95Fq//BGv/Bp1f+izWb6sFl/7zJ/vM4hlX/jAu/
p33Lh+nK10fbFtmtqQ2v4R/ww3E8f//l70v6dpAvN2WbRQ95vsle2/CM50Ur
b9PVbx2eCxqzb1t7Z3pnh/P0jKGrbVW0vx/0oo2pRjwkesZ3G9AXs/87Y7+3
0NHw8dJm3nQ7W5vpOSVde693ypYavmTGtmva0cS26yM9SD5Zegy2lLCstmP5
2eefyQNG/pJ2s1rZFjbS4N47s8Xl715ef/7Zr77Ul198+eUTffnrX/4GL1er
PM+zYueGviiH1er2aF0G0xhJ67PK7GFhLhuOJoutgc3w5xhn9uhlQVbweJ0V
WWNKbN66Bs9z9tCaCsLC65qEmA22MfU5a81ANgTvUgyjy9QAswoklQO+3/dd
w3T6CytzZ0uT3dvhiGfQEw6G1qVr9Dvz8YSb5XEw0nKgF3bYZEJc5sbTqetp
u7TVPfg+9oZ3U0LJjeNNtxEH3BrerNjVtMO+ONkqO/XdgGfQhQ6kkLSEH9UZ
cgefauLLzvNlkz070z13tqIL6+4+r7HPtjxnRW1Ayhr0ZUdTn5zfqAPp7tRh
Scin/ABWYBOg4IMn2M0pNnckQyL1qNJwpmeG9OB5AV2F4fBNJ9OzMrWl2aiq
NLaqoO4reL5X7dB31Si7w0MvFAIX/RNkXrLnw3K05Bt8f6ffvqLbquL8zw4m
UUICZJrYgOeN0N2cavMxiNW0d7bv2ka3QLpmSVUH1TsQWxxYS/l2kUJRFaeh
8HT6pUQnwB4IteztAKrrDSlwZenSog5XRou6sxtMIzd1e4gGvG4sKZFtSbds
n3kOBq2KBOPGqsI9nlp3tHvahxfVGrYfiWqTXeFJJOCxHta0vDOT3JvizCrc
gwEQXiQsKPgB2+Adr0mfalqyCnKurOvHk2osnghLDYzEw7qxx0WIXrU6oQ05
Blq1IZ6SmZNFmH6dNV1vVAEdzHWJY8eCxAtOOSgGEQETZxVpyW7ZPskmzV1X
jywixOirV8Qi23prId3o+J1yDnIiT9Wa+8yVsLnedtgn2EPeCe7w+9GQfMmp
gT9gZkmm05b1KIZV9Af4lhN00+CGR2Zz2KyzX/77s8drr4qgtIP/Keo6SIso
bMyaKSpEdpDpfdFXcBHmHgvuxsGvvYfxOmGcM0HXrNoMywDwANoRqWNdG7pq
k73B3gfd/9Eejolw+fF30BivaK0pDcDWwB6RLs/dybBGYvPQJnyPTao3oyWB
v/JfPnmSfbU7iS//6uZbPPXl2EMSPcmUTYscF2Sauqi5N8FLbKmevLg3qLG0
MCHoPCRPfnM4FoOqcFM40pZ1MDtCUYWwjO8W9akm+67FIZG2AFbJzlSFSRVM
bHSNMf5BorFgu4OsewTiEQpJG+5wa2N/YHz2KiP+0y7FVTK99A1tzbZjN0J3
mK2xFDq8EacPIf+sWGhdEgSZTxr9XAh/8dowkOAO2Zd7BU7c/jqS0vrC44A8
lqttRLLGPfbREVHA3ME6w0PariKlRGiaRTc454awh5C1w+UGzk2iK3s1cCWh
fF+UJCZWVPaKMJTKlJYyhbwpPngOiXuB3/4LsgWBHJHj7hVZ05ULfp+wDJIR
a9T8QCZU6gT2lxaxZDmxsE78NdsmcYEYT8F2KD4YMZIiYQhdviOkCt27l2gw
4QzEAguao2AlxHa6pawoQVTF4U5dGWkB4AEEiuuO2OJB/OLoeGnRP7g5WMx5
nSADcqgFSyWyQdYi5v1Z5EeLTF4o8O1UDOB060ghgicCmuAQCJLqpgO5tmlM
ZQmbnzcc1RPe3fRdCcb1gAX5AmvfwDlBNsC8r7EJ6Aj9H7TKp0IpHnlnzozu
Jmf5yI0lwJsLxEY0ejQmBvBY8B/S0SCbjlwZNCC/oPVUHDxhyq5tdqXYpxb3
OoXD+4J9Cry1Mw2nJynim4K7yIy8UwRD6fm3vT0cxPrDE1mhlDHZe9OSKjyi
eyElV8K3iJYyRibqLtzDID59iqUXsCb2CVEsJ0KNO3Z1BQuFm8H+3Ml+IHuV
cAjdcmAosQEBaLBsrLQlJ2QSZZeW7cVJG74SSIi0Gjb8DsHJ3nHoxhq65U9s
FffJ7UH6vfEGH+lBcTrVZ/qMgoYPQo+hAWq+7cy4eybDVOoS+ouiACP+PTIf
vG81S9gzA9TjJlJna2a0BztWAE7UnCL1mqxRQlRjELwq8SXDpBOLCysTHLuf
FukO1utjTjozzzzuj4ZUPjgP85ERBtC9Aiu18XtOSroSMdt8ZFjGt7MLi6XC
ZMbpoLJu7mSiG1lLvEjLEYxpZ2qS8L3sxhrIAu6SMD59Bt83UhKwQDye/jsy
ZeTKgkWBj2pcH+MOUlm/lPIzaJEqaCbZ8TqRlGcIqf2cDbytOCkWHAJYCMKB
s0pBtXCpzhDGgIPwlxLNyJOWwcGsWpWmSlwPUDRIS88vfp1CMkYQAUvtx1Ys
CDcC3Ph8YT0BGwkOPpoq4BfklSCuuu6orlepVnJEyThJUz9LKIL8iwRCx4gZ
elgjWgiyNx8ZmgJFBuBOHtj0c1QJuSHtNSGtjREvCUuBzq4bBrDFlLSfANZ8
FAlFAslzyOoboOg4QZFsQlw9xPN1d4+Vkch4bZ2RBTd75GyCigBwLbHDLRMR
UYCOctc4T91k37TG2weDEUQTWtKKY60hd/5asB7DiRZsE6RPuStRrpswMRJK
4mWau0Z2IXlqT2uTssPtdBVIPNQdNqpruHNbwnH4shNJlr4ghNDVpBHsYSxs
SbJR3jOHD1UPxMYSTGT9TxEdez8G47ia0tYPDKwqS/qApWhDJTZJ4dy2VFrG
fwaoO4Qyb8OsazGqZSVMkmcfInZj79gA34DfHYt4JlpPJZRKsj2k8h3Zz501
SEMgYngu4hYHDhj1PWhDZthwtIFclU0+OO3rsRxG741PHV8CDTlntSk4OGCf
JypLuiGuWNj2L8bbK3FCtgeCAM2O6tRCSgpNHD30jcL1YgpiNedzUuHS/G/O
hl1ccKK4HldV5mnHJwDkeg7N1EDjagYyCHHvn0CzHkisF/wmOaR7l+YlXLOb
4KkH2BKcHxT55BR8UXBK0iNHyWkiVGKpKLJQIYMPf/fTZdIFf/7ZJiSL79kc
nxstG26zNzDKoesVeV2yfQ7whO1sGbx92p6gjRnUoJpk5M4obfMJ7dPNg6h5
m0Boht1JNbTSmis7bA3TAYw+mJE+luxLE0/NIDerzzceTF5NqeAWtJHgQbVi
Qw5EyN1gWb3d0ftgXJFmzEBUkbAD0vuGiysPY9sYRq7FcafqNYH0menFVJAh
O3LunGovZLIadblkLJmsTxGp4Gfbu66m0j5w9nvinMfAbAiADqYXXfAOhK47
IedOAHRR9vAaWQPvyymxv/IWIQABNr60InlRTX4/lSYNxdADqQoXcYtKos5a
LZLolAJ9MMMyBBoqHnY9Fc0ucfp4Ug+LreylGOUrNSYp7nNdVWo/GjPZ03BK
XQh5aty60/jmtAApVXBQPRNmqH9RJBbbfs7tieyrAkhxxYmdsOiVb7mIcVMY
34rdJ7sTN2uoeZEPXc78sdGtxc4njx6MKMf2MflxGXNemGTru3AF7CBod5Sb
3fTkA414oHcm7HebvaDaDvl2r6wzd6HVoYL5YiqVNWkFp8CBmMgO2a7y7BsV
IT1Q/ei3E5Hb7H3os0DR8gMVfs1kD/Fq5LMKcrq5Bj88nd5xEogwbj8JuW9C
M+Yn4PZb1ZT4Bv9Z1NHx2NOX1ZOiLHG+Qf5IG3dxxT2rRo45oT1TI/sWIUH+
XBLpet+iQvDxcB74LqDVIQJ6EUER5hO0ariCLS0KEaM4DmJXCDFMKtJ0Qknn
bQIio7UDiLTGJTDSV2KqZL0S+otHs9RDAr9W8MiAn30xP5MtJsomCXexFzYt
Z7Ikuwba1reB1dK68+EqhwlOoOUlCKJ1t9l3Wi6+cOnScaGLFGWRy6LH7iTz
vmMnMtWJtb1jycgiNOepScrR7BIZ4MTtNN+liHBSLDiCLHg2YDDXoGDyUmFN
mTqHY0GFfNU7LlAfuqKeoLMbd/kXTxoXmL4IGY36AHn4Q49bCxDj4oUp+jwF
7XF3M9qi98i4W82C7h/BQsr9wPS/Bz/FhvnZhiVOKpiqdHzTNnknqe4Brr1n
QSNlbSdmdpTHCLpTpINL0kbzXmoPvtaYVM19O5a+ZCTlXe7DiCqljZWBItwx
KsWzs9Va4zpINQRMRkG9ICZ1t0Fs5OfGU3ZDir4NvEqdO2EpjxInnZ8qb+Rn
e5Mj9lMDwB0NhUpeluzH24yo/7efwlmRHq0fcF0McyLEJI1zrrdPj3TrgP00
UHD6R6ir59TZhym+ximC8h6bNZDaTsEts7wlkAULya6XEMXUXlBARtHYTKJg
pUidjfqJXBoF3vWsNYsbSM55F0stZKQCo6rgM4YO6Xh3OC8Dkndstl7C75Ti
KbSTE3CGyvvZIzCLIHpwDI8DqIqDE/tWKc1U2Xt1d9fSF4NbQ3YSQpyP15SP
apklcu+00IvgopdxwAuVjoo5LUyNwhFqGZO1tsZUBMMlPWYL5E6Fz9juC+XR
K/jmg3TqUufCWcoLX2ecPMpUpHdLLpIsZScu/6Degxa6I+cO7xcKl/HkR3k0
jc9UmZeKi6e6VCj3+DBWnrehm/JOFf3Ry3fvHi8hy4BhcQEl9No9lIx+ydx9
Wyd23ORXgl+fevwCZLq4NBj7hf2sIy+zKY32r6V5/QlcdDmRQIryNSLxexox
zHfnpf3KUIiI0Y/Z3fii9jW1kvqDzET4wu5lmWOZM/MiqWaiLHXf6Vn2R7Ix
v2+/rzKYCu3rDWGfnByxJ3sL/ZwmOqQ48uL6zQ1jD85/OEfLxUvoVsOullqs
PoSTRUxQHg5maqbGdQRJHdmkisASKndzKCULuyiGaEdSpeqzx08B75eEN6+l
R/MT0Du9dAmhqKrHfZ9UuoWWseKqUsIimeHRxmPR6l6l2kpTVrMZMjbci/kp
Dwg3jDIvN75OhiTUaVRUE+R+gc42afvcz6AtNd7/NmMVxAaYb7Uy4xtI8x5q
DMZJMzg34LecyWl5caq2QK7Sdfm25UQlTj2OoItSWfqbPTKwV7zBn8epdOIW
jSS4WKR1Uo0szlByLQ/dXt88Xs/aLdySk5TjNV/7efbI84dvTh+2yd5LT6ak
0utaOvjwBtxuuhhaISnsRkAFmc1QlvlBBnChKM1cHtGMXxLzWU0ckUKlYuKm
rBwVepOaY1pQ9jXS1eoq+2DOU3OBbku4qU0DbRakCcLUpvYF2wu1pRmEu84m
5WPt73Df8DQO8fhY2lR4SKxph8G3BfaI0TvubfQKLqI2RugnkG1QTiU16p33
Mgt9oJ9qs6z+jgwi9TPUUbQRUFgeEaHy/EMc0LqcCzk3CfFEgxFU7dtymnI9
CSOq776dOZtp6gj7bKT4O3PXoaozcl2ScIV4lvPUd4hFf+ost6G+IzcffZ74
+RlOx3dTgkQPdNy0iCZTLjkkjtX3e1LI4XFyaFNGpa8poUkqTFIT8bWQtQ4h
ELABjgjttKmi7Hvnvnw2IVKqfX26qP2NHxyYW0zKpE/tOwCEkDY68WVxkS8u
cU7+RdwHxSNKKVi9tI7dzYgKiYxE+UsPRAMDNB0BGnoO/erVJh4nbn/yU9Sp
W1H+SMGZkyg/7fzMf09oBTuFrVKBwsgABh2KELtP0sUpGsgD1WbUvTOBlOFq
S2fax7y3w4MejLQCTYj2TkMfu9pgHFJXnu8qjHlyGToMXAlSpSfsXNfvZp1D
zf9FBWJXOblt9TfzJGzZyi+VJoz4+Vl2qf9eDmHFQ+XLCAGb+NDCL830l8o+
nfxFGOSyxjwR1uGrvtdZTx8CFbDI9AlE1Zyo9rEz+66/MBMQAt9A7jfPrny3
mlo0JH/6G7PkTZjTW+KJV+vQ9I4eE092JzNW2uuCqBgITrUpzxsNFtyL1fZg
pCo7cyzubNdHYED96ixgPzT0LyWhKJzLvCSxw2fHVXYjKvQaKrRNJikZwcdC
4zl/Tio1rw2F/0t+iQ5fxnOwIZowWpCv9wW7ua1zfGODjYcvvXmuvQpEBHOl
iuKWd+wsCR+N4/Q7zbjjCPyP5dwh106CclSf+QcS7tuATAVtJlQ+IjhhPhaU
fW4ZrS4psXXTcLccS4kQFG5KyPUoSMaJjYv9psehBK/JcHErw6h5QiIDoPE4
FsMxD8O03xBNz9IjenuSujsrqofWidnGe99myewXxzhubyJHNTFIXwbN1JyT
gWmI684WC2yT6QiKlGG6eLZD3ymd4pU4M5nadVEBi2Z3dRosnSqi+qXUIWh8
ZRlE5tDRE828DLHjSmh99OL67aLsSVOn6gRS+bdpbsqFFOhwO9ZFv9aN+gDQ
JeBMTzpdOgK4jF1P9c7g6fwotfRZPRsokTl3iolmGZe3zroe2V44Rn2t6Rz9
ze7cw8qwWv31r39drbLpH91yleV0Qoiu/mx6+XR6+bm8pGufxTf/mP09/35c
LX34b0v/6FTBwse/+3FFtvQPPp0ZoW9++4v4H6ReUIHY54C/SP/9uPJ+5Oft
+cd86R/tdeHj3y2ya/V/wUOfuMx38+Nvc2IBcSDPl/aZ8jBZdHFr0b+Uh/GT
fpKhP4uHovAP1beuqW0nbuWqbeFfSzb/ZDhCffadOcdlWelf+wSXOoYc3vwR
vYG9K493Tokdlb71QEKdDNSHEXFgWiUjK4EmqCAZYKUn1c47rqHD5YmgipTg
eXiLuKoiPWQ6+TCcT3Ky4GL5c5L1aH1H82FmgCkG6SX6Umnoc69DGYqavlTl
NEO5eSw9WiOEUZ9Wt4jstOm4FRnFm3/lYRbKQgOJyaiF7tmNduASJrEzGTSg
GBXwxauvuCD7DH+mlB9kWa7QanzlceE1Ir4B+YATa2maaVUaond8pG0Abavv
jrY2s0JX1VGc6vypWz9bXCaPpNOfVAEhiUu2POlFNFsd6vdSBaU2zJHStouJ
Dn/uYuRCzGkq0k9a7PwMTZjKWulBMVxW1GdnteebjMvz3qhSXJJLxOvbZ8+l
RPzej1XPDol47X0e1lmtbqexRcbJ8fTurFwxqbge0WRmUfbd0P2UNNF+4aJ7
Lpsxj4mBO8JDRc8VhXuZIjaVUyXjHzqgROEHmQfwU0lh8FshiPMjnL7C6xgG
dK3U3GjZPR0ljKJ5NF4+28tkyVLR6JyZTNUoNqGUO5pTp7EgEFhRvbHLDqOl
wdiRZ2qZKUl3AnZF+IO7EgQDvhmHvNvnIpkX2lmRqti+8yAj2k8hGYDDQ3ri
yzjQy795V5Om+FKR8d0cWrlANtIEM1f5U8P5PFkkz2VTJ5QHk6OGSNfPjgDg
S4JDpXGK76XJ/YIT++gEEG1W/RORr3XVyK/4o3bJMPLUyp4Ge+OSFJ+h0PM2
8CldHaphAs//ZTpsQ8OpjBG5GcPTJXzONJlSFG2bJvwd+TdNbbGTqr7gE7Fi
gHYHq4gLqs00Wzp0nn8FVKPJpQU9ER+dZllNZ3xmDCSBlNMRpb7hnw/gNOuj
KUd/kmiazuMjQpeVRz9m6QPHQvPisprPxHNupZPF2lh+zMeoBz1kV5lT3Z1J
PfLgYbkZA0lQHWuwonpa5GCsQfNHU/XhVBdwHb5s4N3MA0aQnp/hhFjt7Ioe
r4Wmm+DEv4OqzS2v8FemZveQL5EfOPmUS6FIqtFi7tF0XIZInZ3ye8nRU2hD
fOsqbT01hYSbNLaEiaaOh3vW/qwRHLdv2kP0nBOSL5+OCU/5eIg7XCYz86M9
G8CutrI8RunLiSbUmcXYX/8xf8Z6nM4CXWX0szT5a9MehmP+x6IeeayD5vfJ
/4S+Wg07Iurgc6lGoqFt1ormswCUxdcmPmPth1yZAYOVwMqm883N1X98+2KB
sOy90rCdV8WU24FGGT2p+uKe2oIn20fT2FFTQqIcD0j817uX19kXT7948t88
JmMbCytXUhRnyYgFIwe/ca77+4dWUxq+yd4ZbgP38W8rUCwi5yhKoT9QIP3a
lA3qEUQhPGMuFO5aWMv9x8uDhqJhOlPrJwVjjDehm4uqaVxblfJLNMnDmuNz
G5nGjwZ8t3B5QInlVEJjRZZxS87Y/anKBsngqH2o5GxlxtJSmEtzk6fhOPvh
Byxa0Ya7Xs8OUhUcH5BMfPWA+MhaYE4UKKi+Fk4ApoPFNiIyX3O7Pg/OMnhB
0c2T1qnilKaC/Q3WadX2bZjx9i2dxSFm20ehOzEZjlOMKOJcRMCyTw8iuMzp
DJmkhg6ODIxy+CQRV1SEAlNNJzyWFCo+uEAayH7Y/7QFF+PP6knj4b/UfV6c
BGU1pMSB2i46P25C6U5+iIHNCEFaOcoadkM9Oaqu8Ivs0c1TqiY+93TQpqeU
TH/EgQfBAP13NB3S68/l6HzYxyE/dqdNsjTPm5z8+m/4AUmHmJ/i6BeXBv55
kEH2x13uqNaZ0S99HfhSydWmIX7prwxHfjAztKJSUee7MM87Qp35PRnpM/jo
CvnAMNtnXWuR0NIQindacsKA98lrbLL3cbYWys1TrswugNUZH9P5GDmj5UPR
qbCVegWJ6j4rYvQ1soFpD15QKehWddAAzMXJgWMz5Qwh/5+yBJk/UXy9EOce
CMpRKNfove+LxvAJcuoWcH2VOdrOD67KyXsdP0rOuGpMqrkhfUhO1cbwWXLf
ZIzAVxCl31n05dHS1xQc099ESvKx6dwilCiuash8LxNwFyeUyTl5Tg3HpkEm
9v/xM1Qxh+VkjoxhXwxY0Xz3QGivZpqO8EuXQ1jasGCvLfEXGtPzTAD9OJyk
Iikt05SmTn7PRznSM59kN44yDlo8Oq/6qQM+a62H8+jK7CBb2hkRNxImGKnS
Pf1wh0g+FrZv1M+OY0ZoyFeoH/w9LKnhV8kUKVORNiG+5oaXuPt585uytqWZ
mlmRLf1xpNCH03ma6VQapCAubNYNY6oeqPhFZ1ni0pw01hRTXfyUix6kDiOD
cVR8uHDmx7WMorfHMZTRowzxYe6l7PBioND/0JO3PNOcjoXjSc1Sfukpsj4P
gBbPygXUuJ7F1gv0z1wMw0D+JwEi6DolQtIGFbf2wZiTaLwk9KkH00aQ5KNx
nYQczf8C125mUcJSAAA=

-->

</rfc>
