<?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.6.17 (Ruby 2.6.8) -->


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

]>


<rfc ipr="trust200902" docName="draft-ietf-teas-ns-ip-mpls-01" 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="B." surname="Wen" fullname="Bin Wen">
      <organization>Comcast</organization>
      <address>
        <email>Bin_Wen@cable.comcast.com</email>
      </address>
    </author>
    <author initials="D." surname="Ceccarelli" fullname="Daniele Ceccarelli">
      <organization>Ericsson</organization>
      <address>
        <email>daniele.ceccarelli@ericsson.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>
    <author initials="R." surname="Chen" fullname="Ran Chen">
      <organization>ZTE Corporation</organization>
      <address>
        <email>chen.ran@zte.com.cn</email>
      </address>
    </author>
    <author initials="X." surname="Liu" fullname="Xufeng Liu">
      <organization>IBM Corporation</organization>
      <address>
        <email>xufeng.liu.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="L." surname="Contreras" fullname="Luis M. Contreras">
      <organization>Telefonica</organization>
      <address>
        <email>luismiguel.contrerasmurillo@telefonica.com</email>
      </address>
    </author>
    <author initials="R." surname="Rokui" fullname="Reza Rokui">
      <organization>Ciena</organization>
      <address>
        <email>rrokui@ciena.com</email>
      </address>
    </author>
    <author initials="L." surname="Jalil" fullname="Luay Jalil">
      <organization>Verizon</organization>
      <address>
        <email>luay.jalil@verizon.com</email>
      </address>
    </author>

    <date year="2022" month="October" day="24"/>

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

    <abstract>


<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 relying on compliant domains and nodes to provide
forwarding treatment (scheduling, drop policy, resource usage) on to packets
that carry identifiers that indicate the slicing service that is to be applied
to the packets.</t>



    </abstract>



  </front>

  <middle>


<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="I-D.ietf-teas-ietf-network-slices"/> 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.</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>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>For example, when using MPLS as a dataplane, it is possible to identify packets
belonging to the same Slice-Flow Aggregate by carrying an identifier in an MPLS Label Stack Entry (LSE).
Additional Diffserv classification may be indicated in the Traffic
Class (TC) bits of the global MPLS label to allow further differentiation of forwarding
treatments for traffic traversing the same NRP.</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="I-D.ietf-teas-ietf-network-slices"/>.</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="I-D.ietf-teas-ietf-network-slices"/>.</t>
  </dd>
  <dt>IETF Network Slice Controller (NSC):</dt>
  <dd>
    <t>refer to the definition in <xref target="I-D.ietf-teas-ietf-network-slices"/>.</t>
  </dd>
  <dt>Network Resource Partition:</dt>
  <dd>
    <t>refer to the definition in <xref target="I-D.ietf-teas-ietf-network-slices"/>.</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 SFA.</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 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 Filter 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>FAS: Flow Aggregate Selector</t>
</li></ul>

<ul empty="true"><li>
  <t>FASL: Flow Aggregate Selector Label as described in <xref target="SliceSelector"/></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="I-D.ietf-teas-ietf-network-slices"/> 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 Filter 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           (  -    Filter 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="I-D.ietf-teas-ietf-network-slices"/>.
These capabilities are always provided based on a Service Level Agreement (SLA)
between the network slice costumer 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 the traffic flows of one or
more IETF Network Slices. The mapping of IETF Network Slices into an 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 Filter 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 Filter 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 Filter Topology or to create a new Filter Topology.</t>

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

<t>A Controller function programs the physical network with policies for handling
the traffic flows belonging to the Slice-Flow Aggregate.  These policies instruct
underlying routers how to handle traffic for a specific Slice-Flow Aggregate: the
routers correlate markers present in the packets that belong to the Slice-Flow
Aggregate.  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. In the Diffserv model, a Class Selector (CS) codepoint is carried in the
packet and is used by transit nodes to apply the PHB that
determines the scheduling treatment and drop probability for packets.</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, a Flow Aggregate Selector
(FAS) 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 a FAS field if one is not already
present in each Slice-Flow Aggregate packet. In the data plane NRP mode, the
transit nodes within an NRP domain use the FAS 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 is 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 FAS 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 FAS, 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 - Flow-Aggregate Selector</name>

<t>A router should be able to identify a packet belonging to a Slice-Flow Aggregate
before it can apply the associated dataplane forwarding treatment or NRP-PHB.
One or more fields within the packet are used as an FAS to do this.</t>

<t>Overloaded forwarding identifier as FAS:</t>

<ul empty="true"><li>
  <t>It is possible to assign a different forwarding address (or MPLS forwarding
 label in case of MPLS network) for each Slice-Flow Aggregate on a specific node
 in the network. <xref target="RFC3031"/> states in Section 2.1 that: 'Some routers
 analyze a packet's network layer header not merely to choose the packet's
 next hop, but also to determine a packet's "precedence" or "class of
 service"'. Assigning a unique forwarding address (or MPLS forwarding label)
 to each Slice-Flow Aggregate allows Slice-Flow Aggregate packets destined to a node
 to be distinguished by the destination address (or
 MPLS forwarding label) that is carried in the packet.</t>
</li></ul>

<ul empty="true"><li>
  <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. For example, consider a network slicing provider
with a network composed of 'N' nodes, each with 'K' adjacencies to its
neighbors.  Assuming a node can be reached over 'M' different Slice-Flow Aggregates,
the node assigns and advertises reachability to 'N' unique
forwarding addresses, or MPLS forwarding labels.
Similarly, each node assigns a unique forwarding address
(or MPLS forwarding label) for each of its 'K' adjacencies to enable strict
steering over the adjacency for each slice.  The total number of control and data plane states that
need to be stored and programmed in a router's forwarding is (N+K)*M states.
Hence, as 'N', 'K', and 'M' parameters increase, this approach suffers from scalability challenges
in both the control and data planes.</t>
</li></ul>

<t>Overloaded service identifier as FAS:</t>

<ul empty="true"><li>
  <t>The VPN service label can be overloaded to act as a FAS to allow VPN packets
to be mapped to the Slice-Flow Aggregate. In this case, a single VPN service label
acting as a FAS may be allocated by all Egress PEs of a VPN.
Alternatively, multiple VPN service labels may act as FAS's that map a single VPN to the same Slice-Flow Aggregate to
allow for multiple Egress PEs to allocate different VPN service labels for a VPN.
In other cases, a range of VPN service labels acting as multiple FAS's may map multiple VPN traffic to
a single Slice-Flow Aggregate. An example of such deployment is shown in <xref target="bottom-stack"/>.</t>
</li></ul>

<figure title="FAS or VPN label at bottom of label stack." anchor="bottom-stack"><artwork><![CDATA[
  SR Adj-SID:          FAS (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 FAS:</t>

<ul empty="true"><li>
  <t>An NRP Policy may include an identifier FAS field that is carried
in a field in the packet in order to associate it to the NRP supporting a Slice-Flow Aggregate,
independent of the forwarding address or MPLS forwarding label that is bound to
the destination. Routers within the NRP domain can use the forwarding
address (or MPLS forwarding label) to determine the forwarding next-hop(s),
and use the FAS field 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 FAS, in this case, can be carried in one of multiple fields in the packet, depending on
the dataplane used. For example, in MPLS networks, the FAS can be
encoded within an MPLS label that is carried in the packet's MPLS label stack.
All packets that belong to the same Slice-Flow Aggregate may carry the same FAS in the
MPLS label stack. It is also possible to have multiple FAS's map
to the same Slice-Flow Aggregate.</t>
</li></ul>

<ul empty="true"><li>
  <t>In some cases, the position of the FAS may not be at a fixed position
in the MPLS label header. In this case, the FAS label can show up in any
position in the MPLS label stack. To enable a transit router to identify
the position of the FAS label, a Forwarding Actions Indicator (FAI) special purpose label
can be used to indicate the presence of a FAS in the MPLS label stack as shown in <xref target="sli-sl"/>.</t>
</li></ul>

<figure title="FAI and FAS label in the label stack." anchor="sli-sl"><artwork><![CDATA[
     SR Adj-SID:          FAS: 1001
        9012: P1-P2
        9023: P2-PE2

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

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

<ul empty="true"><li>
  <t>When the slice is realized over an IP dataplane, the FAS can be encoded in
the IP header (e.g. as an  IPv6 option header).</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>In Diffserv terminology, the forwarding behavior that is assigned to a specific
class is called a Per Hop Behavior (PHB). The PHB defines the forwarding
precedence that a marked packet with a specific CS receives in relation to
other traffic on the Diffserv-aware network.</t>

<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 FAS to allow routers to apply a specific forwarding
treatment that guarantee the SLA(s).</t>

<t>With Differentiated Services (Diffserv) it is possible to carry  multiple
services over a single converged network. Packets requiring the same forwarding
treatment are marked with a CS at domain ingress nodes. Up to
eight classes or Behavior Aggregates (BAs) may be supported for a given
Forwarding Equivalence Class (FEC) <xref target="RFC2475"/>.  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 supports 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 adding a suitable FAS onto
packets that belong to specific Slice-Flow Aggregate.  In addition, edge nodes
may mark the corresponding Diffserv CS to differentiate between different types
of traffic carried over the same Slice-Flow Aggregate.</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 FAS
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 FAS carried within the packet to apply the corresponding NRP-PHB
forwarding behavior. Nodes within the network slice provider network may also
inspect the Diffserv CS within each packet to apply a per Diffserv class PHB
within the NRP Policy, and allow differentiation of forwarding treatments
for packets forwarded over the same NRP that supports the
Slice-Flow Aggregate.</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 FAS to
allow slice interior nodes to identify them. To support end-to-end network
slicing, the FAS is maintained in the packets as they traverse
devices within the network -- including NRP capable and incapable devices.</t>

<t>For example, when the FAS 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 FASL
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:           FASL: 1001    @@@: NRP Policy enforced
     1601: P1                          ...: NRP Policy not enforced
     1602: P2
     1603: P3
     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 FAS 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 FAS 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 Filter 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 Filter 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>Routing protocols may need to be extended to carry additional per NRP link
state. For example, <xref target="RFC5305"/>, <xref target="RFC3630"/>, and <xref target="RFC7752"/> are ISIS, OSPF, and BGP
protocol extensions to exchange network link state information to allow
ingress TE routers and PCE(s) to do proper path placement in the network.  The
extensions required to support network slicing may be defined in other
documents, and are outside the scope of this document.</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">
  <t>Add new Appendix section with examples for the NRP modes described in
<xref target="SliceModes"/>.</t>
  <t>Add text to clarify the relationship between Slice-Flow Aggregates, the NRP
Policy, and the NRP.</t>
  <t>Remove redundant references to Diffserv behaviors.</t>
  <t>Elaborate on the SFA packet treatment when no rules to associate the packet
to an NRP are defined in the NRP Policy.</t>
  <t>Clarify the NRP instantiation through the NRP Policy enforcement.</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="I-D.ietf-teas-ietf-network-slices"/>.</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 FAS, and hence an
adversary may be able to utilize resources allocated to a specific 
NRP by injecting packets carrying the same FAS 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
]]></artwork></figure>

</section>


  </middle>

  <back>


    <references title='Normative References'>





<reference anchor='RFC3630' target='https://www.rfc-editor.org/info/rfc3630'>
<front>
<title>Traffic Engineering (TE) Extensions to OSPF Version 2</title>
<author fullname='D. Katz' initials='D.' surname='Katz'><organization/></author>
<author fullname='K. Kompella' initials='K.' surname='Kompella'><organization/></author>
<author fullname='D. Yeung' initials='D.' surname='Yeung'><organization/></author>
<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' target='https://www.rfc-editor.org/info/rfc5305'>
<front>
<title>IS-IS Extensions for Traffic Engineering</title>
<author fullname='T. Li' initials='T.' surname='Li'><organization/></author>
<author fullname='H. Smit' initials='H.' surname='Smit'><organization/></author>
<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' target='https://www.rfc-editor.org/info/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'><organization/></author>
<author fullname='J. Medved' initials='J.' surname='Medved'><organization/></author>
<author fullname='S. Previdi' initials='S.' surname='Previdi'><organization/></author>
<author fullname='A. Farrel' initials='A.' surname='Farrel'><organization/></author>
<author fullname='S. Ray' initials='S.' surname='Ray'><organization/></author>
<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' target='https://www.rfc-editor.org/info/rfc3209'>
<front>
<title>RSVP-TE: Extensions to RSVP for LSP Tunnels</title>
<author fullname='D. Awduche' initials='D.' surname='Awduche'><organization/></author>
<author fullname='L. Berger' initials='L.' surname='Berger'><organization/></author>
<author fullname='D. Gan' initials='D.' surname='Gan'><organization/></author>
<author fullname='T. Li' initials='T.' surname='Li'><organization/></author>
<author fullname='V. Srinivasan' initials='V.' surname='Srinivasan'><organization/></author>
<author fullname='G. Swallow' initials='G.' surname='Swallow'><organization/></author>
<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'>




<reference anchor='I-D.ietf-teas-ietf-network-slices'>
   <front>
      <title>Framework for IETF Network Slices</title>
      <author fullname='Adrian Farrel' initials='A.' surname='Farrel'>
         <organization>Old Dog Consulting</organization>
      </author>
      <author fullname='John Drake' initials='J.' surname='Drake'>
         <organization>Juniper Networks</organization>
      </author>
      <author fullname='Reza Rokui' initials='R.' surname='Rokui'>
         <organization>Ciena</organization>
      </author>
      <author fullname='Shunsuke Homma' initials='S.' surname='Homma'>
         <organization>NTT</organization>
      </author>
      <author fullname='Kiran Makhijani' initials='K.' surname='Makhijani'>
         <organization>Futurewei</organization>
      </author>
      <author fullname='Luis M. Contreras' initials='L. M.' surname='Contreras'>
         <organization>Telefonica</organization>
      </author>
      <author fullname='Jeff Tantsura' initials='J.' surname='Tantsura'>
         <organization>Microsoft Inc.</organization>
      </author>
      <date day='24' month='October' year='2022'/>
      <abstract>
	 <t>   This document describes network slicing in the context of networks
   built from IETF technologies.  It defines the term &quot;IETF Network
   Slice&quot; and establishes the general principles of network slicing in
   the IETF context.

   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 how
   abstract requests can be mapped to more specific technologies.  The
   document also discusses related considerations with monitoring and
   security.

   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='Internet-Draft' value='draft-ietf-teas-ietf-network-slices-16'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-teas-ietf-network-slices-16.txt' type='TXT'/>
</reference>



<reference anchor='RFC2475' target='https://www.rfc-editor.org/info/rfc2475'>
<front>
<title>An Architecture for Differentiated Services</title>
<author fullname='S. Blake' initials='S.' surname='Blake'><organization/></author>
<author fullname='D. Black' initials='D.' surname='Black'><organization/></author>
<author fullname='M. Carlson' initials='M.' surname='Carlson'><organization/></author>
<author fullname='E. Davies' initials='E.' surname='Davies'><organization/></author>
<author fullname='Z. Wang' initials='Z.' surname='Wang'><organization/></author>
<author fullname='W. Weiss' initials='W.' surname='Weiss'><organization/></author>
<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' target='https://www.rfc-editor.org/info/rfc5462'>
<front>
<title>Multiprotocol Label Switching (MPLS) Label Stack Entry: &quot;EXP&quot; Field Renamed to &quot;Traffic Class&quot; Field</title>
<author fullname='L. Andersson' initials='L.' surname='Andersson'><organization/></author>
<author fullname='R. Asati' initials='R.' surname='Asati'><organization/></author>
<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 &quot;EXP field&quot;.  The exact use of this field was not defined by these documents, except to state that it was to be &quot;reserved for experimental use&quot;.</t><t>Although the intended use of the EXP field was as a &quot;Class of Service&quot; (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 &quot;Traffic Class field&quot; (&quot;TC field&quot;).  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='RFC3031' target='https://www.rfc-editor.org/info/rfc3031'>
<front>
<title>Multiprotocol Label Switching Architecture</title>
<author fullname='E. Rosen' initials='E.' surname='Rosen'><organization/></author>
<author fullname='A. Viswanathan' initials='A.' surname='Viswanathan'><organization/></author>
<author fullname='R. Callon' initials='R.' surname='Callon'><organization/></author>
<date month='January' year='2001'/>
<abstract><t>This document specifies the architecture for Multiprotocol Label Switching (MPLS).  [STANDARDS-TRACK]</t></abstract>
</front>
<seriesInfo name='RFC' value='3031'/>
<seriesInfo name='DOI' value='10.17487/RFC3031'/>
</reference>



<reference anchor='RFC2702' target='https://www.rfc-editor.org/info/rfc2702'>
<front>
<title>Requirements for Traffic Engineering Over MPLS</title>
<author fullname='D. Awduche' initials='D.' surname='Awduche'><organization/></author>
<author fullname='J. Malcolm' initials='J.' surname='Malcolm'><organization/></author>
<author fullname='J. Agogbua' initials='J.' surname='Agogbua'><organization/></author>
<author fullname='M. O&apos;Dell' initials='M.' surname='O&apos;Dell'><organization/></author>
<author fullname='J. McManus' initials='J.' surname='McManus'><organization/></author>
<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 best paths over the network based
   on the IGP metric assigned to the links.  Many network deployments
   use RSVP-TE based or Segment Routing based Traffic Engineering 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'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-lsr-flex-algo-26.txt' type='TXT'/>
</reference>



<reference anchor='RFC4915' target='https://www.rfc-editor.org/info/rfc4915'>
<front>
<title>Multi-Topology (MT) Routing in OSPF</title>
<author fullname='P. Psenak' initials='P.' surname='Psenak'><organization/></author>
<author fullname='S. Mirtorabi' initials='S.' surname='Mirtorabi'><organization/></author>
<author fullname='A. Roy' initials='A.' surname='Roy'><organization/></author>
<author fullname='L. Nguyen' initials='L.' surname='Nguyen'><organization/></author>
<author fullname='P. Pillay-Esnault' initials='P.' surname='Pillay-Esnault'><organization/></author>
<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='11' month='September' year='2022'/>
      <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-21'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-teas-rfc3272bis-21.txt' type='TXT'/>
</reference>



<reference anchor='RFC8402' target='https://www.rfc-editor.org/info/rfc8402'>
<front>
<title>Segment Routing Architecture</title>
<author fullname='C. Filsfils' initials='C.' role='editor' surname='Filsfils'><organization/></author>
<author fullname='S. Previdi' initials='S.' role='editor' surname='Previdi'><organization/></author>
<author fullname='L. Ginsberg' initials='L.' surname='Ginsberg'><organization/></author>
<author fullname='B. Decraene' initials='B.' surname='Decraene'><organization/></author>
<author fullname='S. Litkowski' initials='S.' surname='Litkowski'><organization/></author>
<author fullname='R. Shakir' initials='R.' surname='Shakir'><organization/></author>
<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 &quot;segments&quot;.  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' target='https://www.rfc-editor.org/info/rfc6241'>
<front>
<title>Network Configuration Protocol (NETCONF)</title>
<author fullname='R. Enns' initials='R.' role='editor' surname='Enns'><organization/></author>
<author fullname='M. Bjorklund' initials='M.' role='editor' surname='Bjorklund'><organization/></author>
<author fullname='J. Schoenwaelder' initials='J.' role='editor' surname='Schoenwaelder'><organization/></author>
<author fullname='A. Bierman' initials='A.' role='editor' surname='Bierman'><organization/></author>
<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' target='https://www.rfc-editor.org/info/rfc8040'>
<front>
<title>RESTCONF Protocol</title>
<author fullname='A. Bierman' initials='A.' surname='Bierman'><organization/></author>
<author fullname='M. Bjorklund' initials='M.' surname='Bjorklund'><organization/></author>
<author fullname='K. Watsen' initials='K.' surname='Watsen'><organization/></author>
<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>



  </back>

<!-- ##markdown-source:
H4sIAMqPVmMAA71963fbVpLn9/tXYJOzx1KHpB9xOtOanl7TspyoYztaSePM
7GZnDkSCImIS4ACgZMXW/u1bz/vCBcUkfdYfEpEE7rNu3Xr8qmo8Hpuu7FbF
UXZe5Kvy17K6zt4V3W3dfMguVuWsaLOyyk7PHr89e3Ohv7Qmv7pqipuj+Ad6
BZow83pW5Wtodd7ki25cFt1i3BV5O67acbkZrzerdvzkqZnlXXFdN3dH0Mmi
NuWmOcq6Ztt2z548+cuTZwbbvG7q7eYouzyZXmQ/wWcc4Xf4nflQ3MEDcxhF
1RVNVXTjV9ibabdX67Jty7rq7jYwhtOTy9fGtF1ezf8zX9UVfHVXtGZTHmX/
u6tno6ytm64pFi38dbfGP/6PMfm2W9bNkTHZ2GTwr6xaGMQku8jzOX3B87vM
m+KD+7JurvOq/DXvoPOj7LhsZ3V2cdd2xbqFUc4m9FCxzssVTLSFtyYw7BfX
+MVkVq/D3t5PspdF0eRrr7/3ZbusttlZfpNX/q9hx3/fVuWmaNx+ed3eXNFb
L37hZ3AAYbd/n2SvathD1+nfy8J9Ffb0/Ta/Lcrsspgtq3pVX5dF0NkvZTGZ
w5svlvRcf44vJ9lPReX19RLITb+JVrNez/K285uHh/8THn4xy69WBTaOD/id
UB+vJtlxMZvBTq1WpbE9vYK2i1UR/Rb2edKUs7ataTjS55xfm8zsay8KearX
Myzl9/kKVrly3f69Llb+tw92+Au8MFnyC8NdXUyys4K3iPu5WOb1Ymu/DLv5
X5cnsJ7Npm7oC6+3DTw/aendF792tKiTWRV0dQ7ruSy8KZ0DLeo3+/Yzg+cn
TV4NdfJvk+xNuXV9/Nt2ASPT78JeTl++HejlI701WZXbCfKg/kmjvt7AhIBZ
NHAuWtfjm23ZZm+jn8KOL4EQFnVVznKvzxW8ty6vtwV2JK+ut025WtUvOvtC
bxCwquf1h61HoOfFr7n7LmYtReV32jT43IsZfp2a39+Bua/8ueV37ruw6fdA
Y78Gq7iCpye/4NMvbvhH7qKqmzW8dFMAm0QG7j6Nx+Msv2q7Jp8Bd3FXSyX3
RMtXyxpG0RT/tS2bIuuWRXZRNDfwQ3bW1DflHBhYV2fL/IZ/zK/KVdndwXdm
kzdwa8FoszzbLO9aWM+Vbbus4K31dtWVGzjdyJO8X9usXmQ3eXOHo2nLX4t2
BDdDs5112wb+zuCOyBbbaoaNt3AxQM95lxX5bMljzmZA61dFNi/mJd5ecxxi
uylm5aKcmZbHD5002QyusXpdNO0ke6uDiaYvbTW0PNAUzAcn2sIWGX30dlnC
i0XVAgXhkGkQxQr4HNy0sBrALuHyW9O89B2YSb1tZoXJgeZmtK2T7HIJ5Az3
8nZdVB2Mv5015RUMIs9aWB9koDDd1ZZWFeYkg9I2Tcs3uy8N2CW9usva7QaO
X4dP2KV3q4EtbnCE0Bk8sipMb9eukBJWtC3wOJDXZlXmONAaaBC2AjemqmHY
OLgN04cBkrvNmzm+BOcs72hqBy3wlvl2Bd+OQP6Ajjc1DP5uZNcl27b5dXHI
48o2+exD0bWGdhpYegOLOoeGYEdh95gAyoq3m/dHlkLmJ0/QwGA38w2MvJib
rqaHpfWJ4UOxLudzmL75EoWWpp5vidKMeedRBraNO3eLm5M6EjOca4GDKoBd
41hpeYTUjSN1f92XcFnNU6dlAfxJTwDIN1sgdX/THZ3Wi0XRMMVb4kZK37bw
ZUkyGAz7DrcydZhxRYpqmVczXsZ5sQJmAasN44PPZWMXlDqCVYCjM+0vAI4m
X7W1gX6DE0VkAKdRJ0OLIryNuwTuiyRCh6WELY8nf7n0DsEcpLdty3ODt/3T
w8t7W3ZL6OMO9rhbGuL19QpOo4hCd0CJuJh5m51fvD8bX56McLUuzg8zITVa
VVo9WLL+Vpv+Mcx2HMNJZsynT//jdPxq4uRt+kueGPN23t/r+WllHxZlxdyU
KCXY/GzBG0yTLZk/oTxNa6srxO1cFxVcdasMlnRd0GDhXYPsvWiJMdB2gBST
0ydqJVQ1RkIHM6BVuDiABpDLCVeGn4Cy4akWuDcI6ihUE58AgR63FJ8hIlzk
8NAkO+2ISrJolMrcYa4GNqA/Cr7v69UKSE361TtKaKdC2gFm1HTLq3oLj8Bj
BjiLfvRHYUzId0s59TKaqnbrTr2PX8O5z6bX101xjWcc2D+QEE4TFgNka3gS
5ot0tK4b2YrgVgFGmC/gLsJjUORrbyEcy8el1DmfK088s3fqwbvzs0M7d/iQ
nRED7ZMtXMXAm0Gx6kocrB4Boo28g7t5lcNgrwq4w8u6oaVr4QzOOuRLtV7N
eipNDpLtrKRblc6Wdk/9yg3TBitl3EqNYZeAbWSfPtHPryxVA70jES+2sF/w
+7zoQKhBhnyptDy4/7BzcGcAhbUl3o/YDEki0qmQkb3wgt2I9oHFkvQui9gB
pwXvOhheRawMelrDbYJ/CwECo4DWi4LO4Zr51Rr4DXC4FrpQVoL7O3Oz6HDv
UUgoqyJodQ9igiGbJGHCbZIBybfARvhSnMHRZlbu0TsPcQGfWv3NuLPQqsTj
zcHOFLacuRPxxFVxA2oTDmc+hy1hGg6P5SLFJPn6dTzSmFMUGl+ViwXeNtnB
q4tDkTGAcv7H+evjZ8+//eb+fqQXtwxINwRls8yJHSYpdvABcJLHIa3WDIS2
FoUKYhiwCc0Hj9ANEhqcDLgSs2N8Eq4DPCmwOQfHMMZjkH02dYkdCRVeCoHx
0weXx4cZNL5iQqKbQafAE/vm+Z+f3d8f6sK+utB5w4hpSUm8mmQsAui7OPI2
L0meuSpWNd+xefZSDrVHEgcvp3K1LXM8psC11nTiO9wc5QIgoET8HQkwftoK
B/4ew9imHR4sOI8dD3dkcC7HF0hMwIpwBVlCCSleJfQsKTHS1IwIbvDnohZ9
RKgH2pb3ijmOAYTYdbnKG5T1mhp1A3gin9ebzgkLjsyHb/FI4IC2NnVK3oC2
CtyeDoimmuNSW/plmROUPuBP8qLrxknKKACqkpJaAjgXP4FC3teWYpYMzB85
MlJFoLaEYmZfvA8lrRHcoLRja2TpOS8SXOjIrISqmTMYu3GxbtNmTglUAVzU
nYKOAAzmGkioSt4WsIunPeYw8gV2mY52n+KBBtVXWH2rLRDz9TmqIzs8mC1p
F6UspewVdweCbmVwYfUskiSBgg5SeXZwCzdXkZYQdMEKlDpavTMPzabebFfw
QCsSjOUuNJaD9tCxR1FyYOcMXg18gAYEEnipbkQPISWFxR3kBDh+VdGMLMod
8To8WnfhQTwr+IXvgXIsL0HJY3z2/cvDHt0hLaTGw0dIXmNRVmbssWN30mEw
I5xCC8qLmeVtEWy68OymvhJbA14XC3fYgMT0pHk7KOTDDe3cIhCdjIohrGh6
NxHwMFKQSBOfl6RrkVwlAmLq2LZ4mO0mypjSGwdTeQ3PFh9z0KzhAN7icd+i
Np7RXUEcG4U2ktn0gAI/YtEHhmZ3VBVmvg5E67KXY3IF4FzQhPly9PRr3Az4
gobwJocWs4sOms9OQHoBBerNxcnhxEznczrowE/scultyuaNTI9ipWYZ2Ry5
JI13SV6VnQgjoLOsYK9X3P2KurdkbeXFXVvh7v+WpUPZafg/3F5tIDUAkU5i
dWBW42OuD2AbeH6gD3i6jZSsJXAwskThQySHk1mooIsDRgo7N6OLEt9PbgMq
qiBmQ6seP3CnY+g1mRWM/ssvs0u6VknBZREaXp+zrFx8dPcvbMYih1uyhGvS
CvOde1c5AW3VnnqryOyLGjeI1tZrr2zVEMFyoyzxESjFR9lNC0Rb/MsXT764
N32R/8gcifIghByqxI/6gvEj7Gb/Ue/WMg7eXRwf7hoDy6b7dTWs1/2jekiR
CLaNItwKRVZZtvhuyby7RaQIvBrgB76nrekzxen+eeg+sqpxSpsxO1XjbNHU
6+AdUJoqOhVoWYUPLLC05iBgdbt1pvbwnx9SsqJh6XB2XLpoKmfN0Gp4gepq
YqICAQePSiBGtNnb6b+zLUBbgw69cVoRMaEJim0O5QYe5+sp2jR3mBHEaEDW
BKYP1obcwopxna48Et/FkiAE5GmFeGWz/p+hCSQ1PhUsHjRCmN1WCN69At0Z
jpsKwcqUUFcDnb9VXkP2WLXjVMLo8flTd8+RaHP6ilciuAFVeuW7COSkbVX+
19Za3KRr0dXYKsNmGKNmGB2GzBxJLa/yax49T9+/v0UeFDF6wOgiMzjONySQ
vAP64U0kgTS0yBB9L6y5hu8wNTf11RldnGq2o3Gr8ui+o6H1t3WSPEpncAUK
NeY0W158UDu3oMLcFE1odSoTKtBurWC4Y2SH2jWJm9SDiArIwP4xvePbr8sV
3I3ZJdP3HfcqqnWK6BPdDJ9s6QNOK9qBbpGDX54wgV+eyFG3Z5fEIviZVpuP
nVXZuvxDoYax2QxYFVsm8pu8ZIdUX+nbsRxMtCChTGdNXd2tWXyaElKFmUpr
zN+yl9OjhPECfzm+OIpML/it6BZHzABgUQONJY9oUKyP8ML9Pb79egqNRpTg
tw6/vxl8QCTigT70Ke7o4g3MSz0Ib8haNoX2xLJKD/wYP/Dj1S8sA8oDJ/ED
JyTQubVT6fuI/lKpGEYlr9FDKEwfic+zqbsapAIV7WHLZksUm+GxNxdnR8H3
0AweTvwN/SVHjvLgD2ifWeyZNImPXcKA1Qp2gtdzQW4jmsw5zuWaOOB5ve3k
6/fnr4+y92fv9DsikddOnIdHpsdH2bQDJWRJLx+XzWxbdkQf0N2xOL6yk/k1
Ec0ZfGldU/bL4xMYP84GUSubLS9hdsKnLTuA39Git15vK1VgdF70I6jv5sv+
CRR0Vfa2WF8By1iWG2Om1QMmcl9WItO9b7KfM9NBU0ort1fkVsoOisn1ZIRK
EV4ssT3GuKMptxCc5KJFn40zkpPfa4bSj7x1yBZvHA8KPx16yeDQtq2zpVu/
7xwk/LLtyPNIbjIxaamIQ7MXPodqIN6KKhTO2ZSoOiH0+RjnwK7QPnORqYI+
Yl3q0BlOB1d9U98WzQgGXDdwt/IMruA/t+W8Wx6KbtIzfLnWRUVdbPGOD/AD
SZ4eGKsC1V3F2EAo3bHlesMY12l/dMhN4UxAo+Ta3hJrEGcvyBV40oFKSWK2
JrqFqUlFTvWMxtpXtr/BZYkd3nhbtCXO04E8RDrtdi9vvobFaLv0YHR6hg02
YiIuyS+5LVtn7o4U9x0rZuAh9FVXK7b57bT8sIgf7EbYvj1HaJ5HUacr13iZ
X4K6sYG/fesxcK6VoHVGRMz7LZCcDbhKyobwcmgCJQ81GsJGzlAxvFkosDHq
pDXzEk/hnNfdgT7IbuFzI/dTirZbsYEPoBPc6IV3WaLwNH0n5B8s3DkhZoF2
R1wdaH5OggqpIGhyIZ/tMt/A34fKGBKNq0wtSsSdcB+iWAu4aIoNDBSOiNUC
gq1YldUH3y8Ch0tFsWVCxjFO/kGpHSXZL1N+SkZVcZefvnx34X2+RyRA1Y7x
6QWs9/196P1FW/vG87V5Lgr1iQfalQKbyFpnGbB9RuyI3V7OjIn5iSBNr8tr
tF09x3X4rbAFRIAouixvQKToCkZ8yBXWW6wRj6EV6RNN1tWcNG7CmmS5abzV
pJ0ho4XXtO9Cspdk3714ggY62VpeZfQeiS2xgG1FkCI7TWgxiRhA3QOxQEYH
jfxf+Ec419S/8Tj+/9Cjn49PPsf//+PNTo+zo/j/A4+Ok//CH9OvHmSfz04+
T+Cf///sUH6kHc4O6d1gt+lXbPvIn8wR/f+QftQn+WU+Sir18svw/MT7xy3x
y/K8vHzO2BZ/1KmDakedaUsqRcrcb37HstHf78viNm5jsuPfz/avx9EvAyNJ
//tZ/v9Yv7CIJa+Vv4X/Mv+C9JuxjfTn8x+9nt3N+lbMVvjczeA76ZVM/Btq
wdGhR4rR30SZQhKuR9eCI8fMHa9MqdL/mtv4bL/VvxJUGRCn/8+18e7i2G9N
6W+HZt9rIhzGb13PVAupf/8RPy0U0x8g7vjngYXOkO1Gho9Mn2Y62TkK6nno
6Z2TDR8ZaOKAKWZsSSfTv/C/xCLsDh2m2zhgkvl89lkI5gjpSv4aE2eBJmQJ
djQywTfGR5Z8deWPhEseuPUbbARH4dNh2NzhHrPBB2jpenvGb+2zqPvsi5BX
gi1lrk8ZQ4/jPP4N7PXn8KPPYn8Le/3Z/wDc8V8r4KwrEN6jCe/bCDRxcCay
aHyyHziYthVi0upr4Pfsjfs5HNb+3MF5K7AJj9OOIw5LT0f8NjUTZrX8SYha
l+loTETKn8b6Z8yzx0K1ylXHIcv1Sd6dGkvfmdvgA+km9Y+Oir3Ns0QrSqT9
Yxb+s78dxY3AhXzdgMKJUqg9ZwP/4t/cQDyh6vds8OC/A+tLKQu20qKprD38
kzHZn7Ij39VCtqrViuVyfJLsyM7TLWjUGfzdMByJu64bUu9B49mCtD1hifrT
UfalpxVlFPn4L18kvEm+NkBS/OSLe7It65JEjKNl648eM/uY2nzoIUbJo6mm
2qIBz91XRporyWwivCiXIBRso6xmq+288AzonruOnXvk1kdVsyVjuvhPa4VU
o6sFMS264qgMX+UtayKqaZlbxIptZGfEwMbOLm5NRxmhgLNlDWIwuTaj4FHa
MotBg8cX21V2CzNSLK2uOwPD8cvafKhwc0gDQ6vjIvJYwac7Gr+onTVp5z3k
+roAzcwZ1t78yBNCNRB21AbysPNqsUKo4JyCbAw2R6JGLr5gMWBuV4gOzGCk
GOsEM5/fVfkaN3x1Z0C1r4pb0LMRo4e4ybJFA446BIiclWoCfXyJk1VyYkqx
5o4hRHRgwhV/sDs17AZJaCKq56ji8ulL+V0cCvSr/HjPJK2RHpkA+du0gm2b
5gW/E3uAOT4ZT4/HZycZYVfZxmyN6yM1sTin+zqHM/vRIf5x2x5fvDlpE16Q
/fAKMIm2iOgfY0NWQIWt0ubcnYV8yIuSHVy8mR4aD4EdMY0ZHILt2gsbsJZq
hf148DS1DC7I7EnErnZJIDGxnQE3I5yWRh0VjEhnRkcGVoz/kZipAEhN9q2i
mtVzzzjYd2tkB9Pjw1EPThDtKXIggg0IG3LBfurJuy3hoDJuCtvSw/yozRwO
vRVb8oIMP2SJPTtpQ6zuLbm2leR0jQjbixYbWA/mG/BNf7xpoE1E87z7q/JD
gYhEYMZNgyAo6PYGjmy9bQ1aXq03Y1UuishSNxL4tqwJ7NYaVhmRTAiIgIOX
sASzjY5+sCqsaLBwzqaWkOS+QI4CtLDdcISaWlIJEL1G63Af+2GjZMpWOJXY
JCm8D4kAKANara7d5CQYp65MOENGx1qYJ7qIZrAh1PgQsRhFscgU1P2jlx6F
8UdXk8KoIzz4BFdkCAeTx/ARBwDqHyuLvTEOrBNeUBJD4TAwiWfk1k4jiXlM
cBY6vtARgbxyt5lAXughG3pUfCxmW8e5TQ+2k5y8LCxsqz1E85HEAhLn4qtn
xNNlivRvKL4VyCl55pCCN4LDjZWwT1/ik/ZBoNIes9mSYnLnx/W64DfF1YJc
xzEEJLlYw7qFQPl44iu8kwT5z2ha4P5WUnAgSRtYqnjqqzszBL6VFY3ERrsV
B9pEHcZBGOiUvI2Ofx0SINbe/bII8boJbsPY+Xrnd3CMxryrOwG+dFZCYcHP
CzzVCwLYMOy6uJCsT4bPsPF2JR5b7UeP5iSuRI8gByMx10ngp54EjgfTAy7a
VdywutGmXVAkuahQSdsJd9R8RfDZ3pHtgYqHN7V1oioJRMgT/OkDxyFZigUs
7tTrjkIEdoJpjjgwR5oBxtUUKz6JzQf8RjlsAOWXy9zFyoSTMDFl3tIuS6Bf
KMchHYkC5DxSOhwVMvB9IZzCvzElvgibQHfY2rqndMoWOh/oWhaAF8WSQDsu
gi4BeKEmTv0WCCyqHCf45bfzkjxJdujRlPWhRjzgKIOT7O7uoCUb5O/Wjrcc
dCTaQuZhMDxgS3YXIjZK59VfF5D7Q/55P7TdjkUGQv2OfWMhQ8QakSJYWC/m
14VK2qoZ27si5kRJfCeyUr0NO1/8t8j2Ou1hH2mswB2rZYGMiN1SbJWVZocR
prBCrSobJOTCxIw/MV/y0mPPs0OSD06i3Vo3XXucSWQlTZP3YuPbIxqBB2n7
pIijEIAOZdIpOFxJhWsbtDSwPLLLniswOkQCY7qsL15PkXD48Owy1b8lAKQI
lfTh3qKB5EBHSjrcJHQqyrTjOfMBFyoRDmJlIrd/GnUhAwClowRdak5YfNja
o4zAfkXzL19c5c0XsJR3aIdhesn+++zwi3s0BMHCeL59BFqM5OvQK0+/oNTD
P17V3XIABQyi5ScEwf/XPV9zr1zzD6w0LPQrDY4RGNb9g4gfmb4PK3DGFols
bY2PU8gtwtDjZS48ikKjiMiCu8aHlJioeUJ54E7ayBlEzq6IpSbCTGc2zLR0
4pWIbOLspkB7L9jYD8e0Z4SZ5PcvaYDGKni7Q7N68VeZF96kIYoeSSgOmMRr
5jAubtfTpm3wZi+qsA+dG7wmKDiLwm1EtQdRMJ2ARM6ZvSuCC10Hmh1oLIZJ
Rayj+HB7yIoY63SE0ckHsaQHr6ewfWtg16xA2p2jiCEFHEco8PREccdKlWBw
SzmNQREIyB4qXqHpczR7IaJV4pBL1r5KxnHnKwwUujOe0ERDG2CXHBV52oP4
6J6TfmFC4ksi5rciJ+O4kDrVohaEzQ1GuVeJYOJdMQ98ek0iotECumX/g/ww
jhoCBDGFckeJCw5ZbuOQZ2XtfOa8aEI8emw88DoBWmMbTSKmzUWuKRl7IY5R
YJ/xNZf4UBIgzj+ZOMaRFVs55RNh5mDRrQTQxQltbkrQTuQSstbR3laQxkh3
68SEJyX41bOby+HkBALe8aXH/KgljZFCjKBNoVR45B2dMWWPMa/zWA3FqHoc
jzUE5EeqLOIoWL4TeRdlzIdvJ2PeBvi7XmIpVahpIwV8Zi8ue2EBu0H4Egci
t1Fccxi0ouEs2QPRKzg7dxidysEb3jhgNyuGxBHwd5mBF/VUh3YDiVxAnZaM
tk5PFySudx1b8HjLWx+pfi6Q3K6bMKlibgik1QXaPXbF2GTGRMeIvlgiMDbK
4oD5lPXUcJYVOPocjeQL5f31QVgydo9xDrSOUbB+4CFB38lmU+SNfwnZaWDw
kPaa0/wxILhGcHGNb4yLj4h6fhBUao0PRqDTJN9TTCusCMi3G1YlW4c6PYwD
kftQSQuqVi+IQk3JDrdoxDE2YmoJkdT7o+FZirdLMuRp8RKbpdsxUR4nVR00
9qGlNRUfjdygj8+OT3itZhQeQFlX9VQYG1IjjA1BwGJ38s6OPNUPf7CROKPA
b+YTE4bA0eLReqOkpNnLKCwTW3ZHNSBC7tueTowymxuyeTJLZ57JWbzQHrrQ
T0Qg8VFV1HwIO6ZBibVzXain1KWVI23RqmssrnhZiJydEHmhnYeReSCuFnNa
EYi68CD8lJ2IEnbxCPDq2syJIg7U4o8uuTmQd4fBBYe0hcUNIWFvPUWe7Ixx
No7eQBxHGlmQLN9dYbin7lW4rMgL9Rtc1NQ2ywZJiCGc73k7wA6Bs9RtIe7j
aNzx5RKAu4f1PiLXnO3+xOZIlaSWewFeXhSJy+GBAjfMe9ITgSsNf+ftMULl
urluQ4MbBS/0/EPBTAR9COiZ49MQjsl7n+KDSfiimfvSEM1LeFm5Wm0Rjcy2
0G2DwGc49p8+6bTGgtIP/L6un1DxbiymX0MadBUlLQCtiMCnn+UjZVXxhc0W
MQ2V5/u6PcLb+OkIPz6j/35NewN/PCfSpYhL7b66c4NsbeopEnZoVYKBXLmB
EILjqTb8jON8dPdNaqWJxSIdx7tv16DDhFfmgj1GqO+HY3dd+C+AXHVD9+1d
an9N0Bs+P8qutvQmXZG6Fmni8F+mRc04BcozVtrYCuEyjLzNP2ocG7bz0raD
bAWv24Id3nC5bYEHhsywH4Dh0lQgP0AW5N+4AiEnEPnpTqDOKaFlHnoGmvnr
eIyTHP8tiegZaubUfyYYzOlwK9BX2FWvlSz1S9zKadTT7xtL/PbwWFL/9h3L
X+lXpB5+7m/JVtKtp2aUXH/571+5nz1WN/lENCNLQr9rLPFO/rHVHRrLX3lt
v+6vbLrnrPdNf0bx89oKcYKvmO89PKOBVn7DOdo1ll3/9l/dh1qR1X2+c3X/
QTP6K+/jnrQ71Mr+nGHXWP7/cAamqK+QnvA/X39F113cSrr13zqWv/I+Dq9u
bxf767TXaRy6DC0BPcwZ9vn38Fj2a2XXN/u3QgLLV5ndv9/VyoPnaO+xDNPU
716X4NffPaNgdnu2spumDLRykB9m72pPflMp1/t3cHWIZRPoa/egyL0yEpWC
WRBP/yNhXB1ovrIgQhnikGPVQMHITjAs25pRF48DfYB7/sL3YKEU/BvthT6+
S3U5hEvPuux6mzegSxdiKEtG7Y6SHsSkx0s9cl0cTWtC35yYAkLXXhADLiHi
1JCXcYdd1KTLewBl9M5YUxDn73/AHpT5Lg41V5N5j9JSBIkcyNoieRxQgFcn
Q3osfiplNvEEhmwK8EaZP8Io+ekWGNslGBnGPbOVR5bNM8AHa2ZDZi01RZva
D1YnIKFB85WYzMlQ5VQQlw2gns22mL1uS96xK/hbMuspxMbpz0nonPU5hHlw
nKE67Xx+yDMeYE3UQ54CqPjIS1fdod3Af6y1qfMq2zDwU3/RzBQNFb0wkrAi
hcqN+vAR1ZradtSDrys+PUy04i1pmHUsKASB1DDSozQybL0KM0JpAmw7Gj/3
e4TIKD6iPVy2pmwYjNuh49pDewfJmGFNlmx3qvw0Xl6ceWchzT6w2xAYYgco
/T6y7ivy2k/ZvfBtuMkZGZ6BWN9pQC1mvNQUt5TXd9OQOXG/DGfy9+HEGcsS
qeGiNHgJ15rve0yn/enhh+MloRgOMnC1nVhBdaR+xr/WD5CR0YhFMTYB4lDa
ZX0reQKDxAKSv0H4lM2J3l96WXI9Ei57vk2Xr1fmrJeA3zhcu3o8YRUT+zuc
CCWZr9zE+cqpQ0IGIWyFU43z6rcF8FUyL8uj7SRGSjoHvjIdz6XPexRCATRY
we6YB2tGEOjWuYojVIeeaRcZ1GxX6vixlSh8AyAW5fHxLs77JYb0I46NkfZa
9ZmPyHq2gJN9i+4u7gaxNnQXjbEZDVphBPr/rC/w1oHvhpPL6RpQIFJ1ZyiZ
q3PgU86LsRVp9hywk9h8jwWNH0bbTzwTGVlDt8JIeIMzlm/IQ19Q9ZIaGtxg
zmPY218jN12YNxonS+Y54tktzcvicdc2j1M8qSBSJIwNCj0f6s/GGYJg9xjN
hY8dQNJ1EKYZ0ly0mFWasOnkn+MKB4tV8bEU/E1ZCX9MFG8K4YSu9hFncnIp
xIUVCVQuBDVKDk57p97AxVk3reJ7XSkbH/RH0rS6A4GJ2YPpKgXNi82qvtOQ
joECLVY021ZVId+j75oDVSg/s0ooMqfALXLahTlvyeeaUZlBxBSgDEhSGeGt
aGXR+SOUTzwGmB4us8K7Q/xtdGm71IdGWGgyj59FErigMO0yoiOMlpGs6bCs
fqJndy/E5xUIP2JEIou26AWDcbi7fiQHM3CFZloQ593J5fGP716js+P85IL+
Jjdp8RHfJ/g3XMfcNrrXYZFwcLFvNZO4KZabdEgkAM/KjaQrt1V4Tr87w/Sl
0M3L784ERlN8hFupVXgnpyJ18DA3cEsRYSZQ70LFHZX8Su7OHrg1doqvY8J4
jRPpAOVWsYn/UH5lRQWvZ4lOzON03Tbd5B75wowUPyg5stZB+TxGbpOEp4sp
MJ0j1GVifvQS30oK/F7qe4nkRLg1xRYKTmte080My/UjkNaqzuec1l879LAo
8B6mWcTEe9lpL205pgm/Rg+p8wt7zWg5ESyqQRl9vNze0BznBEfEKYZbwBn0
U+MdOgdjUuQgv2wQpItNxl5hLs7x9ZOvn97fq0cWnrkQ5evZ5ClR+VH26AJj
sEQxxZaAOazuMGWTrOQjy3Rh3HewMEvOzE2FI4pGAt5my7pu/fIWj6ixCk5C
tqw37AIjnhAoqV4nX2AIUjHHq/AL3N4v6PpGqQ/akWvgi0eTbEorz0dYUEH7
rTwv+yE2p27AtEzHBoEdCMJWAFyaZ083gcEOXgI4xzE9xJc/RnwrPUwrr4Vw
WcUwUqLKJQP/uFiIaErOyU8sbSCPnhgMLKX5w4tDNBKWligLMpXgqjiLvHCO
mB4DcI76ySPV0LMsNEbysOrvVJJLUi8+evdIyrTw4OnRRz88goX9BQT+isWY
mmqxVUV5DRoBXf5AOds1E4519jOejdKEkkD16O0j70inYxJYDcEWmAtI6Lsi
OFpu0RWWpAEzqZo+qRYM5UlSQRv4pmmyYb/DJ8AMnwDHYLhgXWrtpGIEG++M
i0pQyJ8+fucaIwFO4lG6ukNgl01IMEA4rYIm8874ccpwDXFiTY0BW/MByIW8
HrUB04aj9O6rHw5//tNbaXFivkc+MkImDos/whmy7I37i5fnuiBDnMa8SSY3
e5jaLZKAyJFcyZJ304W7mocPRnTP2HR3yUsGlw1zyOpTfElokUTXCqU17riy
hqKPyWePL9uqkxxBHNgE0ubJGAbDlTT7I0EIAZGX9qsRuRawgGhOED9P2NSJ
QdiktEBLEzNdUR1HNGkhJVvJvNeNyOQ8QejmkSgkqJgHg3vQ0GFhyUigtkNv
dLJwsxDdlRgRAztpHmjg7rjQCh1cIEgQLOkOT7zolsz2z1PCOeKMgnVwsVDG
zjS9Z9PKpqPEhB1bYuCommgBNM+sAiTa1etxi/VPyKgjAI6L82w6/2V8cfrK
S/aF+3rQmwiVND07eXaUPX3y5Cl7LP7y5Cl8Pns6PnumXzz7Gr54NoYHjfOv
PCaHy897fZRP7uXP0OtT+C99Tx+fZvpxjB+fwUf36eRZ5iUi/Jm+f7zXR/lE
DgxBXB9l5itu+it5KPrY/0I/m8/Z6Vnm0gh9ptUK8pbharkvPtPCwuD/QI9n
+d046NHvwPbgPssI4c03wFfsL/t3yX9kXw30kEWLkOkQY9/bgz3qCOMX4w6y
aBHcUB/qcbiHsMHBFocasM9bB51/HNU5h6cOWAyeO2b6GOhLz1HoP31FL7B/
zuU/Tl8kYbSeb80LwfYu5iASNRmdLtE2gVIVlOmyIS9lp9x4L2jzyPgRGWKB
SIjwQ/KLHS4beoFd9kIqzm00plULvdgdAnmKsuIpZg+rDv1IEe8RVHXGoOoc
tIdsR/VDhFKLSSH3Cw2h2F1KUBO5ROWgM4GZBkqBGFhD8K/G7TplQspr2CtI
NOlgjKNs7nmdeJ2tno7adSTYl1WgyopDFxdAMPeUO6aYezFVfpGsXRoP3Jre
o3wcQKxY7YqPHxYO8FSILU6fw1FKaEmvo2zApkVV5Ht3+8Y81D8mRPgbJcpG
5duvGFe3tkCULh2OFZXtK87iDRv1EWN65Ekjq+SNmRX0WLTT5pxciVJCtt1w
sbQ7Y/vutyircGn1gtwGaIq+55mGzNBEqC2KNnQ0PpUo6FPOSIGxba+np4d8
HtB7zbhnkUGj0OMgjQUH17C/J/d2szePyO8Easu4XfmiUTYsHfkiUJaQgrJB
QSj7g7JQ9gfFoex3SkTw9ymhVEQsMlnvAt1fZsh6t/YeshHQg6RQ/WP9PiQh
cT/us8hkmbvef0+/0W9xN4OSWQKi9Jv6jf79bvFsn36HxJ9EN3sLaal+d/az
p6i2u5lYYPuSuYOT1E65tovlo5rQKxLS/pb9NJhhjY0oVBPFL40Z3pSZ3pQl
X7vwrNhdOeSJrdrw9c2fCekDnJZ/P3zYFZCqgGOMg4jhDHuOTVGVOcAHnQ/X
mnYnipzCeq9o1kKXExe+5DwNDpDkF5Tk8CYvrNPiDSidP8h0qxXlXNTUIV3e
XIPwRIkXjTlPxSd5RT/wjdDdlQy6EDyAdb5aFFjxUXyMbvq+ecx5b8ec6W+D
Wf1oO4wE4jlYU2i3760vZRubWKSgD5yxgUwgXiTHn47oMb570yvQEcpsA8gG
T+oQhxklzTQqS6dCo/5ZrGi8/kGIkwlRi7iGKh+nZuSwfxSJMgj2Qho4rtEc
p2s8mFqEQ8Qx6ahY9bZX4x5JGkuSmCbEpQYLSHyihxtLzRNYbeRvPJpk6iHB
kxsX25ndE7FFUUUxMibKhEDC7dOYfxJnSxi2rXXYp9/hMRit9yfZ33D0lGvw
ggrQWLt7VFSd0nR0fsQmuVYLsQyX68IGbBkXBSsvhWHInsEXcVG5pvULvA/O
faoYyssTH0bZr4blQJRcVFJjXHPcKZ2+t+M2RScjLRvecBqhVxiwR08Ps9le
VTfFDH7/8p4sTa7cuis4O4rVSq0wabUjtv3HJZ4Y7MLaE+X1yvv9U6IXdlDH
Za09Ndi54RR8IDm/RG2NC+QdX2T4BtZ7Y2CHAEJBL+dzG9Zet7Mec6ixiwe1
SKbeuG22i5JHi+71pqL8uPWVZUOpRfPSYgSh+QnP9Y5C4Nd1vnKZSSjfQknX
gMtB7OoOAzPeMiPp8yC/mHPkN3+g/uJULcKUA0P5eq8YUrqGNF7SiqPxj73N
UhgkcogSAGialp2VqPo16zmlgEU+a8lYw7kKgsrdoRtDD7eXfyRhHDGRccTC
y9nV8WZ6gClNjPkJqXWgrGB2oLR4mChMzuYBu7QOicTim+4HMGv4fO2unInU
5NRCSLaGEa5tcgIM36QzJocLzhQVKyVzlZ8fB+6ef8XL06Bbs8sU4Ybgk17x
SZjfy2l7qHtjk/+KP4PKIxtPFT+B0d7kKzr5Utj89cnxoUAJnj3/9htON9cn
u2TCojYiq6QpcEj6kBOKqfiI0Afq2gdphyyV2IdSwzKxAY2lytShtENnXNu0
C7NSMas+7idusWhQNU1ZLEpsP3SYIE1qFSd68e2iGO1uc1x59CPoGr83m5uK
vZ5laGlKJcQyXkanh+82L6FrKhE5Qog+FHcunYq7SL2UVYm4hjv19jmjNS4T
VjckLrYzI4ptxGWZ0G8MJy9mphkg8UO8vQ/3e+z7Da2iZnyg38RVyvSSoLC3
Nt9kWhUyyOVC2RAE3lBZGdkb+9Tzm9vxM7qOEBKqaCmUn65xwjkhRM2H9Fl8
HXS6LrvwlNgRW5RfwoJKlB+pCxHiz46J574izN51YanGTBeMZisk2zoPl3Ot
I2P59smz+3tJQEs7zog9+nNWNFRQnFNIEE5ACan0a3trql2vevQicnoH6aUi
1HScipwyXzhcLggHIBXpyO38JTuN5vAkrQJTqSHQFUhmurpGaXy59iHcB6+n
rw5Nbx1szvlV24wRKjvO4e37e4aGIBGO7ZE7feWto+FFfP6Xp99oZtQdx/al
Fm7/9CXMXj8lIlZg4NfoTcE9Y7qhXJl8eSdiOlxO+ks/+oZzDlONCnsZUMLb
dlOzV2GHx8iEyqhNR8iJnLjGNyzEbbGiYsYsbegPBP/H65BvzVR4B6VIqBBY
RDgzD1S4R5XY6FCgX+w6r0TzekTJveGuKAi4iKaeizNBxugYLNCJLEO4Hix5
EJwGMwKy3IAC+BzkCFaYeukyGzRaQEMtR8UJ12LdPJEl+s205dKEDphms0lV
83FXj+F/D3N/LEhM5dVbrtnt0QbejkIxKvLtohfbPePiSY0IA7gsrC3EIPXX
ws/Km7sgvX3i89qAvJFhxzuiggb2n6RQ13uYd/rOJbAFikJQd+knOBWnG7IO
UHDZoan3uNYNjqDtfDdSU2gVlP48lOY34267IYU5E8sh2bdQdCFKsDBnNhi2
4tacodRSaw5hOk2dOlzkEGNG8Sj6xhNN2amG51oqOODv4qNVwLuFVSt1cJZt
wwn8c2S3NqIjCP1CquYgkYWgzVgch3kjVUtC3+AVIil6B3cwGbGlSeQFFG68
oDJehmR8TxbH9zyQRLRYIzYHZTG9mMN1SxFcPp9HKHVCCVQg+g84PHcrkOjF
oUa5vq8jd8NYJElxHDLnSNoOggZtyLKzknV3G2jPi9RM65cDDtEHeM6pMnTh
OyJ3BXzeGSIkbkvJzubZ6uPYO5uCtv1NKjkebe9Ei/XeJHUBT7TWtG3eqywD
MicwfSC7E4h9ZScsAd0jBs8wlCaH4Pq63ScDrq60aPA+iILdFjzlxAT85L29
2x+tKSZhupnwRvvt7b5CrBBnlDv61iYkYWkqSl2rRgaEStun2ZqGQ4sgJCww
slY1mPU0qQ4bL+uwnzs4OBvJzMHpLdzjxKgw9E6SekPr9OUVaPkg9J2lGcku
h4CYbK0sJumZuawx5+S0MlgMQNBoHnZXSU47Z3AxrtBPeHo5sRocFQkIL+LV
EwAk573GjfHOOVr81y7iKB1bwrZO26NhRHhro5F0fkSvOrt9eb5uuZow2Ngl
s3VBrE5YjdnTeuLbXJycFkR2w4ycCzHM9BfVkcil1JnuoQ1wSpy08diLtwrk
bjIq6CdNCh7l4LRp+WVMIdrHSokKdAuxGoacqf7yeUXuadtTu+MNik5uveW6
95rtOMjQB1LDj1KyiH5cUpiuN+g3KJxrDYx60x9klhjkFV4NqFJghke091Ic
YDE/NPaohwO186iRNDUc8GOnqRlJ67X8gFJpRgCWMREQ7phGbjuQL579CMdC
U2MkC3568eJFUByxwBILMy15+PTPT54eEdJk6B9VivTeR69hrw2EyTyznxAg
87X99Bw+PbefvoFP34TAmRfBv8FiqXtmdQnG7r+zJz4neCcA4WQKwsksCOdr
xj4E7+yJw/lt82Hkg1ul3/Hy/q8MLM3+DcDKPA+xS9+kMS8D/9JrZkKyeQAu
FHyOgFYBWOYzEWkfGtR/8Y/0CJTv95iGa/8je4xwWMEAQjzNb+kxwErF8LUQ
gRUig3YNdTf8yv+XGKoHUY8wQoMvRv+iAez/4u6hOoxRwMAVbHSCQcTzXoi8
K64WXyHo8uKCspjofX3FIYAPFXvRgG3f98XSCyVVxmZcOv+lk3Lk4r0F2dfM
y3a21ZwWklGEi8fc+9lZIitQpIXMJemUCZM1uf4UGSWiFfaFFu/QIDli5NBA
I6k2nABgW/OASBNX6M2m+x+xpXm29MDVNgsw2TK2VWcXq5eXOEiNf5nUn6xK
KkJxXA1F7tdhlUodW6kpZZrIXXSyhAg78cZFwG1PnmRklqvsoAmWPF1gXvtS
QNSB4UIb5M6qhaZxxPK0LcAsojtL53FvRklf7btfas0qm7y8rtLxm6AI9eoi
sX1422KS3DBjA5m+wlJMjOHRKkSoH89oKCg6ulBJ+8oNURa+UrRoyuG44D0K
xcXytG+iPqBY7PEz/IL//PrQD0Fz7qGyAaJdcf0t1t6GBrNPgCDRVNGY92VD
GYXPJXcCoSKdcnXw/vz1ofhnZpFFl2ujtlp64Uz1eLIqH5ydHCqmnFZOsR4u
oU9val6cY252G22oEkZ2MtymKArGzzUnhliGwb1/M33HJlM+mrbIp7c59Ixv
k0uXgdFE/FNxA9a2rkFIdL5xzwtzad0C0Eo5pEKEVrv0QHnWJIabIMnEUEHq
LzOxYkZbqichDBTXWBQ7ip6rRwai00Q6auY6TQtEUYQiecgZVyNp9DG9gmMd
NlsQ+x0xyweZaTiayYEy13k3WwqEUm0OYXBLiV4fLs+iZVmMGMDhDDNoydmv
XMWiBw8sLzVP0HgwVK8SV1OS8Zr8tJJdyVP3I4iSLLF3dodO6ff1LU51hEAW
6zLxFi9RzaM2np1EUXIEyBQzMazbbFnMOHf/Ek42VXAIfIxJuj4XCBhmCJIS
9i5jvMtUj11dFxXujyIWG/9NmyKTvBj9yn4Ua22Nz/5FB/fKast70Mt2FqYZ
M6bOpi5bHWNEuYq5f6BTJX7pVTg5hKMZKoJNLfouOL9O6FAPqLhzH9kpzYfT
KdFzlPsOX0zUpBacLrwu2KTp8YNFuHW2VOJLC3FncJTq7fUyCypyK8eLvMHk
PFLe85FYehZMk0QMu09DS/nST3vjRYinKidrFQ+P7We7I6aD8+ELu3Q6K13x
RHU2KcuT/bIlgLX0kiwTXrOoGKNSZLTMtSTNnA0ZY1aWKaCmtOWSmN3GtXZd
bqcWk4XB0a7U+5CA1evqD/gvKN0YVSTii0DEwQiqwuEATrZDML672LIMDhda
L3MYN5YbHmFhXFlq4O1XNibLZHTRRDMaDefVWzSFJEXjuteFu1gIDxQvNO2A
BOpVmqpJglv5EMlOpAueK3FZnBx0TD5/3UdbfTsEAPaGkWVh5XU9/kikhMNB
rKBF+AyUPSUvqOboGNpDpAGC02tdDQ84lDz2rfqLSGAm7PSFrWGG+xwV1AVO
PxX5loFi0HL0VjdQuZUQzhdIqWMX7Ht5EoBduiJvx81i9vWzb59dlS3CXbqe
sgXXUb7p2j1w2oHGlvpFlRnblJcJBC4EircRWISth9y7QBxmSZzOVEtDSs21
Lg2MgDl1pGH2QKJHLOvE5bLkDCeLmPhFlaDHi60WWAryA1qWqGqamRUIQZEC
So6KKStkL/pESvqQd9JP4En139mxcpC3rCBBi3O8gWh65xfvqSrUBPfWS3tG
gTNAHPPcqypy+t2ZwhrMp0//DRNU/fnrJ/f3RHr8xTdfP/nm/v6Q1cOX352N
31zIL99++43gxOwSM4/ExTD9ymbqoPH3P1XOSNOnWv1WcupJnh9vdynagbw4
G7HA8Pcyo1REzCHRiBO/ibRnXrhCUD/IsxyYwUghPwSIby+u3aaKmmFF7bbI
bPFHOlRNrcXXoozQlGaHvlIkkSQtQV3dVg3T8l+THVxBU2te+rkQhxmEgvDY
uhMcsyh9KkIor6saQ1BkPg6GeWehtXBrbTdy9Yl2gZu1C7geJpMTxb6uKs+r
D6xLSkQLMxGxw5dITRsIJjZdorMf9Ow0kQPfOYdSRav0Ilf3sHmwCh1L3cBf
ScoJLBZMfsVc5EXbrh+tE0TqQG9Xv6hDnUKmVF4H3tloVBBnmsVjhEePjJDC
HLKXxG+T+3BGsUhGnxSu8OzJX+CoR9HeGPYC1+ybi7PWRxPKZMK5Gj9ThQv0
30kKQcrhKIUjvixjNBY/JXrW3M+XRWMU5dNWvbMLQWNHR/lemCJcwovzPVbv
orimc6LGmIOLc4Xt/9NzQtfGS0knhSxwoXkLltUEy5rsNlxrITYYad6A4o35
3bF0l4YX5Z5UcrUtV4zyAMr+EAajKHDYRy1KETanIEpkY4CRGLDycXoJGJUT
D+nujMcgSs+RMX/Cp20mVbx6m0ydyH1U7wSf96q1W8MbB+i+P3t3GNoAoXGm
Ternx414oUfZ1IOgixz21sWsHvw4fcsVPc9YRyeLmv/A2dtDmNu53jE5A/tE
anc8SE0KZMN0dgwZlSDggJ9ExKTpyO3aSAgZvsg/WWYkiXFNwCNq4h3lTdFj
E/w5okwaajKJqC6mGHGCnQ0HJG0G8PB4Q0lA/u4ssbHmAL8b28+HSO9I0hNK
BCo8PkhtKxl5nFJwcW7CRliVpEMl4AlXWtJugRoFdk0/ZZCFBqLe7PmV8pFo
nQ2eQHq5OH3VBuX5WPyNo239Q2UHYfVpK9zh4K+KDtVZTJhXkKrdC3QNkrHt
7IOowZb3Y+TgPvPEWT1Uy+FMWfiJ5fJwB8UlVgPI05Vk9ZUUfILmcZYyFQmd
NBq5t3z5Vj+x+Dvy5F+RcnHapxenF6Psx4uz11YadndPlGH4o0Th2kytnk6S
sOGkgmmJwxyfHAgeuJZi9LG0GCf2JBXIG41/KSqDjpN8WqqwIRBEc8amMxZ8
3b7g28tlnObalZH3Ijy8rcy3Xb1GvjDJbGUFwaWZCJfm59OW16QHqygle+xq
8wA+Ks/+ffruuzidd4g01PqwLnoP+oqzZQtflfIGLYYQWdiww32LmiJJskU+
+POz50+RAjVftooNT54/keiT6/OzYxtEqGxaYrKh0wUW6nQXV4MSYXHD8bJ9
Akzki3DzUSSaC9+SNYiXCW3sQ3RhfAEq+xEew9TpSHWnbbuliIWaLXswzewE
zm/dHGVnK8wCCqNf1xiAgPTVivmBgurJRL69WkktCqI575mmQPg6ukCrMYkV
nJa03fpe8gxuPVy++dbGhP7EHn/zHeVEmM7FNQLTdrRg50Orgs6IWzjeLRno
pAs/Mxiaxu6MKzKhwYGYRxW+0Z6tbhVODM/i6cnFdzDBp0BG8znVIAZtD5EI
H+182TrFdNwGVNvX5RAfEUICoPFn3HiHMDfkpiuQHATZ7PsALMh8wEqmeHro
wgfmdhq5Zr6eAPunPQWWhAEHZImRyC5aMgv5VeAxHtPnk+wENOy6kYTbdMm+
nlrUsIWOElqwqp0nx2XFcx4kHF5nq4jnTcD5wuMOfX8zwehbuxwM9PB5W7ds
yDgfMQrPfQ6t/Nm1slRUrThFMhRVGqvW7DLNq5sAZ/CqWIN8nwuBgvyWuYwo
ge6uOcafT55hwhDa/sjmR39pnRLWnYksvg3nHpACfgE7iJGVdz2jq6RNYNuy
DZrMsqBIlp+74Z/QC7zhxNW0Qq6SlV+LzcsRzbl75lEVJuyDc68Wc4eeMOYv
SHg3aKP69CmAXd+zwMjrRT07PD3CaProHuqivq3YUpC5jNZwRp/YacARK2bA
Wbq74wDjCh3WlS+otPIY0hGQMYeq1fOtojVt/I3SC/bz1OvHjxykxr3Uijbm
y9a0GssvOWHyWTI7nb6bZuEwhaFatrTMkZvyk/lMDXpfZjrJ6HWMQ05Pn6UD
GoKmcYjFkbINpVhQY+4ihPjCah9hZRF3eOIyJgpKZlc2+35BWl3XlYXhwMXY
5FydBxVmIlV/HK5x1I1XbaBlsmNYgiDmQWYJAclwn+yeTBQ7m5K6VrD5zsO8
RDe9Zm/CO9EWskajmCbTkbpGnE+GosxV0ey56azS6dm4JDRHIneMm7OgLlil
OLQZiYO8D5UWwGEclcVi2D02njIR1c+h+GHNpAqXPHC3cnWn9n+pUTQHXboi
X7Mhq3ObNyqSWde5ghUGqs173VJ8BAX//CIGxiA4IMgUEWcNLa0Cr4YM+HLR
jevFWJeGxzXDLcDSO1WZr/yf846yH1qAO3AqStWBQAoeUeEi9ZCnFZ146VOm
ZxSMGe8D1HldYh4lT0cfiqSyFYLwCgSVAe26GGrbscyFEWRiZl10UnInPQ1b
AIgCzvpARY1A03BEOgxdglWBCMrB+JYv5lI97LoR27bvQYjOrMtjimIIt0x8
ajr7UNW3K/STU9YJmjOoD8sa09JSMoJV+aHgSzgHZe2H5te79tcOPYK/5s2H
+rac/TrKLm7z9R3ovT+Msnew9iDowdPmh6Zsl1VejUCRza+W2+w8/yV7D+cw
ByEZPv6QN9sq/4AZUZiI39bLHFPoA9+ewTNlY0RmKzFY+KYEGS9Zs4xClojF
4PqBVL9lJR7kzSukpZqravXnRpiecILTeVNiIRagdNF05kUH1ISXKsNH6R6Q
oF9kLepxe3dx7kyAHOXOrgbUvaDPGGKCxxqGvIVBsFrkV6PzpnhEcRJ46R3X
KziWL/OmW+LHv2+rkvR5SWOL353A1q6OstkVPvTiF35iAmRBmPOLpsS8bdk5
euhAE1+VD7TTtvRUr6FjDEJpctjRNdaQwL+rh4bUFrDVvZaC9cYvfoR9eVVf
082J9xfoHfDtv1bkkP4BPgL5es3m9P6LejWf19eTWT3ZfqDl+n/HPlSS3dsA
AA==

-->

</rfc>

