<?xml version="1.0" encoding="US-ASCII"?>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.21 (Ruby 3.0.2) -->
<rfc category="info" docName="draft-dong-fantel-state-of-art-01"
     ipr="trust200902" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.25.0 -->

  <front>
    <title abbrev="Fantel State-of-Art">Current State of the Art for Routing
    in AI Networks</title>

    <seriesInfo name="Internet-Draft"
                value="draft-dong-fantel-state-of-art-01"/>

    <author fullname="Jie Dong" initials="J." surname="Dong">
      <organization>Huawei Technologies</organization>

      <address>
        <postal>
          <street>No. 156 Beiqing Road</street>

          <city>Beijing</city>

          <country>China</country>
        </postal>

        <email>jie.dong@huawei.com</email>
      </address>
    </author>

    <author fullname="Dan Li" initials="D." surname="Li">
      <organization>Tsinghua University</organization>

      <address>
        <postal>
          <city>Beijing</city>

          <country>China</country>
        </postal>

        <email>tolidan@tsinghua.edu.cn</email>
      </address>
    </author>

    <author fullname="Qinru Shi" initials="Q." surname="Shi">
      <organization>Huawei Technologies</organization>

      <address>
        <postal>
          <street>No. 156 Beiqing Road</street>

          <city>Beijing</city>

          <country>China</country>
        </postal>

        <email>shiqinru@huawei.com</email>
      </address>
    </author>

    <author fullname="PengFei Huo" initials="P." surname="Huo">
      <organization>ByteDance</organization>

      <address>
        <postal>
          <city>Beijing</city>

          <country>China</country>
        </postal>

        <email>huopengfei@bytedance.com</email>
      </address>
    </author>

    <date day="3" month="March" year="2025"/>

    <area>Routing</area>

    <keyword>Internet-Draft</keyword>

    <abstract>
      <?line 82?>

      <t>This document provides an overview of routing technologies that
      address the needs of traffic engineering and load balancing, with a
      focus on fast notification for example in adaptive or perceptive
      routing. As the scale and complexity of networks grow, these
      technologies are becoming increasingly important when fault tolerance
      and rapid convergence are critical. This document explores existing
      solutions from both the IETF and the broader industry, highlighting
      their applicability to various use cases, including AI workloads and
      general services that demand low-latency, fault recovery, and dynamic
      load distribution across data center networks and inter data center. It
      also offers suggestions for potential IETF initiatives to further
      develop and standardize these techniques.</t>
    </abstract>
  </front>

  <middle>
    <?line 87?>

    <section anchor="intro">
      <name>Introduction</name>

      <t>The emergence of new applications, like AI applications brings new
      requirements to networks, such as load balancing and network
      reliability. AI-driven applications tend to generate highly dynamic and
      unpredictable traffic patterns, and require high performance in terms of
      throughput, latency and packet loss. As a result, there is a growing
      need for Adaptive and Perceptive Routing mechanisms that can respond to
      these new demands. As widely discussed both in standards and the
      industry, Adaptive/Perceptive Routing allows networks to make real-time
      adjustments in response to varying traffic loads and network conditions,
      ensuring that network resources are optimally utilized and congestion is
      minimized.</t>

      <t>This document provides an overview of routing technologies that
      address the needs of traffic engineering and load balancing, with a
      focus on the fast notification, for example in adaptive routing where
      the routing decision adapts to network events. As the scale and
      complexity of networks grow, these technologies are becoming
      increasingly important when fault tolerance and rapid convergence are
      critical. This document explores existing solutions from both the IETF
      and the broader industry, highlighting their applicability to various
      use cases, including AI workloads and general services that demand
      low-latency fault recovery and dynamic load distribution across data
      center networks and inter data center. It also offers suggestions for
      potential IETF initiatives to further develop and standardize these
      techniques.</t>
    </section>

    <section anchor="proposals-in-ietf">
      <name>Proposals in IETF</name>

      <t>There are several individual drafts in the IETF which describe the
      problems, gaps, requirements and potential frameworks for routing in AI
      networks. This section briefly goes through these documents, summarizes
      the current state of this topic in the IETF, and identifies the open
      issues which needs further work.</t>

      <section anchor="gap-analysis-problem-statement-and-requirements">
        <name>Gap Analysis, Problem Statement and Requirements</name>

        <t><xref target="I-D.hcl-rtgwg-ai-network-problem"/> analyzes the gaps
        in the networks used for AI training, and describes the requirements
        for improvements. It firstly introduces the charateristics of AI
        training traffic, then focuses on the gaps and requiements in several
        key technologies: Load Balancing, Congestion Control and Fast
        Failover. It is not clear whether the congestion control mentioned in
        this document is more related to the network layer or the transport
        layer.</t>

        <t><xref target="I-D.cheng-rtgwg-ai-network-reliability-problem"/>
        fucuses on the reliability problem and requirements in AI networks. It
        describes the existing mechanisms for network reliability, including
        link fault detection, ECMP, fast reroute and fast route convergence,
        (e.g. BGP Prefix Independent Convergence (PIC)), then analyzes the
        gaps in the timing of fault detection, notification propagation and
        switchover. In the end, the draft lists a set of requirements for new
        techniques on fault detection, congestion elimination, fast fault
        notification and fast switching over.</t>

        <t><xref target="I-D.wang-rtgwg-dragonfly-routing-problem"/>
        introduces the characteristics and routing mechanisms of dragonfly
        topology, including Minimal Routing, Non-Minimal Routing, Adaptive
        Routing and Valiant Load-Balanced Routing. Then it analyzes the gaps
        of existing routing mechanism in dragonfly networks, such as load
        balancing and adaptive routing notification, in the end the drafts
        list the requirements on routing protocols for dragonfly networks.</t>

        <t>The analysis shows that there are some overlaps in the gap analysis
        and problem statement between these documents. The common problems and
        gaps identified for routing in AI networks are load balancing and fast
        failure notification. The requirements on routing protocols and the
        notification mechanism need further investigation.</t>
      </section>

      <section anchor="framework">
        <name>Framework</name>

        <t><xref target="I-D.cheng-rtgwg-adaptive-routing-framework"/>
        describes a framework for adaptive routing, including a set of
        components, their interaction and the workflow. It identifies the
        problems with existing flow-based load balancing in AI networks,
        especially when congestion happens on some of the links. The solutions
        are classified into two types: flow-based adjustments and packet-based
        adjustments. The flow-based ajdustments are further categorized into
        weight-based dyanamic ECMP and Flow redirection. The overall adaptive
        routing framework consists of routing plane, forwarding plane,
        adaptive routing policy and the remote congestion detection. In the
        forwarding plane, it proposes to add remote path info to the
        forwarding table, and the quality of the links can be updated in
        response to congestion, then new weight value can be calculated to
        optimize the weight-based load balancing. In the routing plane, the
        draft analyzes the possible extensions needed in routing protocols for
        obtaining the path information. In congestion detection, it gives the
        definition of congestion, the general mechanisms for detecting
        congestion, then describes the types of information needs to be
        carried in the congestion notification message. It also anlalyzed the
        options of transmitting congestion information, either by extending
        existing protocols or introducing new protocols.</t>

        <t><xref target="I-D.liu-rtgwg-path-aware-remote-protection"/>
        desribes the framework of path-aware remote protection. It contains
        the routing plane, the forwarding plane and the remote failure
        notification. Similar to <xref
        target="I-D.cheng-rtgwg-adaptive-routing-framework"/>, path awareness
        is required in the routing plane and forwarding plane for rapid
        switchover. It gives the requirements on remote link detection that
        the failure notification should be indepedent of routing protocols,
        and broadcast flooding should be avoided. It also talks about the
        protection scope of remote protection, which may have impacts on the
        speed and propagation of failure notification.</t>

        <t><xref target="I-D.li-rtgwg-distributed-lossless-framework"/>
        analyzes the challenges in building ultra large scale data centers for
        AI training, and introduces the scenarios of distributed AIDC
        networks. Then it proposes a framework and a set of key technologies
        for building lossless and reliable interconnection between multiple
        data centers. Global load balancing, precise flow-control and packet
        loss detection are mentioned as key mechanisms.</t>

        <t>This shows that the scope of the framework documents are different,
        while some of the content are overlapped. There is a possibility to
        combine the existing framework documents to build a complete framework
        which includes both congestion and protection, and covers both
        intra-DC and inter-DC scenarios.</t>
      </section>

      <section anchor="information-model">
        <name>Information Model</name>

        <t><xref target="I-D.zhou-rtgwg-perceptive-routing-information"/>
        defines the information model for perceptive routing (PR), which
        provides the necessary information and relationship of the components
        in the implementation of adaptive routing systems. It offers a common
        information model for representing the state of the network, allowing
        devices to communicate critical information such as failures,
        congestion, and optimal paths, facilitating dynamic and automated
        decision-making. The information model for a PR sensing node includes
        a set of local information and network-level information which can be
        used to evaluate whether a PR notification needs to be generated and
        sent. The information model for a PR routing node includes a set of
        decisions and behaviors to be made by a PR routing node on receipt of
        the PR notification.</t>
      </section>

      <section anchor="solutions">
        <name>Solutions</name>

        <t>In the solution space, there are several documents which propose
        the mechanisms for routing in AI networks include topology-specific
        mechanisms, extensions to routing protocols and the new protocols for
        the notification of network status.</t>

        <section anchor="topology-specific-routing-mechanisms">
          <name>Topology-specific Routing Mechanisms</name>

          <t><xref target="I-D.agt-rtgwg-dragonfly-routing"/> provides on
          overview of the Dragonfly+ topoloy, and describes the routing and
          forwarding mechanisms in the Dragonfly+ topology, which relies
          heavily on non-minimal routing and adaptive load balancing for
          efficient use of available network capacity. It uses existing
          routing mechanisms such as VRF, route leaking and EBGP to achieve
          route propagation control and routing policy. In terms of adaptive
          load balancing, the purpose is to fill paths starting from high
          priority, and try to move flows from congested paths as a reaction
          to congestion. It requires that adaptive load balancing be able to
          work without complete knowledge of network link utilization and
          queue state. It also considers that adaptive routing can work as a
          complementary failure handling mechanism faster than routing
          convergence. While the detailed adaptive routing and load balancing
          mechanisms are left to other documents.</t>
        </section>

        <section anchor="extensions-to-routing-protocols">
          <name>Extensions to Routing Protocols</name>

          <t><xref target="I-D.xu-idr-fare"/> proposes extensions to BGP to
          carry end-to-end path bandwidth within the data center fabric for
          adaptive routing. In the draft a new type of BGP Extended Community
          is defined, and its usage in BGP route update distribution is
          specified using examples of 3-stage and 5-stage Clos networks. With
          the information of path bandwidth and link bandwidth, weighted ECMP
          load balancing can be performed.</t>

          <t><xref target="I-D.wang-idr-next-next-hop-nodes"/> proposes
          extensions to BGP to carry the next-next hop nodes associated with a
          given BGP next hop. One usage of the next-next hops information is
          for global load balancing (GLB) in a Clos network, where load
          balancing based on local next-hop information cannot mitigate the
          congestion, and it requires help from the previous hop(s) to shift
          the traffic to alternative next-hop nodes towards a next-next hop
          node. The next-next hop information is encoded as a new
          characteristic code of the BGP Next Hop Dependent Characteristics
          Attribute.</t>
        </section>

        <section anchor="new-protocols-for-fast-notification">
          <name>New Protocols for Fast Notification</name>

          <t><xref target="I-D.wh-rtgwg-adaptive-routing-arn"/> specifies
          Adaptive Routing Notification (ARN) as a general mechanism to
          proactively disseminate congestion/failure detection and elimination
          information for remote nodes to perform re-routing policies. An ARN
          message contains two kinds of information: information reflecting
          the type of notification (congestion or failure) and quantifiable
          metrics (e.g., congestion level), and information carrying details
          about the affected object (e.g., affected traffic, affected paths).
          The ARN messages can be sent using unicast or multicast to other
          network nodes. The format of the ARN packets and its processing on
          the sending and receiving nodes are also specified. The impact to
          route ocillation and packet reordering caused by ARN are for further
          study.</t>

          <t><xref target="I-D.liu-rtgwg-adaptive-routing-notification"/>
          describes the information carried in Adaptive Routing Notification
          (ARN) messages and the mechanisms of delivering ARN message in the
          network. The draft gives three options, each of which specifies the
          information carried in the ARN message and the mechanism of sending
          the message to specific network nodes. The complexity and overhead
          in implementation are also analyzed. It also introduces an ARN TAG
          mechanism to control the enabling of ARN meschanism on specific
          traffic flows.</t>

          <t><xref target="I-D.zzhang-rtgwg-router-info"/> specifies a generic
          mechanism for a router to advertise some information to its
          neighbors. One use case is to advertise link or path information to
          allow receiving node to better react to network changs . The draft
          firstly analyzes the requirements for the information advertisement,
          then chooses to use UDP as a better choice comparing to IGP. The
          format of the message and the contained information are defined in
          the draft. How the IP address of the target nodes are obtained, and
          the processing on the receiving nodes are considered out of scope of
          the draft.</t>
        </section>
      </section>
    </section>

    <section anchor="implementations-in-industry">
      <name>Implementations in Industry</name>

      <t>One of the most prominent applications of fast notification is
      adaptive routing, which has recently gained significant traction in
      Ethernet-based Artificial Intelligence Data Centers (AIDCs). These data
      centers require real-time network information to dynamically handle the
      unpredictable and bursty traffic of AI/ML applications. The following
      sections highlight some notable implementations of adaptive routing in
      modern data center environments.</t>

      <section anchor="dlb-and-glb">
        <name>DLB and GLB</name>

        <t>Dynamic Load Balancing (DLB) is a mechanism that selects the next
        hop for packets based on the quality of the local switch port or other
        local information. Global Load Balancing (GLB) extends this approach
        by considering the quality of downstream paths when selecting the next
        hop, thereby optimizing traffic distribution and improving overall
        network efficiency. The DLB and GLB mechanisms are implemented by many
        data center switches, including those from Broadcom <xref
        target="GLB-Broadcom"/>, Juniper <xref target="GLB-Juniper"/>, and
        Nvidia <xref target="GLB-NVIDIA"/>.</t>
      </section>

      <section anchor="vrf-based-adaptive-routing">
        <name>VRF-based Adaptive Routing</name>

        <t>Huawei's CloudEngine series switches implement adaptive routing
        through a VRF-based architecture <xref target="VRF-AR"/>. This design
        maintains three distinct routing tables on each device: one for
        shortest paths, one for non-shortest paths, and a combined table for
        both. Path selection is dynamically adjusted based on real-time
        network conditions, including both the local port status and global
        congestion status. The latter is communicated via Adaptive Routing
        Notifications (ARN), allowing for intelligent, congestion-aware
        routing decisions that enhance overall network performance and
        resiliency.</t>
      </section>

      <section anchor="conga">
        <name>CONGA</name>

        <t>Cisco developed a solution <xref target="CONGA"/> for datacenter
        fatrics. CONGA is a network-based, distributed, congestion-aware load
        balancing mechanism designed for datacenter Clos topologies and
        network virtualization overlays. It is CONGA splits TCP flows into
        flowlets, estimates real-time congestion on fabric paths using
        feedback from remote switches, and dynamically allocates flowlets to
        optimal paths.</t>
      </section>

      <section anchor="centralized-te-and-e-ecmp">
        <name>Centralized TE and E-ECMP</name>

        <t>Meta has developed several solutions such as centralized Traffic
        Engineering (TE) and Enhaneced ECMP (E-ECMP) which are specifically
        designed for AI workloads <xref target="TE-EECMP"/>.</t>

        <t>In the centralized TE approach, real-time workload and network
        topology information are collected and transmitted to the control
        plane. The TE engine then executes the Constrained Shortest Path First
        (CSPF) algorithm to generate optimized flow placements every 30
        seconds. The resulting flow placement policy overrides the default BGP
        routes on each switch, with BGP routing decisions serving exclusively
        as a backup mechanism.</t>

        <t>E-ECMP is designed to address the low entropy inherent in AI
        workload flows. To achieve this, switches are configured to
        additionally hash the QP field of RoCE packets. Furthermore,
        NIC-to-NIC flows are divided into multiple flows to increase the
        number of QPs, thereby enhancing load distribution.</t>
      </section>
    </section>

    <section anchor="summary-and-potential-works">
      <name>Summary and Potential Work</name>

      <t>The analysis about the current state of the art for routing in AI
      networks shows that "Adaptive Routing" is a vague term and has different
      meanings in different documents or implementations. In some cases, it
      refers to dynamic load balancing taking the link congestion status into
      consideration. While in some other cases, it refers to fast switchover
      due to network failure. As claimed in some documents, adaptive routing
      is faster than route convergence, the fuctionalities specified in the
      documents are not directly related to routing or path computation. In
      the industry, global load balancing (GLB) is used in many solutions,
      while it does not cover the failure cases. It seems that a better term
      may be needed in IETF to more accurately reflect the functionality.</t>

      <t>According to the framework and solutions documents, it seems the
      related work mainly includes: routing extensions for more visibility in
      network topology and capacity information, fast notification of network
      congestion or failure conditions, and dynamic traffic engineering and
      load balancing mechanisms. In some gap analysis and problem statements,
      congestion control is also considered as one of the problems to be
      solved. While since congestion managment belongs to the WIT area in
      IETF, it is not clear whether it can be pursued together with other
      functions in the RTG area.</t>

      <t>In many of the analyzed documents, it is assumed that the underlay
      routing is based on EBGP, and extensions to BGP for the advertisement of
      additional network information are proposed. Whether other routing
      protocol options (e.g., IGP, IBGP, BGP-SPF, RIFT etc.) also need to be
      investigated is something for further consideration.</t>

      <t>In terms of load balancing, currently most of the documents and
      solutions focus on the load balancing over ECMP paths, while in some
      topologies (such as Dragonfly and Dragonfly+), non-ECMP paths may also
      need to be taken into consideration.</t>

      <t>It seems the there is common interest in the fast notification
      mechanism for traffic engineering and load balancing. This may be
      something a new initiative in IETF could start with, and there is some
      open questions for further discussion. As mentioned in some of the
      documents, congestion notification is required for dynamic load
      balancing or flow redirect, and failure notification is required for
      fast switchover. Currently it is not clear whether it is possible to
      provide a general mechanism for the notification of both the congestion
      and failure conditions, or there is enough differences between the two
      cases that separate mechanisms are needed. Moreover, further
      investigation is needed on whether a new protocol is needed for fast
      notification, or extensions based on existing protocols would also meet
      some of the requirements.</t>
    </section>

    <section anchor="security-considerations">
      <name>Security Considerations</name>

      <t>TBD</t>
    </section>

    <section anchor="iana-considerations">
      <name>IANA Considerations</name>

      <t>There are no requested IANA actions.</t>
    </section>

    <section anchor="acknowledgments">
      <name>Acknowledgments</name>

      <t>The authors would like to thank Xuesong Geng and Hang Shi for their
      review and discussion of this document.</t>
    </section>
  </middle>

  <back>
    <references anchor="sec-informative-references">
      <name>Informative References</name>

      <reference anchor="GLB-Broadcom"
                 target="https://www.broadcom.com/blog/cognitive-routing-in-the-tomahawk-5-data-center-switch">
        <front>
          <title>Cognitive routing in the Tomahawk 5 data center
          switch</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="GLB-Juniper"
                 target="https://www.juniper.net/documentation/us/en/software/junos/ai-ml-evo/topics/topic-map/glb.html">
        <front>
          <title>Global Load Balancing (GLB)</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="GLB-NVIDIA"
                 target="https://developer.nvidia.com/blog/turbocharging-ai-workloads-with-nvidia-spectrum-x-networking-platform">
        <front>
          <title>Turbocharging Generative AI Workloads with NVIDIA Spectrum-X
          Networking Platform</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="VRF-AR"
                 target="https://info.support.huawei.com/info-finder/encyclopedia/en/Dragonfly+Adaptive+Routing.html">
        <front>
          <title>What Is Dragonfly Adaptive Routing?</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="CONGA"
                 target="https://dl.acm.org/doi/pdf/10.1145/2740070.2626316">
        <front>
          <title>CONGA-Distributed Congestion-Aware Load Balancing for
          Datacenters</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="TE-EECMP"
                 target="https://dl.acm.org/doi/10.1145/3651890.3672233">
        <front>
          <title>RDMA over Ethernet for Distributed Training at Meta
          Scale</title>

          <author>
            <organization/>
          </author>

          <date>n.d.</date>
        </front>
      </reference>

      <reference anchor="I-D.hcl-rtgwg-ai-network-problem"
                 target="https://datatracker.ietf.org/doc/html/draft-hcl-rtgwg-ai-network-problem-01"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.hcl-rtgwg-ai-network-problem.xml">
        <front>
          <title>Gap Analysis, Problem Statement, and Requirements in AI
          Networks</title>

          <author fullname="PengFei Huo" initials="P." surname="Huo">
            <organization>ByteDance</organization>
          </author>

          <author fullname="Gang Chen" initials="G." surname="Chen">
            <organization>ByteDance</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Zhuo Jiang" initials="Z." surname="Jiang">
            <organization>ByteDance</organization>
          </author>

          <date day="23" month="August" year="2024"/>

          <abstract>
            <t>This document provides the gap analysis of AI networks,
            describes the fundamental problems, and defines the requirements
            for technical improvements.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-hcl-rtgwg-ai-network-problem-01"/>
      </reference>

      <reference anchor="I-D.cheng-rtgwg-ai-network-reliability-problem"
                 target="https://datatracker.ietf.org/doc/html/draft-cheng-rtgwg-ai-network-reliability-problem-02"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.cheng-rtgwg-ai-network-reliability-problem.xml">
        <front>
          <title>Reliability in AI Networks Gap Analysis, Problem Statement,
          and Requirements</title>

          <author fullname="Weiqiang Cheng" initials="W." surname="Cheng">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="wangwenxuan" initials="" surname="wangwenxuan">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Bohua Xu" initials="B." surname="Xu">
            <organization>China Unicom</organization>
          </author>

          <date day="3" month="November" year="2024"/>

          <abstract>
            <t>This document provides the gap analysis of existing reliability
            mechanism in AI networks, describes the fundamental problems, and
            defines the requirements for technical improvements.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-cheng-rtgwg-ai-network-reliability-problem-02"/>
      </reference>

      <reference anchor="I-D.wang-rtgwg-dragonfly-routing-problem"
                 target="https://datatracker.ietf.org/doc/html/draft-wang-rtgwg-dragonfly-routing-problem-02"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.wang-rtgwg-dragonfly-routing-problem.xml">
        <front>
          <title>Routing mechanism in Dragonfly Networks Gap Analysis, Problem
          Statement, and Requirements</title>

          <author fullname="Ruixue Wang" initials="R." surname="Wang">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="wangwenxuan" initials="" surname="wangwenxuan">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Weiqiang Cheng" initials="W." surname="Cheng">
            <organization>China Mobile</organization>
          </author>

          <date day="4" month="September" year="2024"/>

          <abstract>
            <t>This document provides the gap analysis of existing routing
            mechanism in dragonfly networks, describes the fundamental
            problems, and defines the requirements for technical
            improvements.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-wang-rtgwg-dragonfly-routing-problem-02"/>
      </reference>

      <reference anchor="I-D.cheng-rtgwg-adaptive-routing-framework"
                 target="https://datatracker.ietf.org/doc/html/draft-cheng-rtgwg-adaptive-routing-framework-03"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.cheng-rtgwg-adaptive-routing-framework.xml">
        <front>
          <title>Adaptive Routing Framework</title>

          <author fullname="Weiqiang Cheng" initials="W." surname="Cheng">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Kevin Wang" initials="K." surname="Wang">
            <organization>Juniper Networks</organization>
          </author>

          <author fullname="Jiaming Ye" initials="J." surname="Ye">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Rui Zhuang" initials="R." surname="Zhuang">
            <organization>China Mobile</organization>
          </author>

          <author fullname="PengFei Huo" initials="P." surname="Huo">
            <organization>ByteDance</organization>
          </author>

          <date day="20" month="October" year="2024"/>

          <abstract>
            <t>In many cases, ECMP (Equal-Cost Multi-Path) flow-based hashing
            leads to high congestion and variable flow completion time. This
            reduces applications performance. Load balancing based on local
            link quality is not always optimal, A global view of congestion,
            with information from remote links, is needed for optimal
            balancing. Adaptive routing is a technology that makes dynamic
            routing decision based on changes in traffic load and network
            topology. This document describes a framework for Adaptive
            Routing. Specifically, it identifies a set of adaptive routing
            components, explains their interactions, and exemplifies the
            workflow mechanism.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-cheng-rtgwg-adaptive-routing-framework-03"/>
      </reference>

      <reference anchor="I-D.liu-rtgwg-path-aware-remote-protection"
                 target="https://datatracker.ietf.org/doc/html/draft-liu-rtgwg-path-aware-remote-protection-02"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.liu-rtgwg-path-aware-remote-protection.xml">
        <front>
          <title>Path-aware Remote Protection Framework</title>

          <author fullname="Yisong Liu" initials="Y." surname="Liu">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Mengxiao Chen" initials="M." surname="Chen">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Zheng Zhang" initials="Z." surname="Zhang">
            <organization>ZTE Corporation</organization>
          </author>

          <author fullname="Kevin Wang" initials="K." surname="Wang">
            <organization>Juniper Network</organization>
          </author>

          <author fullname="Zongying He" initials="Z." surname="He">
            <organization>Broadcom</organization>
          </author>

          <date day="13" month="September" year="2024"/>

          <abstract>
            <t>This document describes the framework of path-aware remote
            protection.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-liu-rtgwg-path-aware-remote-protection-02"/>
      </reference>

      <reference anchor="I-D.li-rtgwg-distributed-lossless-framework"
                 target="https://datatracker.ietf.org/doc/html/draft-li-rtgwg-distributed-lossless-framework-00"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.li-rtgwg-distributed-lossless-framework.xml">
        <front>
          <title>Framework of Distributed AIDC Network</title>

          <author fullname="Cong Li" initials="C." surname="Li">
            <organization>Chinat Telecom</organization>
          </author>

          <author fullname="Siwei Ji" initials="S." surname="Ji">
            <organization>Chinat Telecom</organization>
          </author>

          <author fullname="Keyi Zhu" initials="K." surname="Zhu">
            <organization>Huawei Technologies</organization>
          </author>

          <date day="21" month="October" year="2024"/>

          <abstract>
            <t>With the rapid development of large language models, it puts
            forward higher requirements for the networking scale of data
            centers. Distributed model training has been proposed to shorten
            the training time and relieve the resource demand in a single data
            center.This document proposes a framework to address the challenge
            of efficient lossless interconnection and reliable data
            transmission between multiple data centers, which can connect
            multiple data centers to form a larger cluster through network
            connection. The document further conducts in-depth research on the
            key technologies and application scenarios of this distributed
            AIDC network.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-li-rtgwg-distributed-lossless-framework-00"/>
      </reference>

      <reference anchor="I-D.zhou-rtgwg-perceptive-routing-information"
                 target="https://datatracker.ietf.org/doc/html/draft-zhou-rtgwg-perceptive-routing-information-00"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.zhou-rtgwg-perceptive-routing-information.xml">
        <front>
          <title>Perceptive Routing Information Model</title>

          <author fullname="Tianran Zhou" initials="T." surname="Zhou">
            <organization>Huawei</organization>
          </author>

          <author fullname="Dan Li" initials="D." surname="Li">
            <organization>Tsinghua University</organization>
          </author>

          <author fullname="Xuesong Geng" initials="X." surname="Geng">
            <organization>Huawei</organization>
          </author>

          <date day="18" month="October" year="2024"/>

          <abstract>
            <t>This docuement defines the information model for perceptive
            routing, which could serve as a foundational component in the
            implementation of perceptive routing.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-zhou-rtgwg-perceptive-routing-information-00"/>
      </reference>

      <reference anchor="I-D.agt-rtgwg-dragonfly-routing"
                 target="https://datatracker.ietf.org/doc/html/draft-agt-rtgwg-dragonfly-routing-01"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.agt-rtgwg-dragonfly-routing.xml">
        <front>
          <title>Routing in Dragonfly+ Topologies</title>

          <author fullname="Dmitry Afanasiev" initials="D."
                  surname="Afanasiev"/>

          <author fullname="Roman" initials="" surname="Roman">
            <organization>Yandex</organization>
          </author>

          <author fullname="Jeff Tantsura" initials="J." surname="Tantsura">
            <organization>Nvidia</organization>
          </author>

          <date day="4" month="March" year="2024"/>

          <abstract>
            <t>This document provides an overview of Dragonfly+ network
            topology and describes routing implementation for IP networks with
            Dragonfly+ topology with support for non-minimal routing.t</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-agt-rtgwg-dragonfly-routing-01"/>
      </reference>

      <reference anchor="I-D.xu-idr-fare"
                 target="https://datatracker.ietf.org/doc/html/draft-xu-idr-fare-02"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.xu-idr-fare.xml">
        <front>
          <title>Fully Adaptive Routing Ethernet using BGP</title>

          <author fullname="Xiaohu Xu" initials="X." surname="Xu">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Shraddha Hegde" initials="S." surname="Hegde">
            <organization>Juniper</organization>
          </author>

          <author fullname="Zongying He" initials="Z." surname="He">
            <organization>Broadcom</organization>
          </author>

          <author fullname="Junjie Wang" initials="J." surname="Wang">
            <organization>Centec</organization>
          </author>

          <author fullname="Hongyi Huang" initials="H." surname="Huang">
            <organization>Huawei</organization>
          </author>

          <author fullname="Qingliang Zhang" initials="Q." surname="Zhang">
            <organization>H3C</organization>
          </author>

          <author fullname="Hang Wu" initials="H." surname="Wu">
            <organization>Ruijie Networks</organization>
          </author>

          <author fullname="Yadong Liu" initials="Y." surname="Liu">
            <organization>Tencent</organization>
          </author>

          <author fullname="Yinben Xia" initials="Y." surname="Xia">
            <organization>Tencent</organization>
          </author>

          <author fullname="Peilong Wang" initials="P." surname="Wang">
            <organization>Baidu</organization>
          </author>

          <author fullname="Tiezheng" initials="" surname="Tiezheng">
            <organization>IEIT SYSTEMS</organization>
          </author>

          <date day="1" month="September" year="2024"/>

          <abstract>
            <t>Large language models (LLMs) like ChatGPT have become
            increasingly popular in recent years due to their impressive
            performance in various natural language processing tasks. These
            models are built by training deep neural networks on massive
            amounts of text data, often consisting of billions or even
            trillions of parameters. However, the training process for these
            models can be extremely resource- intensive, requiring the
            deployment of thousands or even tens of thousands of GPUs in a
            single AI training cluster. Therefore, three- stage or even
            five-stage CLOS networks are commonly adopted for AI networks. The
            non-blocking nature of the network become increasingly critical
            for large-scale AI models. Therefore, adaptive routing is
            necessary to dynamically distribute the traffic to the same
            destination over multiple equal-cost paths, based on the network
            capacity and even congestion information along those paths.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft" value="draft-xu-idr-fare-02"/>
      </reference>

      <reference anchor="I-D.wang-idr-next-next-hop-nodes"
                 target="https://datatracker.ietf.org/doc/html/draft-wang-idr-next-next-hop-nodes-02"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.wang-idr-next-next-hop-nodes.xml">
        <front>
          <title>BGP Next-next Hop Nodes</title>

          <author fullname="Kevin Wang" initials="K." surname="Wang">
            <organization>Juniper Networks</organization>
          </author>

          <author fullname="Jeffrey Haas" initials="J." surname="Haas">
            <organization>Juniper Networks</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Jeff Tantsura" initials="J." surname="Tantsura">
            <organization>Nviadia</organization>
          </author>

          <date day="2" month="December" year="2024"/>

          <abstract>
            <t>BGP speakers learn their next hop addresses for NLRI in
            RFC-4271 in the NEXT_HOP field and in RFC-4760 in the "Network
            Address of Next Hop" field. Under certain circumstances, it might
            be desirable for a BGP speaker to know both the next hops and the
            next-next hops of NLRI to make optimal forwarding decisions. One
            such example is global load balancing (GLB) in a Clos network.
            Draft-ietf-idr-entropy-label defines the "Next Hop Dependent
            Characteristics Attribute" (NHC) which allows a BGP speaker to
            signal the forwarding characteristics associated with a given next
            hop. This document defines a new NHC characteristic, the Next-next
            Hop Nodes (NNHN) characteristic, which can be used to advertise
            the next- next hop nodes associated with a given next hop.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-wang-idr-next-next-hop-nodes-02"/>
      </reference>

      <reference anchor="I-D.wh-rtgwg-adaptive-routing-arn"
                 target="https://datatracker.ietf.org/doc/html/draft-wh-rtgwg-adaptive-routing-arn-03"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.wh-rtgwg-adaptive-routing-arn.xml">
        <front>
          <title>Adaptive Routing Notification</title>

          <author fullname="Haibo Wang" initials="H." surname="Wang">
            <organization>Huawei</organization>
          </author>

          <author fullname="Hongyi Huang" initials="H." surname="Huang">
            <organization>Huawei</organization>
          </author>

          <author fullname="Xuesong Geng" initials="X." surname="Geng">
            <organization>Huawei</organization>
          </author>

          <author fullname="Xiaohu Xu" initials="X." surname="Xu">
            <organization>China Mobile</organization>
          </author>

          <author fullname="Yinben Xia" initials="Y." surname="Xia">
            <organization>Tencent</organization>
          </author>

          <date day="13" month="September" year="2024"/>

          <abstract>
            <t>Large-scale supercomputing and AI data centers utilize
            multipath to implement load balancing and/or improve transport
            reliability. Adaptive routing (AR), widely used in direct
            topologies such as dragonfly, is growing popular in commodity data
            centers to dynamically adjust routing policies based on path
            congestion and failures. When congestion or failure occurs, the
            sensing node can not only apply AR locally but also send the
            congestion/failure information to other nodes in a timely and
            accurate manner to enforce AR on other nodes, thus avoiding
            exacerbating congestion on the reported path. This document
            specifies Adaptive Routing Notification (ARN), a general mechanism
            to proactively disseminate congestion detection and congestion
            elimination information for remote nodes to perform re-routing
            policies.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-wh-rtgwg-adaptive-routing-arn-03"/>
      </reference>

      <reference anchor="I-D.liu-rtgwg-adaptive-routing-notification"
                 target="https://datatracker.ietf.org/doc/html/draft-liu-rtgwg-adaptive-routing-notification-01"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.liu-rtgwg-adaptive-routing-notification.xml">
        <front>
          <title>Adaptive Routing Notification for Load-balancing</title>

          <author fullname="Yao Liu" initials="Y." surname="Liu">
            <organization>ZTE</organization>
          </author>

          <author fullname="lihesong" initials="" surname="lihesong">
            <organization>ZTE</organization>
          </author>

          <author fullname="Wei Duan" initials="W." surname="Duan">
            <organization>ZTE</organization>
          </author>

          <date day="20" month="October" year="2024"/>

          <abstract>
            <t>This document focuses on the information carried in (Adaptive
            Routing Notification)ARN messages and how they are delivered into
            the network.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-liu-rtgwg-adaptive-routing-notification-01"/>
      </reference>

      <reference anchor="I-D.zzhang-rtgwg-router-info"
                 target="https://datatracker.ietf.org/doc/html/draft-zzhang-rtgwg-router-info-01"
                 xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.zzhang-rtgwg-router-info.xml">
        <front>
          <title>Advertising Router Information</title>

          <author fullname="Zhaohui (Jeffrey) Zhang" initials="Z. J."
                  surname="Zhang">
            <organization>Juniper Networks</organization>
          </author>

          <author fullname="Kevin Wang" initials="K." surname="Wang">
            <organization>Juniper Networks</organization>
          </author>

          <author fullname="Changwang Lin" initials="C." surname="Lin">
            <organization>New H3C Technologies</organization>
          </author>

          <author fullname="Niranjan Vaidya" initials="N." surname="Vaidya">
            <organization>Broadcom</organization>
          </author>

          <date day="18" month="September" year="2024"/>

          <abstract>
            <t>This document specifies a generic mechanism for a router to
            advertise some information to its neighbors. One use case of this
            mechanism is to advertise link/path information so that a
            receiving router can better react to network changes.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-zzhang-rtgwg-router-info-01"/>
      </reference>
    </references>
  </back>

  <!-- ##markdown-source:
H4sIAAAAAAAAA+1c33PbNrZ+11+B2TzcZFaU02Sb3vXL1rGd1J3G6zredl8h
EpLQUKRKkFbUTP/3+51zABCglLR35r7d7bSpLZHAwfn5nR9IURSz3va1OVeX
Q9eZplfve90b1a5UvzHqouvVqu3UfTv0tlkr26iLG3Vr+n3bfXAzvVx25vFc
vdFNb2p5tWhXBV6bVW3Z6C0Wrjq96ouqbdbFip8rXHhOd33x/PmsXbq2Nr1x
57NhV2n+gf53Pivx57rtDufYedXO3LDcWuds2zwcdlj65vrhzWxmd9256rvB
9S+eP//78xcz3Rl9HmieEanrrh1252r2wRzwa4U3QUjXmL64IupmMz30m7Y7
nxUz7OTO1fcLdQWKZ0rO8L01/ve2W+vG/qZ7EHGuvhv03lj1YMpN09bt2ho3
U2arbX2ufrFmQaf+dsMPLcp2O1Ou74zpz9Vtu1Bfff1KvTb2V2LsfaurmSpt
j6Pis1+IcFW2Q9PT4S83ttGzSNzVQv1gA2lXuuHfcsIeHFbAxupfjX00ncPC
kbC+rW2lm297/8zCVMOibEbi/ogQFSn5caHebyIpP9qmG+SDP88mtyEOdMP/
GZtG6u4W2LkN1N2ZZv0GVPBHOX2vD70BH0sTqdoM7Q7Pr4z9dokvK/oyJ+0P
yFCzWdN2W2zwCD2ekfrG35R6+8Pr4nWHw2BJWgr/BDNs142lx1Q32hyZ4kO7
1Ru9/6C+VrANrUpDKqzc3vblRlbQ3Zoo2/T9zp2fne33+8XSb0K0ny3B+rMy
bFD4DQrbFNig6P0GxdcFbVDIBkWygSf8+6GxO9PldL+t26Wu1Q/YTr3WNfhF
tD/F888+S9wvstACdngGdzFssSNL5GxwZ6Y5c+2q38OYz/Bg6860LbZ1YR7b
s77d2dLJ/4qt3p2t6+Vi02/rlMzbn26ubi7OUyIfhm7ZlhuQQsS9NY3pWCTk
1H6Gm6hBvVM48EbJ2+r9zpRwLdvi38Hr0Zt3te5JnidPVplHU7d8rkdbWT2y
vk+3L3CcfdizoD0Leb5wYc+PRRP3LHbjnvj3p/s3xcV9LoKfN7pXN07Bpa3b
ZlUf1EWld3w+7wv/cZJg0s2FG3a7tusXoxXy58XKNpXpII3yUNKpQCCJJu7x
17DHX/0eQQ749/Kft29zAfAnxZWFEdnlALuCvjdr40joxQXJeqpBFH2uoI6i
je40x+uFLrcL2DTUyJ7tqtXZV88XX331t6/PXnzzt+fPv3m+ePHqxauXX72a
4f2H6+L6+vLdXUbY/dW7C9XCU6pr2AJFBtk5ofSh07YhksDldwYW+L7Utfkz
BAViXr76+qv//vvzxctX37x48fKlKOtisYBnLwqll9hLlwhGDxvrVDAIteta
6IVxCo6eKHy0Zk/xOfiHPvGq8BSgTldVZ5xjt9EYA5WmcI5At7Klglez+LDj
kzSVIv1Ty8DvuWi/xunLAe81aqVdr5q2t3iZjZMZYz7q7a425Jx0UDJP0EJd
yNaO+MN7QJvw8Ef4S6LEK7VTiMr7OT3qTH4K0oOlwVvi/0rEc4pV0Gi7JS0F
jFD7jSHihrqngAZDhofmzTq9s7RlA16tDX+K5coOTg8ELdQDSIvMNR93dQtm
4QeImrYDFBnomE6tunarli3YQachrMHr0y/sVqEsMA7Aju4wVxu73tT4T0Sy
MbZTererseXS1nTwvlWPurMtuDrgvKV2xs3pcPVQ0TtwQdEd8D5rdk+1ciTy
Msi2QoBiqe0LOAQyS8+EDvzCiQ/8bnVAzIOwWbhVUGISni67FqqRhpAoD3rT
8kfJ1wt1A42qXQvRrWCByg1rb7GOVWHXgozeglJmkaXowl7V0ZlXQ0cGpbxX
5D2A/5pKd5X9zaTSt78OxsEY2Bq2tqpgXbMnBNW6thpKJv/TE0u//v4fI/mP
kfz/NpIn6q5rd63DrqRgkgpBbJ2I0mEpYgyYb2EZA37kRCw+DN2w5QZbOkh9
yXuQFS1rswXL13qHPzvz62A7Q0ogBx+PseoAqoUjdL4uSxADs0iPYKXOiPEu
O2sIlqxbFhTeWW/82YKuYVM3bLfQgd+MGEjp81I35qWWmAboF44yF6FURNrK
+vcIvyski2CXP6pYeeA1EbgASn/yRL3VO3XR6PrgLPa/EyZINsv6T6vfJ6yY
zT59+sdNcbXYlHXR9es9gzl/6MIz8fff8R7WDOcgjgYsH5UJSl4x/8C03uML
OU2Qi7ycCYKeh4nD48kHrHwr27mebN97y8A9oE0coyO7LdnFJTsp8XbsXRpx
ZobdWaSXXQXt7bcG/UGxkEpn/uh8gtzmCbSjH0FWzeu9IV/5BlkWWSLTDnnC
d6qyNrojl8XyYerHFUq/AtGB300lvExjAH7ewk2BYDL6igwrYbaq9QHLtrIy
WNA48pLyMSmCl2kJXqyPpYpFrfdSiYRXQ8az5KFgSyMLRXxHFnLTT2QdnewW
3EWS6rYi8nCOZJPUNda2+eC9XGV6sbi5IqA7l/DUGTJScf/yAf+axIC5emoW
CE2v397BCszKfkTwrQwMiUyLhBijxdO7m8tnz7zmfFbPe8vBCVp3RFgWLMGr
nV7Lz+z7OOf0+iFLgQbeTbwYTuvIJUEbew7zU/toEP5HfykhekJBolzgKAjV
8jnzRp7OiIx8E+r4YI+Z6ux11Jwq5Ecxyx6V5pSJlqONssJ4d5qoAE4ZFyX3
R2aXKcA72PQWhunzsLm6RU519OE0JeTtftJQKUiYLLgQC4b9hISOwABcaX9C
ziAqqusRzaQFI8lB48nBwxlrNwFVTMgUJmUSmAe1Mh5g+IBGunDsJSGxsAhY
37clnAdpxjFFJEHCO9qHAOU27d4jiX4MqO3WsMDrRMHBhPE1DpDe6l0MHkvs
YkwzjXMCsYDetqL/HHcF0vD6IZhVXwivTNcJLnoNtvWA71MOyqYZm+Akp2xy
EcFl+j/KlQJpjKMWTgEKsPYbcEB9E8DBaa/qhRxNI2IJGMfoC/WIMZgHU91I
dT86AgLRiA4MJARgMlbTZTRhOhetuQI6lOiT44YoC8b4Ubvp8WKpKV5POJ7L
ZK4M1W8AkaBhDL8TP7MB2jUN66aok1TZyXV7hRiBNePxWjsnWoBjIJzt8d9h
R8E2oUdXvwBfJyBNlx9Mf/yl7JC++Es1vojtgkh91R0QzO+7NwTa/VvVQQtu
ptgiER1LQqsqKFU5qlnLOKE+tulRrGCNY0eeZGo78BWRCBLfE/odPzlaBy7Q
locoVGh022eYITr7GEWOV7WcOwJHCxJHVhgW2mnIn2pgAUgkL/caOjKPW/8K
eO3ztihPcBGI1yjpaDBcQQoF5SQk3yZk+iBKEUv4jBSoHkx4H+lYOURA0+4o
pkpKkIsl18p44glbxwiaOXOc31kcCfoOgO9YAcnKPd1HDoLssV32HkbyCoFb
XOX2LD8lC2b5WjIfIgYwg5IhPMLmm3ElpncTKOQXw9ZHbMyxFBsLLZxQ5vMA
MJO523U2gMlMeSa+zzm9NmOap5ua2Vf5XENsVioIjdvafkJdSgBchGU7Wx6E
36xS0dOMXG67iBU4FkJD4pcJ7Kjt4D0rCaHQVEYtRIkJdXi+i28dWTNaIage
X4zaH1/kQxP8hrTd53RqalhTqzwdjd5Dl2tgfsjifxkn5qJwTHJDZRzEXx/X
cpWNxBxRyHGVyyAZ3EyV8whQyGEYakeFjkDh5CEJTAx1RbpmGUszlE79XZCo
uBNp2HAAr9uWyR1X0I8tolU1qmGva4IBS6wVglegypXIgAUbTwQ69/nwVh8Q
keBQkUwiQMYsBvGLgoOgmYjLGcSfEmKihwH8jlXzooZnqSGgLMhnvgeWXdeG
DIUEtxxszacG/u40sjMkHL5IltRb3OmkeYKsHR6mapKA56SUf3FzdZkVKQTf
xkCQQg+GpQFeTJNeJiOSHM7qcz5K07j6B4JhP02ognhAuMUJ7W5yrkVopE0r
jjvEVut8+C6TdFqiPe+d6CRZ8pgqA2wT5aMXXcxmUKEc544ak7uHCFl50cpS
gQu/shbVJgMyRBcXTLoIlXekrlKWgolKnIm1PqC1pW1Mnvae2pmcNXEZkpAy
aZ9SKOosaBAy4Wpk4nq9Jkftl2IrdcXlUdIaXUAjYmmPfonK4zHtTRJB3rWV
qaPe/wb7DA4Ykja7SXc1vscuGOHOq2cak7a0olQK4xLRRTy9u38WjDYWuqW0
UVJg6g7ZWl77+Be3sbtROgEbh3BniZWx60rPHYEsd3BIZKRO4WubOqQtpw/Q
GeiqI93z0MClEyXe6iCFGppMj1TGV25ZH7ZDQ55lrEVnu4TU0XsiN88AAB2c
ARLeovDgKJkvSds0ExMKvmzSA/W7yRlUZFjUf9zqDyHdPXE00H93Dz/QOMlL
KzNqXPQPdTulmPYKNaSayrvZtyLTgBSdYDxD+I9YEEphmnbOgkoKYQQj9d5l
E+O/fIQxtT55hMAO8WJLgwhh2y5sttV4Cbhlug4Hx9LYXR8EPSGZrIjM6H1I
cCTnHk08BB//PaKQLs2Xkl9PeqyFcN+c9kv83DwFtF9OdVNwxdseJcBjV4ZV
evCe4Yl6OKIgFFfeRUqit9Dr/nM1IviHaN5t3sca++3+vIeTZeKkppPgnQQ9
g4dHS1EZSRSRYhaW2hjIHOkro2DYha8hpatHPzFJhrntRUVlS3GAejjkVB5h
rhwLA/9KDekiCLBb4Qrq58tILlr9T/dv5r5qWRs2VqblmuqVlLuVG2u86zIZ
dknjZZ49Sp5kOimwfeZUAnF3Q0foQFlp2djaOxlShs5HrnbLPS5sDpvhAi3r
V8fRbguBcvz2XTPvukzl19FkhZ3xtYosR2Q+eTQa+5enJUAwkVhNaTsHR+Qa
BA9j3PzQtPvaVGuTKjRDWjCm9jNRTPevgxm8+x4hJ+fsFcWBnIzAV3JmApxc
jNYcYrpDBJAQbFXntUKqWXHVX4/gPSlNL9TPjDYkZUQqUpsT1cLjVm2m+w5q
s+o5jZZ221iMm4klX2feIljxXfAL0Yg/DoWtumIFoCNGK7gxdzZeLSnFPFDN
sujbwjQibVDYVHtb4ScSkI/HacNxpZcdPMmpyldM7n0mL9Xug4A32pWPUfF0
DQdUoC1qlDD2qDxU7qn7hJyWXAK9I1Yj1Yq8G0oVUXFsWHFwkqxyZ5uN5iXN
c64lyfra/3wJOJoA7J+t7w+nMcmnnQknWHykiPGjua9xYGOuNk2E6wMnIBMt
S0gzr8WTjBoIRf7YtLuCgpX7kyKTsODfVnibQx3ZqWtLyxHXzwFQxihcDI8u
1D8b4xkckU+ylMtYYSXirE9Bf5mh4xmCjK3ks81x/VeKQVhToEg4eLYd2Eb9
tq3lsq2ZVD6Cfoz+ZmPqnbgsyTEB2KhDj2WfumfEL6DMVR/6ajxAQe64phFb
ma+LZAgH+5ZCk2PNnfJXwEv++YRXcAhtJWmN6H7eQlElIxLhOgnlltb5Dutc
jb2sSdPlovfJ4cJ7glsse5fhAe5b3iaAYNS1zecqFroj0B+sxx13X9L11NOL
+9tncqqjwhdxFEpLwQEg8kAW6gw3rVLZnQUPm2SCEGbS38p4KXCdywNBMMGY
VBdPIaES5C/UBSDY/W0ohyVVoX2rEI+raa3tPNuuM6va1+1CcY5jUMaDJHFr
uxAxnvl4pLlSz/FtayAxSI5bllk3j2H2s1ARSNUeVi0ZBwWQtG4CpQVhZDjL
X/BDWDR+3IdOefyEQ/YzUdaEJbHs6wT/cCWDMhroDo7DOT//EoNQiMAsAF+i
Z5LjDD5WlyTfRc8NTaDMj3uQHjf7MqIkf0DijwGbS97OsTu6cZ8hcN0n4GLI
ArlSPYZ/X1noTNtVMgpVas5RgP+JKG4ZkIx828D1Q3U4WZc8sotU5FnTZxok
kvrsn7GdKIUA6ycNVBjCoxwlVeN8KsMPP3FoDaXAzsQiL1IKAE1aTTDzaNxf
oL3PteSYPFoviFC+kAf7KLTylKYkM2Oc/OJwAO+85SS3jzrga29JETGpmmmx
74eLt7nnCQBauq+wP9/W92eKh2hGakMkYMCbaMVvv23GNjnrXcc1ksxPegeY
5nKChERTO2nV4LQ91cS4BJVyHt+SlTSEHZYtVdUkGstEmUfw4/uMOaj0Mulh
SBST5lZqUZIL90QHw3X6PWY2dDqnUiUKozlZ1fNoYmGqPZG8LRfbuLlRbtrQ
qKLD/OvqTqKFJwZf21KUQrOS47mbt3cLdcKrTDXRu3KTu0yu+AlsDGrMZ1og
nO5l4u8uTlL6lWUYOnE90igKwNOXqSfu65TLCpkGueWBCc8qlJ4QHoW7yZRd
Ztz81OFsRrIPp24dl3kRDblOKcOHsXlzPMZJbf2jvrMY/kY7Jrsh2a6Fd86u
G34Zi/eh6wxiwlC579VddLwFjwPSjajaylQNDbqrS1/hfkpVah9i3KT67bWH
1K8uersdM+uJ+vqSF3ejOesStDc0O+rXltzHlELPACU9RKvlQbGzdz9kLArR
KVTu/FyfG+c6xRTBQal8T6Ryqr5opTjVNVnyY5pH27WNJGdcN7r64TXTCTA8
m135Qt70tskVI2WyiMR7UZbqDAEPF3E4o0qutvrAGmHzqXYuI2lpEimeGaPu
J4e8o3rf4ksXYXy3z8ncGjhLeG5D4TSoenD/CQVVu2/ozpHe+jIBDxXIgcLj
4UhzmVfBgr5PzA94keYTrgQkeIYwzDFRqz4oUajgUH2ERJ4wP42oZKRRxoIL
tro5nLiflE/x9huqo3BCES5BqU+f0jtR1ODz14z8N/43+oIoueWrMv47uavz
+++iKXQ1xpvZBDHMZnIR7b8cZVJDdc1T3jQ7TDEnUDoe6Vhbw9CqTnbRXbmx
hLYJd3/6JDdzQIzMvsKZwSeALzY2UAlMVFztKvtxZbIYLvsxvJCi+Dl+F4zl
NtA7Q85L6trhc6rPTb+TjpXvrVSysjSqoLQLdUdRzuuPeLjUSci8CAkzWMSx
j4G2VtaDoVGqcQhcjIINReqkMtYkdpHg9FBEJQ0D7CRtATFJD6BSj5DxF3Gf
E+CXtBNW0jX3TrVPM4PQ4fbrjJVu9hGm2fB4/NQYfEI0js5DorUYB+sb32ki
eMM/0HyfpKVS82c2ztPu4wmKPlez8trjh8CqeA1KCgG+ems93A30wnP25D58
IU/6cAfwmekDyKoJGz1c3vlaJE/40I+16Xl8iRoo0KdE8GlO1oTKlHgjSXFW
xlRLuFIxap9SjqafTNuLktWkI7RH2DfOtoTWje+6UTDs6DB0Aetayr0FlYJm
M76DRUE4XLir4mzyOEUVSsdluo53iNfJJY+nD9eSY16TFpgyFJyeym7PfMzn
QUCPcPkkmYCy2wmfPoWLZuQLZjNfsisnB/JBYJ5wO6yRSTWU6o/gWYlwLCmp
lJr9+Mk4/xywO089iLVhY7nhIrDSfDTl0HtgetlSuBE48z54FvYZbwjHqqeX
7+/egFc1TYj1G04PQgsqjidVLFjasvQQ1/C1i5fPCTTAfbgwiugoI/bzdePz
YbaLlLeL7U4gUR7LjeXK0V+KrvmLOeH73Mj5igjXLuGxnFRRBD1DcYfdaHUw
a5G6iv5buJleGSJySZTtjkSy4Za471BF+fnU52FsTVDgn4+RxqPclV0PXdyC
PasHbE486o+wVWvqivDAfXt5HWDLQr2R3Jvm3ufq9uaSasz4nzdtadhTQ8kP
8sWZA/me8iS5OCSwsBm2S5qRX2FHN4IJ8Ywy4TC5KiM3Ud7zlQ3JQe/iFZGf
+e8IyEdrx5LLiXsdNGjbf6nllwws/GUaFv4ifvdRrwfDHR2mhv1DGFmAiDUN
i3B+MH6a9CC7KWblUjuD2nAXiQoi3AYf0fXUf/fSmwqjgMcxT4QRQJ8HjtLg
sGE01E9iHm+azKDzhdVqMGkC6itmfMGsrDUcShUXTW7ZHANxd9SDmVwO4LEQ
uYdH6JQxU+wLhOwwGxahKrNMhUKbk2sZYc+Qc1PGOvTj3KDkwuHW2BfL4v4O
DaURBD2j5w/jKZbka/wFE+ZXOqnF/OVKiDM08ystrZBPsxbRlNTSJNOQfHmK
23lUUimhxzgWn4+rm55NTeQTl8QuyrL1o6PtZL6Gu/YxYCUisiNV46UWfoXQ
JN/1keb9eWRo0s0gM2ISH20cubHNcTzhaRjfjs2nFI+z4aRheLJMmyHD9Ird
n7tXmQ4oRbv74xH7bAokhjt6Ou1XSr+gHWsBcdBbJhsggkeqiokZAtWUGe6B
dum1H+ivW/IhXpA/3zyQruvxMpr9zI0mfB4aVki2BzaFtXzFYUtMPqhOHNK5
f3jLGywYQ7CWB2/pS3kTpbHcohq2PJzqZ7sGusUPGJiae0T41EAXeR13w0Jp
KitHSSYfItXJ2gOZv2+yMVPlnHLEo3sZYX7Wl91viJwbJgp/FMAbc3V/8+ZB
mb5cPBOx8h0Ekdx4A4EM1LHa9JuQC8Sh9szbCh4Lff9pu9/HJpgYF4xCwWn0
bZnJxlvAggsyjZa/UoCwhE/O9pmXTyD80wBVx7++gbYZpzWezTnbGxdj1zRl
BmIPDTOeiC8y8hcdSh9m8uIwF9hBWM+r3bH156XYP2fSPgv2TnSUjPTtxmuw
0bGWPOvKIxVsFbFoKMRKbKSrnXSvq4+eLt6gtQ7CcHxgBMDstmA6qZhYzOdm
vtOJYk6/Tgd72jy9/zD3V3BOjAJPV5xE8kX4O5jItX/eh8QxShny8BNDJ3uG
nxtjiqn6ZErylBuXJYT7puHqR4BO1DFIrjdxF5Ajaii67fjy6bRkJKF0od4h
OtG556fvEjEDJOrypFyYhUsntZJnIkPzK2N8DT86tejyTkzb71nz2J62xvSZ
uqTVes5M1XukTDThw/lStDKCu6+vuCJ9cXtx/F28Tda0vKaM//CzUizmaqe6
KMOQjr9vzBia/4qqQGdtPxgJQRoI899YCaKkv9JGrPA7jR/eb2xQAUutCh4m
47AcrSReqA4GEf7+BUqKZv8DruTUUh9MAAA=

-->
</rfc>
