<?xml version="1.0" encoding="UTF-8"?>
  <?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
  <!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.29 (Ruby 2.6.10) -->


<!DOCTYPE rfc  [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">

]>


<rfc ipr="trust200902" docName="draft-ietf-teas-ns-ip-mpls-07" category="info" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true">
  <front>
    <title abbrev="IP/MPLS Network Slicing">Realizing Network Slices in IP/MPLS Networks</title>

    <author initials="T." surname="Saad" fullname="Tarek Saad">
      <organization>Cisco Systems Inc.</organization>
      <address>
        <email>tsaad.net@gmail.com</email>
      </address>
    </author>
    <author initials="V." surname="Beeram" fullname="Vishnu Pavan Beeram">
      <organization>Juniper Networks</organization>
      <address>
        <email>vbeeram@juniper.net</email>
      </address>
    </author>
    <author initials="J." surname="Dong" fullname="Jie Dong">
      <organization>Huawei Technologies</organization>
      <address>
        <email>jie.dong@huawei.com</email>
      </address>
    </author>
    <author initials="J." surname="Halpern" fullname="Joel Halpern">
      <organization>Ericsson</organization>
      <address>
        <email>joel.halpern@ericsson.com</email>
      </address>
    </author>
    <author initials="S." surname="Peng" fullname="Shaofu Peng">
      <organization>ZTE Corporation</organization>
      <address>
        <email>peng.shaofu@zte.com.cn</email>
      </address>
    </author>

    <date year="2026" month="February" day="28"/>

    
    <workgroup>TEAS Working Group</workgroup>
    <keyword>Internet-Draft</keyword>

    <abstract>


<?line 50?>

<t>Realizing network slices may require the Service Provider to have the ability to
partition a physical network into multiple logical networks of varying sizes,
structures, and functions so that each slice can be dedicated to specific
services or customers. Multiple network slices can be realized on the same
network while ensuring slice elasticity in terms of network resource
allocation. This document describes a scalable solution to realize network
slicing in IP/MPLS networks by supporting multiple services on top of a single
physical network by by requiring compliant domains and nodes to provide
forwarding treatment (scheduling, drop policy, resource usage) based on
slice identifiers.</t>



    </abstract>



  </front>

  <middle>


<?line 63?>

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

<t>Network slicing allows a Service Provider to create independent and logical
networks on top of a shared physical network infrastructure. Such network
slices can be offered to customers or used internally by the Service Provider
to enhance the delivery of their service offerings. A Service Provider can also
use network slicing to structure and organize the elements of its
infrastructure. The solution discussed in this document works with any path
control technology (such as RSVP-TE, or SR) that can be used by a Service Provider
to realize network slicing in IP/MPLS networks.</t>

<t><xref target="RFC9543"/> provides the definition of a network
slice for use within the IETF and discusses the general framework for
requesting and operating IETF Network Slices, their characteristics, and the
necessary system components and interfaces. It also  discusses the function of
an IETF Network Slice Controller and the requirements on its northbound and
southbound interfaces.</t>

<t>This document introduces the notion of a Slice-Flow Aggregate which comprises
of one or more IETF network slice traffic streams. It also describes the
Network Resource Partition (NRP) and the NRP Policy that can be used to
instantiate control and data plane behaviors on select topological elements
associated with the NRP that supports a Slice-Flow
Aggregate - refer <xref target="SliceDefinition"/> for further details.</t>

<t>The IETF Network Slice Controller is responsible for the aggregation of
multiple IETF network traffic streams into a Slice-Flow Aggregate, and for
maintaining the mapping required between them. The mechanisms used by the
controller to determine the mapping of one or more IETF network slice to a
Slice-Flow Aggregate are outside the scope of this document. The focus of this
document is on the mechanisms required at the device level to address the
requirements of network slicing in packet networks.</t>

<t>In a Diffserv (DS) domain <xref target="RFC2475"/>, packets requiring the same forwarding
treatment (scheduling and drop policy) are classified and marked with the
respective Class Selector (CS) Codepoint (or the Traffic Class (TC) field for
MPLS packets <xref target="RFC5462"/>) at the DS domain ingress nodes.  Such packets are
said to belong to a Behavior Aggregate (BA) that has a common set of behavioral
characteristics or a common set of delivery requirements.  At transit nodes,
the CS is inspected to determine the specific forwarding treatment to be
applied before the packet is forwarded.  A similar approach is adopted in this
document to realize network slicing. The solution proposed in this document
does not mandate Diffserv to be enabled in the network to provide a specific
forwarding treatment. If Diffserv is enabled within the network, the Slice-Flow
Aggregate traffic can further carry a Diffserv CS to enable differentiation of
forwarding treatments for packets within a Slice-Flow Aggregate.</t>

<t>When logical networks associated with an NRP are realized on top of a shared
physical network infrastructure, it is important to steer traffic on the
specific network resources partition that is allocated for a given Slice-Flow
Aggregate.  In packet networks, the packets of a specific Slice-Flow Aggregate
may be identified by one or more specific fields carried within the packet. An
NRP ingress boundary node (where Slice-Flow Aggregate traffic enters the NRP)
populates the respective field(s) in packets that are
mapped to a Slice-Flow Aggregate in order to allow interior NRP nodes to
identify and apply the specific Per NRP Hop Behavior (NRP-PHB) associated with the
Slice-Flow Aggregate. The NRP-PHB defines the scheduling treatment and, in some
cases, the packet drop probability.</t>

<t>This document covers different modes of NRPs and discusses how
each mode can ensure proper placement of Slice-Flow Aggregate paths
and respective treatment of Slice-Flow Aggregate traffic.</t>

<section anchor="terminology"><name>Terminology</name>

<t>The reader is expected to be familiar with the terminology specified in
<xref target="RFC9543"/>.</t>

<t>The following terminology is used in the document:</t>

<dl newline="true">
  <dt>IETF Network Slice:</dt>
  <dd>
    <t>refer to the definition of 'IETF network slice' in 
<xref target="RFC9543"/>.</t>
  </dd>
  <dt>IETF Network Slice Controller (NSC):</dt>
  <dd>
    <t>refer to the definition in <xref target="RFC9543"/>.</t>
  </dd>
  <dt>Network Resource Partition:</dt>
  <dd>
    <t>refer to the definition in <xref target="RFC9543"/>.</t>
  </dd>
  <dt>Slice-Flow Aggregate:</dt>
  <dd>
    <t>a collection of packets that are mapped to an NRP and are given the same
forwarding treatment; a Slice-Flow Aggregate comprises of one or more IETF
network slice traffic streams from one or more connectivity constructs
(belonging to one or more IETF network slices); the mapping of one or more IETF
network slice streams to a Slice-Flow Aggregate is maintained by the IETF Network
Slice Controller.  The boundary nodes MAY also maintain a mapping of specific
IETF network slice service(s) to a Slice-Flow Aggregate.</t>
  </dd>
  <dt>Network Resource Partition Policy (NRP):</dt>
  <dd>
    <t>a policy construct that enables instantiation of mechanisms in support 
of IETF network slice specific control and data plane behaviors 
on select topological elements; the enforcement of an NRP Policy 
results in the creation of an NRP.</t>
  </dd>
  <dt>NRP Identifier (NRP-ID):</dt>
  <dd>
    <t>an identifier that is globally unique within an NRP domain and that can
be used in the control or management plane to identify the resources associated with the NRP.</t>
  </dd>
  <dt>NRP Selector:</dt>
  <dd>
    <t>one or more fields (markings) in a packet's network layer header
that are used to map the packet to an NRP.</t>
  </dd>
  <dt>NRP Selector Identifier (NRP Selector ID):</dt>
  <dd>
    <t>a dedicated identifier that acts as an NRP Selector.</t>
  </dd>
  <dt>NRP Capable Node:</dt>
  <dd>
    <t>a node that supports one of the NRP modes described in this document.</t>
  </dd>
  <dt>NRP Incapable Node:</dt>
  <dd>
    <t>a node that does not support any of the NRP modes described in this document.</t>
  </dd>
  <dt>Slice-Flow Aggregate Path:</dt>
  <dd>
    <t>a path that is setup over the NRP that is associated with a specific Slice-Flow Aggregate.</t>
  </dd>
  <dt>Slice-Flow Aggregate Packet:</dt>
  <dd>
    <t>a packet that traverses over the NRP that is associated with a specific Slice-Flow Aggregate.</t>
  </dd>
  <dt>NRP Filtered Topology:</dt>
  <dd>
    <t>a set of topological elements associated with a Network Resource Partition.</t>
  </dd>
  <dt>NRP state aware TE (NRP-TE):</dt>
  <dd>
    <t>a mechanism for TE path selection that takes into account the available network resources associated with a specific NRP.</t>
  </dd>
</dl>

</section>
<section anchor="acronyms-and-abbreviations"><name>Acronyms and Abbreviations</name>

<ul empty="true"><li>
  <t>BA: Behavior Aggregate</t>
</li></ul>

<ul empty="true"><li>
  <t>CS: Class Selector</t>
</li></ul>

<ul empty="true"><li>
  <t>NRP-PHB: NRP Per Hop Behavior as described in <xref target="SlicePHB"/></t>
</li></ul>

<ul empty="true"><li>
  <t>SLA: Service Level Agreements</t>
</li></ul>

<ul empty="true"><li>
  <t>SLO: Service Level Objectives</t>
</li></ul>

<ul empty="true"><li>
  <t>SLE: Service Level Expectations</t>
</li></ul>

<ul empty="true"><li>
  <t>Diffserv: Differentiated Services</t>
</li></ul>

<ul empty="true"><li>
  <t>MPLS: Multiprotocol Label Switching</t>
</li></ul>

<ul empty="true"><li>
  <t>LSP: Label Switched Path</t>
</li></ul>

<ul empty="true"><li>
  <t>RSVP: Resource Reservation Protocol</t>
</li></ul>

<ul empty="true"><li>
  <t>TE: Traffic Engineering</t>
</li></ul>

<ul empty="true"><li>
  <t>SR: Segment Routing</t>
</li></ul>

<ul empty="true"><li>
  <t>VRF: VPN Routing and Forwarding</t>
</li></ul>

<ul empty="true"><li>
  <t>AC: Attachment Circuit</t>
</li></ul>

<ul empty="true"><li>
  <t>CE: Customer Edge</t>
</li></ul>

<ul empty="true"><li>
  <t>PE: Provider Edge</t>
</li></ul>

<ul empty="true"><li>
  <t>PCEP: Path Computation Element (PCE) Communication Protocol (PCEP)</t>
</li></ul>

</section>
</section>
<section anchor="network-resource-slicing-membership"><name>Network Resource Slicing Membership</name>

<t>An NRP that supports a Slice-Flow Aggregate can be
instantiated over parts of an IP/MPLS network (e.g., all or specific network
resources in the access, aggregation, or core network), and can stretch across
multiple domains administered by a provider.  The NRP topology may
be comprised of dedicated and/or shared network resources (e.g., in
terms of processing power, storage, and bandwidth).</t>

<t>The physical network resources may be fully dedicated to a specific Slice-Flow
Aggregate.  For example, traffic belonging to a Slice-Flow Aggregate can traverse
dedicated network resources without being subjected to contention from traffic of
other Slice-Flow Aggregates.  Dedicated physical network resource slicing allows for simple
partitioning of the physical network resources amongst Slice-Flow Aggregates without
the need to distinguish packets traversing the dedicated network resources
since only one Slice-Flow Aggregate traffic stream can traverse the dedicated
resource at any time.</t>

<t>To optimize network utilization, sharing of the physical network resources may
be desirable. In such case, the same physical network resource capacity is
divided among multiple NRPs that support multiple Slice-Flow
Aggregates. The shared physical network resources can be
partitioned in the data plane (for example by applying hardware policers and
shapers) and/or partitioned in the control plane by providing a logical
representation of the physical link that has a subset of the network resources
available to it.</t>

</section>
<section anchor="NSRealization"><name>IETF Network Slice Realization</name>

<t><xref target="ns-workflow"/> describes the steps required to realize an IETF network slice
service in a provider network  using the solution proposed in this document.
While Figure 4 of <xref target="RFC9543"/> provides an abstract
architecture of an IETF Network Slice, this section intends to offer a
realization of that architecture specific for IP/MPLS packet networks.</t>

<t>Each of the steps is further elaborated on in a subsequent section.</t>

<figure title="IETF network slice realization steps." anchor="ns-workflow"><artwork><![CDATA[
                        --      --      --
                       |CE|    |CE|    |CE|
                        --      --      --
                      AC :    AC :    AC :
                      ----------------------       -------
                     ( |PE|....|PE|....|PE| )     ( IETF  )
    IETF Network    (   --:     --     :--   )   ( Network )
    Slice Service   (     :............:     )   (  Slice  )
    Request          (  IETF Network Slice  )     (       )  Customer
      v               ----------------------       -------     View
      v        ............................\........./...............
      v                                     \       /        Provider
      v    >>>>>>>>>>>>>>>  Slice-Flow       \     /           View
      v   ^                 Aggregate Mapping v   v
      v   ^             -----------------------------------------
      v   ^            ( |PE|.......|PE|........|PE|.......|PE|  )
     ---------        (   --:        --         :--         --    )
    |         |       (     :...................:                 )
    |   NSC   |        (        Network Resource Partition       )
    |         |         -----------------------------------------
    |         |                             ^
    |         |>>>>>  Resource Partitioning |
     ---------          of Filtered Topology|
      v   v                                 |
      v   v            -----------------------------      --------
      v   v           (|PE|..-..|PE|... ..|PE|..|PE|)    (        )
      v   v          ( :--  |P|  --   :-:  --   :--  )  (  Filter  )
      v   v          ( :.-   -:.......|P|       :-   )  ( Topology )
      v   v          (  |P|...........:-:.......|P|  )   (        )
      v   v           (  -    Filtered Topology      )     --------
      v   v            -----------------------------       ^
      v    >>>>>>>>>>>>  Topology Filter ^                /
      v        ...........................\............../...........
      v                                    \            /  Underlay
     ----------                             \          /  (Physical)
    |          |                             \        /    Network
    | Network  |    ----------------------------------------------
    |Controller|   ( |PE|.....-.....|PE|......    |PE|.......|PE| )
    |          |  (   --     |P|     --      :-...:--     -..:--   )
     ----------  (    :       -:.............|P|.........|P|        )
         v       (    -......................:-:..-       -         )
          >>>>>>> (  |P|.........................|P|......:        )
      Program the  (  -                           -               )
        Network     ----------------------------------------------
                             (NRP Policies and Paths)*

 * : NRP Policy installation and path placement can be centralized
     or distributed.
]]></artwork></figure>

<section anchor="network-topology-filters"><name>Network Topology Filters</name>

<t>The Physical Network may be filtered into a number of Filter
Topologies.  Filter actions may include selection of specific nodes
and links according to their capabilities and are based on network-
wide policies.  The resulting topologies can be used to host IETF
Network Slices and provide a useful way for the network operator to
know that all of the resources they are using to plan a network
slice meet specific SLOs.  This step can be done offline during
planning activity, or could be performed dynamically
as new demands arise.</t>

<t><xref target="SlicePolicyTopology"/> describes how topology filters can be
associated with the NRP instantiated by the NRP Policy.</t>

</section>
<section anchor="NetworkSliceServiceRequest"><name>IETF Network Slice Service Request</name>

<t>The customer requests an IETF Network Slice Service specifying the
CE-AC-PE points of attachment, the connectivity matrix, and the
SLOs/SLEs as described in <xref target="RFC9543"/>.
These capabilities are always provided based on a Service Level Agreement (SLA)
between the network slice customer and the provider.</t>

<t>This defines the traffic flows that need to be supported
when the slice is realized.  Depending on the mechanism and
encoding of the Attachment Circuit (AC), the IETF Network Slice Service may also include
information that will allow the operator's controllers to configure
the PEs to determine what customer traffic is intended
for this IETF Network Slice.</t>

<t>IETF Network Slice Service Requests are likely to arrive at various
times in the life of the network, and may also be modified.</t>

</section>
<section anchor="SliceAggregateMapping"><name>Slice-Flow Aggregation</name>

<t>A network may be called upon to support very many IETF Network
Slices, and this could present scaling challenges in the operation
of the network.  In order to overcome this, the IETF Network Slice
streams may be aggregated into groups according to similar characteristics.</t>

<t>A Slice-Flow Aggregate is a construct that comprises of the traffic flows of one or
more IETF Network Slices. The mapping of IETF Network Slices into a Slice-Flow
Aggregate is a matter of local operator policy is a function executed by the
Controller.  The Slice-Flow Aggregate may be preconfigured, created on demand, or
modified dynamically.</t>

</section>
<section anchor="PathPlacement"><name>Path Placement over NRP Filtered Topology</name>

<t>Depending on the underlying network technology, the paths are selected in the
network in order to best deliver the SLOs for the different services carried by
the Slice-Flow Aggregate.  The path placement function (carried on ingress node
or by a controller) is performed on the Filtered Topology that is
selected to support the Slice-Flow Aggregate.</t>

<t>Note that this step may indicate the need to increase the capacity of the
underlying Filtered Topology or to create a new Filtered Topology.</t>

</section>
<section anchor="nrp-policy"><name>NRP Policy</name>

<t>An NRP policy is a policy construct that enables instantiation of mechanisms in support of service
specific control and data plane behaviors on select topological
elements associated with the NRP.</t>

<t>The NRP Policy is a construct that enables the instantiation of control and
data plane behaviors on select topological elements in support of the IETF
network slice service. The NRP Policy encompasses policy actions (see <xref target="SliceDefinition"/>) that
manage the specific resources in the network associated with the NRP.</t>

</section>
<section anchor="nrp-policy-installation"><name>NRP Policy Installation</name>

<t>A Controller function programs the physical network with the NRP policies to define specific handling
for traffic flows belonging to the Slice-Flow Aggregate.  These NRP policies may
be consumed on select topological elements in the network and as a result
define how routers handle traffic for the Slice-Flow Aggregate associated with
the NRP.</t>

<t>For example, the routers that instantiate the NRP Policy can correlate markers
that are present in packets that belong to the Slice-Flow Aggregate and apply
specific treatments to them.</t>

<t>The way in which the NRP Policy is installed in the routers and the way that
the traffic is marked is implementation specific.  The NRP Policy instantiation
in the network is further described in <xref target="SlicePolicyInstantiation"/>.</t>

</section>
<section anchor="path-instantiation"><name>Path Instantiation</name>

<t>Depending on the underlying network technology, a Controller function may
install the forwarding state specific to the Slice-Flow Aggregate so that traffic is
routed along paths derived in the Path Placement step described in
<xref target="PathPlacement"/>.  The way in which the paths are instantiated is
implementation specific.</t>

</section>
<section anchor="service-mapping"><name>Service Mapping</name>

<t>The edge points can be configured to support the network slice service by
mapping the customer traffic to Slice-Flow Aggregates, possibly using
information supplied when the IETF network slice service was requested.  The
edge points may also be instructed to mark the packets so that the network
routers will know which policies and routing instructions to apply.
The steering of traffic onto Slice-Flow Aggregate paths is further described in <xref target="TrafficToSFAPath"/>.</t>

</section>
</section>
<section anchor="SliceModes"><name>Network Resource Partition Modes</name>

<t>An NRP Policy can be used to dictate if the network resource partitioning
of the shared network resources among multiple Slice-Flow Aggregates can be achieved:</t>

<t><list style="format %c)" counter="bar">
  <t>in data plane only,</t>
  <t>in control plane only, or</t>
  <t>in both control and data planes.</t>
</list></t>

<section anchor="DataplaneSlicing"><name>Data plane Network Resource Partition Mode</name>

<t>The physical network resources can be partitioned on network devices
by applying a Per Hop forwarding Behavior (PHB) onto packets that traverse the
network devices.</t>

<t>When data plane NRP mode is applied, packets need to be forwarded on the
specific NRP that supports the Slice-Flow Aggregate to ensure the proper
forwarding treatment dictated in the NRP Policy is applied (refer to
<xref target="SliceDefinition"/> below).  In this case, an NRP Selector
must be carried in each packet to identify the Slice-Flow Aggregate that
it belongs to.</t>

<t>The ingress node of an NRP domain adds an NRP Selector field (if not already
present) in each Slice-Flow Aggregate packet. In the data plane NRP mode, the
transit nodes within an NRP domain use the NRP Selector to associate packets with a
Slice-Flow Aggregate and to determine the Network Resource Partition Per Hop
Behavior (NRP-PHB) that is applied to the packet (refer to <xref target="SlicePHB"/> for
further details). The CS MAY be used to apply a Diffserv PHB on to the packet to
allow differentiation of traffic treatment within the same Slice-Flow
Aggregate.</t>

<t>When data plane only NRP mode is used, routers may rely on a
network state independent view of the topology to determine the best paths.
In this case, the best path selection dictates the
forwarding path of packets to the destination. The NRP Selector field carried in each
packet determines the specific NRP-PHB treatment along the
selected path.</t>

</section>
<section anchor="control-plane-network-resource-partition-mode"><name>Control Plane Network Resource Partition Mode</name>

<t>Multiple NRPs can be realized over the same set of physical resources.  Each
NRP is identified by an identifier (NRP-ID) that is globally unique within the
NRP domain. The NRP state reservations for each NRP can be maintained on the
network element or on a controller.</t>

<t>The network reservation states for a specific partition can be represented
in a topology that contains all or a subset of the physical network
elements (nodes and links) and reflect the network state reservations in
that NRP. The logical network resources that appear in the NRP topology can
reflect a part, whole, or in-excess of the physical network resource capacity
(e.g., when oversubscription is desirable).</t>

<t>For example, the physical link bandwidth can be
divided into fractions, each dedicated to an NRP that supports a Slice-Flow Aggregate.
The topology associated with the NRP supporting a Slice-Flow Aggregate
can be used by routing protocols, or by the ingress/PCE when computing NRP state
aware TE paths.</t>

<t>To perform NRP state aware Traffic Engineering (NRP-TE), the resource reservation
on each link needs to be NRP aware. The NRP reservations state can be managed
locally on the device or off device (e.g. on a controller).</t>

<t>The same physical link may be member of multiple slice policies that
instantiate different NRPs. The NRP
reservable or utilized bandwidth on such a link is updated (and may be
advertised) whenever new paths are placed in the network. The NRP
reservation state, in this case, is maintained on each device or off the
device on a resource reservation manager that holds reservation states for
those links in the network.</t>

<t>Multiple NRPs that support Slice-Flow Aggregates can form a group and share the available network
resources allocated to each. In this case, a node can update
the reservable bandwidth for each NRP to take into consideration
the available bandwidth from other NRPs in the same group.</t>

<t>For illustration purposes, <xref target="resource-sharing"/> describes bandwidth partitioning
or sharing amongst a group of NRPs. In Figure 2a, the NRPs identified by the following NRP-IDs:
NRP1, NRP2, NRP3 and NRP4 are not sharing any bandwidths between each
other. In Figure 2b, the NRPs: NRP1 and NRP2 can share the
available bandwidth portion allocated to each amongst them.
Similarly, NRP3 and NRP4 can share amongst themselves any available bandwidth
allocated to them, but they cannot share available bandwidth allocated to
NRP1 or NRP2.  In both cases, the Max Reservable Bandwidth may exceed the
actual physical link resource capacity to allow for over subscription.</t>

<figure title="Bandwidth isolation/sharing among NRPs." anchor="resource-sharing"><artwork><![CDATA[
  I-----------------------------I     I-----------------------------I 
  <--NRP1->                     I     I-----------------I           I
  I---------I                   I     I <-NRP1->        I           I
  I         I                   I     I I-------I       I           I
  I---------I                   I     I I       I       I           I
  I                             I     I I-------I       I           I
  <-----NRP2------>             I     I                 I           I
  I-----------------I           I     I <-NRP2->        I           I
  I                 I           I     I I---------I     I           I
  I-----------------I           I     I I         I     I           I
  I                             I     I I---------I     I           I
  <---NRP3---->                 I     I                 I           I
  I-------------I               I     I NRP1 + NRP2     I           I
  I             I               I     I-----------------I           I
  I-------------I               I     I                             I
  I                             I     I                             I
  <---NRP4---->                 I     I-----------------I           I
  I-------------I               I     I <-NRP3->        I           I
  I             I               I     I I-------I       I           I
  I-------------I               I     I I       I       I           I
  I                             I     I I-------I       I           I
  I NRP1+NRP2+NRP3+NRP4         I     I                 I           I
  I                             I     I <-NRP4->        I           I
  I-----------------------------I     I I---------I     I           I
  <--Max Reservable Bandwidth-->      I I         I     I           I
                                      I I---------I     I           I
                                      I                 I           I
                                      I NRP3 + NRP4     I           I
                                      I-----------------I           I
                                      I NRP1+NRP2+NRP3+NRP4         I
                                      I                             I
                                      I-----------------------------I
                                      <--Max Reservable Bandwidth-->

  (a) No bandwidth sharing            (b) Sharing bandwidth between
      between NRPs.                       NRPs of the same group.

]]></artwork></figure>

</section>
<section anchor="data-and-control-plane-network-resource-partition-mode"><name>Data and Control Plane Network Resource Partition Mode</name>

<t>In order to support strict guarantees for Slice-Flow
Aggregates, the network resources can be partitioned in both the control plane
and data plane.</t>

<t>The control plane partitioning allows the creation of customized topologies per
NRP that each supports a Slice-Flow Aggregate. The ingress routers or a Path
Computation Engine (PCE) may use the customized topologies and the NRP state
to determine optimal path placement for specific demand flows using NRP-TE.</t>

<t>The data plane partitioning provides isolation for Slice-Flow Aggregate traffic, and
protection when resource contention occurs due to bursts of traffic from other Slice-Flow
Aggregate traffic that traverses the same shared network resource.</t>

</section>
</section>
<section anchor="SlicePolicyInstantiation"><name>Network Resource Partition Instantiation</name>

<t>A network slice can span multiple technologies and multiple administrative
domains.  Depending on the network slice customer requirements, a network
slice can be differentiated from other network slices in terms of data, control,
and management planes.</t>

<t>The customer of a network slice service expresses their intent
by specifying requirements rather than mechanisms to realize the slice as described
in <xref target="NetworkSliceServiceRequest"/>.</t>

<t>The network slice controller is fed with the network slice service
intent and realizes it with an appropriate Network Resource Partition Policy (NRP Policy).
Multiple IETF network slices are mapped to the same Slice-Flow Aggregate as described in <xref target="SliceAggregateMapping"/>.</t>

<t>The network wide consistent NRP Policy definition is distributed to the
devices in the network as shown in <xref target="ns-workflow"/>. The specification of
the network slice intent on the northbound interface of the controller and the
mechanism used to map the network slice to a Slice-Flow Aggregate are outside the scope
of this document and will be addressed in separate documents.</t>

<section anchor="SliceDefinition"><name>NRP Policy Definition</name>

<t>The NRP Policy is network-wide construct that is supplied to network devices,
and may include rules that control the following:</t>

<t><list style="symbols">
  <t>Data plane specific policies: This includes the NRP Selector, any firewall rules or
flow-spec filters, and QoS profiles associated with the NRP Policy and any
classes within it.</t>
  <t>Control plane specific policies: This includes bandwidth reservations, any
network resource sharing amongst slice policies, and reservation preference to
prioritize reservations of a specific NRP over others.</t>
  <t>Topology membership policies: This defines the topology filter policies that dictate
node/link/function membership to a specific NRP.</t>
</list></t>

<t>There is a desire for flexibility in realizing network slices to support the
services across networks consisting of implementations from multiple vendors.  These
networks may also be grouped into disparate domains and deploy various path
control technologies and tunnel techniques to carry traffic across the network.
It is expected that a standardized data model for NRP
Policy will facilitate the instantiation and management of the NRP
on the topological elements selected by the NRP
Policy topology filter.</t>

<t>It is also possible to distribute the NRP Policy to
network devices using several mechanisms, including protocols such as NETCONF
or RESTCONF, or exchanging it using a suitable routing protocol that network
devices participate in (such as IGP(s) or BGP). The extensions to enable
specific protocols to carry an NRP Policy definition will
be described in separate documents.</t>

<section anchor="SliceSelector"><name>Network Resource Partition Selector</name>

<t>A router needs to be able to identify a packet belonging to a Slice-
Flow Aggregate before it can apply the associated data plane
forwarding treatment or NRP-PHB.  One or more fields within the
packet are used as an NRP Selector to do this. There are several
possible approaches as follows.</t>

<t>Overloaded forwarding identifier as NRP Selector:</t>

<ul empty="true"><li>
  <t>It is possible to assign a different forwarding address or MPLS forwarding
 label for each Slice-Flow Aggregate on a specific node
 in the network. This allows Slice-Flow Aggregate packets
 destined to a node to be distinguished by the destination address
 or the MPLS forwarding label that is carried in the packet.</t>

  <t>This approach requires maintaining per Slice-Flow Aggregate state
 for each destination in the network in both the control and data
 plane and on each router in the network. Hence this approach
 scales as the multiple of the number of Slice-Flow Aggregates
 and the number of adjacencies each node has which is a
 scalability challenge in both the control and data planes.</t>
</li></ul>

<t>Overloaded service identifier as NRP Selector:</t>

<ul empty="true"><li>
  <t>VPN identifiers can be carried in the IP/MPLS forwarding plane
 using a variety of techniques (including MPLS VPN service labels).
 These identifiers can be overloaded to act as NRP Selectors
 to allow VPN packets to be mapped to the Slice-Flow Aggregate.  In
 this case, a single VPN identifier acting as an NRP Selector needs
 to be allocated by all Egress PEs of a VPN.</t>
</li></ul>

<ul empty="true"><li>
  <t>In other cases, a range of VPN identifiers can map to a single NRP
 Selector to map traffic from multiple VPNs to a Slice-Flow Aggregate.</t>
</li></ul>

<figure title="NRP Selector as VPN label at bottom of label stack." anchor="bottom-stack"><artwork><![CDATA[
  SR Adj-SID:          NRP Selector (VPN service label) on PE2: 1001
     9012: P1-P2
     9023: P2-PE2

         /-----\        /-----\        /-----\       /-----\
         | PE1 | -----  | P1  | ------ | P2  |------ | PE2 |
         \-----/        \-----/        \-----/       \-----/

In 
packet: 
+------+       +------+         +------+        +------+
| IP   |       | 9012 |         | 9023 |        | 1001 |
+------+       +------+         +------+        +------+
| Pay- |       | 9023 |         | 1001 |        | IP   | 
| Load |       +------+         +------+        +------+
+----- +       | 1001 |         | IP   |        | Pay- |
               +------+         +------+        | Load |
               | IP   |         | Pay- |        +------+
               +------+         | Load |
               | Pay- |         +------+
               | Load |
               +------+
]]></artwork></figure>

<t>Dedicated identifier as NRP Selector:</t>

<ul empty="true"><li>
  <t>A dedicated identifier may be defined as to act as the NRP Selector
ID to be carried in packets of Slice-Flow Aggregate, independent of
the forwarding address or MPLS forwarding label bound to the
destination and independent of any VPN identifiers.  Routers within
the NRP domain can use the forwarding address or MPLS forwarding
label to determine the forwarding next-hops, and use the NRP
Selector in the packet to infer the specific forwarding treatment
that needs to be applied on the packet.</t>
</li></ul>

<ul empty="true"><li>
  <t>The NRP Selector, in this case, can be carried in one of multiple
fields in the packet, depending on the data plane in use. All packets
that belong to the same Slice-Flow Aggregate may carry the same
NRP Selector, but it is also possible to have multiple NRP Selector's
map to the same Slice-Flow Aggregate.</t>
</li></ul>

<t>Fallback treatment for unclassified packets:</t>

<ul empty="true"><li>
  <t>When a dedicated identifier is used as the NRP Selector, it is
beneficial to specify a fallback action for situations where an
NRP packet cannot be mapped to an NRP on an NRP-capable node.  In
such cases, a field within the NRP Selector ID can be used to
indicate whether to apply the default drop action or permit a
fallback treatment.  The fallback treatment can be specified by a
local policy.</t>

</li></ul>

</section>
<section anchor="network-resource-partition-resource-reservation"><name>Network Resource Partition Resource Reservation</name>

<t>Bandwidth and network resource allocation strategies for slice policies are
essential to achieve optimal placement of paths within the
network while still meeting the target SLOs.</t>

<t>Resource reservation allows for the management of available bandwidth and the
prioritization of existing allocations to enable preference-based preemption
when contention on a specific network resource arises. Sharing of a network
resource's available bandwidth amongst a group of NRPs
may also be desirable.  For example, a Slice-Flow Aggregate may not be using all of
the NRP reservable bandwidth; this allows other NRPs in
the same group to use the available bandwidth resources for other Slice-Flow
Aggregates.</t>

<t>Congestion on shared network resources may result from sub-optimal placement
of paths in different slice policies. When this occurs, preemption
of some Slice-Flow Aggregate paths may be desirable to alleviate congestion.
A preference-based allocation scheme enables prioritization of Slice-Flow Aggregate paths
that can be preempted.</t>

<t>Since network characteristics and its state can change over time, the NRP
topology and its network state need to be propagated in the network to enable
ingress TE routers or Path Computation Engine (PCEs) to perform accurate path placement
based on the current state of the NRP network resources.</t>

</section>
<section anchor="SlicePHB"><name>Network Resource Partition Per Hop Behavior</name>

<t>The NRP Per Hop Behavior (NRP-PHB) is the externally
observable forwarding behavior applied to a specific packet belonging to a
Slice-Flow Aggregate. The goal of an NRP-PHB is to provide a specified amount
of network resources for traffic belonging to a specific Slice-Flow Aggregate.
A single NRP may also support multiple forwarding
treatments or services that can be carried over the same logical network.</t>

<t>The Slice-Flow Aggregate traffic may be identified at NRP ingress boundary
nodes by carrying a NRP Selector to allow routers to apply a specific forwarding
treatment that guarantee the SLA(s).</t>

<t>To support multiple forwarding treatments over the same Slice-Flow Aggregate, a
Slice-Flow Aggregate packet may also carry a Diffserv CS to identify the
specific Diffserv forwarding treatment to be applied on the traffic belonging
to the same NRP.</t>

<t>At transit nodes, the CS field carried inside the packets are used to determine the
specific PHB that determines the forwarding and scheduling
treatment before packets are forwarded, and in some cases, drop probability for
each packet.</t>

</section>
<section anchor="SlicePolicyTopology"><name>Network Resource Partition Topology</name>

<t>A key element of the NRP Policy is a customized topology that may include the
full or subset of the physical network topology. The NRP topology
could also span multiple administrative domains and/or multiple dataplane
technologies.</t>

<t>An NRP topology can overlap or share a subset of links
with another NRP topology. A number of topology
filtering policies can be defined as part of the NRP
Policy to limit the specific topology elements that belong to the NRP.
For example, a topology filtering policy can leverage Resource
Affinities as defined in <xref target="RFC2702"/> to include or exclude certain links that
the NRP is instantiated on in support of the Slice-Flow
Aggregate.</t>

<t>The NRP Policy may also include a reference to a
predefined topology (e.g., derived from a Flexible Algorithm Definition (FAD)
as defined in <xref target="I-D.ietf-lsr-flex-algo"/>, or Multi-Topology ID as defined
<xref target="RFC4915"/>.</t>

</section>
</section>
<section anchor="NRPBoundary"><name>Network Resource Partition Boundary</name>

<t>A network slice originates at the edge nodes of a network slice provider.
Traffic that is steered over the corresponding NRP supporting a Slice-Flow
Aggregate may traverse NRP capable as well as NRP incapable interior nodes.</t>

<t>The network slice may encompass one or more domains administered by a provider.
For example, an organization's intranet or an ISP.  The network provider
is responsible for ensuring that adequate network resources are
provisioned and/or reserved to support the SLAs offered by the network
end-to-end.</t>

<section anchor="network-resource-partition-edge-nodes"><name>Network Resource Partition Edge Nodes</name>

<t>NRP edge nodes sit at the boundary of a network slice provider network
and receive traffic that requires steering over network resources specific to a
NRP that supports a Slice-Flow Aggregate. These edge nodes are responsible for identifying Slice-Flow
Aggregate specific traffic flows by possibly inspecting multiple fields from
inbound packets (e.g., implementations may inspect IP traffic's network 5-tuple
in the IP and transport protocol headers) to decide on which NRP it
can be steered.</t>

<t>Network slice ingress nodes may condition the inbound traffic at network boundaries in
accordance with the requirements or rules of each service's SLAs.  The
requirements and rules for network slice services are set using
mechanisms which are outside the scope of this document.</t>

<t>When data plane NRP mode is employed, the NRP ingress nodes are responsible for
setting a suitable NRP Selector on packets that belong to the Slice-Flow
Aggregate, and optionally the desired Diffserv CS.</t>

</section>
<section anchor="network-resource-partition-interior-nodes"><name>Network Resource Partition Interior Nodes</name>

<t>An NRP interior node receives slice traffic and may be able to identify the
packets belonging to a specific Slice-Flow Aggregate by inspecting the NRP Selector
field carried inside each packet, or by inspecting other fields
within the packet that may identify the traffic streams that belong to a specific
Slice-Flow Aggregate. For example, when data plane NRP mode is applied, interior
nodes can use the NRP Selector carried within the packet to apply the corresponding NRP-PHB
forwarding behavior.</t>

</section>
<section anchor="NRPIncapbale"><name>Network Resource Partition Incapable Nodes</name>

<t>Packets that belong to a Slice-Flow Aggregate may need to traverse nodes that
are NRP incapable. In this case, several options are possible to allow the
slice traffic to continue to be forwarded over such devices and be able to
resume the NRP forwarding treatment once the traffic reaches devices that are
NRP-capable.</t>

<t>When data plane NRP mode is employed, packets carry a NRP Selector to allow
slice interior nodes to identify them. To support end-to-end network slicing,
the NRP Selector is maintained in the packets as they traverse devices within
the network -- including NRP capable and incapable devices.</t>

<t>For example, when the NRP Selector is an MPLS label at the bottom of the MPLS
label stack, packets can traverse over devices that are NRP incapable without
any further considerations. On the other hand when the NRP Selector label is at
the top of the MPLS label stack, packets can be bypassed (or tunneled) over the
NRP incapable devices towards the next device that supports NRP as shown in
<xref target="sl-interworking"/>.</t>

<figure title="Extending network slice over NRP incapable device(s)." anchor="sl-interworking"><artwork><![CDATA[
  SR Node-SID:           NRP Selector: 1001     @@@: NRP Policy
     1601: P1            Label                       enforced
     1602: P2                                   ...: NRP Policy
     1603: P3                                        not enforced
     1604: P4
     1605: P5

            @@@@@@@@@@@@@@ ........................
                                                  .
           /-----\        /-----\        /-----\  .
           | P1  | -----  | P2  | ----- | P3  |   .
           \-----/        \-----/        \-----/  .
                                            |     @@@@@@@@@@
                                            |
                                         /-----\        /-----\ 
                                         | P4  | ------ | P5  |
                                         \-----/        \-----/


            +------+       +------+        +------+
            | 1001 |       | 1604 |        | 1001 |
            +------+       +------+        +------+
            | 1605 |       | 1001 |        | IP   |
            +------+       +------+        +------+
            | IP   |       | 1605 |        | Pay- |
            +------+       +------+        | Load |
            | Pay- |       | IP   |        +------+
            | Load |       +------+
            +----- +       | Pay- |
                           | Load |
                           +------+
]]></artwork></figure>

</section>
<section anchor="combining-network-resource-partition-modes"><name>Combining Network Resource Partition Modes</name>

<t>It is possible to employ a combination of the NRP modes that were
discussed in <xref target="SliceModes"/> to realize a network slice. For example, data and
control plane NRP modes can be employed in parts of a network, while
control plane NRP mode can be employed in the other parts of the
network. The path selection, in such case, can take into
account the NRP available network resources.  The NRP Selector carried within
packets allow transit nodes to enforce the corresponding NRP-PHB on the parts of the
network that apply the data plane NRP mode. The NRP Selector can be
maintained while traffic traverses nodes that do not enforce data plane NRP
mode, and so slice PHB enforcement can resume once traffic traverses
capable nodes.</t>

</section>
</section>
</section>
<section anchor="TrafficToSFAPath"><name>Mapping Traffic on Slice-Flow Aggregates</name>

<t>The usual techniques to steer traffic onto paths can be applicable when
steering traffic over paths established for a specific Slice-Flow Aggregate.</t>

<t>For example, one or more (layer-2 or layer-3) VPN services can be directly
mapped to paths established for a Slice-Flow Aggregate. In this case, the per
Virtual Routing and Forwarding (VRF) instance traffic that arrives on the
Provider Edge (PE) router over external interfaces can be directly mapped to a
specific Slice-Flow Aggregate path. External interfaces can be further
partitioned (e.g., using VLANs) to allow mapping one or more VLANs to specific
Slice-Flow Aggregate paths.</t>

<t>Another option is steer traffic to specific destinations directly over multiple
slice policies. This allows traffic arriving on any external interface and
targeted to such destinations to be directly steered over the slice paths.</t>

<t>A third option that can also be used is to utilize a data plane firewall filter
or classifier to enable matching of several fields in the incoming packets to
decide whether the packet belongs to a specific Slice-Flow Aggregate. This option
allows for applying a rich set of rules to identify specific packets to be
mapped to a Slice-Flow Aggregate. However, it requires data plane network resources to
be able to perform the additional checks in hardware.</t>

<section anchor="network-slice-flow-aggregate-relationships"><name>Network Slice-Flow Aggregate Relationships</name>

<t>The following describes the generalization relationships between
the IETF network slice and different parts of the solution
as described in <xref target="ns-workflow"/>.</t>

<t>o A customer may request one or more IETF Network Slices.</t>

<t>o Any given Attachment Circuit (AC) may support the traffic for one or more IETF Network
  Slices. If there is more than one IETF Network Slice using a
  single AC, the IETF Network Slice Service request must include
  enough information to allow the edge nodes to demultiplex the
  traffic for the different IETF Network Slices.</t>

<t>o By definition, multiple IETF Network Slices may be mapped to a
  single Slice-Flow Aggregate.  However, it is possible for an
  Slice-Flow Aggregate to contain just a single IETF Network Slice.</t>

<t>o The physical network may be filtered to multiple Filter
  Topologies.  Each such Filtered Topology facilitates
  planning the placement of paths for the Slice-Flow Aggregate by
  presenting only the subset of links and nodes that meet specific
  criteria.  Note, however, in absence of 
  any Filtered Topology, Slice-Flow Aggregate are free to
  operate over the full physical network.</t>

<t>o It is anticipated that there may be very many IETF Network Slices supported
  by a network operator over a single physical network.  A network may support a
  limited number of Slice-Flow Aggregates, with each of the Slice-Flow Aggregates
  grouping any number of the IETF Network Slices streams.</t>

</section>
</section>
<section anchor="path-selection-and-instantiation"><name>Path Selection and Instantiation</name>

<section anchor="applicability-of-path-selection-to-slice-flow-aggregates"><name>Applicability of Path Selection to Slice-Flow Aggregates</name>

<t>In State-dependent TE <xref target="I-D.ietf-teas-rfc3272bis"/>, the path selection adapts
based on the current state of the network. The state of the network can be
based on parameters flooded by the routers as described in <xref target="RFC2702"/>.  The
link state is advertised with current reservations, thereby reflecting the
available bandwidth on each link.  Such link reservations may be maintained
centrally on a network wide network resource manager, or distributed on devices
(as usually done with RSVP-TE). TE extensions exist today to allow IGPs (e.g.,
<xref target="RFC3630"/> and <xref target="RFC5305"/>), and BGP-LS <xref target="RFC7752"/> to advertise such link
state reservations.</t>

<t>When the network resource reservations are maintained for NRPs,
the link state can carry per NRP state (e.g.,
reservable bandwidth).  This allows path computation to take into account the
specific network resources available for an NRP.  In this
case, we refer to the process of path placement and path provisioning as NRP
aware TE (NRP-TE).</t>

</section>
<section anchor="applicability-of-path-control-technologies-to-slice-flow-aggregates"><name>Applicability of Path Control Technologies to Slice-Flow Aggregates</name>

<t>The NRP modes described in this document are agnostic to the
technology used to setup paths that carry Slice-Flow Aggregate traffic.
One or more paths connecting the endpoints of the mapped IETF network
slices may be selected to steer the corresponding traffic streams
over the resources allocated for the NRP that
supports a Slice-Flow Aggregate.</t>

<t>The feasible paths can be computed using the NRP topology and network state
subject the optimization metrics and constraints.</t>

<section anchor="rsvp-te-based-slice-flow-aggregate-paths"><name>RSVP-TE Based Slice-Flow Aggregate Paths</name>

<t>RSVP-TE <xref target="RFC3209"/> can be used to signal LSPs over the computed feasible paths
in order to carry the Slice-Flow Aggregate traffic. The specific extensions to the RSVP-TE
protocol required to enable signaling of NRP aware RSVP-TE LSPs are
outside the scope of this document.</t>

</section>
<section anchor="sr-based-slice-flow-aggregate-paths"><name>SR Based Slice-Flow Aggregate Paths</name>

<t>Segment Routing (SR) <xref target="RFC8402"/> can be used to setup and steer traffic over
the computed Slice-Flow Aggregate feasible paths.</t>

<t>The SR architecture defines a number of building blocks that can be leveraged to support
the realization of NRPs that support Slice-Flow Aggregates in an SR network.</t>

<t>Such building blocks include:</t>

<t><list style="symbols">
  <t>SR Policy with or without Flexible Algorithm.</t>
  <t>Steering of services (e.g. VPN) traffic over SR paths</t>
  <t>SR Operation, Administration and Management (OAM) and Performance Management (PM)</t>
</list></t>

<t>SR allows a headend node to steer packets onto specific SR paths using
a Segment Routing Policy (SR Policy). The SR policy supports various
optimization objectives and constraints and can be used to steer Slice-Flow Aggregate
traffic in the SR network.</t>

<t>The SR policy can be instantiated with or without the IGP Flexible Algorithm
(Flex-Algorithm) feature.  It may be possible to dedicate a single SR
Flex-Algorithm to compute and instantiate SR paths for one Slice-Flow Aggregate
traffic. In this case, the SR Flex-Algorithm computed paths and Flex-Algorithm
SR SIDs are not shared by other Slice-Flow Aggregates traffic. However, to allow for better
scale, it may be desirable for multiple Slice-Flow Aggregates traffic to share the
same SR Flex-Algorithm computed paths and SIDs.</t>

</section>
</section>
</section>
<section anchor="network-resource-partition-protocol-extensions"><name>Network Resource Partition Protocol Extensions</name>

<t>Some protocols may need to be extended to carry additional NRP state.</t>

<t>It is essential, however, that routing protocols, like IGPs or BGP, remain uninvolved in
these areas to ensure they are isolated and maintain their scalability and
stability. Furthermore, the complexity of routing protocols path selection
should not be impacted by the increasing number of network slices and/or NRPs.</t>

<t>The instantiation of an NRP Policy may need to be automated. Multiple options
are possible to facilitate automation of distribution of an NRP Policy to
capable devices.</t>

<t>For example, a YANG data model for the NRP Policy may be
supported on network devices and controllers. A suitable transport (e.g.,
NETCONF <xref target="RFC6241"/>, RESTCONF <xref target="RFC8040"/>, or gRPC) may be used to enable
configuration and retrieval of state information for slice policies on network
devices. The NRP Policy YANG data model is outside the scope of this
document.</t>

</section>
<section anchor="outstanding-issues"><name>Outstanding Issues</name>

<t>Note to RFC Editor: Please remove this section prior to publication.</t>

<t>This section records non-blocking issues that were raised during the Working
Group Adoption Poll for the document. The below list of issues needs to be fully
addressed before progressing the document to publication in IESG.</t>

<t><list style="numbers" type="1">
  <t>Add new Appendix section with examples for the NRP modes described in
<xref target="SliceModes"/>.</t>
  <t>Elaborate on the Slice-Flow Aggregate packet treatment when no rules to associate the packet
to an NRP are defined in the NRP Policy.</t>
  <t>Clarify how the solution caters to the different IETF Network Slice Service
Demarcation Point locations described in Section 4.2 of
<xref target="RFC9543"/>.</t>
  <t>Clarify the relationship the underlay physical network, the filter topology
and the NRP resources.</t>
  <t>Expand on how isolation between NRPs can be realized depending on the
deployed NRP mode.</t>
  <t>Revise <xref target="NRPIncapbale"/> to describe how nodes can discover NRP incapable
downstream neighbors.</t>
  <t>Expand <xref target="SecurityConsiderations"/> on additional security threats introduced
with the solution.</t>
  <t>Expand <xref target="NRPBoundary"/> on NRP domain boundary and multi-domain aspects.</t>
</list></t>

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

<t>This document has no IANA actions.</t>

</section>
<section anchor="SecurityConsiderations"><name>Security Considerations</name>

<t>The main goal of network slicing is to allow for varying treatment of
traffic from multiple different network slices that are utilizing a common
network infrastructure and to allow for different levels of services to be
provided for traffic traversing a given network resource.</t>

<t>A variety of techniques may be used to achieve this, but the end result will be
that some packets may be mapped to specific resources and may receive
different (e.g., better) service treatment than others.  The mapping of network
traffic to a specific NRP is indicated primarily by the NRP Selector, and hence an
adversary may be able to utilize resources allocated to a specific 
NRP by injecting packets carrying the same NRP Selector field in their packets.</t>

<t>Such theft-of-service may become a denial-of-service attack when the modified
or injected traffic depletes the resources available to forward legitimate
traffic belonging to a specific NRP.</t>

<t>The defense against this type of theft and denial-of-service attacks consists
of a combination of traffic conditioning at NRP domain boundaries
with security and integrity of the network infrastructure within an NRP
domain.</t>

</section>
<section anchor="acknowledgement"><name>Acknowledgement</name>

<t>The authors would like to thank Krzysztof Szarkowicz, Swamy SRK, Navaneetha
Krishnan, Prabhu Raj Villadathu Karunakaran, and Mohamed Boucadair
for their review of this document and for providing valuable feedback on it.
The authors would also like to thank Adrian Farrel for detailed discussions
that resulted in <xref target="NSRealization"/>.</t>

</section>
<section anchor="contributors"><name>Contributors</name>

<t>The following individuals contributed to this document:</t>

<figure><artwork><![CDATA[
   Colby Barth
   Juniper Networks
   Email: cbarth@juniper.net

   Srihari R.  Sangli
   Juniper Networks
   Email: ssangli@juniper.net

   Chandra Ramachandran
   Juniper Networks
   Email: csekar@juniper.net

   Adrian Farrel
   Old Dog Consulting
   United Kingdom
   Email: adrian@olddog.co.uk

   Bin Wen
   Comcast
   Email: Bin_Wen@cable.comcast.com

   Daniele Ceccarelli
   Cisco Systems Inc.
   Email: daniele.ietf@gmail.com

   Xufeng Liu
   IBM Corporation
   Email: xufeng.liu.ietf@gmail.com

   Luis M. Contreras
   Telefonica
   Email: luismiguel.contrerasmurillo@telefonica.com

   Reza Rokui
   Ciena
   Email: rrokui@ciena.com

   Ran Chen
   ZTE Corporation
   Email: chen.ran@zte.com.cn

   Luay Jalil
   Verizon
   Email: luay.jalil@verizon.com

]]></artwork></figure>

</section>


  </middle>

  <back>


<references title='References' anchor="sec-combined-references">

    <references title='Normative References' anchor="sec-normative-references">



<reference anchor="RFC3630">
  <front>
    <title>Traffic Engineering (TE) Extensions to OSPF Version 2</title>
    <author fullname="D. Katz" initials="D." surname="Katz"/>
    <author fullname="K. Kompella" initials="K." surname="Kompella"/>
    <author fullname="D. Yeung" initials="D." surname="Yeung"/>
    <date month="September" year="2003"/>
    <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="RFC5305">
  <front>
    <title>IS-IS Extensions for Traffic Engineering</title>
    <author fullname="T. Li" initials="T." surname="Li"/>
    <author fullname="H. Smit" initials="H." surname="Smit"/>
    <date month="October" year="2008"/>
    <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="RFC7752">
  <front>
    <title>North-Bound Distribution of Link-State and Traffic Engineering (TE) Information Using BGP</title>
    <author fullname="H. Gredler" initials="H." role="editor" surname="Gredler"/>
    <author fullname="J. Medved" initials="J." surname="Medved"/>
    <author fullname="S. Previdi" initials="S." surname="Previdi"/>
    <author fullname="A. Farrel" initials="A." surname="Farrel"/>
    <author fullname="S. Ray" initials="S." surname="Ray"/>
    <date month="March" year="2016"/>
    <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="RFC3209">
  <front>
    <title>RSVP-TE: Extensions to RSVP for LSP Tunnels</title>
    <author fullname="D. Awduche" initials="D." surname="Awduche"/>
    <author fullname="L. Berger" initials="L." surname="Berger"/>
    <author fullname="D. Gan" initials="D." surname="Gan"/>
    <author fullname="T. Li" initials="T." surname="Li"/>
    <author fullname="V. Srinivasan" initials="V." surname="Srinivasan"/>
    <author fullname="G. Swallow" initials="G." surname="Swallow"/>
    <date month="December" year="2001"/>
    <abstract>
      <t>This document describes the use of RSVP (Resource Reservation Protocol), including all the necessary extensions, to establish label-switched paths (LSPs) in MPLS (Multi-Protocol Label Switching). Since the flow along an LSP is completely identified by the label applied at the ingress node of the path, these paths may be treated as tunnels. A key application of LSP tunnels is traffic engineering with MPLS as specified in RFC 2702. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="3209"/>
  <seriesInfo name="DOI" value="10.17487/RFC3209"/>
</reference>



    </references>

    <references title='Informative References' anchor="sec-informative-references">



<reference anchor="RFC9543">
  <front>
    <title>A Framework for Network Slices in Networks Built from IETF Technologies</title>
    <author fullname="A. Farrel" initials="A." role="editor" surname="Farrel"/>
    <author fullname="J. Drake" initials="J." role="editor" surname="Drake"/>
    <author fullname="R. Rokui" initials="R." surname="Rokui"/>
    <author fullname="S. Homma" initials="S." surname="Homma"/>
    <author fullname="K. Makhijani" initials="K." surname="Makhijani"/>
    <author fullname="L. Contreras" initials="L." surname="Contreras"/>
    <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
    <date month="March" year="2024"/>
    <abstract>
      <t>This document describes network slicing in the context of networks built from IETF technologies. It defines the term "IETF Network Slice" to describe this type of network slice and establishes the general principles of network slicing in the IETF context.</t>
      <t>The document discusses the general framework for requesting and operating IETF Network Slices, the characteristics of an IETF Network Slice, the necessary system components and interfaces, and the mapping of abstract requests to more specific technologies. The document also discusses related considerations with monitoring and security.</t>
      <t>This document also provides definitions of related terms to enable consistent usage in other IETF documents that describe or use aspects of IETF Network Slices.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="9543"/>
  <seriesInfo name="DOI" value="10.17487/RFC9543"/>
</reference>
<reference anchor="RFC2475">
  <front>
    <title>An Architecture for Differentiated Services</title>
    <author fullname="S. Blake" initials="S." surname="Blake"/>
    <author fullname="D. Black" initials="D." surname="Black"/>
    <author fullname="M. Carlson" initials="M." surname="Carlson"/>
    <author fullname="E. Davies" initials="E." surname="Davies"/>
    <author fullname="Z. Wang" initials="Z." surname="Wang"/>
    <author fullname="W. Weiss" initials="W." surname="Weiss"/>
    <date month="December" year="1998"/>
    <abstract>
      <t>This document defines an architecture for implementing scalable service differentiation in the Internet. This memo provides information for the Internet community.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="2475"/>
  <seriesInfo name="DOI" value="10.17487/RFC2475"/>
</reference>
<reference anchor="RFC5462">
  <front>
    <title>Multiprotocol Label Switching (MPLS) Label Stack Entry: "EXP" Field Renamed to "Traffic Class" Field</title>
    <author fullname="L. Andersson" initials="L." surname="Andersson"/>
    <author fullname="R. Asati" initials="R." surname="Asati"/>
    <date month="February" year="2009"/>
    <abstract>
      <t>The early Multiprotocol Label Switching (MPLS) documents defined the form of the MPLS label stack entry. This includes a three-bit field called the "EXP field". The exact use of this field was not defined by these documents, except to state that it was to be "reserved for experimental use".</t>
      <t>Although the intended use of the EXP field was as a "Class of Service" (CoS) field, it was not named a CoS field by these early documents because the use of such a CoS field was not considered to be sufficiently defined. Today a number of standards documents define its usage as a CoS field.</t>
      <t>To avoid misunderstanding about how this field may be used, it has become increasingly necessary to rename this field. This document changes the name of the field to the "Traffic Class field" ("TC field"). In doing so, it also updates documents that define the current use of the EXP field. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="5462"/>
  <seriesInfo name="DOI" value="10.17487/RFC5462"/>
</reference>
<reference anchor="RFC2702">
  <front>
    <title>Requirements for Traffic Engineering Over MPLS</title>
    <author fullname="D. Awduche" initials="D." surname="Awduche"/>
    <author fullname="J. Malcolm" initials="J." surname="Malcolm"/>
    <author fullname="J. Agogbua" initials="J." surname="Agogbua"/>
    <author fullname="M. O'Dell" initials="M." surname="O'Dell"/>
    <author fullname="J. McManus" initials="J." surname="McManus"/>
    <date month="September" year="1999"/>
    <abstract>
      <t>This document presents a set of requirements for Traffic Engineering over Multiprotocol Label Switching (MPLS). It identifies the functional capabilities required to implement policies that facilitate efficient and reliable network operations in an MPLS domain. This memo provides information for the Internet community.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="2702"/>
  <seriesInfo name="DOI" value="10.17487/RFC2702"/>
</reference>

<reference anchor="I-D.ietf-lsr-flex-algo">
   <front>
      <title>IGP Flexible Algorithm</title>
      <author fullname="Peter Psenak" initials="P." surname="Psenak">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author fullname="Shraddha Hegde" initials="S." surname="Hegde">
         <organization>Juniper Networks, Inc.</organization>
      </author>
      <author fullname="Clarence Filsfils" initials="C." surname="Filsfils">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author fullname="Ketan Talaulikar" initials="K." surname="Talaulikar">
         <organization>Cisco Systems, Inc</organization>
      </author>
      <author fullname="Arkadiy Gulko" initials="A." surname="Gulko">
         <organization>Edward Jones</organization>
      </author>
      <date day="17" month="October" year="2022"/>
      <abstract>
	 <t>IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links.  Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path.  This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network.  This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-lsr-flex-algo-26"/>
   
</reference>
<reference anchor="RFC4915">
  <front>
    <title>Multi-Topology (MT) Routing in OSPF</title>
    <author fullname="P. Psenak" initials="P." surname="Psenak"/>
    <author fullname="S. Mirtorabi" initials="S." surname="Mirtorabi"/>
    <author fullname="A. Roy" initials="A." surname="Roy"/>
    <author fullname="L. Nguyen" initials="L." surname="Nguyen"/>
    <author fullname="P. Pillay-Esnault" initials="P." surname="Pillay-Esnault"/>
    <date month="June" year="2007"/>
    <abstract>
      <t>This document describes an extension to Open Shortest Path First (OSPF) in order to define independent IP topologies called Multi- Topologies (MTs). The Multi-Topologies extension can be used for computing different paths for unicast traffic, multicast traffic, different classes of service based on flexible criteria, or an in- band network management topology.</t>
      <t>An optional extension to exclude selected links from the default topology is also described. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="4915"/>
  <seriesInfo name="DOI" value="10.17487/RFC4915"/>
</reference>

<reference anchor="I-D.ietf-teas-rfc3272bis">
   <front>
      <title>Overview and Principles of Internet Traffic Engineering</title>
      <author fullname="Adrian Farrel" initials="A." surname="Farrel">
         <organization>Old Dog Consulting</organization>
      </author>
      <date day="12" month="August" year="2023"/>
      <abstract>
	 <t>   This document describes the principles of traffic engineering (TE) in
   the Internet.  The document is intended to promote better
   understanding of the issues surrounding traffic engineering in IP
   networks and the networks that support IP networking, and to provide
   a common basis for the development of traffic engineering
   capabilities for the Internet.  The principles, architectures, and
   methodologies for performance evaluation and performance optimization
   of operational networks are also discussed.

   This work was first published as RFC 3272 in May 2002.  This document
   obsoletes RFC 3272 by making a complete update to bring the text in
   line with best current practices for Internet traffic engineering and
   to include references to the latest relevant work in the IETF.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-teas-rfc3272bis-27"/>
   
</reference>
<reference anchor="RFC8402">
  <front>
    <title>Segment Routing Architecture</title>
    <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
    <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
    <author fullname="L. Ginsberg" initials="L." surname="Ginsberg"/>
    <author fullname="B. Decraene" initials="B." surname="Decraene"/>
    <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
    <author fullname="R. Shakir" initials="R." surname="Shakir"/>
    <date month="July" year="2018"/>
    <abstract>
      <t>Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment can represent any instruction, topological or service based. A segment can have a semantic local to an SR node or global within an SR domain. SR provides a mechanism that allows a flow to be restricted to a specific topological path, while maintaining per-flow state only at the ingress node(s) to the SR domain.</t>
      <t>SR can be directly applied to the MPLS architecture with no change to the forwarding plane. A segment is encoded as an MPLS label. An ordered list of segments is encoded as a stack of labels. The segment to process is on the top of the stack. Upon completion of a segment, the related label is popped from the stack.</t>
      <t>SR can be applied to the IPv6 architecture, with a new type of routing header. A segment is encoded as an IPv6 address. An ordered list of segments is encoded as an ordered list of IPv6 addresses in the routing header. The active segment is indicated by the Destination Address (DA) of the packet. The next active segment is indicated by a pointer in the new routing header.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="8402"/>
  <seriesInfo name="DOI" value="10.17487/RFC8402"/>
</reference>
<reference anchor="RFC6241">
  <front>
    <title>Network Configuration Protocol (NETCONF)</title>
    <author fullname="R. Enns" initials="R." role="editor" surname="Enns"/>
    <author fullname="M. Bjorklund" initials="M." role="editor" surname="Bjorklund"/>
    <author fullname="J. Schoenwaelder" initials="J." role="editor" surname="Schoenwaelder"/>
    <author fullname="A. Bierman" initials="A." role="editor" surname="Bierman"/>
    <date month="June" year="2011"/>
    <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="RFC8040">
  <front>
    <title>RESTCONF Protocol</title>
    <author fullname="A. Bierman" initials="A." surname="Bierman"/>
    <author fullname="M. Bjorklund" initials="M." surname="Bjorklund"/>
    <author fullname="K. Watsen" initials="K." surname="Watsen"/>
    <date month="January" year="2017"/>
    <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>



    </references>

</references>



  </back>

<!-- ##markdown-source:
H4sIAMOho2kAA71963fbRpbn9/orsMnZE6lDMn6lM1FnspZlOVG37WgljXtn
tnfmgCQoIiYBNgBKZmzt3773WS8UKDndZ/UhMUmgHrdu3bqP3701Ho9NV3ar
4ii7KPJV+VtZXWdvi+62bt5nl6tyVrRZWWVn59+8OX99qb+0Jp9Om+LmKP6B
XoEmzLyeVfkaWp03+aIbl0W3GHdF3o6rdlxuxuvNqh0/+s7M8q64rpvdEXSy
qE25aY6yrtm23ZNHj75/9MRgm9dNvd0cZVenx5fZX+EzjvAn/M68L3bwwBxG
UXVFUxXd+CX2ZtrtdF22bVlX3W4DYzg7vXplTNvl1fy/8lVdwVe7ojWb8ij7
3109G2Vt3XRNsWjhX7s1/uP/GJNvu2XdHBmTjU0Gf2XVwiAm2WWez+kLnt9V
3hTv3Zd1c51X5W95B50fZSdlO6uzy13bFesWRjmb0EPFOi9XMNEW3prAsJ9f
4xeTWb0Oe3s3yV4URZOvvf7ele2y2mbn+U1e+b+GHf95W5WbonHr5XV7M6W3
nv/Kz+AAwm7/PMle1rCGrtM/l4X7Kuzp521+W5TZVTFbVvWqvi6LoLNfy2Iy
hzefL+k5f47a18/5CoZRGddbXaz8b8MOT5ty1rY1/aKdwAuTJb/wvJDfe11d
TrLzgufA/Vwu83qxtV+G3fzH1Wl2UjebuqEvvN428PykpXef/9YV2M9kVhlT
1c0anr0pgGeQm92n8Xic5dO2a/IZkNrts0o2Tcv7bJ3vsqb4+7ZsiqxbFtll
0dzAD9l5U9+Uc1jNrs6W+Q3/mE/LVdnt4DuzyRvYwjDILM82y11bzvKVbbus
4K31dtWVm1WR4QJ5v7ZZvchu8maHo2nL34p2BNuk2c66bQP/zmDDZIttNcPG
W9gl0HPeZUU+W/KYsxkw4bTI5sW8xK08xyG2m2JWLsqZaXn80EmTzWBP1+ui
aSfZGx1MNH1pqyHyQFMwH5xoC2tl9NHbZQkvFlW7bWjINIhilbcdiB2gBogq
kARrmpe+AzOpt82sMPlqVc9oNSfZ1bJsMxBS23VRdTD+dtaUUxhEnrVAn3wK
vbT1aktUhTnJoLRN07KY80WjJel0l7XbDTBOh09Y0jtqYIsbHCF0Bo+sCtNb
NWhjqsyArQCPbVZljkOtgQthMXBpqhoGjsPbMIcYYLrbvJnjGyDP8o4md9DO
lsV8u4JvRyCOoetNDcPfjSxlsm2bXxeH2TRvie6G6QotVh2sJK4aM/G6nM9h
uOZLlLhNPd8SZxjz1ltJ7BwpfYvETLHwDEcGrVfzArYS9kGTEdY0jjV9Oi1B
zM5T3L1ocsuxIJy3wJr+Ijm+qheLomEOtcyInLnFOZd0gMCwie6pzWfgvaJa
5tWM99+8WMHmbnY4PvhcNrrA3BFQAVj9uE8AHE2+amsD/QY7gBYNdo9Ohogi
Mom7LFYFLigxd9m1Jp781dJj2jkcPduW5wZv+9zO5L0tuyX0scs2ebc0sxoX
dAW7R+T4DvgGiZm32cXlu/Px1ekIqXV5cchCQKhK1AOS9Zfa9LdNtmfbTDJj
Pn78HxevTr7/9tnTuzvl6VaovSgrlnHED8ESZwteRppSyVIDj3yioNKB27ku
Kjj7VhkQbl3QkOBdg/usaGm7EtHhHMnpE7USakMjWe0ZcCSIc1hplD0iK+En
4F94qgWZCroEnvu0d0HnwIXDZ4jVFjk8NMnOOuKFLBqlilyYqwEy90cBJxMt
1woYSvrVk0M4pEIOAQHRdMtpvYVH4DEDu10/+qMwJpSGpextGU1VO7pT7+NX
sLuz4+vrprjGnQxCGRgFpwnEgOMfnoT5Ires60aWIpD1IJzyBZwQyOxFvvYI
4QQxklLnfKFy6tyedAdvL84P7dzhQ3ZOQq3PnHBAgrwE3a8rcbDK6MQbeQcn
5iqHwU4LOFnLuiHStbDTZh1Kn1oPTN17JgfdYlbSWUc7SLunfkXutwGljKPU
GFYJhEP28SP9/NJyNfA7MvFiC+sFv8+LDlQNlLpXysuD6w8rB3IcOKwt8dTC
Zkg/kE6FjewxFKxGtA6sLKRXWZQB2C14/sDwKhJY0NM632zw38KAIA6g9aKg
fbhmqbQGqQJyrIUuVGDg+s7cLDpcezy6y6oIWn0AM8GQTZIx4czIgOVbECOs
Ssxga7PA9vidh7iAT63+ZtxeaFUP8eZgZwpLztKJJN+quAHFFYczn8OSMA+H
23KREoWbfPa+6JwkNOYMVbmX5WKBZ0p28PLyUM79jEXkk2fffXt3N5I3W09R
UI0pc6qASaoCvAGcNnBI1JqBKtXikU8CAxahee8xukFGg50BB192gk+C0Med
AotzcAJjPAF9ZFOX2JFw4ZUwGD99cHVymEHjK2Ykkv86BZ7Yt8/++OTu7lAJ
+/JS5w0jJpKSyjPJ+KDXd2Hkps1LOtunBRh4dJLmYB7xpvZY4uDFsRxgyxy3
KUitNe34DhdHpQCoIZF8RwaMn7YqgL/GMLbjDjcW7MeOhzsyOJeTS2QmEEVI
QdZDQo5XvTlLanE0NQObYlXSFlvUYiUI90Db8l4xxzGAarkuVzmMegMnKWrs
8EQ+rzedUwkcmw+f1ZFaAW1t6pRWAW0VuDwdME01R1Jb/qWhg/KEWrW86Lpx
2iuqeWo6pEgAp8TCNQpda4vesS+tjliFS4lgFXl4RKi4neVNs/N3HKwVqXtk
B8xL0hzp/BBpmhoe0d+ypIwpLUthh5u/LkFC9syx+HSBQeLhglszsItCvbhv
P4Sq4QiUAWK+NZ5OOa836CYod4UcLOSM5cHYeGozZ2XS9kFuYnuqoN0Mg7mG
3VAlqQ4MedaTcyOPfVuZjnafoppB+3jqmSV0jviHg9tBKGNaWtcyZBDuDjTz
yiBhVayQUoQ6G27Y7OAWuKJIKztKsAIVqFaP/0OzqTfbFTzQijJmBSWN5aA9
dJK+ZQqi1MJTjmXBgG4FL9WNGE5kVbHmhkINx68WoBGi7Ehso5TYhTLlvOAX
fgbOsWIRlajx+c8vDnt8h7yQ5FySBvIaa+UyY+9kcUILBjPCKbRgbZkZWJfB
osvx09RTcWZMYk10Vt8gke0OhGXG+QKvwBDaSL9fAseRawIfov1NfoKCZBZM
HxS9GclofD9JbLSEQMODVr31c7MZek1YAkb/5ZfZFUl0sqBYe4PX56ymFR+c
6Ac+XuQgoEuQ0FaP7Ny7unIkMAPDSJTCRY3cQOT23ipbtWdZMRFCHoFtdZTd
tED34l+/ePTFnenrlEfmSLTTrk7YXF/1Na+vsJt4bPuV1YO3lyeH+3qyKo5t
cNgI+Lx2UkuHLeCpvkItRiYa79HM26MijXGLwQ8s76yPKnUo/GloX1trKaXg
mr3WEhiv9Tp4B/ToirgVXWDwgQV/aw5YGRLPwn41uj380316dzQsHc4e4YU+
TTYWrNIfWDMmZhA4KJC5A3HcZm+O/53NQ20NOvTGabWGhHEgThmUv4PjxON4
j6kphiVZnMwwrDE7SotblNQFUvHE2hSO8iwHlIVsI2ZoJqcGrBL7XkPV7LdU
eTkLdEQ7sSccLFNCfR7swlbFBXnm1NanJ3H/wfNn1hPIZ8bZS6ZE5fkIrVpw
vQKBjp60bVX+fWu9MtK16PNsubOpbtRU12HIzJH38iq/5tHz9GER7VEnB63o
JwOGucxADRUcts/XoikcoKWDPjs6pnMRAl+1dnFW+Q6muCRZbqxoEAcDMqN/
rllREXUe09H7QQjqedJjyoIxgpNUOuqr0sVJviFl9S1sGG6JNJnQK0ETX1iX
BR+m6nLpq/S6+NVsT+NW7Ve+Rpfi53WSlB3ncBbLbstpNZm5wPTagu57UzSh
56VM6M771cnhjnENtWteT+wBpDAqIyix/zm949uvylVHXukr3sE77lcMzNS2
TnQ0LLukF5BH6A25RZa9OuUtfHUqHGelE2nx8DPRmwWL1fa7/H2h7qHZDKQz
2+f5TV5ysKRvL+whCO8MUJaOZ01d7dasyR1TSJnFZmvMj9mL46OECY+/nFwe
RQ4I/FbU0iMWcbBGgbKbR1woPjh44e4O3758Dd2pE/s1uXKOoUtx+9EDv8QP
/DL9lbVEeeA0fuCUVD43JbUwj+hfalXCgOQ1egj9IkcSJmvqrgb9JHudw1me
XQIlZ0v06cBjry/Pj4LvoRncNfgbuuyPHEPAP6B9lu3n0iQ+dgUDVhfNKSoK
BUUuaDIXOJdrEr0X9baTr99dvDrK3p2/1e9o5V45XxM8cnxylB13HWji9PJJ
2cy2ZUfLBt2dSOwlO51f01qew5c2OmK/PDmF8eNsQDlYb7ZMwuyUN0F2AL+j
u2m9hjNmFs6LfgSDzHzZ3xiCTsjeFOsp7OVluTHmuLrHf+trbeRX9v3Jc5YG
aBy3cmxGkY3soJhcT0ZoveGpE1vYxu0YOf5gg4FJOvI9uBR6meF5JW8dsjsW
x4NqWIeBGthLbescvTZQOAfroGxZzFCkRvwtqmzR7EX8YAwaj2NVT+fs59Iz
Cfr8BufA0bj+npepgsVio7DQGU4Hqb6pb4tmBAOuGzjUeQZT+M9tOe+Wh2LX
9FwZrnWx/xdbVC6CkHNS2AbuB2BRsL/yNVBmZBXqQD3es+Qq+o3rtD86FHKw
J6BRikxvSTRIvBEUGtzpwKWku1uny8LU5IBK9YyexJe2v0GyxDFXFOJtifN0
uADRk7v95M3XQIy2Sw9Gp2fYyyb+y5KCZtuydb5YoZX6ovdQzMBDGC6tVuzF
2etuYWMjWI2wfbuP0HeMOkhXrvGUvQLDZwP/9l2bILlWAvQYETM/jECyN+AU
KRs89Cbo1KIgKbo2Rs73PrxYqEkxUKE18xJ34Zzp7nAC5NnwpZH7KcXbrTho
BwLkbvQiuyxTeF4CZ10cLNw+IWGBniSkDjQ/J/2BbB90ylBAcZlv4N+HKhgS
jasyL9bLTqQPcayN+TfFBgYKW8SaH8FSrMrqve+0h82lGtIyoXoYp5aguYAq
5pepIBoDcbjLj1++vfQ+32EwumrH+PQC6H13F4Ym0Xu68QJBnv9cA7aBWadY
GLEu9LjTZ8CQsMGbez3tE/NXQsG8Kq/Ru/UM6ZCOnCPUQGFHeQOKQ1cwtEAO
qh5JRtxTK6ofuhqrOVn4BGrIctN4NCP6kyXkNe1HMexR2I9wnaKjThaQaYkB
DPHHF7B4iLtiZzeRjJYcrEk4/GV00Mj/hT8Cm6X+xuP4/0OPfjo5/RT//x9v
9vgkO4r/P/DoOPkX/ph+9SD7dH76aQJ//v+zQ/mRVjg7pHeD1aZfse0jfzJH
9P9D+lGf5Jd5w6huyy/D8xPvj1vil+V5efmC4RX+qFPb0Y4605ZUV5S53/wO
stG/35XFbdzGZM/f3+y/vol+GRhJ+u9v8v9v9AsLjfFa+TH8y/xj0G/GNtKf
z3/2enbn5xtxk+FzN4PvpCmZ+BtqwfGhx4rRv4kzhSVcj64Fx46Z216ZcqX/
NbfxyX6r/0pwZcCc/p9r4+3lid+a8t8es7rXRDiMz6VnqoXU33/GTwvH9AeI
K/5pgNAZit2e3+GTt7L3c/fg03snGz4y0MQBc8zYsk6m/8L/koiwK3SYbuOA
WebT+SdhmCPkK/nXmCQLNMEk2NfIBN8YH1n2VcofiZQ8sNQbbgRH4fNh2Nzh
A2aDDxDpemsmrz2Eqg9ZGOGvhFzKXJdCtZ7I+eYz5Ovfwo++jP0c+fo3/wOI
x3+rQLSuQEePJvzQRqCJg3NROeOtfc/OtK2QlNbgBr9nj9xP4bAeLh5ceASb
8ETtOBKx9HQkcFMzYVnLn4SrlUxHY+JS/jTWf8ZCeyxsq2J1HMpcn+fdtrEM
nrkFPpBuUn+0V+xxniVaUSbt77Pwz/52FDcCJ/J1A3YlqqF2ow38xb+5gXha
1e9Z4MG/AxurKQv2kaJHrD38gzHZH7IjP5RDLqnVihVzfJK8uC7kLYjIGfy7
YRwJdw1KOlrxYNhsQd2esEr98Sj70jN+MkoQ+tcvEtEq3xwgNX7yxR15dpUk
keBo2cmj28w+pq4dFXECRKy26KdzB5aR5kryjogsyiU9Adsoq9lqOy8897UX
H+RoIsX30aJsyZUtAdtaYb0Y6kAwglIcbV7Fxevkx+YW8UobWRnxo3EwjVvT
UUZI1GxZgx5MsdQox4qWzOKg4PHFdpXdwowUz6l0Z3Ayflmb9xUuDplg6Fxc
RBEx+LSTMJXMEY3wHnp6XYBp5vxnr3/hCaEdCCtqUzw4eLRYIVxtTukXBpsj
XSOX4LP4KbcrRKhlMFLMgoGZz3dVvsYFX+1MjkG1WzCnESeG2L2yRT+NuuOJ
nZVrArN7iZNVdmJOsV6NIVRu4KmVALTbNRyESJgiauio5fLxS/mdfpZf5cc7
ZmnNKcgETN6mLWzbNBN8J2a/OTkdH5+Mz08zwk+yK9n60EfqSXFR/nUOe/aD
Q53jsn1z+fq0TcQ5fBgEDLUtIi7HXIMV8FqrHDh3HJ8PhUSyg8vXx4fGw/pG
osESREHa1u2sKB8PPaRuvgX5MIml1ckIjCSOMJBZt0tFXHCGSmthceQtxXwS
8uVFkF1yVhXVrJ57nr5+jCI7OD45HPVQCtHKoZwhNIIIG5fspdGy2xK2I6O1
sC3dsl+1mUM8t+IYXpAXh9yq56dtiAq9pQC50lFpRChSdMwAPVg6wDf98aax
OBFn8+qvyvcFAsZA5DYNYp6g2xvYmPW2NehGtaGJVbkoIrfbSIDCQhNYrTVQ
GYFLCKuA7ZVw67LDjX6wlqoYqrCbji0jyamAcgN4YbvhXCx1ixL0do2u3j6k
xOZjlK3II3EwUnoXZVQtsdXq2k1O0j7qyoQzZPCiReFhvGcGC0KNDzGLUXCM
TEFjOXq0UU5rdAApYDdCHk+QIkPwmjwGoQS4ov7Osqge42BA4UkkgH2Hrkk8
088TMNGoYDd0fHAjRHTlTi2BztBDNs2l+FDMtk5Cmx4eKDl9IS0srN1G85Fk
l5Hs4iNmxLNlnvRPIpb+FGM8d9DAGwFK9q2tj1/is/ZR4NSewNmSCbLzcztd
QpVCH0GDo13HOor1lFt0lQ/5nOLpIzhzxjSDnLc6gcNF2uRChbxOd6YbIJzQ
NFIQ7WIcaBN1iLo30CmFD50MO8R1dKe8EKFPOcFIGDtjbxcPjtKYt3UnIJPO
aiOs5HHMJ/NjUSCMYeUlKmTDLLwJjLcu/dHVflZiTspJ7yHmFac52LCxz8//
FFgY6qu8mObhULAkEswMQkYUGpUZ1l18OyIhU3QG+FpvFt7YzO/Ip4qmrtI0
hhoyRSz6WEeLR/p6kxP8V6iv1sBBWxSpPCvO/jAMLAsx0r1IvA5iGFoWMAUc
E84IQ6ntAV/t9tqwxdmmg42B8qr2BSsFqCy5sQLnzPEcYw0gkPFBVHu/EGij
jmz0v2q3sqPvWbuATGguIf+wJWRkzKi3w3FH6joN2zuURJCls7dCqhtH9TCY
jzaPNM+Cxsv2C/V9shbgxG2KFR8gzXs0SS2cT3WEGKnvcoqGB6uwe7drvcwQ
fnMtEIdbkmGSNtn19p+Y8i6EqrNTRRrfJyb2z3fC2lK2Fid68BqJZS5D8gAf
vttAt7OJ1tOLyCWRU9TEmd8CAa31UA1++fzDMk9uH+RQIRA14oGuGeXmyL9n
tbSSgSOeISLDGtJK8yENw4Nz1y5DpCnQceTTBUzYUEG4E3r31tvpAIF9CqMY
WjjWpEV3F1WZmamYXxdqNKqTx6pD8UGblKqoK6i+1/mWrFIHGkliQkbQb4tZ
pzv2MASGEHZLqWrWZBtGZwOFWrWbyZKDiRl/Yr55UcrZpMhbZBsvj8gurZuu
0Q1Edhk5TXgtNr5rrRFAm7ZPpwiqubiryXDmlCm1IG3i1AB5ZJWHN5EA767q
y1fHyDi8efaFnd4QllYsJ/pwZxURT8J5/iZQlGhXlGmoROZDhNTsGUR3RUCV
NE5IBgCWdVnA5qHME1jao4xQo0Xzr19M8+YLIOUOXYrML9l/nx1+cYc+TSCM
p0QgNGgkX4c4EvoFFXv+cVp3ywEtCeynj5gm8vc7NkdfuubvoTQQGh+mZwU4
eHcvRk2m7wNhnN9QEoVb4yNrcgtV9WSZS9Gi9CxisuBI8kFQJmp+ItmFHiUV
iU36HW9Mlz3seVpsCmkvIbCPkRyUrpQ6SZlX4vYBEyFdmkTY04rYSBEVCXKg
ST4mlTePh/PtIRvpbO8TGCuCyZs1SDV2JrB1Az1SspiD7Ad5BemJ4aFbqj6A
0kFOdN9O8tIsNNdhPu/B9iUN+gA2JoLn8xWmie2MaCCHdngDkoWTGM96+C1d
Z1KLTJCFnM7D2LZOSbJjQ6mnyleQ0TqYaF8l8pn3pdQwx5tEJqLF08viyzEu
y2RZIYBvUzZ5VDvhkI2Fk0vKHvJEIidHesm+mMnInqUghcOwA6+f/evORcvH
XoIpAQCTINT+riToo781cYwjq+9xPShCRwLh7cnZxdVzbkowWdXdY23ueDnI
lUBn0sSEWyX41QudyO7kOgbe/qXH/Ew5zb5DNKitr1Sk+D3afUYTQXWkbWiR
aaKpl1HKmjhKJnUm4HBYQRKFEZW0+8W7MW8CyGWv/JS6XGhFBW9oJb+V+CB4
EMvG2cRtlJwcJkhp6pTl8YFMKZyd26KOlrzyjcPysyeI5AT+LjPwUu7q0LMk
hht6PMi17zw5Ise888zmC7TMA5zibVfGZYNbuonsKuaGEHtd4P3BrhiOzjD4
GMQZH6nOeXHA0stG7bjqC8gBtkt9rbZPH0SiY/fk7cAZRhn3QbQMrcDNpsgb
/ziy08BENe01p/mPQI2s0QSt8Y1x8QGB7vfiiK1zyghanhRkSnQGioCCuGHs
ZeuAxocpmzdEx1ocvUbEFF1MrtpFI26REXNLCJ5/eAIEq8GWJENRN6/8Wbod
E1WPUt1b011aoqnE6+Rw/eb85JRpNaOMECpUqbvC2OQmkXCI+xbPpLd35Kl+
xovNiRoFMVSfmTDdkohH9EadqRWliXKCsWW3VQMm5L7t7kTH09yQX5xlOwtP
rh2GPvOFfiIGibeqJkqESHMalHjE14VGzV3xOTK3nEOJFBnPT+I8ySgL7TyM
zAOh1Fhji3DzhZe1QR4iKhPGI8AzbDMnjjjQuBCGZ+fA3h3mkxzSEhY3BH6+
9Sxh8kTH1UF6A3ESaWRx0XyIhbnGulYhWVEW6jcV+6l6yywLJEmXsL/n7YA4
BMlSt4VACaJxx4dLgOcfNpyIXXOODpGYI1uMWu6l2nmJQ64QB6reMO9JrAyz
Zopd8PIY4XJdXLegwYmCJ3v+vmAhgl5BjN/ybgjH5L1PyemkidHMfbWI5iWy
DEzxLULT2Sm6bRDrDtv+40ed1lgSMwIMgOsntFwbm8ahWSxKRakVQRQRxPyT
fKSiKj6w2aWklRX4vG6P8DR+PMKPT+i/T2lt4B/PiHUp+1W7r3ZukK0thUXK
DlElGMjUDYTQPI+14Sec2qWrb1KUJhGLfByvvqUB+xwvOa6IBnM4dteF/wLo
VTd03u5S62uC3vD5UTbd0pt0RCot0szhv0xEzbiOyRM239iMd2VC3uQfNHUR
23lh20GxgsdtweAHONy2IANDYdjPubElVJDHSb3zT1zJJ6CMgrO9oK0zQk7d
9ww088N4jJMc/5hEdw01c+Y/EwzmbLgV6CvsqtdKlvolbuUs6un3jSV+e3gs
qb+HjuUH+hW5h5/7MdlKuvXUjJL0l//+wP08gLrJJ6IZWRb6XWOJV/Ifo+7Q
WH5g2j7tUzbdc9b7pj+j+HlthSTB1yz37p/RQCufsY/2jWXf38Ope18rQt1n
e6n7T5rRD7yOD+TdoVYeLhn2jeX/j2Rgjvoa+Qn/8/RrOu7iVtKtf+5YfuB1
HKZubxX7dHrQbhw6DC0D3S8ZHvJ3/1ge1sq+bx7eCiksX2d2/X5XK/fuoweP
ZZinfjddgl9/94yC2T2wlf08ZaCVg/wwe1t7+ptqud7fwfQQC+nT1+5B0Xtl
JKoFsyKe/iNlXCNQvrEgShli0mPTQIHpTjEs25rhF98E9gD3/IUfAkIt+DP9
hT4KUG05hM7Puux6mzdgSxfiKEsmao+SIbhkyEhDWt0ySqA2YXBLXAFhbCxI
+5eqANSQV92JY7xky3tgdYzTWFcQV/m/xx+U+dEP9VuTe48qkQS1O8jbIqU7
UIHX0EN6LH5pZ3bxBB5tyulHnT9CsfkVNhj/J6gYxsCzl0fI5nniA5rZ/GnL
TdGi9usTENzUoPtKfOfkqHImiCsAUc9mWyxpuKU42RT+zWhvC4lx9vPe+qVR
TSLnqE5Hb+8LLQdgDQ0xpxAePj7X3QHRbuA/1tvUeZeBMDxYf9FiJA1djWGk
RkkKuz0AJvdL7Y56qQyaqxDW1vFIGpa8C66LQG4Y6VYaGfZehdXHtCC3HY1f
iz6CNBQf0B8uS1M2DNnuMPLrIf+D4tBAkyX7nSofG+iVFugs8N0H+RtCE+xJ
ULiLvPtCq6CE+ML34SZnZHgG4n2nAbVYV1br1FKd4U1D7sSHVdOTfx9OnLMs
UZcwqsGYiLEFmLEkVKmHMo9JQvk85OBqO/GC6kj9opKtnywloxGPYgI0CHux
vpVSlEEtCSnZIXLKVhXuk15IrlvCVfO35fv1yJz1LgQwLvshLlPXr58+QM1U
/XQT10+nDglag7gPLn3O1G8LkKvkXpZH2x5k0oXyVeh4wf0UOlVTsOyKeUBV
BAlvXdw4gkXonnZZYs12pYEfe/+F7wDEq3t8wIiLfokj/YjzpKQ9Ww3YRj1H
5EZbwBa/xbgX94eoFTqUxtieZjJxwsL/rC/x+IHvhisaKjEIcljtDNVsd/F9
qncytrrNA0fuVDc/dEHjh9H2iw5F3tYwvjASIeG85huK2xd0eUoNDW6wgjEs
8m9RvC6sAo2TJT8dCW+6hMbBtte2hlc8qSCxKEwYC0MgGuHGGYKG9w36Db9x
UEPXQVhiikGoV1QjmvDSFKjjqxcWq+JDKVczlZUIysRdTyEwz12VxFW8XEFw
kUkCOgvhgVIJ1h6uN3CC1k2r0F53k44PnyO1WuOCIM3sDnXXCs2LzareaQbQ
wP0wVkfbVlUh32MQm/OaqKC6qioypyA+ctaFFZEp+JrRFW2IMkBlkNQzREas
iLIYBRLOJ2ED0g/JrCjfEJgend6uHqURWZrEM1tIgcsU1C4jPsLkKqmBDmQV
GGShNbH4gIj3KzB+JJFEKW0xHAbjcIf+SDZmEBPN9D6et6dXJ7+8fYVRj4vT
S/o3xUuLD/g+Ib/hXOa2Mc4ORMLBxUHWTNLsWIHSIZEmPCs3UnzcXgJ09tM5
FtGFbl78dC7gmuIDHE+tAiU5TcAhxtzALUeE5We9kxVXVGprucN74PjYq8da
vImcJvqZ9FY2UILYra0SZeunKwIoWRzORCek3MNQcoK1q7vuiW5nZaQxcMza
CHOBjftLvzStBwqRkdnKs/1qsMSBNZ3PtERNIalGxGHGMqpeCkGnjBx4SN1f
4LlVnSNwwBush2FB9gvK6Zofs4y3gr8L8BaRawyxusCy157ejwLjpfJQ3l0l
0NqKSlraOGRSM6HwbZDXjW/2g8dySwHYf3uAdC2+y+glLSfI9W1rNiZskTsn
GTysk84GG5F0hmhSMiNVUTwMlAOcTcyP2ACPWG/sEPPARbZp+w7UCxQrGRqx
pPNHGWP7Ex4G9S1gG6w20G1YEkqXzRPT+Gc+1P1x4/uYZsnMhU/bI0ozK21e
fzIWjg2o/e8ezee/gsJb0elNI6JFwopwjObGEWjXejuizfLcO2Fn3Xn8byu2
3cP8WAzVuynPgvDDVdZKaD6MjmTCj5mV1HjgFpK05o7TA3cUUAvYn46NGKsF
A+pHTedJjKR2c6LyvV08D6K3DY5i+x6ybxobXwPZRGcVteJjDvhyw4hAlKCF
0+3LLpLLMhYUzTZYjEg6OPFP2c2EadKkJ0LDE5Y/lZj3EjvOwZbGNYenUqtD
ZlDtBojHPBbe8mQoPeJ7ZCwHQ4N7St67onSXF9nx/Nfx5dnLo8DJ6V2Z1FtJ
BHrD9J4cZY8fPXrMztPvHz2Gz+ePx+dP9IsnT+GLJ2N40DhX7zfk+/3bgz7K
J/fyJ+j1MfyXvqePjzP9OMaPT+Cj+3T6JPMK5P2Nvv/mQR/lE/lS5Tg7yszX
3PTX8lD0sf+FfjafYF9lrrrNJ6JWUE8LqeW++ESEhcH/Az2e57tx0KPfge3B
fZYRwpuvYRPaXx7eJf8j+3qghywiQqZDjMMA9/aoI4xfjDvIIiK4od7X43AP
YYODLQ41YJ+3sQIQ9l29HsOhOHuvcYJg+4EAwg3IZzMm+dELlLJOX9GbHDN4
mSrKnzoMjtP1+wWXx3YpqW1OEMcuA2jl7KVIQO8M8a5JSt/O5wPC6wW00oXZ
ccM6l8yXHUvi0/ox1HDI4+S3T36NSLbCIXBhE61QZ5VBeNkGBEATt/9D9UFR
nmI4u/d6BXbIeFlvxO/gpTRgHXNd70Dd4ozxhSK89928RrOQeiTWahAnUx2q
cFhRvecBCmGKfe1ALmXQAwbaEMU/GPAom8ceci98wYkck+x4tfJ02kTu6rDn
FHlUzHZ5jivqezNBnFeZtnrpWmq/hLF97SsciZy4e0eA5UJewTE/pQ1rzSO6
27Xy7iWU+dF+o4SKgUsz9CqkxB6T+9CggWlRwaYES404TDzzWJpCB8K4aamq
3W3F78L3g+WVkEh4SuBv08SVQbXm3Yz1Lg1UXlVtsjWkSXfhTAkvpSQQWyAc
ottNf3QFEWBcHEOoPVsUxE4OK8O3bcl8sBIHbqaOVOZFj+ySudr/QTt311Oh
cobblOp8bKSu0o/mXks9dTmBMS6USxdcx35Hd4V3RkGkgvxQtDohwhkvV0M/
NHqE+E5OTkh0gUP/NjCGIXuWto0LUKVlkISrFdXJ0hzZLm+uYcWpWBbe6J7A
EXv12MkECrxRSXCk+O2tb9RGa4sP4gJ00/c8Lp5zdcx1mzZYo4lAjUYA8y78
GBrOPfpS7ZiJjegHly3rU1+16fGnkbfG9z56tdPDkvwDEQh8V/aUWElU6Exr
ASQhzH8Sa5TpH0CRTYguQBrqaZGakYvRE2J0MCiLPHBSYy0hpfFgDi3ndGF5
BLYr2u103GNJY1kS82FdkZeAxScs/WiuHFQe+QuPdUTqIWHPjVu1RNZEbEC6
g4WMZJnQxBz3eczfibMlDNuWCenz757L9vzrmmX0VDnqku4GUPrFl7GSQtL5
mRXk+SwkaatcFxZYbVy2irwUpgt5ya8Yv8y1SFPgLXHeTcU6XJ36cIf+RSUO
7MA3j2kuSo4rpdP3VtwWXGNERMMLTiP0LlPq8dP9DtHePTga2//5hR9fi59y
CZkln5/o620qquBXT+2m8xSmqb1ox0XggoSxhFd1zx2T13W+cqm0lAVYktDr
3RbLVyhsedv0d5xfICXy6d5zQ9Ox5yBwMZTerQypm5aJK2xQx2dyW10pSC+M
0tL4TvZ7rsToX4fKiW69S00NZ9BNRcFjZ1Mv4ZecP7aQisuTTSjH3o3SNDWL
fmIH0evjA0y/pRysPdTyC6SE1EhbOAO5x8JYdn0GLvP1s7tdjMI+NHzncqzs
93jJ+JotxwZ7N0DTAzCQOAvWhta9q6xd8Qbf4HFjpoRYil6GWbO+QYWpQ/ZC
Vm+5JF7h92ZT/kdi5/G5IepofEUrJT55ifP3CyCvflqqwifGZd4XO5eb6qRd
UJKqBxKTxFI/no9kwtuBaPPtTS+1jbiUPf3GcL1A3usBrCkEL/khU7z7xF28
pEUjjB8snbibpryMUnbOgnWktyoFibGUWmYEYGMVGW/sx5573I6fI5R84ZJo
w4qLcg4IDPP5YVEbo4RO0SwIzGI7YhspTZiWxPmRThdFTe2YeO4rikpdF5Zr
zPGCI4KFlDHl4bpr77979OTuTqq90Ypz1JP+OSsauhqU8/FsfSTNyw6u7KoS
ZccGcvYjBEpc/JOyCB20AYQUaDE6cDt9yfTVgkKk+eXZK8IKAMccr65RY1qu
fTjMwavjl4emR4az8ctJWXSL8aptxog2GOfw9t0dRYAJRzW2Ow5sRfe+XNT7
7PvH32qZpj279oXewPrxS5i9fkqg/2Dg1+gnwiVjtqHCPZVe1Bzj41wV2Csf
ycj1/ajmnj0LqFJXu6nZ67EnsdiEBoOtjcJJ8WxvY5iowLKsrZyR+oO9T5uG
nITKUbqZlpoLrg99wCVr0Z5A2/s6r0Q7/opqacJRUVAgGEsGX56L8a1j0JYM
VbtFerDbhcJ8WGeFjVIEUMyLv29Zqe3V7mnQsISGWkYYi9Bi+ylRkfH1cct3
/riYp83Mr+bjrh7D/+4X/nifH10b2vJNlB5v4OEoHGOv+93DL7Z7hhbNCr6b
22MhGy11ZZpuPMino4VfIix3gOeHYJ3bgL1RXscronoG9p/kUK8+XFC1b+eq
aQFH0e3jfrUlcQqi6AAjhJ21eozrtXsROoiPRmoKPfjSn3ep7bfjbrsho0Zi
lOyDQM2FOMEiRfjeW7Zk5jD8OUXgOexKu6nTjH7ZxN693YpkdBVyeGQz3NdS
Mxl/F/+zYoYsMkW5oySIpeGSuTmKWwuKC2C0yNWMs1sIhp3VcJg3crVUFwte
IZaidxZ1hBF2SjzjKARXYzyALpMhiZXMYqzkPaWZwPxd1TtUxezRFdAtwXAG
xtRFSJ9At68fWMzQ+Ko2xv3Jj0A1CgTxQDedeWr1/dv/TGWriADRgAKRq5u5
jW47d+UD+iAdB4ZpP8umw13mba5e7CWpnnvarpal8NpgtYx3p/Gctv7VwbQR
/epS8Y3u0cK4WQwYyMGRcvuQWl9KcrEF/UBMwC0698RMfJ9y72hGA90kvAEP
4RH/eumWFQ76cpqvCtA4ztPcu89jKD4dqwjwpEknxC0UKABxrQRF4zH/S3EK
H9qkdd1NyK9cIQF4YqvIIa+YGieb24IULHIcZ9NF7Gu3HGmgGANtXI9NwQgu
bVPrmBovzvBggaPbSc3npH/AOFi6U5ninbmGk9JpE05bCAQrTG1ketwXFvEI
+E+xRJ56p/OWaKPvsBuPPQRloAaSiaufXMG8/o5KDQ52DQUobdCYtRcNHCv2
y3gRZJ+y3t2lxBHxwkWaqV65ShhyqW4WFOGAw+wXqV1PPy4JiZ8cPI8IpyBl
Y+uNP+JscMRTFJpUYnmeHSArEN4XC7monm7CUdtJ1cjCCvv90GktllDXwne9
TAkwUtrVmPgL11FTNRymBmVEBKoJw/CMjsC/58+f+1fkMGTg8R8fPT4ieIv7
4zu0038FljSd6W058DaCcZ4MPOz/0W1Did4Ru/P0Ae/TH4Y+eiN4Bi08s5++
hU/fmgAP8Tz4G7yJ64FposGk/HceiDgK3gmQRZkiizKLLHrKMJPgnQfiiz5v
Pgw1cVT6vJcf/vQAVR7eABDlWYjF+vazBpAmlwk55h44VBKNE+GQPhFrJqBW
/4R+gMv9fpIAq39CPxGWLOg2jaq6p58kWqmHIAvBVQNjS2LHEmPxYGJpFFiq
2X3PxMiqLyP5rNiqU8wFmPcyXdyFGvEJgTECviwMCzeup4xuvq/6seZd+BoZ
KzFUJA2bCe6QVmVHDtlbME7NvGxnW81RkwxBrqZ852dbRp6ISOueSxK5CZOv
XX9yeKqGxSCupgudYiNGGAw0kmrDnfa2NQ+wMHFXe9g6niN2dtprykkP0ape
ZE9vq84Sq1dnLCh1GcObInvBGmWiJAf1ZymISmfZsAnhEFX9uWVaoVEt0r5K
m6g7KuUQPbWSMR2uiKumUDsjAVMovKM36slwgV2KsdTC5Th0edqiZESnZ7U9
7s34OCAK49qreq9sZfGBSnEfv+yVDmev5bbFMlhhKhY5ZMJq5Rz910LdaCHO
WN8EzdFY55l95YZ4DV8pWvQvcCJEVA90ANEVbBnfcXqwyndFM36SkW6K/3x6
6EPbXcyibGAhV1yins26ocGkbeV+rVssc/CubKhm2IUkReFqvnJW18G7i1eH
EjSYRX5GviOr1eKqeqkz+zoPzk8PNVWCKKdxc5ey25uaDxcz+/0XVOs2Ox1u
U+wE41eTEPcgA2jevT5+y4483qP2pidvcegZB4gbcEPYUpvHEpuqbeXSkOm8
hnxYaesIQJSyCMgY5+Kn8VjvEC6CgCHRPuqTmYQz47TUvx2mxCiY046iF4CQ
geg0kY8adYy5oL5imyhsyxgFKZSJ0EQnOmwaMAfDMH3PwhobD861zrvZUsBX
6owIIaElxiK4ErPmaRhxy1oEoHPcuGrl925YJjVP0HgANq9YfVOSS5XCZpI/
7Zn/EdxDSOzt3aFd+nN9i1MlZKZ15HvES9TrrY3nGlR8DUG55uxYBrrNlsWM
q3MuYWdTjdYg8pXk64uCq35g6q9cWOpqQrpalNjVdVEVjbsCtfHftEVwyLfe
v/yCso8suMs/8eBcWW15DXr1DMJCAsbU2bGrR8HoMr6z0t/QqXve6FXYOdcg
zKqhyxCpRT8w5N/cM9SDyexdcmc0H86TpueougW+mLibUBB+8Lrgbo5P7r2M
UWdL5f31QkY02+vt9TILbmb0XHd+EIdCGip7PpBIz3oXFLl1GiLlCz+fdeTi
Nqnr87ROryf27ZwH0qv8/eGrv7Q7K6V44iYGKbyd/bolaKb0krwusmblMYZK
xHfzYnqUzk6u5bUXhJe2IDqL2/5tay5tuzWcZlipKz4Byd17QdR0R5UEqOo4
HwWiGUYICoYSO+0uuPAWmoDthf7MHEaOV86N8MYqITZId2iq4jobJqOjpjen
0XD1jEVTSMUDvgGxcIcLAVViYtMqSGZ5pXnYkh7PG0lWI335pTKYuzA142i0
rqW9h5GGYdmhN4wsC2/hVBGAjEoAEQS37k/iHHF8jqInPYiFn+yZMRhXq+d6
iJbk1m81akJKMyEvL+2VBbjS0b1TIO2PRcdlBBO0HL3VDVxwRGlql8irY5f8
cnUawDC6Im/HzWL29Ml3T6Zli0CMrmeCwZGUb7r2ASjPwI5L/aIGjW0Kc+TX
BaH24FCo5y5gb+8NS94IzGAaCYdSxVy5WQLRDFqum9dQRxqWBiF+xOLtXBRf
dnGyVLFfOh16vNxqGfWg+IcVi2qqGbmuXK7ACKv19LDrUrh7FN1pzjeB8r07
B3nLRhK0SBda0/QuLt9R7fcJrq1X04Bg98Ac89yrHXz207kG3M3Hj/8NCPn0
j08f3d0R6/EX3z599O3d3SGbiC9+Oh+/vpRfvvvuWwEwWRKznERimP79BRq9
8dc/VbRciyRZG1cKZrQcY/FWl7DSFOLZiF+Gv5cZpfD0h3oduCiExNozD+wc
VAn3/AlmMM/ATyDgE4xvaFBjzbCxdltk9r4X2lRNrVcsRHXf3I33inGRHGO0
1+3dAFrkf7JHKmjdnCu/0MmwgFB/A/t8gm0WFUlCbN91VSOAXbPs3HV3FvMJ
59Z2I4efWBi4WPuAwBPjV40Q417uCpeTFUSXu1e8W1rVw9dKTRsoJ8FdrWzO
9Zw2URjb2LMtVZpej3LF25h775pgzRvkK2k6gdeC2a+Y69X2EYYzSB7iugig
E/yqF4ZQwoXq7CA7G80p4HpSuI3aiWQwiXDIXpC8Ta7DOWUyGH1SpMKTR9/D
Vo/uY8OqGHDMvr48b32cm0wmnKvxLwJ2qXl7WSEoLBbVZ8GXZYzGInvE1pp7
9iePUQzQt3q3hSUEjR2jzA9CuyAJLy8eQL3L4pr2iTpkDi4vDuWk+pdnBPuM
SUk7hbxwoYsLyGoCsia7DWktzAYjzRswvrGKIxbo10pSuaeVTLfliiEOwNnv
Q3C/Ilp9PJ1cteCMRMmLCgKhA54+vq4LRuXUQzo74zGI4XNkzB/waVsmCY/e
RuPICbzpBJ/3LjW0zje+eeTd+dvD0A8IjTNvUj+/6I3po+zYw0aLHvbGZbwd
/HL8hu/tOWc7nbxq/gPnbw5hbhd6xuQMORO93ckgmwZd+U4lHZVgs0CeRMyk
RQctbaSAEb7IP1lhpPfeBzKiJtlR3hQ9McGfI86koSbvvbEXjvKZHqxsOCBp
M8AtxwtKCvJP54mFNQf43dh+PkR+R5aeULUevTrdr1slObTOKLi8MGEjbE7S
phIchbtAxi6BOgb2TT/llIUGot7s/pVLYtBDGzyB/HJ59rINLuFg9TfO1fM3
lR2EtamDiyGmBV5db6iADZnbvTS5hY/239sHcYO9xINzWx4yT5zVfRVbz1WE
n1opDzsIUzdc4S0fDDWVel1SB0ZwPs5VZnVBW9vM5s96FjEjbfvXNa3K9wXr
xlwhbAQijy8YBE3spl7xPbooC1uyjHOJB+k1kTu+DpcK7jI82aqz+HPZBGV9
0LWL7n/6NMlesdMb9Z+RPVFxT7Be1xtuZJ2ZdkkpH5JoWq43uV8FTm6Wp9Cm
PQXiGqUMp6Yy03olZHRRelj7LFqZfNvV65wuv7W1UAWAZmIAmlf4Tl6THqzR
k+yxq809sKc8+/fjtz/FdfdUt/IGPi2M9TAkrjdVGSkFSVvMU7HYVIcuFpND
qtnJWf/HJ88eow2the1UBXj07JHkOFxfnItf0hO5kp2pNx+7Q6hB7a644VxC
vTrROQUTmeNuPloTr3ftfEwm9JkPKUPGV4ayX+AxrHGIzHTWtlvCxdfsqYNp
ZqewHRHEdL4CjkO1YV3fSHWtttAL5EtG5G2205VUjyWe855pCgRJY0izGpOK
QFXcqD8XB8/gBEPyzTWDoMj+yjF98xNlRx/PJdQB03a8YOdDVKHbV2H3t+Ru
ky78Uhno5toZVxZWM9CamoDN2rO1k8KJ4UF5dnr5E0zwMbDRfE63hoHlhliD
D3a+7GliPm4Dru3bZQh2CIP+0PizSXYK0qVupLjcoKKtYFh39Sfa51XtYiHu
5lQXg8E+XTGIvCn8pJ5wg8Fg/jjJTlaghix2KHeDgECGR3Tjrtzc45ZWFzn2
/RJkcSMUPUdDMHN1BAKb9VII+mzyBNPsiVS4/77/9tlTItR3bmys17qAB33B
l7rD5oxdiiyYpQqrzVXLXKE3See3ec3/gnHOjVSgQzq4auz+fQK9ezvjOinY
B1c0LeYOKGDM9xM4VW/QA/PxY4A4vmN1iKlCPTvMNEJH+ogW6qK+rdgOhhmX
18tpTQVrHz+y0wCmK2aw17rdSQDihA65iqCexK08BqNHNuMUoXq+VRCgzXtQ
rsB+Hnv9+Blb1LhXgsfm2ti67GO9ppgw7ax3nB2/Pc7CYYqIsRsVC+8B39OT
crskvaqTjF7H9M/09Pm8pCFo0neEFJaoqtPRQEnfReDohdWtw3ptbovEFXgV
dMvBWo5uguKwBoXAVUlcNDlXmN429ppjNw7XOFp+qzawoTj0KflL8yAPXWAg
3CcH4BIF+48HKgJGZ59WNsFTwl7Ghi4fLTQhtbm51gIl96oZ1QtEWZPK8+BI
HoakaRg3Z8EVsMJ8aEvZBcnhldZuZuyQRRvYNTaeqhyVfqa0Ta3sA8ceyLBy
tfOK8wZ1tudgMlYUVuXrJtu8UW3FRok1Lj9wdaLXP4GaKdPjV/GjBQB5PbY0
5zu+59hqrfKWGu7w5aIb14uxEosHOMNFwTpGFWjb/s95R/XLLKYbZBel+hsq
aPWreOiEgijlCrmvOelqReWRMS7Ar9clVh3xbNKhRBpb7hoPLdDY0Y+JSY8d
6yXdTpUdmJrUj05Pw1azbg1h4GK4nozDJobR9ugSwgvUNM6KtpIyl5r4143o
/L7HPNrFwT3ocgUFSa7j2fuqvl1hbJhqctCcQcVe1ljSjEwEMnPo8M2r99lf
mt927W8dRsB+y5v39W05+22UXd7m6x3YeX8ZZW+B9qAMwdPmL03ZLqu8GoHh
lk+X2+wi/zV7BzszB0USPv4lb7ZV/h4LKTA3v6mXwFxzzMSdwTNlY0SvKTFt
0935HVfix6dY6CD9QPPdstEKOhmVcqq5RHx/boRjCSd4PG9KoNMrYHmxBvh2
dTxmGURJJ4OkX6Kw0QjT28sL5/LifGN2raN9giVHI1gFbnQY8hYGwaaDf8eC
N8UjSgbAY/CkXsH+fAH28BI//hkMTQppSNFz/O4UlnZ1lM2m+NDzX/mJCbAF
oZ8vmxKrHGUXGJHKq+tVeU87bUtP9Ro6wbyLJocVXecz/nd135DaApa611JA
b/ziF1iXl/U1naV4ooFuDt/+W0UB2L/AR2Bfr9mc3n9er+bz+noyqyfb99Tu
C1iTv/J1TCf1egabwXsJfvwv+PE5gQDhJfod/0+vvswrkGhFdlLMQPIVK6bS
CepB2eWu7Yp1iylcE6/BOb9C8dHn1/idbe1/bUGCXGevyy1+OnvxBsbTbGq5
U9Y18YGem6zKbaqV11vgiDcTZijQI4iyV9DlAoTGLPfaWcGTa7AIC3xZHl6D
yAC2e97ZF2zDF8VvsIz1+61MEsxKr7GmwV+ez/Br9wqs18mSafsfV6cD85nB
ExNgi+e/dUTiyaySmYD8/zNsFFrtd0VT/ha8B5t3N/kVf39+wz9yx7gH/h+l
byLlu80AAA==

-->

</rfc>

