<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?rfc toc="yes" ?>
<?rfc tocompact="yes"?>
<?rfc tocdepth="4"?>
<?rfc tocindent="yes"?>
<?rfc symrefs="yes" ?>
<?rfc sortrefs="yes"?>
<?rfc rfcedstyle="yes"?>
<?rfc subcompact="no"?>
<?rfc compact="yes" ?>
<?rfc iprnotified="Yes" ?>
<?rfc strict="no" ?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" category="info" docName="draft-li-teas-hierarchy-ip-controllers-10" obsoletes="" updates="" submissionType="IETF" xml:lang="en" tocInclude="true" tocDepth="4" symRefs="true" sortRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.10.0 -->
  <front>
    <title abbrev="HIC">Hierarchy of IP Controllers (HIC)</title>
    <seriesInfo name="Internet-Draft" value="draft-li-teas-hierarchy-ip-controllers-10"/>
    <author initials="Z" surname="Li" fullname="Zhenbin Li">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Huawei Bld., No.156 Beiqing Rd.</street>
          <city>Beijing</city>
          <region/>
          <code>100095</code>
          <country>China</country>
        </postal>
        <email>lizhenbin@huawei.com</email>
      </address>
    </author>
    <author initials="D" surname="Dhody" fullname="Dhruv Dhody">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Divyashree Techno Park, Whitefield</street>
          <city>Bangalore</city>
          <region>Karnataka</region>
          <code>560066</code>
          <country>India</country>
        </postal>
        <email>dhruv.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="H" surname="Chen" fullname="Huaimo Chen">
      <organization>Futurewei Technologies</organization>
      <address>
        <postal>
          <street/>
          <city>Boston</city>
          <region>MA</region>
          <code/>
          <country>USA</country>
        </postal>
        <email>huaimo.chen@futurewei.com</email>
      </address>
    </author>
    <date year="2022"/>
    <area>Routing</area>
    <workgroup>TEAS Working Group</workgroup>
    <keyword>HIC</keyword>
    <abstract>
      <t>
   This document describes the interactions between various IP controllers in a hierarchical fashion to provide various IP services. It describes how the
   Abstraction and Control of Traffic Engineered Networks (ACTN) framework is applied to the Hierarchy of IP controllers (HIC) as well as document the interactions with other protocols
   like BGP, Path Computation Element Communication Protocol (PCEP), and other YANG-based protocols to provide end to end dynamic services spanning multiple domains and controllers (e.g. Layer 3 Virtual Private Network (L3VPN), Seamless MPLS etc).
      </t>
    </abstract>
    <!--
  <note title="Requirements Language">
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in <xref target="RFC2119"/>.</t>
    </note>   -->
  </front>
  <middle>
    <section toc="default" numbered="true">
      <name>Introduction</name>
      <t>
   Software-Defined Networking (SDN) refers to a separation between the
   control elements and the forwarding components so that software
   running in a centralized system called a controller, can act to
   program the devices in the network to behave in specific ways.  A
   required element in an SDN architecture is a component that plans how
   the network resources will be used and how the devices will be
   programmed.  It is possible to view this component as performing
   specific computations to place flows within the network given
   knowledge of the availability of network resources, how other
   forwarding devices are programmed, and the way that other flows are
   routed. The Application-Based Network Operation (ABNO) <xref target="RFC7491" format="default"/>
   describes how various components and technologies fit together.
      </t>
      <t>
   A domain <xref target="RFC4655" format="default"/> is any collection of network
        elements within a common sphere of address management or path
        computation responsibility.  Specifically, within this document,
        it means a part of an operator's network that is under common
        management.  Network elements will often be grouped into
        domains based on technology types, vendor profiles, and
        geographic proximity and under a domain controller.
      </t>
      <t>
    Multiple such domains in the network are interconnected, and a path
    is established through a series of connected domains to form an end-to-end
    path over which various services are offered. Each domain is under the
    control of the domain controller (or lower-level controller), and a "super controller" (or high-level controller)
    takes responsibility for a high-level view of the network before distributing tasks to domain controllers (or lower-level controllers).
    It is possible for each of the domain to use a different tunnelling mechanism (eg RSVP-TE, Segment Routing (SR) etc).
      </t>
      <t>
   <xref target="RFC8453" format="default"/> describes the framework for
   Abstraction and Control of Traffic Engineered Networks (ACTN) as well as a set of management and control functions
   used to operate multiple TE networks. This documents would apply the ACTN principles to the Hierarchy of IP controllers (HIC)
   and focus on the applicability and interactions with other protocols and technologies (specific to IP packet domains).
      </t>
      <t>
   Sometimes, service (such as Layer 3 Virtual Private Network (L3VPN), Layer 2 Virtual Private Network (L2VPN), Ethernet VPN (EVPN), Seamless MPLS) require sites attached to different
   domains (under the control of different domain controller) to be interconnected as part of the VPN
   service. This requires multi-domain coordination between domain controllers to compute and set-up
   an E2E path for the VPN service.
      </t>
      <t>
   This document describes the interactions between various IP controllers in a hierarchical fashion to provide various IP services. It describes how the
   Abstraction and Control of Traffic Engineered Networks (ACTN) framework is applied to the Hierarchy of IP controllers (HIC) as well as document the interactions with control plane protocols
   (like BGP, Path Computation Element Communication Protocol (PCEP)) and management plane aspects (YANG models) to provide end to end dynamic services spanning multiple domains and controllers (e.g. L3VPN, Seamless MPLS, etc.).
      </t>
    </section>
    <section toc="default" anchor="sec_overview" numbered="true">
      <name>Overview</name>
      <t><xref target="fig_ex" format="default"/> show examples of multi-domain IP domains under the hierarchy of IP controllers.
      </t>
      <figure anchor="fig_ex">
        <name>Example: Hierarchy of IP controllers (HIC)</name>
        <artwork name="" type="" align="left" alt=""><![CDATA[

                          |
                    +------------+
                    |  SuperCo   |
                    +------------+
                          |
          ----------------------------------
          |               |                |
   +------------+   +------------+   +------------+
   |   DoCo#1   |   |   DoCo#2   |   |   DoCo#3   |
   +------------+   +------------+   +------------+


   +--Domain#1--+   +--Domain#2--+   +--Domain#3--+
   |            |   |            |   |            |
   |     B------+---+---D-----E--+---+------J     |
   |    /       |   |    \   /   |   |       \    |
   |   /        |   |     \ /    |   |        \   |
   |  A         |   |      H     |   |         L  |
   |   \        |   |     / \    |   |        /   |
   |    \       |   |    /   \   |   |       /    |
   |     C------+---+---F-----G--+---+------K     |
   |            |   |            |   |            |
   +------------+   +------------+   +------------+

          ]]></artwork>
      </figure>
      <t>The IP "Super Controller" receives a request from the network/service orchestrator to set-up dynamic services spanning multiple domains. The IP "Super Controller" breaks down and assigns tasks to the domain controllers, responsible for communicating to network devices in the domain. It further coordinates between the controller to provide a unified view of the multi-domain network.</t>
      <section toc="default" anchor="sec_actn" numbered="true">
        <name>Mapping to ACTN</name>
        <t>
        As per <xref target="RFC8453" format="default"/>, ACTN has following the main functions -
        </t>
        <ul spacing="normal">
          <li>Multi-domain coordination</li>
          <li>Virtualization/Abstraction</li>
          <li>Customer mapping/translation</li>
          <li>Virtual service coordination</li>
        </ul>
        <t>These functions are part of Multi-Domain Service Coordinator (MDSC) and/or Provisioning Network Controller (PNC). Further, these functions are part of the controller/orchestrator.</t>
        <t>The HIC is an instantiation of the ACTN framework for the IP packet network. The IP domain (lower-level) controllers implement the PNC functionalities for configuring, controlling, and monitoring the IP domain. The "super controller" (high-level controller) implements the MDSC functionalities for coordination between multiple domains as well as maintaining an abstracted view of multiple domains. It also takes care of the service-related functionalities of the customer-mapping/translation and virtual service coordination.</t>
        <t>The ACTN functions are part of the IP controllers and responsible for the TE topology and E2E path computation/set-up. There are other functions along with ACTN that are needed to manage multiple IP domain networks.</t>
      </section>
      <section toc="default" anchor="sec_interface" numbered="true">
        <name>Interface between Super Controller and Domain Controller in HIC</name>
        <t>The interaction between super controller and the domain controllers in HIC is a combination of Control Plane and Management Plane interface as shown in <xref target="fig_int" format="default"/>.
        BGP <xref target="RFC4271" format="default"/> and PCEP <xref target="RFC5440" format="default"/> are example of the control plane interface; whereas NETCONF <xref target="RFC6241" format="default"/> and RESTCONF <xref target="RFC8040" format="default"/>
        are examples of the management plane interface.
        </t>
        <figure anchor="fig_int">
          <name>Interface between Super Controller and Domain Controller</name>
          <artwork name="" type="" align="left" alt=""><![CDATA[

   +----------------------------------------------+
   |                Super Controller              |
   |                                              |
   |                                              |
   +------------------*------#---------------------+
                      *      #
                      *      #
                   *************************
                   *         #             *
             ######*###############        *
             #     *              #        *
   +---------#-----*--+        +--#--------*------+
   | Domain           |        | Domain           |
   | Controller       |        | Controller       |
   +--#------------*--+        +--#------------*--+
      #            *              #            *
      #            *              #            *


    * -> Control Plane Interface
    # -> Management Plane Interface


          ]]></artwork>
        </figure>
        <t>Note that ACTN's MDSC-PNC Interface (MPI) could be implemented via management plane interface using YANG models <xref target="I-D.ietf-teas-actn-yang" format="default"/> or via PCEP control plane interface
          <xref target="RFC8637" format="default"/>.</t>
      </section>
    </section>
    <section toc="default" anchor="sec_key" numbered="true">
      <name>Key Concepts</name>
      <section toc="default" anchor="sec_topo" numbered="true">
        <name>Topology</name>
        <t>The Domain Controller is expected to be aware of the topology of the network devices in its domain. The domain controller could participate in the IGP (<xref target="RFC3630" format="default"/> and <xref target="RFC5305" format="default"/>) or use
   BGP-LS <xref target="I-D.ietf-idr-rfc7752bis" format="default"/> by which link-state and TE information is collected and shared with the domain controller using the BGP routing protocol. </t>
        <t>An alternate approach would be to rely on the management plane interface which uses the YANG model for network/TE Topology as per <xref target="RFC8345" format="default"/> and <xref target="RFC8795" format="default"/>.</t>
        <t>The domain controller is expected to share the domain topology to the Super Controller, as per ACTN (where PNC abstract the topology towards MDSC). A level of abstraction is usually applied while presenting the topology to a higher-level controller. Topology abstraction is described in <xref target="RFC7926" format="default"/> as well as <xref target="RFC8453" format="default"/>. BGP-LS, PCEP-LS <xref target="I-D.dhodylee-pce-pcep-ls" format="default"/> or management plane interface based on the abstracted network/TE Topology could be used to carry the abstract topology to the super-controller. At minimum, the border nodes and inter-domain links are exposed to the super-controller. </t>
        <t>Further <xref target="RFC8453" format="default"/> defines three types of topology abstraction - (1) Native/White Topology; (2) Black Topology; and (3) Grey Topology. Based on the local policy, the domain controller would share the domain topology to the Super Controller based on the abstraction type. Note that any of the control plane or management plane mechanism could be used to carry abstracted domain topology. The Super Controller's MDSC function is expected to manage a E2E topology by coordinating the abstracted domain topology received from the domain controllers.</t>
      </section>
      <section toc="default" anchor="sec_pc" numbered="true">
        <name>Path Computation/Path instantiation</name>
        <t>The Domain Controller is responsible for computing and setup of path when the source and destination are in the same domain, otherwise the Super Controller coordinates the multi-domain path computation and setup with the help of the domain controller. This is aligned to ACTN.</t>
        <t>PCEP <xref target="RFC5440" format="default"/> provides mechanisms for Path Computation Elements (PCEs) <xref target="RFC4655" format="default"/> to
   perform path computations in response to Path Computation Clients
   (PCCs) requests. Since then, the role and function of the PCE has grown to allow
   delegated control <xref target="RFC8231" format="default"/> and PCE-initiated use of network
   resources <xref target="RFC8281" format="default"/>.</t>
        <t>Further, <xref target="RFC6805" format="default"/> and <xref target="RFC8751" format="default"/> describes a hierarchy of
    PCE with Parent PCE coordinating multi-domain path computation function between Child PCE(s). This fits well
    with HIC as described in this document.</t>
        <t>Note that a management plane interface which uses the YANG model for path computation/setup (<xref target="I-D.ietf-teas-yang-path-computation" format="default"/> and <xref target="I-D.ietf-teas-yang-te" format="default"/>) could be used in place of PCEP.</t>
        <t>In case there is a need to stitch per domain tunnels into an E2E tunnel, mechanism are described in <!--<xref target="I-D.lee-pce-lsp-stitching-hpce"/> and-->
          <xref target="I-D.ietf-pce-stateful-interdomain" format="default"/>.</t>
      </section>
      <section toc="default" anchor="sec_bgp" numbered="true">
        <name>BGP considerations</name>
        <t><xref target="RFC4456" format="default"/> describes the concept of route-reflection where a "route reflector" (RR) reflects the routes to avoid full mesh connection between Internal BGP (IBGP) peers. The IP domain
   controller can play the role of RR in its domain. The super controller can further act as RR to towards the domain controller.</t>
        <t>BGP can provide routing policies for traffic management, like
        route preference, AS-path filter policy, IP-prefix filter policy and
        route aggregation. The controller can distribute these BGP policies into the
        routers in a single IP domain. For the scenario of multiple domains,
        the super controller can distribute per BGP Policy into each IP domain
        controller. Then the IP domain controller trickles down the BGP Policy
        to the network devices.</t>
        <t><xref target="RFC8955" format="default"/> describes the concept of BGP Flowspec that
        can be used to distribute traffic flow specifications. A flow
        specification is an n-tuple consisting of several matching criteria
        that can be applied to IP traffic. The controller can originate the flow specifications and disseminate it to the routers. The flow action includes the redirection to a specific TE tunnel. Also, the IP domain controller could be
        responsible for collecting the flow sample in its domain and the super
        controller can act as the Flow Analysis Server.</t>
        <t><xref target="RFC7854" format="default"/> describes the BGP Monitoring Protocol
        (BMP) to monitor BGP sessions. BMP is used to obtain route views
        with a flexible way. In the fashion of hierarchical architecture, the
        IP domain controller can be used as the domain Monitoring Station.
        Meanwhile, the super controller is responsible for a high-level view
        of the global network state.</t>
      </section>
    </section>
    <section toc="default" anchor="sec_vpn" numbered="true">
      <name>VPN Service</name>
      <section toc="default" anchor="sec_smpls" numbered="true">
        <name>Seamless MPLS</name>
        <t><xref target="I-D.ietf-mpls-seamless-mpls" format="default">Seamless MPLS</xref>
      describes an architecture which can be used to extend MPLS networks to
      integrate access and core/aggregation networks into a single MPLS
      domain.In the
      seamless MPLS for mobile backhaul, since there are multiple domains
      including the core network and multiple mobile backhaul networks,
      for each domain there is a domain controller. In order
      to implement the end-to-end network service provision, there should be
      coordination among multiple domain controllers.</t>
        <t/>
        <figure anchor="fig_smpls">
          <name>Seamless MPLS</name>
          <artwork name="" type="" align="left" alt=""><![CDATA[

                             |
                             |
                             |
                          +----------+
           |--------------|Super     |---------|
           |              |Controller|         |
           |              +----------+         |
           |                 |                 |
           |                 |                 |
           |                 |                 |
       +------+           +------+          +------+
  |----|DoCo  |----|  |---|DoCo  |--|  |----|DoCo  |---|
  |    |#X1   |    |  |   |#Y    |  |  |    |#X2   |   |
  |    +------+    |  |   +------+  |  |    +------+   |
  |                |  |             |  |               |
  |                |  |             |  |               |
  |                |  |             |  |               |
  |               +----+           +----+              |
  |           ....|ABR1|...........|ABR3|....          |
+----+   .....    +----+           +----+    .....   +----+
| PE |...                                         ...| PE |
+----+   .....                                       +----+
              ....+----+           +----+    .....
                  |ABR2|...........|ABR4|....
                  +----+           +----+

  |      IGP-X1     |      IGP-Y     |       IGP-X2     |
  |       (MBH)     |      (Core)    |       (MBH)      |
  |                 |                |                  |
  |-----BGP LSP-----|-----BGP LSP----|------BGP LSP-----|
  |                 |                |                  |
  |---LDP/TE LSP----|----LDP/TE LSP--|-----LDP/TE LSP---|
  |                 |                |                  |


]]></artwork>
        </figure>
        <t>Super Controller is responsible for setting the seamless MPLS service. It should break down the service model to network configuration model <xref target="RFC8309" format="default"/> and the domain controller further break it to the device configuration model to the PE/ASBR to make the E2E seamless MPLS service. The selection of appropriate ASBRs and handling of intra-domain tunnels is coordinated by the Super Controller in a similar fashion as shown in <xref target="sec_l3vpn" format="default"/>.</t>
        <t>By enabling BGP sessions between Domain Controller and Super Controller, BGP labeled routes can also be learned at Super Controller. As Super Controller is aware of the (abstract) topology, it could make intelligent decisions regarding E2E BGP LSP to optimize based on the overall traffic information.</t>
      </section>
      <section toc="default" anchor="sec_l3vpn" numbered="true">
        <name>L3VPN</name>
        <t>
    A Layer 3 IP VPN service is a collection of sites that are authorized
   to exchange traffic between each other over a shared IP
   infrastructure. <xref target="RFC4110" format="default"/> provides a framework for Layer 3 Provider-Provisioned
   Virtual Private Networks (PPVPNs). <xref target="RFC8299" format="default"/> provides a L3VPN
   service delivery YANG model for PE-based VPNs. The Super controller is expected to implement the L3SM model
   and translate it to network models towards the domain controller, which in turn translate it to the device model.
   See <xref target="RFC8309" format="default"/> for more details.
        </t>
        <figure anchor="fig_l3vpn">
          <name>L3VPN</name>
          <artwork name="" type="" align="left" alt=""><![CDATA[
                                  | L3SM
                                  V
                       +--------------------+
                       |  Super Controller  |
                       +--------------------+
                                  |
                  +-------------------------------+
                  |                               |
                  V                               V
               +--------+                   +--------+
               | DoCo#1 |                   | DoCo#2 |
               |        |                   |        |
               +--------+                   +--------+

         CE                                                   CE
          \     AS 100                          AS 200       /
           \                                               /
            A----B----C----ASBR1------ASBR2----D----E----F
           /    /    /       /          /     /    /    /
          /    /    /       /          /     /    /    /
   CE----G----H----I----ASBR3------ASBR4----J----K----L------CE
]]></artwork>
        </figure>
        <t>Based on the user data in the L3SM model, the network configurations need to be trickle down to the network device to set up the L3VPN.</t>
        <t><xref target="RFC9182" format="default"/> describes the need for a YANG model for use between the entity that
   interacts directly with the customer (service orchestrator) and the
   entity in charge of network orchestration and control which,
   according to <xref target="RFC8309" format="default"/>, can be referred to as Service Delivery
   Model. The resulting model is called the L3VPN Network
   Model (L3NM).</t>
        <t>Based on the QoS or Policy requirement for the L3VPN service, the Super Controller may -
        </t>
        <ul spacing="normal">
          <li>Set the tunnel selection policy at the PE/ASBR routers so that they could select the existing tunnels</li>
          <li>Select an existing tunnel at the controller level and bind it to the VPN service</li>
          <li>Initiate the process of creating a new tunnel based on the QoS requirement and bind it to the VPN service</li>
          <li>Initiate the process of creating a new tunnel based on the policy</li>
        </ul>
        <t>Refer <xref target="I-D.ietf-teas-te-service-mapping-yang" format="default"/> for more details from ACTN perspective.</t>
        <t>Apart from the Management plane interface based on respective YANG models, the control plane interface PCEP could be used for path computation and setup. </t>
      </section>
      <section toc="default" anchor="sec_l2" numbered="true">
        <name>L2VPN and EVPN service</name>
        <t>There are two fundamentally different kinds of Layer 2 VPN service
   that a service provider could offer to a customer: Virtual Private
   Wire Service (VPWS) and Virtual Private LAN Service (VPLS) <xref target="RFC4664" format="default"/>.
   A VPWS is a VPN service that supplies an L2 point-to-point service.
   A VPLS is an L2 service that emulates LAN service across a Wide Area
   Network (WAN). A BGP MPLS-based Ethernet VPN (EVPN) <xref target="RFC7432" format="default"/> addresses
   some of the limitations when it
   comes to multihoming and redundancy, multicast optimization,
   provisioning simplicity, flow-based load balancing, and multipathing, etc.
        </t>
        <t>The handling of L2VPN/EVPN service is done in a similar fashion as shown in <xref target="sec_l3vpn" format="default"/>.</t>
      </section>
    </section>
    <section toc="default" anchor="sec_ext" numbered="true">
      <name>Possible Features/Extensions</name>
      <t>This sections list some of the possible features or protocol extensions that could be worked on to deploy HIC in a multi-domain packet network.
      </t>
      <ol spacing="normal" type="1"><li>Simplify the initial configurations needed to set-up the relationship between the super controller and the domain controllers. Note that
    			this could be done via exchanges during initial session establishment, discovery via other protocols, service discovery (such as DNS etc.).</li>
        <li>The (higher-level controller, lower-level controller) relationship or the role of the controller. </li>
        <li>The learning and handling of various capabilities of the Super Controller and Domain Controller. </li>
        <li>Handling of multiple instances of the controller at each level for high availability.</li>
      </ol>
      <t>[Editor's Note - This list is expected to be updated in the next version with more details]</t>
    </section>
    <section toc="default" numbered="true">
      <name>Other Considerations</name>
      <section toc="default" anchor="sec_cp" numbered="true">
        <name>Control Plane</name>
        <section toc="default" anchor="sec_pce" numbered="true">
          <name>PCE / PCEP</name>
          <t>The Path Computation Element communication Protocol (PCEP) <xref target="RFC5440" format="default"/> provides
   mechanisms for Path Computation Elements (PCEs) <xref target="RFC4655" format="default"/> to perform path
   computations in response to Path Computation Clients (PCCs) requests.</t>
          <t>The ability to compute shortest constrained TE LSPs in Multiprotocol
   Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across
   multiple domains have been identified as a key motivation for PCE
   development.</t>
          <t>A stateful PCE <xref target="RFC8231" format="default"/> is capable of considering, for the purposes of
   path computation, not only the network state in terms of links and
   nodes (referred to as the Traffic Engineering Database or TED) but
   also the status of active services (previously computed paths,
   and currently reserved resources, stored in the Label Switched
   Paths Database (LSPDB).</t>
          <t><xref target="RFC8051" format="default"/> describes general considerations for
   a stateful PCE deployment and examines its applicability and
   benefits, as well as its challenges and limitations through a number
   of use cases.</t>
          <t><xref target="RFC8231" format="default"/> describes a set of extensions to PCEP to
   provide stateful control.  A stateful PCE has access to not only the
   information carried by the network's Interior Gateway Protocol (IGP),
   but also the set of active paths and their reserved resources for its
   computations.  The additional state allows the PCE to compute
   constrained paths while considering individual LSPs and their
   interactions.  <xref target="RFC8281" format="default"/> describes the setup,
   maintenance and teardown of PCE-initiated LSPs under the stateful PCE
   model.</t>
          <t><xref target="RFC8231" format="default"/> also describes the active stateful PCE.
   The active PCE functionality allows a PCE to reroute an existing
   LSP or make changes to the attributes of an existing LSP, or a PCC to delegate
   control of specific LSPs to a new PCE.</t>
          <t>Computing paths across large multi-domain environments
   require special computational components and cooperation between
   entities in different domains capable of complex path computation.
   The PCE provides an architecture and a set of functional components
   to address this problem space. A PCE may be used to compute
   end-to-end paths across multi-domain
   environments using a per-domain path computation technique <xref target="RFC5152" format="default"/>.
   The Backward recursive PCE based path computation (BRPC) mechanism
   <xref target="RFC5441" format="default"/> defines a PCE-based path computation procedure to compute
   inter-domain constrained  MPLS and
   GMPLS TE networks. However,
   both per-domain and BRPC techniques assume that the sequence of
   domains to be crossed from source to destination is known, either
   fixed by the network operator or obtained by other means.</t>
          <t><xref target="RFC6805" format="default"/> describes a Hierarchical PCE (H-PCE)
   architecture which can be used for computing end-to-end paths for
   inter-domain MPLS Traffic Engineering (TE) and GMPLS Label Switched
   Paths (LSPs) when the domain sequence is not known.
   Within the Hierarchical PCE (H-PCE) architecture,
   the Parent PCE (P-PCE) is used to compute a multi-domain
   path based on the domain connectivity information.  A Child PCE
   (C-PCE) may be responsible for a single domain or multiple domains,
   it is used to compute the intra-domain path based on its domain
   topology information.</t>
          <t><xref target="RFC8751" format="default"/> state the considerations for stateful PCE(s) in
   hierarchical PCE architecture.  In particular, the behaviour changes
   and additions to the existing stateful PCE mechanisms (including PCE-
   initiated LSP set-up and active PCE usage) in the context of networks
   using the H-PCE architecture.</t>
          <t><xref target="RFC8637" format="default"/> examines the applicability of PCE/PCEP to the ACTN
   framework in detail.</t>
          <t><xref target="RFC8283" format="default"/> introduces the architecture for PCE as a central controller
   as an extension of the architecture described in <xref target="RFC4655" format="default"/> and
   assumes the continued use of PCEP as the protocol used between PCE
   and PCC. Some related extension to PCEP  <xref target="RFC9168" format="default"/> and <xref target="RFC9050" format="default"/> are also applicable in HIC.</t>
        </section>
        <section toc="default" anchor="sec_bgp_cons" numbered="true">
          <name>BGP</name>
          <t> <xref target="I-D.ietf-idr-rfc7752bis" format="default"/> describes a mechanism by which link-state and TE
   information can be collected from networks and shared with external
   components using the BGP routing protocol. This is
   achieved using a new BGP Network Layer Reachability Information
   (NLRI) encoding format and a new BGP path attribute (BGP-LS
   attribute) that carries link, node, and prefix
          parameters and attributes.</t>
          <t>BGP-LS is another approach to collect
          network topology information. It is an extension to BGP for
          distribution of the network's link-state (LS) topology to external
          entities, such as the SDN controller. Network's link-state topology
          consists of nodes and links and a set of attributes.
          The link-state topology  is distributed among
          the IGP domain. The specific protocol used in an IGP domain could be OSPF
          <xref target="RFC2238" format="default"/> or IS-IS <xref target="ISO10589" format="default"/>. Note that, the
          detailed link-state models of these two protocols are not identical.
          Therefore, BGP-LS can provide a more abstract topology model that
          can map the IGP models.</t>
          <!--<t>The domain controller can play the role of BGP speaker to
          retrieve the link-state information from IGP LSDBs in its domain, in case the domain controller participate in the IGP.
          Then the super controller can also further act as BGP speaker to
          collect global link-state information from the domain
          controllers.</t>-->
          <t>The domain controller acts as a consumer to collect the domain's link-state and TE information via BGP-LS. The domain controller would usually abstract the domain information towards the super-controller and further send it via BGP-LS. </t>
          <t>BGP-Flowspec is a solution devised for preventing distributed
          Denial-of-service (DDoS) attack. BGP-Flowspec distributes
          specification rules into neighbours. <xref target="RFC8955" format="default"/> defines a new BGP NLRI
          encoding format that can be used to distribute traffic flow
          specifications. Additionally, it defines two applications of that
          encoding format: one that can be used to automate inter-domain
          coordination of traffic filtering, such as what is required in order
          to mitigate DDoS attacks; and a second application to provide
          traffic filtering in the context of BGP/MPLS VPN service.</t>
          <t>The IP domain controller can act as the traffic sampling node.
          The super controller can act as the traffic analysis server. When
          the super controller finds the attack happened, the super controller
          should distribute the flow rules to associated IP domain
          controllers. And each IP domain controller should distribute the
          flow rules into the ingress routers. Additionally one of the actions taken could be "redirect" where flow could be redirected to the TE tunnels created by the controller. </t>
          <t><xref target="I-D.luo-grow-bgp-controller-based-ts" format="default"/> describes
          the traffic steering based on BGP controller. The traditional method
          for traffic steering depends on the static configuration which is
          time-consuming and inefficient. With the hierarchical IP controller, the
          IP domain controller can have the domain network topology view and
          routing information while the super controller can have the global
          network topology view and routing information. The super controller
          can compute the end-to-end paths to satisfy the differentiated
          service requirement. The IP domain controller may be used to
          distribute the routing policy into the routers. BGP policy varies in
          many aspects. Its goal is to meet the customer application and
          connectivity requirement, and specific service transport needs. So
          the super BGP controller is responsible for the coordination of
          multiple domain BGP Policy. And then distribute Policy to the related IP
          domain controller. The IP domain controller is responsible for
          distributing the policy to its network nodes.</t>
          <t><xref target="I-D.ietf-idr-rtc-hierarchical-rr" format="default"/> describes the
          route target (RT) constrain mechanism in the hierarchical route
          reflection (RR) scenario. <xref target="RFC4684" format="default"/> describes the
          route-target constrain mechanism to build a route distribution graph
          in order to restrict the propagation of Virtual Private Network
          (VPN) routes. <xref target="I-D.ietf-idr-rtc-hierarchical-rr" format="default"/>
          proposes a solution to address the RT constrain issue in the
          hierarchical RR scenarios. The super controller corresponding to
          higher level RR can receive the RT-constrain routes from the lower
          level RR, which is acted by the IP domain controller. The higher
          level RR will select one of the received routes as the best route.
          then it should advertise the best route to all the lower level RR to
          build the route distribution graph. This fits well with the HIC as
          described in this document.</t>
        </section>
      </section>
      <section toc="default" anchor="sec_mp" numbered="true">
        <name>Management Plane</name>
        <section toc="default" anchor="sec_Yang" numbered="true">
          <name>YANG Models</name>
          <t>This is a non-exhaustive list of possible YANG models developed or in-development that could be used for HIC.
          </t>
          <ul empty="true" spacing="normal">
            <li>Topology: <xref target="RFC8345" format="default"/> defines a generic YANG data model for
        network topology. <xref target="RFC8795" format="default"/> defines a YANG data model for representing, retrieving
        and manipulating Traffic Engineering (TE) Topologies. </li>
            <li>Tunnel: <xref target="I-D.ietf-teas-yang-te" format="default"/> defines a YANG data model for the configuration and
        management of Traffic Engineering (TE) interfaces, tunnels and Label
        Switched Paths (LSPs).</li>
            <li>L3VPN: The Layer 3 service model (L3SM) is defined in <xref target="RFC8299" format="default"/>, which is a YANG data model that can be used for
   communication between customers and network operators and to deliver
   a Layer 3 provider-provisioned VPN service. <xref target="I-D.ietf-bess-l3vpn-yang" format="default"/> defines a YANG data model that can be used to configure
   and manage BGP Layer 3 VPNs at the device. Note that a network configuration model at the Domain Controller level needs to be developed.</li>
            <li>L2VPN/EVPN: <xref target="RFC8466" format="default"/> defines a YANG data model that can be used to configure
   a Layer 2 Provider-Provisioned VPN service. This model is intended to be instantiated at the management system to
   deliver the overall service. <xref target="I-D.ietf-bess-l2vpn-yang" format="default"/> and <xref target="I-D.ietf-bess-evpn-yang" format="default"/> defines a YANG data model to
   configure and manage L2VPN and EVPN service respectively. Note that a network configuration model at the Domain Controller level needs to be developed.</li>
            <li>OAM: TBD</li>
            <li>BGP Policy: <xref target="I-D.ietf-idr-bgp-model" format="default"/> defines a
              YANG data model that can be used to configure BGP Policy based
              on data centre, carrier and content provider operational
              requirements. The model is intended to be vendor-neutral, in
              order to allow operators to manage BGP configuration in
              heterogeneous environments with routers supplied by multiple
              vendors. Note that a network configuration model at the Domain
              Controller level needs to be developed.</li>
            <li>BGP Flowspec: <xref target="I-D.wu-idr-flowspec-yang-cfg" format="default"/>
              defines a YANG data model for Flow Specification
              implementations. The configuration data is described as flow
              specification rules that can be distributed as BGP NLRI to a
              network element. The rules can be used to filter Distributed
              Denial of Service attacks (DDoS) besides other use cases. Note
              that a network configuration model at the Domain Controller
              level needs to be developed.</li>
          </ul>
          <t><xref target="RFC8969" format="default"/> provides a framework that describes and discusses an
   architecture for service and network management automation that takes
   advantage of YANG modeling technologies. This is quite apt for HIC and includes interactions between multiple YANG models as described in <xref target="RFC8969" format="default"/>.</t>
          <t>[Editor's Note - the above list should be extended.]</t>
        </section>
        <section toc="default" anchor="sec_netconf" numbered="true">
          <name>Protocol Considerations</name>
          <t>The Network Configuration Protocol (NETCONF) <xref target="RFC6241" format="default"/> provides mechanisms to install, manipulate, and delete the
   configuration of network devices. The RESTCONF <xref target="RFC8040" format="default"/> describes an HTTP-based protocol that provides a
   programmatic interface for accessing data defined in YANG, using the
   datastore concepts defined in NETCONF. </t>
          <t>Some other mechanism like gRPC/gNMI could also be used between controllers using the same YANG data models.</t>
        </section>
      </section>
    </section>
    <section toc="default" anchor="sec_iana" numbered="true">
      <name>IANA Considerations</name>
      <t>There are no IANA concerns in this document.</t>
    </section>
    <section toc="default" numbered="true">
      <name>Security Considerations</name>
      <t>There are no new security concerns in this document.</t>
    </section>
    <section toc="default" numbered="true">
      <name>Acknowledgments</name>
    </section>
    <section toc="default" numbered="true">
      <name>Contributing Authors</name>
      <artwork name="" type="" align="left" alt=""><![CDATA[
Dailongfei (Larry)
Huawei Technologies,
Beijing, China

Email: larry.dai@huawei.com
]]></artwork>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        <!--<?rfc include="reference.RFC.2119.xml" ?>-->
    <reference anchor="RFC8453" target="https://www.rfc-editor.org/info/rfc8453" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8453.xml">
          <front>
            <title>Framework for Abstraction and Control of TE Networks (ACTN)</title>
            <author initials="D." surname="Ceccarelli" fullname="D. Ceccarelli" role="editor">
              <organization/>
            </author>
            <author initials="Y." surname="Lee" fullname="Y. Lee" role="editor">
              <organization/>
            </author>
            <date year="2018" month="August"/>
            <abstract>
              <t>Traffic Engineered (TE) networks have a variety of mechanisms to facilitate the separation of the data plane and control plane.  They also have a range of management and provisioning protocols to configure and activate network resources.  These mechanisms represent key technologies for enabling flexible and dynamic networking.  The term "Traffic Engineered network" refers to a network that uses any connection-oriented technology under the control of a distributed or centralized control plane to support dynamic provisioning of end-to- end connectivity.</t>
              <t>Abstraction of network resources is a technique that can be applied to a single network domain or across multiple domains to create a single virtualized network that is under the control of a network operator or the customer of the operator that actually owns the network resources.</t>
              <t>This document provides a framework for Abstraction and Control of TE Networks (ACTN) to support virtual network services and connectivity services.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8453"/>
          <seriesInfo name="DOI" value="10.17487/RFC8453"/>
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="RFC2238" target="https://www.rfc-editor.org/info/rfc2238" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.2238.xml">
          <front>
            <title>Definitions of Managed Objects for HPR using SMIv2</title>
            <author initials="B." surname="Clouston" fullname="B. Clouston" role="editor">
              <organization/>
            </author>
            <author initials="B." surname="Moore" fullname="B. Moore" role="editor">
              <organization/>
            </author>
            <date year="1997" month="November"/>
            <abstract>
              <t>This memo defines a portion of the Management Information Base (MIB) for use with network management protocols in the Internet community.  In particular, it defines objects for monitoring and controlling network devices with HPR (High Performance Routing) capabilities.  This memo identifies managed objects for the HPR protocol.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2238"/>
          <seriesInfo name="DOI" value="10.17487/RFC2238"/>
        </reference>
        <reference anchor="RFC3630" target="https://www.rfc-editor.org/info/rfc3630" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.3630.xml">
          <front>
            <title>Traffic Engineering (TE) Extensions to OSPF Version 2</title>
            <author initials="D." surname="Katz" fullname="D. Katz">
              <organization/>
            </author>
            <author initials="K." surname="Kompella" fullname="K. Kompella">
              <organization/>
            </author>
            <author initials="D." surname="Yeung" fullname="D. Yeung">
              <organization/>
            </author>
            <date year="2003" month="September"/>
            <abstract>
              <t>This document describes extensions to the OSPF protocol version 2 to support intra-area Traffic Engineering (TE), using Opaque Link State Advertisements.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3630"/>
          <seriesInfo name="DOI" value="10.17487/RFC3630"/>
        </reference>
        <reference anchor="RFC4110" target="https://www.rfc-editor.org/info/rfc4110" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4110.xml">
          <front>
            <title>A Framework for Layer 3 Provider-Provisioned Virtual Private Networks (PPVPNs)</title>
            <author initials="R." surname="Callon" fullname="R. Callon">
              <organization/>
            </author>
            <author initials="M." surname="Suzuki" fullname="M. Suzuki">
              <organization/>
            </author>
            <date year="2005" month="July"/>
            <abstract>
              <t>This document provides a framework for Layer 3 Provider-Provisioned Virtual Private Networks (PPVPNs).  This framework is intended to aid in the standardization of protocols and mechanisms for support of layer 3 PPVPNs.  It is the intent of this document to produce a coherent description of the significant technical issues that are important in the design of layer 3 PPVPN solutions.  Selection of specific approaches, making choices regarding engineering tradeoffs, and detailed protocol specification, are outside of the scope of this framework document.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4110"/>
          <seriesInfo name="DOI" value="10.17487/RFC4110"/>
        </reference>
        <reference anchor="RFC4271" target="https://www.rfc-editor.org/info/rfc4271" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4271.xml">
          <front>
            <title>A Border Gateway Protocol 4 (BGP-4)</title>
            <author initials="Y." surname="Rekhter" fullname="Y. Rekhter" role="editor">
              <organization/>
            </author>
            <author initials="T." surname="Li" fullname="T. Li" role="editor">
              <organization/>
            </author>
            <author initials="S." surname="Hares" fullname="S. Hares" role="editor">
              <organization/>
            </author>
            <date year="2006" month="January"/>
            <abstract>
              <t>This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol.</t>
              <t>The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems.  This network reachability information includes information on the list of Autonomous Systems (ASes) that reachability information traverses. This information is sufficient for constructing a graph of AS connectivity for this reachability from which routing loops may be pruned, and, at the AS level, some policy decisions may be enforced.</t>
              <t>BGP-4 provides a set of mechanisms for supporting Classless Inter-Domain Routing (CIDR).  These mechanisms include support for advertising a set of destinations as an IP prefix, and eliminating the concept of network "class" within BGP.  BGP-4 also introduces mechanisms that allow aggregation of routes, including aggregation of AS paths.</t>
              <t>This document obsoletes RFC 1771.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4271"/>
          <seriesInfo name="DOI" value="10.17487/RFC4271"/>
        </reference>
        <reference anchor="RFC4456" target="https://www.rfc-editor.org/info/rfc4456" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4456.xml">
          <front>
            <title>BGP Route Reflection: An Alternative to Full Mesh Internal BGP (IBGP)</title>
            <author initials="T." surname="Bates" fullname="T. Bates">
              <organization/>
            </author>
            <author initials="E." surname="Chen" fullname="E. Chen">
              <organization/>
            </author>
            <author initials="R." surname="Chandra" fullname="R. Chandra">
              <organization/>
            </author>
            <date year="2006" month="April"/>
            <abstract>
              <t>The Border Gateway Protocol (BGP) is an inter-autonomous system routing protocol designed for TCP/IP internets.  Typically, all BGP speakers within a single AS must be fully meshed so that any external routing information must be re-distributed to all other routers within that Autonomous System (AS).  This represents a serious scaling problem that has been well documented with several alternatives proposed.</t>
              <t>This document describes the use and design of a method known as "route reflection" to alleviate the need for "full mesh" Internal BGP (IBGP).</t>
              <t>This document obsoletes RFC 2796 and RFC 1966.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4456"/>
          <seriesInfo name="DOI" value="10.17487/RFC4456"/>
        </reference>
        <reference anchor="RFC4655" target="https://www.rfc-editor.org/info/rfc4655" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4655.xml">
          <front>
            <title>A Path Computation Element (PCE)-Based Architecture</title>
            <author initials="A." surname="Farrel" fullname="A. Farrel">
              <organization/>
            </author>
            <author initials="J.-P." surname="Vasseur" fullname="J.-P. Vasseur">
              <organization/>
            </author>
            <author initials="J." surname="Ash" fullname="J. Ash">
              <organization/>
            </author>
            <date year="2006" month="August"/>
            <abstract>
              <t>Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks.  Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains.</t>
              <t>This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space.  This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4655"/>
          <seriesInfo name="DOI" value="10.17487/RFC4655"/>
        </reference>
        <reference anchor="RFC4664" target="https://www.rfc-editor.org/info/rfc4664" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4664.xml">
          <front>
            <title>Framework for Layer 2 Virtual Private Networks (L2VPNs)</title>
            <author initials="L." surname="Andersson" fullname="L. Andersson" role="editor">
              <organization/>
            </author>
            <author initials="E." surname="Rosen" fullname="E. Rosen" role="editor">
              <organization/>
            </author>
            <date year="2006" month="September"/>
            <abstract>
              <t>This document provides a framework for Layer 2 Provider Provisioned Virtual Private Networks (L2VPNs).  This framework is intended to aid in standardizing protocols and mechanisms to support interoperable L2VPNs.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4664"/>
          <seriesInfo name="DOI" value="10.17487/RFC4664"/>
        </reference>
        <reference anchor="RFC4684" target="https://www.rfc-editor.org/info/rfc4684" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4684.xml">
          <front>
            <title>Constrained Route Distribution for Border Gateway Protocol/MultiProtocol Label Switching (BGP/MPLS) Internet Protocol (IP) Virtual Private Networks (VPNs)</title>
            <author initials="P." surname="Marques" fullname="P. Marques">
              <organization/>
            </author>
            <author initials="R." surname="Bonica" fullname="R. Bonica">
              <organization/>
            </author>
            <author initials="L." surname="Fang" fullname="L. Fang">
              <organization/>
            </author>
            <author initials="L." surname="Martini" fullname="L. Martini">
              <organization/>
            </author>
            <author initials="R." surname="Raszuk" fullname="R. Raszuk">
              <organization/>
            </author>
            <author initials="K." surname="Patel" fullname="K. Patel">
              <organization/>
            </author>
            <author initials="J." surname="Guichard" fullname="J. Guichard">
              <organization/>
            </author>
            <date year="2006" month="November"/>
            <abstract>
              <t>This document defines Multi-Protocol BGP (MP-BGP) procedures that allow BGP speakers to exchange Route Target reachability information.  This information can be used to build a route distribution graph in order to limit the propagation of Virtual Private Network (VPN) Network Layer Reachability Information (NLRI) between different autonomous systems or distinct clusters of the same autonomous system.  This document updates RFC 4364.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4684"/>
          <seriesInfo name="DOI" value="10.17487/RFC4684"/>
        </reference>
        <reference anchor="RFC5152" target="https://www.rfc-editor.org/info/rfc5152" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5152.xml">
          <front>
            <title>A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)</title>
            <author initials="JP." surname="Vasseur" fullname="JP. Vasseur" role="editor">
              <organization/>
            </author>
            <author initials="A." surname="Ayyangar" fullname="A. Ayyangar" role="editor">
              <organization/>
            </author>
            <author initials="R." surname="Zhang" fullname="R. Zhang">
              <organization/>
            </author>
            <date year="2008" month="February"/>
            <abstract>
              <t>This document specifies a per-domain path computation technique for establishing inter-domain Traffic Engineering (TE) Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Label Switched Paths (LSPs).  In this document, a domain refers to a collection of network elements within a common sphere of address management or path computational responsibility such as Interior Gateway Protocol (IGP) areas and Autonomous Systems.</t>
              <t>Per-domain computation applies where the full path of an inter-domain TE LSP cannot be or is not determined at the ingress node of the TE LSP, and is not signaled across domain boundaries.  This is most likely to arise owing to TE visibility limitations.  The signaling message indicates the destination and nodes up to the next domain boundary.  It may also indicate further domain boundaries or domain identifiers.  The path through each domain, possibly including the choice of exit point from the domain, must be determined within the domain.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5152"/>
          <seriesInfo name="DOI" value="10.17487/RFC5152"/>
        </reference>
        <reference anchor="RFC5305" target="https://www.rfc-editor.org/info/rfc5305" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5305.xml">
          <front>
            <title>IS-IS Extensions for Traffic Engineering</title>
            <author initials="T." surname="Li" fullname="T. Li">
              <organization/>
            </author>
            <author initials="H." surname="Smit" fullname="H. Smit">
              <organization/>
            </author>
            <date year="2008" month="October"/>
            <abstract>
              <t>This document describes extensions to the Intermediate System to Intermediate System (IS-IS) protocol to support Traffic Engineering (TE).  This document extends the IS-IS protocol by specifying new information that an Intermediate System (router) can place in Link State Protocol Data Units (LSP).  This information describes additional details regarding the state of the network that are useful for traffic engineering computations.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5305"/>
          <seriesInfo name="DOI" value="10.17487/RFC5305"/>
        </reference>
        <reference anchor="RFC5440" target="https://www.rfc-editor.org/info/rfc5440" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5440.xml">
          <front>
            <title>Path Computation Element (PCE) Communication Protocol (PCEP)</title>
            <author initials="JP." surname="Vasseur" fullname="JP. Vasseur" role="editor">
              <organization/>
            </author>
            <author initials="JL." surname="Le Roux" fullname="JL. Le Roux" role="editor">
              <organization/>
            </author>
            <date year="2009" month="March"/>
            <abstract>
              <t>This document specifies the Path Computation Element (PCE) Communication Protocol (PCEP) for communications between a Path Computation Client (PCC) and a PCE, or between two PCEs.  Such interactions include path computation requests and path computation replies as well as notifications of specific states related to the use of a PCE in the context of Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering.  PCEP is designed to be flexible and extensible so as to easily allow for the addition of further messages and objects, should further requirements be expressed in the future.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5440"/>
          <seriesInfo name="DOI" value="10.17487/RFC5440"/>
        </reference>
        <reference anchor="RFC5441" target="https://www.rfc-editor.org/info/rfc5441" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5441.xml">
          <front>
            <title>A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths</title>
            <author initials="JP." surname="Vasseur" fullname="JP. Vasseur" role="editor">
              <organization/>
            </author>
            <author initials="R." surname="Zhang" fullname="R. Zhang">
              <organization/>
            </author>
            <author initials="N." surname="Bitar" fullname="N. Bitar">
              <organization/>
            </author>
            <author initials="JL." surname="Le Roux" fullname="JL. Le Roux">
              <organization/>
            </author>
            <date year="2009" month="April"/>
            <abstract>
              <t>The ability to compute shortest constrained Traffic Engineering Label Switched Paths (TE LSPs) in Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across multiple domains has been identified as a key requirement.  In this context, a domain is a collection of network elements within a common sphere of address management or path computational responsibility such as an IGP area or an Autonomous Systems.  This document specifies a procedure relying on the use of multiple Path Computation Elements (PCEs) to compute such inter-domain shortest constrained paths across a predetermined sequence of domains, using a backward-recursive path computation technique.  This technique preserves confidentiality across domains, which is sometimes required when domains are managed by different service providers.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5441"/>
          <seriesInfo name="DOI" value="10.17487/RFC5441"/>
        </reference>
        <reference anchor="RFC6241" target="https://www.rfc-editor.org/info/rfc6241" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.6241.xml">
          <front>
            <title>Network Configuration Protocol (NETCONF)</title>
            <author initials="R." surname="Enns" fullname="R. Enns" role="editor">
              <organization/>
            </author>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund" role="editor">
              <organization/>
            </author>
            <author initials="J." surname="Schoenwaelder" fullname="J. Schoenwaelder" role="editor">
              <organization/>
            </author>
            <author initials="A." surname="Bierman" fullname="A. Bierman" role="editor">
              <organization/>
            </author>
            <date year="2011" month="June"/>
            <abstract>
              <t>The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices.  It uses an Extensible Markup Language (XML)-based data encoding for the configuration data as well as the protocol messages.  The NETCONF protocol operations are realized as remote procedure calls (RPCs).  This document obsoletes RFC 4741.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6241"/>
          <seriesInfo name="DOI" value="10.17487/RFC6241"/>
        </reference>
        <reference anchor="RFC6805" target="https://www.rfc-editor.org/info/rfc6805" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.6805.xml">
          <front>
            <title>The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS</title>
            <author initials="D." surname="King" fullname="D. King" role="editor">
              <organization/>
            </author>
            <author initials="A." surname="Farrel" fullname="A. Farrel" role="editor">
              <organization/>
            </author>
            <date year="2012" month="November"/>
            <abstract>
              <t>Computing optimum routes for Label Switched Paths (LSPs) across multiple domains in MPLS Traffic Engineering (MPLS-TE) and GMPLS networks presents a problem because no single point of path computation is aware of all of the links and resources in each domain.  A solution may be achieved using the Path Computation Element (PCE) architecture.</t>
              <t>Where the sequence of domains is known a priori, various techniques can be employed to derive an optimum path.  If the domains are simply connected, or if the preferred points of interconnection are also known, the Per-Domain Path Computation technique can be used.  Where there are multiple connections between domains and there is no preference for the choice of points of interconnection, the Backward-Recursive PCE-based Computation (BRPC) procedure can be used to derive an optimal path.</t>
              <t>This document examines techniques to establish the optimum path when the sequence of domains is not known in advance.  The document shows how the PCE architecture can be extended to allow the optimum sequence of domains to be selected, and the optimum end-to-end path to be derived through the use of a hierarchical relationship between domains.  This document is not an Internet Standards Track  specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6805"/>
          <seriesInfo name="DOI" value="10.17487/RFC6805"/>
        </reference>
        <reference anchor="RFC7432" target="https://www.rfc-editor.org/info/rfc7432" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7432.xml">
          <front>
            <title>BGP MPLS-Based Ethernet VPN</title>
            <author initials="A." surname="Sajassi" fullname="A. Sajassi" role="editor">
              <organization/>
            </author>
            <author initials="R." surname="Aggarwal" fullname="R. Aggarwal">
              <organization/>
            </author>
            <author initials="N." surname="Bitar" fullname="N. Bitar">
              <organization/>
            </author>
            <author initials="A." surname="Isaac" fullname="A. Isaac">
              <organization/>
            </author>
            <author initials="J." surname="Uttaro" fullname="J. Uttaro">
              <organization/>
            </author>
            <author initials="J." surname="Drake" fullname="J. Drake">
              <organization/>
            </author>
            <author initials="W." surname="Henderickx" fullname="W. Henderickx">
              <organization/>
            </author>
            <date year="2015" month="February"/>
            <abstract>
              <t>This document describes procedures for BGP MPLS-based Ethernet VPNs (EVPN).  The procedures described here meet the requirements specified in RFC 7209 -- "Requirements for Ethernet VPN (EVPN)".</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7432"/>
          <seriesInfo name="DOI" value="10.17487/RFC7432"/>
        </reference>
        <reference anchor="RFC7491" target="https://www.rfc-editor.org/info/rfc7491" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7491.xml">
          <front>
            <title>A PCE-Based Architecture for Application-Based Network Operations</title>
            <author initials="D." surname="King" fullname="D. King">
              <organization/>
            </author>
            <author initials="A." surname="Farrel" fullname="A. Farrel">
              <organization/>
            </author>
            <date year="2015" month="March"/>
            <abstract>
              <t>Services such as content distribution, distributed databases, or inter-data center connectivity place a set of new requirements on the operation of networks.  They need on-demand and application-specific reservation of network connectivity, reliability, and resources (such as bandwidth) in a variety of network applications (such as point-to-point connectivity, network virtualization, or mobile back-haul) and in a range of network technologies from packet (IP/MPLS) down to optical.  An environment that operates to meet these types of requirements is said to have Application-Based Network Operations (ABNO).  ABNO brings together many existing technologies and may be seen as the use of a toolbox of existing components enhanced with a few new elements.</t>
              <t>This document describes an architecture and framework for ABNO, showing how these components fit together.  It provides a cookbook of existing technologies to satisfy the architecture and meet the needs of the applications.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7491"/>
          <seriesInfo name="DOI" value="10.17487/RFC7491"/>
        </reference>

        <!--><reference anchor="RFC7752" target="https://www.rfc-editor.org/info/rfc7752" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7752.xml">
          <front>
            <title>North-Bound Distribution of Link-State and Traffic Engineering (TE) Information Using BGP</title>
            <author initials="H." surname="Gredler" fullname="H. Gredler" role="editor">
              <organization/>
            </author>
            <author initials="J." surname="Medved" fullname="J. Medved">
              <organization/>
            </author>
            <author initials="S." surname="Previdi" fullname="S. Previdi">
              <organization/>
            </author>
            <author initials="A." surname="Farrel" fullname="A. Farrel">
              <organization/>
            </author>
            <author initials="S." surname="Ray" fullname="S. Ray">
              <organization/>
            </author>
            <date year="2016" month="March"/>
            <abstract>
              <t>In a number of environments, a component external to a network is called upon to perform computations based on the network topology and current state of the connections within the network, including Traffic Engineering (TE) information.  This is information typically distributed by IGP routing protocols within the network.</t>
              <t>This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol.  This is achieved using a new BGP Network Layer Reachability Information (NLRI) encoding format.  The mechanism is applicable to physical and virtual IGP links.  The mechanism described is subject to policy control.</t>
              <t>Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7752"/>
          <seriesInfo name="DOI" value="10.17487/RFC7752"/>
        </reference>-->
        <reference anchor="RFC7854" target="https://www.rfc-editor.org/info/rfc7854" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7854.xml">
          <front>
            <title>BGP Monitoring Protocol (BMP)</title>
            <author initials="J." surname="Scudder" fullname="J. Scudder" role="editor">
              <organization/>
            </author>
            <author initials="R." surname="Fernando" fullname="R. Fernando">
              <organization/>
            </author>
            <author initials="S." surname="Stuart" fullname="S. Stuart">
              <organization/>
            </author>
            <date year="2016" month="June"/>
            <abstract>
              <t>This document defines the BGP Monitoring Protocol (BMP), which can be used to monitor BGP sessions.  BMP is intended to provide a convenient interface for obtaining route views.  Prior to the introduction of BMP, screen scraping was the most commonly used approach to obtaining such views.  The design goals are to keep BMP simple, useful, easily implemented, and minimally service affecting. BMP is not suitable for use as a routing protocol.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7854"/>
          <seriesInfo name="DOI" value="10.17487/RFC7854"/>
        </reference>
        <reference anchor="RFC7926" target="https://www.rfc-editor.org/info/rfc7926" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7926.xml">
          <front>
            <title>Problem Statement and Architecture for Information Exchange between Interconnected Traffic-Engineered Networks</title>
            <author initials="A." surname="Farrel" fullname="A. Farrel" role="editor">
              <organization/>
            </author>
            <author initials="J." surname="Drake" fullname="J. Drake">
              <organization/>
            </author>
            <author initials="N." surname="Bitar" fullname="N. Bitar">
              <organization/>
            </author>
            <author initials="G." surname="Swallow" fullname="G. Swallow">
              <organization/>
            </author>
            <author initials="D." surname="Ceccarelli" fullname="D. Ceccarelli">
              <organization/>
            </author>
            <author initials="X." surname="Zhang" fullname="X. Zhang">
              <organization/>
            </author>
            <date year="2016" month="July"/>
            <abstract>
              <t>In Traffic-Engineered (TE) systems, it is sometimes desirable to establish an end-to-end TE path with a set of constraints (such as bandwidth) across one or more networks from a source to a destination.  TE information is the data relating to nodes and TE links that is used in the process of selecting a TE path.  TE information is usually only available within a network.  We call such a zone of visibility of TE information a domain.  An example of a domain may be an IGP area or an Autonomous System.</t>
              <t>In order to determine the potential to establish a TE path through a series of connected networks, it is necessary to have available a certain amount of TE information about each network.  This need not be the full set of TE information available within each network but does need to express the potential of providing TE connectivity. This subset of TE information is called TE reachability information.</t>
              <t>This document sets out the problem statement for the exchange of TE information between interconnected TE networks in support of end-to-end TE path establishment and describes the best current practice architecture to meet this problem statement.  For reasons that are explained in this document, this work is limited to simple TE constraints and information that determine TE reachability.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="206"/>
          <seriesInfo name="RFC" value="7926"/>
          <seriesInfo name="DOI" value="10.17487/RFC7926"/>
        </reference>
        <reference anchor="RFC8040" target="https://www.rfc-editor.org/info/rfc8040" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8040.xml">
          <front>
            <title>RESTCONF Protocol</title>
            <author initials="A." surname="Bierman" fullname="A. Bierman">
              <organization/>
            </author>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund">
              <organization/>
            </author>
            <author initials="K." surname="Watsen" fullname="K. Watsen">
              <organization/>
            </author>
            <date year="2017" month="January"/>
            <abstract>
              <t>This document describes an HTTP-based protocol that provides a programmatic interface for accessing data defined in YANG, using the datastore concepts defined in the Network Configuration Protocol (NETCONF).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8040"/>
          <seriesInfo name="DOI" value="10.17487/RFC8040"/>
        </reference>
        <reference anchor="RFC8051" target="https://www.rfc-editor.org/info/rfc8051" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8051.xml">
          <front>
            <title>Applicability of a Stateful Path Computation Element (PCE)</title>
            <author initials="X." surname="Zhang" fullname="X. Zhang" role="editor">
              <organization/>
            </author>
            <author initials="I." surname="Minei" fullname="I. Minei" role="editor">
              <organization/>
            </author>
            <date year="2017" month="January"/>
            <abstract>
              <t>A stateful Path Computation Element (PCE) maintains information about Label Switched Path (LSP) characteristics and resource usage within a network in order to provide traffic-engineering calculations for its associated Path Computation Clients (PCCs).  This document describes general considerations for a stateful PCE deployment and examines its applicability and benefits, as well as its challenges and limitations, through a number of use cases.  PCE Communication Protocol (PCEP) extensions required for stateful PCE usage are covered in separate documents.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8051"/>
          <seriesInfo name="DOI" value="10.17487/RFC8051"/>
        </reference>
        <reference anchor="RFC8231" target="https://www.rfc-editor.org/info/rfc8231" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8231.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for Stateful PCE</title>
            <author initials="E." surname="Crabbe" fullname="E. Crabbe">
              <organization/>
            </author>
            <author initials="I." surname="Minei" fullname="I. Minei">
              <organization/>
            </author>
            <author initials="J." surname="Medved" fullname="J. Medved">
              <organization/>
            </author>
            <author initials="R." surname="Varga" fullname="R. Varga">
              <organization/>
            </author>
            <date year="2017" month="September"/>
            <abstract>
              <t>The Path Computation Element Communication Protocol (PCEP) provides mechanisms for Path Computation Elements (PCEs) to perform path computations in response to Path Computation Client (PCC) requests.</t>
              <t>Although PCEP explicitly makes no assumptions regarding the information available to the PCE, it also makes no provisions for PCE control of timing and sequence of path computations within and across PCEP sessions.  This document describes a set of extensions to PCEP to enable stateful control of MPLS-TE and GMPLS Label Switched Paths (LSPs) via PCEP.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8231"/>
          <seriesInfo name="DOI" value="10.17487/RFC8231"/>
        </reference>
        <reference anchor="RFC8281" target="https://www.rfc-editor.org/info/rfc8281" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8281.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for PCE-Initiated LSP Setup in a Stateful PCE Model</title>
            <author initials="E." surname="Crabbe" fullname="E. Crabbe">
              <organization/>
            </author>
            <author initials="I." surname="Minei" fullname="I. Minei">
              <organization/>
            </author>
            <author initials="S." surname="Sivabalan" fullname="S. Sivabalan">
              <organization/>
            </author>
            <author initials="R." surname="Varga" fullname="R. Varga">
              <organization/>
            </author>
            <date year="2017" month="December"/>
            <abstract>
              <t>The Path Computation Element Communication Protocol (PCEP) provides mechanisms for Path Computation Elements (PCEs) to perform path computations in response to Path Computation Client (PCC) requests.</t>
              <t>The extensions for stateful PCE provide active control of Multiprotocol Label Switching (MPLS) Traffic Engineering Label Switched Paths (TE LSPs) via PCEP, for a model where the PCC delegates control over one or more locally configured LSPs to the PCE.  This document describes the creation and deletion of PCE-initiated LSPs under the stateful PCE model.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8281"/>
          <seriesInfo name="DOI" value="10.17487/RFC8281"/>
        </reference>
        <reference anchor="RFC8283" target="https://www.rfc-editor.org/info/rfc8283" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8283.xml">
          <front>
            <title>An Architecture for Use of PCE and the PCE Communication Protocol (PCEP) in a Network with Central Control</title>
            <author initials="A." surname="Farrel" fullname="A. Farrel" role="editor">
              <organization/>
            </author>
            <author initials="Q." surname="Zhao" fullname="Q. Zhao" role="editor">
              <organization/>
            </author>
            <author initials="Z." surname="Li" fullname="Z. Li">
              <organization/>
            </author>
            <author initials="C." surname="Zhou" fullname="C. Zhou">
              <organization/>
            </author>
            <date year="2017" month="December"/>
            <abstract>
              <t>The Path Computation Element (PCE) is a core component of Software- Defined Networking (SDN) systems.  It can compute optimal paths for traffic across a network and can also update the paths to reflect changes in the network or traffic demands.</t>
              <t>PCE was developed to derive paths for MPLS Label Switched Paths (LSPs), which are supplied to the head end of the LSP using the Path Computation Element Communication Protocol (PCEP).</t>
              <t>SDN has a broader applicability than signaled MPLS traffic-engineered (TE) networks, and the PCE may be used to determine paths in a range of use cases including static LSPs, segment routing, Service Function Chaining (SFC), and most forms of a routed or switched network.  It is, therefore, reasonable to consider PCEP as a control protocol for use in these environments to allow the PCE to be fully enabled as a central controller.</t>
              <t>This document briefly introduces the architecture for PCE as a central controller, examines the motivations and applicability for PCEP as a control protocol in this environment, and introduces the implications for the protocol.  A PCE-based central controller can simplify the processing of a distributed control plane by blending it with elements of SDN and without necessarily completely replacing it.</t>
              <t>This document does not describe use cases in detail and does not define protocol extensions: that work is left for other documents.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8283"/>
          <seriesInfo name="DOI" value="10.17487/RFC8283"/>
        </reference>
        <reference anchor="RFC8299" target="https://www.rfc-editor.org/info/rfc8299" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8299.xml">
          <front>
            <title>YANG Data Model for L3VPN Service Delivery</title>
            <author initials="Q." surname="Wu" fullname="Q. Wu" role="editor">
              <organization/>
            </author>
            <author initials="S." surname="Litkowski" fullname="S. Litkowski">
              <organization/>
            </author>
            <author initials="L." surname="Tomotaki" fullname="L. Tomotaki">
              <organization/>
            </author>
            <author initials="K." surname="Ogaki" fullname="K. Ogaki">
              <organization/>
            </author>
            <date year="2018" month="January"/>
            <abstract>
              <t>This document defines a YANG data model that can be used for communication between customers and network operators and to deliver a Layer 3 provider-provisioned VPN service.  This document is limited to BGP PE-based VPNs as described in RFCs 4026, 4110, and 4364.  This model is intended to be instantiated at the management system to deliver the overall service.  It is not a configuration model to be used directly on network elements.  This model provides an abstracted view of the Layer 3 IP VPN service configuration components.  It will be up to the management system to take this model as input and use specific configuration models to configure the different network elements to deliver the service.  How the configuration of network elements is done is out of scope for this document.</t>
              <t>This document obsoletes RFC 8049; it replaces the unimplementable module in that RFC with a new module with the same name that is not backward compatible.  The changes are a series of small fixes to the YANG module and some clarifications to the text.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8299"/>
          <seriesInfo name="DOI" value="10.17487/RFC8299"/>
        </reference>
        <reference anchor="RFC8309" target="https://www.rfc-editor.org/info/rfc8309" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8309.xml">
          <front>
            <title>Service Models Explained</title>
            <author initials="Q." surname="Wu" fullname="Q. Wu">
              <organization/>
            </author>
            <author initials="W." surname="Liu" fullname="W. Liu">
              <organization/>
            </author>
            <author initials="A." surname="Farrel" fullname="A. Farrel">
              <organization/>
            </author>
            <date year="2018" month="January"/>
            <abstract>
              <t>The IETF has produced many modules in the YANG modeling language. The majority of these modules are used to construct data models to model devices or monolithic functions.</t>
              <t>A small number of YANG modules have been defined to model services (for example, the Layer 3 Virtual Private Network Service Model (L3SM) produced by the L3SM working group and documented in RFC 8049).</t>
              <t>This document describes service models as used within the IETF and also shows where a service model might fit into a software-defined networking architecture.  Note that service models do not make any assumption of how a service is actually engineered and delivered for a customer; details of how network protocols and devices are engineered to deliver a service are captured in other modules that are not exposed through the interface between the customer and the provider.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8309"/>
          <seriesInfo name="DOI" value="10.17487/RFC8309"/>
        </reference>
        <reference anchor="RFC8345" target="https://www.rfc-editor.org/info/rfc8345" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8345.xml">
          <front>
            <title>A YANG Data Model for Network Topologies</title>
            <author initials="A." surname="Clemm" fullname="A. Clemm">
              <organization/>
            </author>
            <author initials="J." surname="Medved" fullname="J. Medved">
              <organization/>
            </author>
            <author initials="R." surname="Varga" fullname="R. Varga">
              <organization/>
            </author>
            <author initials="N." surname="Bahadur" fullname="N. Bahadur">
              <organization/>
            </author>
            <author initials="H." surname="Ananthakrishnan" fullname="H. Ananthakrishnan">
              <organization/>
            </author>
            <author initials="X." surname="Liu" fullname="X. Liu">
              <organization/>
            </author>
            <date year="2018" month="March"/>
            <abstract>
              <t>This document defines an abstract (generic, or base) YANG data model for network/service topologies and inventories.  The data model serves as a base model that is augmented with technology-specific details in other, more specific topology and inventory data models.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8345"/>
          <seriesInfo name="DOI" value="10.17487/RFC8345"/>
        </reference>
        <reference anchor="RFC8466" target="https://www.rfc-editor.org/info/rfc8466" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8466.xml">
          <front>
            <title>A YANG Data Model for Layer 2 Virtual Private Network (L2VPN) Service Delivery</title>
            <author initials="B." surname="Wen" fullname="B. Wen">
              <organization/>
            </author>
            <author initials="G." surname="Fioccola" fullname="G. Fioccola" role="editor">
              <organization/>
            </author>
            <author initials="C." surname="Xie" fullname="C. Xie">
              <organization/>
            </author>
            <author initials="L." surname="Jalil" fullname="L. Jalil">
              <organization/>
            </author>
            <date year="2018" month="October"/>
            <abstract>
              <t>This document defines a YANG data model that can be used to configure a Layer 2 provider-provisioned VPN service.  It is up to a management system to take this as an input and generate specific configuration models to configure the different network elements to deliver the service.  How this configuration of network elements is done is out of scope for this document.</t>
              <t>The YANG data model defined in this document includes support for point-to-point Virtual Private Wire Services (VPWSs) and multipoint Virtual Private LAN Services (VPLSs) that use Pseudowires signaled using the Label Distribution Protocol (LDP) and the Border Gateway Protocol (BGP) as described in RFCs 4761 and 6624.</t>
              <t>The YANG data model defined in this document conforms to the Network Management Datastore Architecture defined in RFC 8342.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8466"/>
          <seriesInfo name="DOI" value="10.17487/RFC8466"/>
        </reference>
        <reference anchor="RFC8637" target="https://www.rfc-editor.org/info/rfc8637" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8637.xml">
          <front>
            <title>Applicability of the Path Computation Element (PCE) to the Abstraction and Control of TE Networks (ACTN)</title>
            <author initials="D." surname="Dhody" fullname="D. Dhody">
              <organization/>
            </author>
            <author initials="Y." surname="Lee" fullname="Y. Lee">
              <organization/>
            </author>
            <author initials="D." surname="Ceccarelli" fullname="D. Ceccarelli">
              <organization/>
            </author>
            <date year="2019" month="July"/>
            <abstract>
              <t>Abstraction and Control of TE Networks (ACTN) refers to the set of virtual network (VN) operations needed to orchestrate, control, and manage large-scale multidomain TE networks so as to facilitate network programmability, automation, efficient resource sharing, and end-to-end virtual service-aware connectivity and network function virtualization services.</t>
              <t>The Path Computation Element (PCE) is a component, application, or network node that is capable of computing a network path or route based on a network graph and applying computational constraints.  The PCE serves requests from Path Computation Clients (PCCs) that communicate with it over a local API or using the Path Computation Element Communication Protocol (PCEP).</t>
              <t>This document examines the applicability of PCE to the ACTN framework.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8637"/>
          <seriesInfo name="DOI" value="10.17487/RFC8637"/>
        </reference>
        <reference anchor="RFC8955" target="https://www.rfc-editor.org/info/rfc8955" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8955.xml">
          <front>
            <title>Dissemination of Flow Specification Rules</title>
            <author initials="C." surname="Loibl" fullname="C. Loibl">
              <organization/>
            </author>
            <author initials="S." surname="Hares" fullname="S. Hares">
              <organization/>
            </author>
            <author initials="R." surname="Raszuk" fullname="R. Raszuk">
              <organization/>
            </author>
            <author initials="D." surname="McPherson" fullname="D. McPherson">
              <organization/>
            </author>
            <author initials="M." surname="Bacher" fullname="M. Bacher">
              <organization/>
            </author>
            <date year="2020" month="December"/>
            <abstract>
              <t>This document defines a Border Gateway Protocol Network Layer Reachability Information (BGP NLRI) encoding format that can be used to distribute (intra-domain and inter-domain) traffic Flow Specifications for IPv4 unicast and IPv4 BGP/MPLS VPN services. This allows the routing system to propagate information regarding more specific components of the traffic aggregate defined by an IP destination prefix. </t>
              <t>It also specifies BGP Extended Community encoding formats, which can be used to propagate Traffic Filtering Actions along with the Flow Specification NLRI.  Those Traffic Filtering Actions encode actions a routing system can take if the packet matches the Flow Specification.</t>
              <t> This document obsoletes both RFC 5575 and RFC 7674.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8955"/>
          <seriesInfo name="DOI" value="10.17487/RFC8955"/>
        </reference>


      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-teas-actn-yang.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-teas-yang-te.xml"/>
        <reference anchor="RFC8795" target="https://www.rfc-editor.org/info/rfc8795" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8795.xml">
          <front>
            <title>YANG Data Model for Traffic Engineering (TE) Topologies</title>
            <author initials="X." surname="Liu" fullname="X. Liu">
              <organization/>
            </author>
            <author initials="I." surname="Bryskin" fullname="I. Bryskin">
              <organization/>
            </author>
            <author initials="V." surname="Beeram" fullname="V. Beeram">
              <organization/>
            </author>
            <author initials="T." surname="Saad" fullname="T. Saad">
              <organization/>
            </author>
            <author initials="H." surname="Shah" fullname="H. Shah">
              <organization/>
            </author>
            <author initials="O." surname="Gonzalez de Dios" fullname="O. Gonzalez de Dios">
              <organization/>
            </author>
            <date year="2020" month="August"/>
            <abstract>
              <t>This document defines a YANG data model for representing, retrieving, and manipulating Traffic Engineering (TE) Topologies. The model serves as a base model that other technology-specific TE topology models can augment.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8795"/>
          <seriesInfo name="DOI" value="10.17487/RFC8795"/>
        </reference>
        <reference anchor="RFC8751" target="https://www.rfc-editor.org/info/rfc8751" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8751.xml">
          <front>
            <title>Hierarchical Stateful Path Computation Element (PCE)</title>
            <author initials="D." surname="Dhody" fullname="D. Dhody">
              <organization/>
            </author>
            <author initials="Y." surname="Lee" fullname="Y. Lee">
              <organization/>
            </author>
            <author initials="D." surname="Ceccarelli" fullname="D. Ceccarelli">
              <organization/>
            </author>
            <author initials="J." surname="Shin" fullname="J. Shin">
              <organization/>
            </author>
            <author initials="D." surname="King" fullname="D. King">
              <organization/>
            </author>
            <date year="2020" month="March"/>
            <abstract>
              <t>A stateful Path Computation Element (PCE) maintains information on the current network state received from the Path Computation Clients (PCCs), including computed Label Switched Paths (LSPs), reserved resources within the network, and pending path computation requests. This information may then be considered when computing the path for a new traffic-engineered LSP or for any associated/dependent LSPs. The path-computation response from a PCE helps the PCC to gracefully establish the computed LSP.</t>
              <t>The Hierarchical Path Computation Element (H-PCE) architecture allows the optimum sequence of interconnected domains to be selected and network policy to be applied if applicable, via the use of a hierarchical relationship between PCEs.</t>
              <t>Combining the capabilities of stateful PCE and the hierarchical PCE would be advantageous. This document describes general considerations and use cases for the deployment of stateful, but not stateless, PCEs using the hierarchical PCE architecture.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8751"/>
          <seriesInfo name="DOI" value="10.17487/RFC8751"/>
        </reference>
        <reference anchor="RFC8969" target="https://www.rfc-editor.org/info/rfc8969" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8969.xml">
          <front>
            <title>A Framework for Automating Service and Network Management with YANG</title>
            <author initials="Q." surname="Wu" fullname="Q. Wu" role="editor">
              <organization/>
            </author>
            <author initials="M." surname="Boucadair" fullname="M. Boucadair" role="editor">
              <organization/>
            </author>
            <author initials="D." surname="Lopez" fullname="D. Lopez">
              <organization/>
            </author>
            <author initials="C." surname="Xie" fullname="C. Xie">
              <organization/>
            </author>
            <author initials="L." surname="Geng" fullname="L. Geng">
              <organization/>
            </author>
            <date year="2021" month="January"/>
            <abstract>
              <t>Data models provide a programmatic approach to represent services and networks. Concretely, they can be used to derive configuration information for network and service components, and state information that will be monitored and tracked.  Data models can be used during the service and network management life cycle (e.g., service instantiation, service provisioning, service optimization, service monitoring, service diagnosing, and service assurance).  Data models are also instrumental in the automation of network management, and they can provide closed-loop control for adaptive and deterministic service creation, delivery, and maintenance.</t>
              <t>This document describes a framework for service and network management automation that takes advantage of YANG modeling technologies. This framework is drawn from a network operator perspective irrespective of the origin of a data model; thus, it can accommodate YANG modules that are developed outside the IETF.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8969"/>
          <seriesInfo name="DOI" value="10.17487/RFC8969"/>
        </reference>
        <reference anchor="RFC9050" target="https://www.rfc-editor.org/info/rfc9050" xml:base="https://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.9050.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Procedures and Extensions for Using the PCE as a Central Controller (PCECC) of LSPs</title>
            <author initials="Z." surname="Li" fullname="Z. Li">
              <organization/>
            </author>
            <author initials="S." surname="Peng" fullname="S. Peng">
              <organization/>
            </author>
            <author initials="M." surname="Negi" fullname="M. Negi">
              <organization/>
            </author>
            <author initials="Q." surname="Zhao" fullname="Q. Zhao">
              <organization/>
            </author>
            <author initials="C." surname="Zhou" fullname="C. Zhou">
              <organization/>
            </author>
            <date year="2021" month="July"/>
            <abstract>
              <t>The Path Computation Element (PCE) is a core component of Software-Defined Networking (SDN) systems.</t>
              <t>A PCE as a Central Controller (PCECC) can simplify the processing of a distributed control plane by blending it with elements of SDN and without necessarily completely replacing it. Thus, the Label Switched Path (LSP) can be calculated/set up/initiated and the label-forwarding entries can also be downloaded through a centralized PCE server to each network device along the path while leveraging the existing PCE technologies as much as possible.</t>
              <t>This document specifies the procedures and Path Computation Element Communication Protocol (PCEP) extensions for using the PCE as the central controller for provisioning labels along the path of the static LSP.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9050"/>
          <seriesInfo name="DOI" value="10.17487/RFC9050"/>
        </reference>
              <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-idr-rfc7752bis.xml"/>
        <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.9182.xml"/>
        <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.9168.xml"/>

      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-teas-yang-path-computation.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-mpls-seamless-mpls.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-bess-evpn-yang.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-bess-l2vpn-yang.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-bess-l3vpn-yang.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-dhodylee-pce-pcep-ls.xml"/>
      <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-teas-te-service-mapping-yang.xml"/>
        <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-pce-stateful-interdomain.xml"/>
        <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-luo-grow-bgp-controller-based-ts.xml"/>
        <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-idr-rtc-hierarchical-rr.xml"/>
        <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-ietf-idr-bgp-model.xml"/>
        <xi:include href="https://datatracker.ietf.org/doc/bibxml3/draft-wu-idr-flowspec-yang-cfg.xml"/>
        <!--ISO-->
      <reference anchor="ISO10589">
          <front>
            <title>
            Intermediate system to Intermediate system routing information
            exchange protocol for use in conjunction with the Protocol for
            providing the Connectionless-mode Network Service (ISO
            8473)
            </title>
            <author fullname="ISO">
              <organization>ISO</organization>
            </author>
            <date month="" year="1992"/>
          </front>
          <seriesInfo name="ISO/IEC" value="10589:2002"/>
        </reference>
      </references>
    </references>
  </back>
</rfc>
