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

<!DOCTYPE rfc SYSTEM "rfc2629.dtd" [
]>

<?rfc toc="yes"?>
<?rfc sortrefs="yes"?>
<?rfc symrefs="yes"?>

<rfc ipr="trust200902" docName="draft-bestbar-teas-ns-packet-09" category="info">

  <front>
    <title abbrev="IP/MPLS Network Slicing">Realizing Network Slices in IP/MPLS Networks</title>

    <author initials="T." surname="Saad" fullname="Tarek Saad">
      <organization>Juniper Networks</organization>
      <address>
        <email>tsaad@juniper.net</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>Volta Networks</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="April" day="21"/>

    
    <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" title="Introduction">

<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" title="Terminology">

<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>

<t><list style="hanging">
  <t hangText="IETF Network Slice:"><vspace blankLines='0'/>
  refer to the definition of ‘IETF network slice’ in 
<xref target="I-D.ietf-teas-ietf-network-slices"/>.</t>
  <t hangText="IETF Network Slice Controller (NSC):"><vspace blankLines='0'/>
  refer to the definition in <xref target="I-D.ietf-teas-ietf-network-slices"/>.</t>
  <t hangText="Network Resource Partition:"><vspace blankLines='0'/>
  refer to the definition in <xref target="I-D.ietf-teas-ietf-network-slices"/>.</t>
  <t hangText="Slice-Flow Aggregate:"><vspace blankLines='0'/>
  a collection of packets that match an NRP Policy and are given the same
forwarding treatment; a Slice-Flow Aggregate comprises of one or more IETF
network slice traffic streams; the mapping of one or more IETF network slices
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>
  <t hangText="Network Resource Partition Policy (NRP):"><vspace blankLines='0'/>
  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>
  <t hangText="NRP Identifier (NRP-ID):"><vspace blankLines='0'/>
  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>
  <t hangText="NRP Capable Node:"><vspace blankLines='0'/>
  a node that supports one of the NRP modes described in this document.</t>
  <t hangText="NRP Incapable Node:"><vspace blankLines='0'/>
  a node that does not support any of the NRP modes described in this document.</t>
  <t hangText="Slice-Flow Aggregate Path:"><vspace blankLines='0'/>
  a path that is setup over the NRP that is associated with a specific Slice-Flow Aggregate.</t>
  <t hangText="Slice-Flow Aggregate Packet:"><vspace blankLines='0'/>
  a packet that traverses over the NRP that is associated with a specific Slice-Flow Aggregate.</t>
  <t hangText="NRP Filter Topology:"><vspace blankLines='0'/>
  a set of topological elements associated with a Network Resource Partition.</t>
  <t hangText="NRP state aware TE (NRP-TE):"><vspace blankLines='0'/>
  a mechanism for TE path selection that takes into account the available network resources associated with a specific NRP.</t>
</list></t>

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

<t><list style='empty'>
  <t>BA: Behavior Aggregate</t>
</list></t>

<t><list style='empty'>
  <t>CS: Class Selector</t>
</list></t>

<t><list style='empty'>
  <t>NRP-PHB: NRP Per Hop Behavior as described in <xref target="SlicePHB"/></t>
</list></t>

<t><list style='empty'>
  <t>FAS: Flow Aggregate Selector</t>
</list></t>

<t><list style='empty'>
  <t>FASL: Flow Aggregate Selector Label as described in <xref target="SliceSelector"/></t>
</list></t>

<t><list style='empty'>
  <t>SLA: Service Level Agreements</t>
</list></t>

<t><list style='empty'>
  <t>SLO: Service Level Objectives</t>
</list></t>

<t><list style='empty'>
  <t>SLE: Service Level Expectations</t>
</list></t>

<t><list style='empty'>
  <t>Diffserv: Differentiated Services</t>
</list></t>

<t><list style='empty'>
  <t>MPLS: Multiprotocol Label Switching</t>
</list></t>

<t><list style='empty'>
  <t>LSP: Label Switched Path</t>
</list></t>

<t><list style='empty'>
  <t>RSVP: Resource Reservation Protocol</t>
</list></t>

<t><list style='empty'>
  <t>TE: Traffic Engineering</t>
</list></t>

<t><list style='empty'>
  <t>SR: Segment Routing</t>
</list></t>

<t><list style='empty'>
  <t>VRF: VPN Routing and Forwarding</t>
</list></t>

<t><list style='empty'>
  <t>AC: Attachment Circuit</t>
</list></t>

<t><list style='empty'>
  <t>CE: Customer Edge</t>
</list></t>

<t><list style='empty'>
  <t>PE: Provider Edge</t>
</list></t>

<t><list style='empty'>
  <t>PCEP: Path Computation Element (PCE) Communication Protocol (PCEP)</t>
</list></t>

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

<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" title="IETF Network Slice Realization">

<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" title="Network Topology Filters">

<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" title="IETF Network Slice Service Request">

<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" title="Slice-Flow Aggregation">

<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" title="Path Placement over NRP Filter Topology">

<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" title="NRP Policy Installation">

<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" title="Path Instantiation">

<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" title="Service Mapping">

<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" title="Network Resource Partition Modes">

<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" title="Data plane Network Resource Partition Mode">

<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" title="Control Plane Network Resource Partition Mode">

<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" title="Data and Control Plane Network Resource Partition Mode">

<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" title="Network Resource Partition Instantiation">

<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" title="NRP Policy Definition">

<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" title="Network Resource Partition - Flow-Aggregate Selector">

<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>Forwarding Address Based FAS:</t>

<t><list style='empty'>
  <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>
</list></t>

<t><list style='empty'>
  <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>
</list></t>

<t>Global Identifier Based FAS:</t>

<t><list style='empty'>
  <t>An NRP Policy may include a Global Identifier FAS (G-FAS) field that is carried
in each 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 G-FAS field in the packet to infer the specific forwarding treatment that needs to be applied on
the packet.</t>
</list></t>

<t><list style='empty'>
  <t>The G-FAS can be carried in one of multiple fields within the packet, depending on
the dataplane used. For example, in MPLS networks, the G-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 G-FAS in the
MPLS label stack. It is also possible to have multiple G-FAS’s map
to the same Slice-Flow Aggregate.</t>
</list></t>

<t><list style='empty'>
  <t>The G-FAS can be encoded in an MPLS label and may appear in several positions in the MPLS label stack.
For example, the VPN service label may act as a G-FAS to allow VPN packets
to be mapped to the Slice-Flow Aggregate. In this case, a single VPN service label
acting as a G-FAS may be allocated by all Egress PEs of a VPN.
Alternatively, multiple VPN service labels may act as G-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 G-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>
</list></t>

<figure title="G-FAS or VPN label at bottom of label stack." anchor="bottom-stack"><artwork><![CDATA[
  SR Adj-SID:          G-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><list style='empty'>
  <t>In some cases, the position of the G-FAS may not be at a fixed position
in the MPLS label header. In this case, the G-FAS label can show up in any
position in the MPLS label stack. To enable a transit router to identify
the position of the G-FAS label, a special purpose label 
can be used to indicate the presence of a G-FAS
in the MPLS label stack as shown in <xref target="sli-sl"/>.</t>
</list></t>

<figure title="FAI and G-FAS label in the label stack." anchor="sli-sl"><artwork><![CDATA[
     SR Adj-SID:          G-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>

<t><list style='empty'>
  <t>When the slice is realized over an IP dataplane, the G-FAS can be encoded in
the IP header (e.g. as an  IPv6 option header).</t>
</list></t>

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

<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" title="Network Resource Partition Per Hop Behavior">

<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" title="Network Resource Partition Topology">

<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="network-resource-partition-boundary" title="Network Resource Partition Boundary">

<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" title="Network Resource Partition Edge Nodes">

<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" title="Network Resource Partition Interior Nodes">

<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" title="Network Resource Partition Incapable Nodes">

<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" title="Combining Network Resource Partition Modes">

<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" title="Mapping Traffic on Slice-Flow Aggregates">

<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" title="Network Slice-Flow Aggregate Relationships">

<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" title="Path Selection and Instantiation">

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

<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" title="Applicability of Path Control Technologies to Slice-Flow Aggregates">

<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" title="RSVP-TE Based Slice-Flow Aggregate Paths">

<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" title="SR Based Slice-Flow Aggregate Paths">

<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" title="Network Resource Partition Protocol Extensions">

<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" title="Outstanding Issues">

<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>
</list></t>

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

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

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

<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" title="Acknowledgement">

<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" title="Contributors">

<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'>
	 <organization>Old Dog Consulting</organization>
      </author>
      <author fullname='John Drake'>
	 <organization>Juniper Networks</organization>
      </author>
      <author fullname='Reza Rokui'>
	 <organization>Ciena</organization>
      </author>
      <author fullname='Shunsuke Homma'>
	 <organization>NTT</organization>
      </author>
      <author fullname='Kiran Makhijani'>
	 <organization>Futurewei</organization>
      </author>
      <author fullname='Luis M. Contreras'>
	 <organization>Telefonica</organization>
      </author>
      <author fullname='Jeff Tantsura'>
	 <organization>Microsoft Inc.</organization>
      </author>
      <date day='27' month='March' 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-10'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-teas-ietf-network-slices-10.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'>
	 <organization>Cisco Systems</organization>
      </author>
      <author fullname='Shraddha Hegde'>
	 <organization>Juniper Networks</organization>
      </author>
      <author fullname='Clarence Filsfils'>
	 <organization>Cisco Systems</organization>
      </author>
      <author fullname='Ketan Talaulikar'>
	 <organization>Arrcus, Inc</organization>
      </author>
      <author fullname='Arkadiy Gulko'>
	 <organization>Edward Jones</organization>
      </author>
      <date day='7' month='April' year='2022'/>
      <abstract>
	 <t>   IGP protocols traditionally 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 proposes 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-19'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-lsr-flex-algo-19.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'>
	 <organization>Old Dog Consulting</organization>
      </author>
      <date day='24' month='March' 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-16'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-teas-rfc3272bis-16.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:
H4sIACuuYWIAA71963fbVpLn9/tXYJ2zx2KHpJ/pTKt7ekzLcqKO7WhFtTOz
m505EAmKiEmADYCSGVvzt2897wsARSd91h8SkQTus27devyqajQamSZvVtlx
cpGlq/zXvLhO3mXNbVl9SKarfJbVSV4kZ+eP3p6/meovtUmvrqrs5jj+gV6B
Jsy8nBXpGlqdV+miGV1ldXOVVqMmS+tRUY826exD1owe/8nM0ia7LqvdMXSz
KE2+qY6TptrWzdPHj//0+KnBVq+rcrs5Ti5PJ9PkJ/iMY/wOvzMfsh08MIdx
FE1WFdDkK+zPmLpJi/l/pauygDHsstps8uPk/zTlbJjUZdVU2aKGv3Zr/OP/
GpNum2VZHRuTjEwC//Kihv7GyTRN5/QFT+YyrbIP7suyuk6L/Ne0ycviOPnb
tsg3WeXWCB/J1mm+ghnV8M6LX/iJMYwz7On9OHmZZVW69vp6n9fLYpucpzdp
4f96eKc3V/RWf7d/GyevStgs1+nf8sx9Ffb0/Ta9zfLkMpsti3JVXudZ0Nkv
eTaew5svlvTceFauw85ejpOfssLr6yXQlX4TdnVSrmdp3fjNw8P/BQ+/mKVX
qwwbxwf8TqiPV+PkJJvNYJdWq9zYnl5B29kqi34L+zyt8lldlzQc6XPOr41n
9rUXmTzV6hmW8vt0BatcuG7/VmYr/9t7O/wFXhgv+YX+rqbj5DzjLeJ+psu0
XGztl2E3//vyFNaz2pQVfeH1toHnxzW9++LXhhZ1PCuCri5gPZeZN6ULoEX9
5tB+ZvD8uEqLvk7+fZy8ybeuj3/fLmBk+l3Yy/ty1aQBsUsnH+ml8SrfjvOs
Wby4xq9bS/cG5lMWcPqrtHYdvtnmdfI2+ins9xLoYFEW+Sz1+lzBe+v8epth
R/Lqelvlq1X5orEvtAYBi3pRfth69HmR/Zq676KzkGeF32lV4XMvZvh11/z+
Bkx85c8t3bnvosUEEvs12KoVPD3+BZ9+ccM/chdFWa3hpZsMOCSyafdpNBol
6VXdVOkMmIu7Qgq5D2q+QtYwiir7xzavsqRZZsk0q27gh+S8Km/yOfCvpkyW
6Q3/mF7lq7zZwXdmk1ZwO8FokzTZLHc1rOfKtp0X8NZ6u2ryDRxuZEner3VS
LpKbtNrhaOr816wewqVQbWfNtoK/E7geksW2mGHjNdwJ0HPaJFk6W/KYkxmQ
+lWWzLN5jnfUHIdYb7JZvshnpubxQydVMoPLqlxnVT1O3upgoulLWxUtDzQF
88GJ1rBFRh+9XebwYlbUQEE4ZBpEtgI2BzcqrAZwS7ji1jQvfQdmUm6rWWZS
oLkZbes4uVwCOcP9u11nRQPjr2dVDvcvrGAN64P8E6a72tKqwpxkUNqmqfkG
9299u6RXu6TebuCMN/iEXXq3GtjiBkcIncEjq8y0du0KKWFF2wKPA3ltVnmK
Ay2BBmErcGOKEoaNg9swfRggudu0muNLcM7ShqZ2VANrmW9X8O0Q5AzoeFPC
4HdDuy7Jtk6vswGPK2Ghoza008DRK1jUOTQEOwq7xwSQF7zdvD+yFDI/eYIG
BruZbmDk2dw0JT0srY8NH4p1Pp/D9M1XKJpU5XxLlGbMO48ysG3cuVvcnK4j
McO5ZjioDLg1jpWWR0jdOFL3130Jd9W867QsgD/pCQDRZguk7m+6o9Nyscgq
pnhL3Ejp2xq+zEnSgmHvcCu7DjOuSFYs02LGyzjPVsAsYLVhfPA5r+yCUkew
CnB0Ju0FwNGkq7o00G9woogM4DTqZGhRhLdxl8B9kUTosOSw5fHkL5feIZjn
NUyT5wZv+6eHl/c2b5bQxw72uFka4vXlCk6jSEI7oERczLROLqbvz0eXp0Nc
renFIBFSo1Wl1YMla2+1aR/DZM8xHCfGfPr0b2ejV3TXsVBNf8kTI97Ouzs9
P7XswyIvmJsSpQSbnyx4g2myOfOns9PL17S2ukLcznVWwFW3SmBJ1xkNFt41
yN5Byieaxu0AISalT9RKqFIMhQ5mQKtwcQANIJcTrgw/AWXDUzVwb5DR6yZb
E58AWR63FJ8hIlyk8NA4OWuISpJolMrcYa4GNqA9Cr7vy9UKSE361TtKaKdA
2gFmVDXLq3ILj8BjBjiLfvRHYUzId3M59TKaonTrTr2PXsO5TybX11V2jWcc
2D+QEE4TFgNEa3gS5ot0tC4r2YrgVgFGmC7gLsJjkKVrbyEcy8el1DlfKE88
t3fq0buL84GdO3xIzomBtskWrmLgzaBTNTkOVo8A0UYKEtlmlcJgrzK4w/Oy
oqWr4QzOGuRLpV7NeipNCoLtLKdblc6Wdk/9yg1TBytl3EqNYJeAbSSfPtHP
ryxVA70jES+2sF/w+zxrQKhBhnyptNy7/7BzcGcAhdU53o/YDEki0qmQkb3w
gt2I9oHFku5dFrEDTgvedTC8glgZ9LSG2wT/FgIERgGtZxmdwzXzqzXwG+Bw
NXShrAT3d+Zm0eDeo5CQF1nQ6gHEBEM2nYQJt0kCJF8DG+FLcQZHm1m5R+88
xAV8qvU3485CrRKPNwc7U9hy5k7EE1fZDWhNOJz5HLaEaTg8losuJsnXr+OR
xpyh0PgqXyzwtkmOXk0HImMA5fzbxeuTp8+//ebubqgXtwxINwRls8SJHaZT
7OAD4CSPAa3WDIS2GoUKYhiwCdUHj9ANEhqcDLgSkxN8Eq4DPCmwOUcnMMYT
kH02ZY4dCRVeCoHx00eXJ4MEGl8xIdHNoFPgiX3z/I9P7+4GurCvpjpvGDEt
KYlX44RFAH0XR16nOckzV9mq5Ds2TV7KofZI4ujlRK62ZYrHFLjWmk58g5uj
XAAElIi/IwHGT1vhwN9jGNukwYMF57Hh4Q4NzuVkisQErAhXkCWUkOJVQk86
JUaamhHBDf5clKKPCPVA2/JeNscxgBC7zldphbJeVaJuAE+k83LTOGHBkXn/
LR4JHNDWpuySN6CtDLenAaIp5rjUln5Z5gSlD/iTvOi6cZIyCoCqpHQtAZyL
n0Afb2tLMUsG5o8cGakiUFtCMbMt3oeS1hBuUNqxNbL0lBcJLnRkVkLVzBmM
3bhYt6kTpwSqAC7qTkZHAAZzDSRUdN4WsItnLeYw9AV2mY5238UDDaqvsPpW
WyDm63NUR3Z4MGvSLnJZStkr7g4E3cLgwupZJEkCBR2k8uToFm6urFtC0AXL
UOqo9c4cmE252a7ggVokGMtdaCxH9cCxR1FyYOcMXg18gHoEEniprEQPISWF
xR3kBDh+VdGMLMqOeB0erV14EM8zfuF7oBzLS1DyGJ1//3LQojukha7x8BGS
11iUlRl77NiddBjMEKdQg/JiZmmdBZsuPLsqr8TWgNfFwh02IDE9ad4OCvlw
Q3u3CEQno2IIK5reTQQ8jBQk0sTnOelaJFeJgNh1bGs8zHYTZUzdGwdTeQ3P
Zh9T0KzhAN7icd+iNp7QXUEcG4U2ktn0gAI/YtEHhmZ3VBVmvg5E67KXY+cK
wLmgCfPl6OnXuBnwBQ3hTQotJtMGmk9OQXoBBerN9HQwNpP5nA468BO7XHqb
snkj0aNYqFlGNkcuSeNdkld5I8II6Cwr2OsVd7+i7i1ZW3lx31a4+79m6VB2
Gv4Pt1cdSA1ApONYHZiV+JjrA9gGnh/oA56uIyVrCRyMLFH4EMnhZBbK6OKA
kcLOzeiixPc7twEVVRCzoVWPH7jT0feazApG/9VXySVdq6TgsggNr89ZVs4+
uvsXNmORwi2ZwzVphfnGvaucgLbqQL1VZPZFiRtEa+u1l9dqiGC5UZb4GJTi
4+SmBqLN/vXB4wd3pi3yH5tjUR6EkEOV+GFbMH6I3Rw+6v1axtG76clg3xhY
Nj2sq3697p/VQxeJYNsowq1QZJVlC+6WddrMrPQg6iTdDEC+fE1by2cXo/tz
33VkNeMuZcbs1Yz//GW6UG32XIpoymbNzWpg+1XLMVFycMvXydvJf7Cqro1B
f9747N3ZHpxanvFa52G+nqDJcY+WL5tAyj5vHysrqMWzoCa2b7qRSLoWRV/2
11Pa8EZl9TxBC0WHImnHfq+NwOw3EvCuZehtcMwupCtUpUAlr5UVkLlUzSyF
8GF8/sxdQyR5nL3ilQguKBUu+aoAMWZb5P/YWoOYdC2qFBtN2Epi1Eqiw5CZ
I4mlRXrNo+fp+9eriGsi5fbYRGQGJ+mG5IV3QD+8iSQvhgYTouuFtabwFaPW
oLa2oYtTzPY0bjUS3Xe0g35ZJ50n6RxuKKHGlGbLiw9a4RY0jJusCo1CeYeG
sl9o7+8YuZV2TdIg9SA3OTKYf07v+PbrfAVXV3LJ9L3jXkXz7SL6jm76T7b0
AacVzTS3yGEvT5nAL0/lqNuzS1IL/EyrzcfOalRN+iFTu9VsBqyKDQfpTZqz
v6itk+1ZDiZaECAms6osdmuWbiYEGGGmUhvz1+Tl5LjDtoC/nEyPI8sIfiui
/zEzAFjUQKFIIxoU4yC8cHeHb7+eQKMRJfitw+9veh8QgbWnD32KO5q+gXmp
gf8NGbMm0J4YPumBH+MHfrz6hUU0eeA0fuCU5C23diocH9NfKrTCqOQ1eghl
3WNxSVZlU8KlrZI3bNlsiVItPPZmen4cfA/N4OHE39CdcewoD/6A9pnFnkuT
+NglDFiNVKeoKGTk1aHJXOBcrokDXpTbRr5+f/H6OHl//k6/IxJ57aRteGRy
cpxMGtARlvTySV7NtnlD9AHdnYhfKjmdXxPRnMOX1nNkvzw5hfHjbBBTstny
EianfNqSI/gdDW7r9bZQ/ULnRT+Cdm2+ap9AATklb7P1FbCMZb4xZlLcY8H2
ZRmyrPsW9TkzHbR01HJ7RV6f5CgbX4+HqLPgxRKbS4w7mnILwUnOanSpOBs2
uaVmKPXIWwM2SON4UFYiyQ0ObV07U7d1y85BAM/rhhyD5MUSi1M1TlQ1V5a2
Qy0Nb0UV2uZs6VOVDfp8hHNgT2WbuchUQV2wHm/oDKeDq74pb7NqCAMuK7hb
eQZX8J/bfN4sB6I6tOxSrnXRIBdbvOMD934nTw9sSYFmrWJmoB7v2XK9YYzr
tD065KZwJqBR8jxviTWILxbkCjzpQKWLqlw7C9rClKTBdvWMttRXtr/eZYn9
0Xhb1DnO02EwRDpt9i9vuobFqJvuwej0DNtTxIKbk9twm9fOGh3p1XtWzMBD
6EouVmyS22uYYY0g2I2wfXuO0HqOok6Tr/EyvyyTcgN/+8Zd4FwrAdMMiZgP
WyA5G3CV5BWh2dBCSQ5ktFMNnR2hf7NQYGNQSG3mOZ7COa+7w2SQWcHnRu6n
LtquxUTdAx5woxfeZYnCU8SdkH+0cOeEmAWaBXF1oPk5CSqkgqBFhFyqy3QD
fw+UMXQ0rjK1KBE74T5EsRYPUWUbGCgcEasFBFuxyosPvtsCDpeKYssOGcc4
+QeldpRkv+rS9Rj0xF1++urd1Pt8h476oh7h0wtY77u70DmLpvCN5wrzPAjq
su7U/siYZhmwfUbMfM1Bvoax+YkQR6/zazQtPcd1+FJUAQI0FPyVViBSNBkD
MuQKay3WkMdQi/SJFuViToAagoIkqam81aSdIXu117Tv4bGXZNv7d4r2M9la
XmV07oipL4NtRaAi+zRoMYkYQN0DsUBGB438N/wjFGr3v9Eo/n//w59PTj/H
///nND05SY7j//c+POr8F/7Y9/JR8vn89PMY/vn/TwbyI+12MpC3g72n37H9
Y39Sx/T/Af2oT+rrfLRUCubX4Y2x94/b4tflefv6BYNR/LF3HV079kTbUrnS
rsHNb1hA+vt9nt22Wxnv+fez/etR9EvvaLr//Sz/f6RfWKBR0M5fw3+Jf3X6
Ddlmumb1n63e3a37Vkxa+NzNnre617TjX38bjjY98oz+Jmq1JOJ6dW04Ek3c
0UuUUv2vtZXP9nv9q4NSA4L1//mtvJue+O0pTe7R/zsaif/60pXtaqPr33+2
nxcaag8TKeBz76InyKQjM0ninmfa2TsW6r3/+b3TDh/pbeSIqWhkySnRv/C/
xETsfg36WjliMvp8/lmI6BhpTf4aEfeBRmQp9jYzxndGx5asdReOhZ8euZXc
0wyOxKfOsMHBQXPCR2gRWzvI7x22vIfskSW5DuaVuH5lHC2u9OiLWPHP4Uef
HX8ZK/7Z/wB89O8FcOEVKACtiR/aDDRydC4Sbfvk33NsbTvE0oWz2Ebsbf05
HNqX8A/n+MBGPK48irgxPR3x5u75MFvmT0LqulzHIyJc/jTSP9scfiS0rBx4
FLJn/yC40+RRfeK2+0i66vpHR8jKAklnO0q47QMY/rO/Hbebgev8ugI1FmVb
ewJ7/sW/+YPxxLPftt29/46slybP2P6LRrh68AeDb/4hOfbdOGQHW61Y5sdn
yUbtnNwCRJ3B3xUjkbT7siLjAehTW5DlxyyvfzpOvvJ0roTCG//1QYevytc1
SEcYP7gjy7UuTMRWarYt6fGzj6lFiR5iiDwagootmgfd/WakuZyMMsKpUolA
wTbyYrbazjPPPO87A8l1SD59VGRrMtWL97RUPDU6chDQoquOqvZVWrOeo3qc
uUWg2EZ2R8x37Erj1nSUEQQ4WZYgUpO/NYoQpU2zADR4fLFdJbcwIwXS6roz
Khy/LM2HAjeH9Du0aS4ifxh82tH4RaktSfdvwdbXGeh9zmz35keeECqZsKM2
ioddY4sV4gTnFGFjsDkSTnALbvJmJ+bR7QqhgQmMFAOdYObzXZGuccNXO5PW
0P8taPEI0EPQZF6jeUjdDUTQSjWBtr/EySo5MaVYY0ofHDowEIuz2Z0bdrJ0
aDWqNakS9Okr+V3cFfSr/HjHJK1hHomg+Otu9d02zQu+E2uDOTkdTU5G56cJ
AVfZgm1N90M14BSZLDSCBKr8o4P747Y9mr45rTt8LIeBFWASdRbRPwaGrIAK
a6XNuTsLaZ+PJjmavpkMjAe/jpjGDA7Bdu3FDFg7uGJ+PGya2h0XZFQlYler
J5CYWOaAnxFIS0OOMoajM6sj8y0G/0jAVICiJutZVszKuWd6bDtNkqPJyWDY
h1XQhUAORKAEYUMu0k/9hLc5HFQGTWFbepgf1okDoddiqV6QWYnsvOendQjU
vSXHuZKcrhEBe9EeBOvBfAO+aY+3G2UT0Tzv/ir/kCEcEZhxVSECCrq9gSNb
bmuDdl3rK1nliyyyAw4Fuy1rAru1hlVGGBPCLeDgddiZ2QJIP1glWHRgOGcT
S0hyXyBHAVrYbjg8Te20hIZeo+3Zn6fRyBkmu7wWTiUWT4rtQyIAyoBWi2s3
OYnEKQsTzpChsRbjiQ6oGWwINd5HLEaDHGQK6lzSS48i9aOrSTHUERh8jCvS
B7JJY3CKg/+0j5VF9BiH6AkvKAmgcAibjmfk1u6GEfOY4Cw0fKEj/HjlbjMB
1NBDNu4o+5jNto5zGw8TxFdu5+RlYWFb7SGaDyUQkDgXXz1Dni5TpH9D8a1A
Ls9zBxO8ERBurKZ9+gqftA8ClbaYzZZUlp0f1Osi3xRUC7IdBxCQ5GLN9haX
5YOJMReEwv4ZSgvc30oKDiFpo0oVTH21M33IW1nRSHC0W3GkTZRhEISBTsmX
6fjXgNCw9u6XRYjXTVAhxs7XO7+9YzTmXdkIrKaxEgoLfl7UqV4QwIZh18VB
ZT0+fIaNtyvx2Eo/dDQlcSV6BDkYiblOBj/zZHA8mB5q0a7ihtWOutvBRZKL
CpW0nXBHzVeEnW0d2RaiuH9TayeqkkCEPMGfPnAckqVYwOJOve4oPmAvVOeY
o3KkGWBcVbbik1h9wG+UwwY4frnMXaBMOAkTU+Yt7bJE+YVyHNKRqEDO36XD
USED3xfCyfwbU4KLsAl0tq2t80unbHHzgbZl4X1RIAm048LnOuA01MSZ3wIh
RZXjBL98OS9JO8kO/aWyPtSIBxtl6JPd3T20ZCP83drxloOORFvIPAyGB2zJ
7kLERum8+usCcn/IP+/6ttuxyECo37NvLGSIWCNSBAvr2fw6U0lbdWN7V8Sc
KEJnSnvASvU2bHzx38Lay27//VADBXaslgUyInZLgVVWmu3Ch8oIbtNalQ0S
cmFixp+YL3npsefZIckHJ9FurZuuPc4kspKmyXux8W0SlYCPtH1SxFEIQHc1
A3cpVkmFaxux1LM8ssueozE6RAKSuiynrydIOHx49pn43xK8UoRK+nBnsUZy
oCMlHW4SOhV5t1s78eEcKhH2InEiUEE3pkMGAEpHDrrUnID4sLXHCUEJs+pf
H1yl1QNYyh3aYZhekv85Gzy4M8kfcGE85ADCOIbydejzp19Q6uEfr8pm2YMx
BtHyEyLg/3HH19wr1/w9Kw0L/UojYwTkdXcvnkim74MWnLFFwlpr46MgUotf
9HiZi42iuCgisuCu8QErJmqeMCS4kzZsBnG5K2KpHTGmMxtjmjvxSkQ2caVT
lL0XaezHYtozwkzy+5c0QGMVvP1xWa3gq8SLbdL4RI8kFGVM4jVzGBe062nT
NnKzFVLYBub1XhMUmUWxNqLagyjYnX1Ezpm9K4ILXQeaHGkghukKV0fx4XbA
ihjrdIQASnuRqkevJ7B9a2DXrEDanaNwIYUzRxjz7onijuUqweCWcg6DLBCQ
Pcy9At/naPZCvKwEIeesfeWMEk9XGCW0M57QREPrYZccEnnWAhDpnpN+YULi
68Tjb0VOxnEhdapFLYiZ6w1xLzoiifdFVPDpNR3hjBYuLvsfJIdx1BDgkymO
O8paMGC5jeOdlbXzmfNCCfHosfHA6wRojW00HQFtLmxNydiLb4yi+oyvucSH
kuB2/snEMQ6t2Mr5ngiRB4tuJYAmzmZzk4N2IpeQtY62toI0RrpbxyY8KcGv
nt1cDidnD/COLz3mhyxpgBQiEG3+pMwj7+iMKXuMeZ3HaihA1eN4rCEgP1Jl
EUfB8p3Iuyhj3n87GfM2QPe1skqpQk0bKdA2e3HZCwvYDYKjOAq5joKaw5AY
DZZJ7omNwdm5w+hUDt7wysHGWTEkjoC/ywy8kKoytBtIXATqtGS0nXlxVcSs
vOvYQtNr3vpI9XNR5HbdhEllc0MQsCbQ7rErRj4z4jrGC8YSgbExHEfMp6yn
hlOswNHnWCdfKG+vD4KesXuMoqB1jCL1Aw8J+k42myyt/EvITgNDk7TXlOaP
0cAlQpdLfGOUfURM9b2QVWt8MALMJvmeAlphRUC+3bAqWTtM6yCOQm4DMS1k
W70gCmQlO9yiEsfYkKklxGkfjrVnKd4uSZ+nxctq1t2OiZI4qeqgkRU1ran4
aOQGfXR+csprNaPgA0qtqqfC2IAdYWwIMRa7k3d25Kl2cIWN8xkGfjOfmDDA
jhaP1hslJU1dRpkdsGV3VAMi5L7t6cQYtrkhmyezdOaZnMIL7aEL/UQEEh9V
xeSHoGYalFg715l6Sl1OOdIWrbrG4oqXgsjZCZEX2nkYmQeidjGhFUG0My9A
gFITUbYuHgFeXZs5UcSRWvzRJTcH8m4wdGFAW5jdEM721lPkyc4Yp+JoDcRx
pKGF4PLdFcaS6l6Fy4q8UL/BRe3aZtkgCWCE8z2ve9ghcJayzsR9HI07vlwC
6Hi/3kfkmrLdn9gcqZLUcit8zItRcQk8UOCGeY9bInChse+8PUaoXDfXbWhw
o+CFnn7ImImgDwE9c3wawjF572MsBQdQ0Mx9aYjmJbwsX622iHVmW+i2Qlg1
HPtPn3RaI4kBCPy+rp9Q8a5sxIAGTOgqSk4AWhEBZz9Nh8qq4gubLWIaJ8/3
dX2Mt/GTIX58Sv99RnsDfzwn0qV4Tu2+2LlB1jbvFAk7tCrBQK7cQAjD8UQb
fspRRLr7pmulicUiHce7b9egwWxXZsoeI9T3w7G7LvwXQK66oft217W/JugN
nx8mV1t6k65IXYtu4vBfpkVNOP/JU1ba2Arh0ou8TT9qlBy289K2g2wFr9uM
Hd5wuW2BB4bMsB3e4XJUID9AFuTfuAJQZ4j62V68zpkAZu57Clv6y2iEEx39
tRPZ09/Smf9UOKSzfQ1Bh2F/7YZaL3U3dBZ195tHFDewZ0Rd/75gRH+hn5Gg
+MG/9jTU14Ub0f79sP//C3d2yGJ3PtKamnb0m0cU7+7vXuzeEf2Fl/pZe6HD
hvp+6Zla/IJriBjG18weD5hab0Nfctb2j2jfvy9a7HsbksV+fs9i//Om9hfe
20Mpu7+hL2Aj+0f0/4+NMKl9jYSG/3n2NV2X7Yb6uvjiEf2F93bPYrc2tmvN
Dju0fbfqyO//XjZy2L8DRnRoQ/u++aKGSAj6OrF7+lsbuv+sfcGI+qnt96xR
8OvvmVowzcMb2k9thF4+SgfJu9KTEVWSDv4dXQ2wMAP94B4V6VrHo8I2y/t9
/0jqV0+d00oSK/4h4jlWQhT27ETQvC4Z3/Eo0Dy48we+rwzl7S+0TPpIMtUa
EZg9a5LrbVqB1p6JSa4z+njY6avs9K2p76+Jo4JN6AUUo0PoRAxi2SXUnRry
MgexM5ysBh4UGv1A1ujEZQLusTwlvjNFDeNkSKT0GkFCCrLrSD4KVBXUndE9
Fj9jMxuTApM5BaqjdhGhofy0EYwiEzQOI6zZniTL5pn6gzWzob+WmqJNbQfd
E2TRoKFMjPNkEnPKjstqUM5mW0yStyU/3BX8LQn8FMzjNPVOkJ71boT5fJxJ
vNvNfZ8PPkC1qC++CwrjYzxdEYl6A/+xdq3Gq5/DEFP9RTNsVFRbw0jijS78
b9SHj93WDLrDFlBekfBhwhhvScMkaEG9CaSGoR6loWE7WZjZSvNs29H4KeYj
7Ef2ES3vsjV5xbDfBl3kHq48yPkMa7JkC1fhpyPz4uUbC572IeSGYBd74O93
kR9BMd5+ZvCFby3unJHhGYidnwZUY2JNzaRL6YM3FRkuD8vUJn8Pxs4s15Gp
jow5LpNrhxPP93J2py9qIZXjJaFoETKl1Y3YW3WkfmLB2g/FkdGI7TI2NuJQ
6mV5K+kIgwQJkodC+JRNvd5eellyPRIuSb/Nyq935qyV5984BL36VmEVO/a3
P6FLZ1p0E6dFpw4Jg4QAGc5ozqtfZ8BXyZAtj9bjGJPpoALKdDzwAO9RCDrQ
sAi7Yx6AGuGmW+eUjvAjeqZdDFK1XamLyRa88E2NWPvHR9Y4P5uY7I85Ckfa
q9U7PyQ73QJO9i061rgbRPXQXTTCZjQ8hrHu/6uc4q0D3/UnyQsSTRY7Qzlj
HVSAcneMrEhz4ICd1Ob7Rmj8MNp2Ap3InBs6MIbCG5xZfkNYgIyKpJTQ4AZT
K8Pe/ho5BMP01DhZMgQSz65pXhb5u7b5qOJJBTEpYRRS6GNRzznOEAS7R2iY
fOSgmK6DMF2SprzF5NWEgidPIBdSWKyyj7kgffJC+GNHjagQuOhKLHFGKpep
XFiRgPJC+GTNF5q9U2/g4iyrWpHErmKODy8kcVodj8DE7MF0BYnm2WZV7jR4
pKcOjBXNtkWRyffoJeeQGEoDrRKKzClwwJw1YWpd8u4mVMgQ0QsoA5JURsgu
Wll0MwnlE48BpofLrEDyEOkbXdouhaMRFtqZj9BiFlz4mXYZ0RHG5UhydlhW
P5+0uxfi8wqEHzEikUVr9LfBONxdP5SDGThdE6278+708uTHd6/RrXJxOqW/
ySGbfcT3CWgO1zG3jY58WCQcXOzFTSRCi+UmHRIJwLN8I1nRbbGfs+/OMQ0r
dPPyu3MB7GQf4VaqFUjKKVUdEM0N3FJEmNHUu1BxRyVPlLuze26NveLriNBk
o460hnKr2ASGKL+yooLXs8RBpnFWcJs284C8Z0ZqLOQcxetAgx4jt7nIu2s2
MJ0jqGZsfvQS90qm/VaGfYkZRWA3RTEKImxe0s3MvjztZSI1Rl5SWCDmiMSs
gclZKyU6piC/Rgesczt7g9VSJViwg9IReXnDoTnON46AVozmgIPn5/UbOP9l
p5xBbt8gBhibjJ3OXPjj2eNnT+7u1OELz0xF43o6fkKkfZw8nGKIl2ij2BJw
hNUO803J8j20nBbGvQNKWHLWbypKkVUSTzdblmXtl854SI0VQP7Jstywh40Y
QaCZep08wAinbI733wPc0wd0Z6OoB+0I73/wcJxMaOX53Aro6LCV52UfYHPq
ZewW5NgKsAegWAs+TJME6iYwlsLLXufYpAco88eIb3UP0wppIRpXIZKUZXPJ
uEIuRCLqkcMQEB/rSQIoVgJLaf7w4giQDvNKlMKZynsVnKFe2EVMjwH2R93w
kT7omRMqI0lk9Xcq9yV5Ix++eyglYHjw9OjDHx7Cwv4CUn7BsktJdd6KLL8G
NYBufKCc7ZoJx2IJGC5HOU5Jinr49qF3pLtDHlj3wBaYC0hkvQJEam7RFa2k
ATOpmjapZowU6qSCOnB902TDfvtPgOk/AY7BcDG8rrWTahRssTMu6EERhfr4
zjVGUpuEuzRlg7gxm++gh3BqxWSmjfHDoOHu4aygGmK25gOQCnk9rP1ZwSk4
evf1D4Of//BWWhyb75GPDJHjw+IPcYYscOP+4o25zsj6piF1kobOHqZ6iyQg
wiNXyeTddNG05v6DgZfLd1xnwks4Ht4tYeiGr3ClSftdvLuOvhsR6JvhqBGb
MBH0OyjaYjHQeaPWgYOwbkPjQ3RFUOxgun0UZwfJ+jgIeS2M7YUNz7G3twfm
JtSPXC/eVXo/s29Dh71H8HIaweUEMhuru9oFLbCi2QNRgqIwF4qq3V9aSmP7
o/KgiSCPFOvOnFw71fAtx/Qlh7vVYPrEnGEy98yCRvHzfNBQ/ImYcF4EYodY
3P1RcCKBbO4B7P1yKfvuJzig3qM1FnYZm8lqtS9Yst9QhadC1CV9jscpSONW
V0mP4kEVhe1KUhsP8cLcmPvGMO7cJl2g1uLYVAEWjKsKDAwnV2AvI4Ra69TC
yWJebDWV8pPUNqJ48Q7gIVloED5tK9tyooLAINjtm4jRdlytt901IpXozLue
NfTfIqMQNg57fcqeDsz2QDYLaAuJgKrFokUb7zS7Ga2Oan+SulVSUWQTDvBe
ArIREHhZ2S698cnizUIgaceYGENOM0EPV8MFnegSh8sJNEs6rB0vumXroL8d
zSlYCxd4aexcu3duUtjMupgdaEviHFontNSiZ1mFC6sp1yMiNLLrClpsegGq
zy+j6dkrLych7+5RazJUPvn89Olx8uTx4yfsuvzT4yfw+fzJ6PypfvH0GXzx
dAQPGudufUT+158P+iif3Mufodcn8F/6nj4+SfTjCD8+hY/u0+lTLw1g8jN9
/+igj/KJvJgS4HGcmK+56a/loehj+wv9bD4nZ+eJy2L2mVYrSK2Iq+W++EwL
C4P/HT2ep7tR0KPfge3BfZYRwptvynRufzm8S/4j+bqnhyRahESHGLvi7+1R
Rxi/GHeQRIvghnpfj/09hA32ttjXgH3eeun9A6keej53wGjw5Ml90iT8JOUa
8S6LB1Rj4ozr2vnAU71nVFxzrBoV9ytOZw7CxEcMP5JnTftKYmU/vh5cg/wU
w3CBLW03fBfujO2/75pLLq2WkdpoUtEePeuS6Z8MtTZUawjerYzBlm5MFAcd
5NTgSB92Cck91jF73pbQOQVqzqhe+cwz2cc/fSaZdPDJpJdVJr+TWya/k2Em
v5Fnwt9nBGgRxmmS1hE7nKskrXN9APd8PTmTDLC/r9/7eCj34z4L104cA/gt
/Ua/xd308u4OTNMX9Rv9+80M/JB++xhkRzcHs/Gufvf2cyAz399MzNK/Yv6g
vBz3DpUBn1tqjrEWG/+pN+kbG16oCIxfqjPW2DyFhPgmPC3WWo7DYgM4fH3z
RwIFAUfl3wf3ew26iv4Y49BkOMuWD1SEao46Qj/FteYCisK5sAItGsPQO8Wl
ODl5hMMu+SUuOebKizW10ASqYFA36PzCRJCaz6RJq2tQ3ykbpDEXXUFTXp0T
fCP0jHVGggh0wPppLWAs+yjuSDd936jmHL0jTj+4wVSDtB1GogMdAiq09rfW
l1KgjS2w0MfY2OgqUDE6x98dZmR8T6hXkyS0HvSAIDz5QnxrlMnTqD2nK17r
z2J74/UP4q5MiHDENVQbTdeMHEyQwmN6cWFIAyclGvF0jXvznXDcOmZCFVvg
9mrUIkljSRJzl7h8ZQGJj/V4w1wZ1zb0Nx5Vt7JPf+XGRc+2eyJaKxVRIxOk
TAiU7DaN+SdxtoRh2/KObfrtH4PREoeSkg5HTwkQp1Rzx1rrozLvlDuk8cNI
yQubiT05X2c2isy40Fx5KYyN9szECKFKNddg4LNwnlaFW16e+ojLdgEwh7fk
OpoaeJviTun0vR23eUMZlFnxhtMIvVqILXq6n822CtkpvPD7l3ekj7oC8K4E
7jA2bWpRTWulY49BXNWKcTFsxaNkY2m7f8o+w77suNC2Z4p1zjvFKUgiMjGc
xjUBT6YJvoEl7hgDItjRppTSVWE1eDvrEcc/uyBVC3pqjdum4Mh5tOiJrwpK
2lteWTbUtWhero4gX0CHk3tPafLrMl25dCmUBCKna8AlRnaVkIEZb5mRtHmQ
X146crHfU3JyopYjSsyhfL1V/6m7qjVe0gq58Y+9TZ0YZJeIshJo7pi9xbe0
dLeLX+U8BxYkrVVyDSdQCGqJJ4HRUw+3lxSlwzxvIvO8RaKzYfTN5AjzrBjz
E1JrTyXF5EhpcdBRKp3N1HZpHWiJBTjdD2DW8PnaXTljKUOqtZ9s2SZc284J
MNKTzpgcLjhTVJ+VXCZ+0h64e/6Ol6dBZ2iTKBgOcSqtepswv5eTeqB7YzMS
i+WTKjb7iIlTGO1NuqKTL6XWX5+eDASA8PT5t99wDrw22XVmUaojsup0R/VJ
H3JCMT8gEboAahzLPJm2ciFZKrEPdQ3LxC4cliq7DqUdOkPgJk2YKotZ9Uk7
m4wFjqqLxMJWYh+Wgw9ppq04+4zvm8MQfJt4y6MfAeL4vdmEWewrzUOrUleW
LuP5Gu+/27wss13Z0RFt9CHbuRwv7iL18mh1hEDs1C/gnKe4TFjQkbjY3jQt
thGX+kK/MZxRmZlmANoPofk+MvCR72GwqprxMYFjVxzUy8xChL9KN4kWwgwS
zFCKBgFFFFZG9sY+8bztdvwMxCNchSpaivqna5wgUYhm89F/FooHna7zJjwl
dsQWENjhySPKj9SFCBxox8RzX5F37DqzVGMmCwa+ZZICnofLCeCRsXz7+Ond
nWTFpR1ncB/9OcsqqqHOeS0IXaCElPvlzG21N1cwexG5yIKcVxHAOs6PTuk4
HIQXhAOQinTkdv6SMkcTi5JWgfndEBMLJDNZXaM0vlz7aO+j15NXA9NaB5sI
f1VXI0TVjlJ4++6OASVIhCN75M5eeetoeBGf/+nJN5qudc+xfam3cCuaBUZ6
jS583CQmFMrYybd1R7yHy4x/6UfmcOZjqpRhuT+l3a03JTu098AUTKh92qSI
nE6K65jDzG+zFRVsZvFCf6DQALz/+JrsCv2gRA0F4o8IjuYBDg+ohBudAgRj
XKeFqFoPKcU4XA4ZgRrRujM9FwCNjsHiocgYhOvBogahbjAvIQsKKHHPQXBg
DamVtLNCKwU0VHPEnLApVsY7clW/mdRcftHh12xOq2I+asoR/O9+do9Fl6mE
fM11yT3awOtQKEZlvH30YrtnzDzpDWFwl0W/hVCl9lr4uYFTF8B3SOxeHZA3
cuh4R1SywP47KdT1Hma/3rk0ukBRCPjO/TSrgvlAXgEaLaNo9OLW2sgR7J0v
Q2oKzYDSnwfm/GbUbDekISdiKiSDFsoqRAkWAs0WwlqwNDMUU0rNZEynqVFP
ixxizGseReZ4siijOfBcSx0J/F2AQQqGt5BrpQ7O9W24jECK/NVGewRhYUjV
HECyEFAay98wb6RqSSscvEIkRe/gDnZGc2kqewGMGy/gjJehM/YniWN/7kll
mq3RaY/Cl97E4bp1EVw6n0cIdnIdFiDr9yBt9muM6LqhRrmGsSN3wyAFSbQc
MudIvA4CCm1EszOLNbsNtOdFcXYrlD0onHt4zpkydOE7ImgFfN5ZHiSmS8nO
ZvtqY9wbmwi3/iIdHI+2d6Il5sl0Cv+eLK3J47xXWehjTmDaIHcnAfvaTVjm
ukUMniWomxyC6+v2kDy8utKisvvIPfZT8JQ7JuCnEG7d/mg+MR22mjFvtN/e
/ivESm1GuaNvXkISlqaiBLpqVUBEtX2azWc4tAi3yBIiq1G9uVc79V/j5T72
MxgHZ6Mzf3H3Fh5wYlQYeiepxaF1+vIK1HpQys67Gck+D4DYaK0sJkmiuXQz
Zwa1MliMLVCgHPunJLOes7AYV24oPL2c3g2OigSLZ/HqCTKKs2/jxnjnHE38
axeN1B13wsZN26Nh4HhtI5V0fkSvOrtDeb5uudos2Lols3UBrk5YjdnTeuwb
WZycFkR9w4yG9iyG+QajahapFFzTPbTBTx0nbTTyYrECuZusCPpJU5NHmUBt
cQAZU4SkVClR0S8hRMOQ/9RfvsKRHW171+54g6KTW2JwCkahSs7lIE8gSA0/
SuEk+nFJIbzeoN+gcK6VOMpNe5BJxyCv8GpAlQLzTKKBl2IEs/nA2KMeDtTO
o0TS1FDBj40miCQ11/IDSugZ4VZGREC4YxrV7dB/ePYj+ApNjeEr+OnFixdB
kcYMCz3MtPTikz8+fnJM8JK+f1S50nsf3YStNhAb89R+QlTMM/vpOXx6bj99
A5++CdEyL4J/veVcD8/94sbuv3MgKCd4J0DeJIq8SSzy5hkDHoJ3DgTffNl8
GO7gVuk3vHz4Kz1Lc3gDsDLPQ8DSN91Al55/3WtmQrK5ByMUfI7QVQFC5jMR
aRsP1H7x9/QIlO/32I3i/Gf2GIGvggGEIJov6TEASMWYtRB2FcKB9g11P+bK
/9cxVA+5GgGDel+M/kUDOPzF/UN1wKKAgSvC6BQDjOet8HlX4i2+QtDHxWVt
Md38+oojBe8rOaPB3L6zi6UXSu2MzaQ+RFOlHLl4b0H2NfO8nm0134VkG+ES
Nnd+5pbIChRpIXNJSGXCRE6uP4VCiWiFfaGJOzRIDhkq1NNIVxtOALCtecij
sSs3Z4sODNm0PFuKZEuyieYiJlvGtmjsYrWyIwcJ+i879SerkopQHNdkkfu1
X6VST1bXlBJNJy86WYcIO/bGRRFDnjzJUCxXX0KTL3m6wLz0pYCoA8PlPsh/
VQpN44jlaVsIWkR3ls7j3oySvtp3v9LKWTaFell0h3mCItSqzsT24W2NqXrD
bA5k+goLQjFoR2shoX48o6Gg6OgiKu0rN0RZ+EpWoymHw4cPKFcXy9O+ifqI
QrZHT/EL/vPZwI9Ocf6gvAKiXXEVMNbe+gZzSPwQ0VRWmfd5RXmNLySvAu6m
5zw+en/xeiAOmVlk0eUKrbUWgDhXPZ6sykfnpwMFi9PKKbjDJftpTc0Lg0rN
fqMN1eNITvvbFEXB+HnoxBDLuLf3bybv2GTKR9OWGvU2h57xbXLdxWi0HMBE
/H6lra4QEp1v3PNiK2u3ALRSDpoQwdMuPRSeNYnhJkiiMVSQ2stMrJjhlepJ
COPJNfzRjqLl6pGB6DSRjqq5TtMiTxSSSC5xBtJIMn/MwuBYh80kxI5GzABC
ZhoOoHUozHXazJaCmVSbg9jZczVLw73GRWK0OIwRAzicYUYpOfuVq5t074Hl
peYJGg936tUDq3IyXpNjVjIveep+hEmSJfbObt8p/b68xakOEbliXSbe4nXU
FCmNZydRWBwhMMVMDOs2W2YzriCwhJNNdSQCp2InXV8I5guzB9XMWV3eepcv
H7u6zgrcH4UoVv6bNoUmeTHa9QUpJNsan/2LDu6V1Zb3oJUJLUxBZkyZTFwm
OwaFci11/0B3FRqmV+HkEHCmrxQ3tei74PxqpX09oOLOfSRnNB9OtUTPUV48
fLGjMrYAc+F1ASNNTu4tBa6zpUJjWg48gaNUbq+XSVAXXDle5A0m55Hyno/E
0pNgmiRi2H3qW8qXfkocL3y0q36z1hLx2H6yP5QyOB++sEuns9AV76gRJ8WB
kl+2hKiWXjqLlZcsKsYwFBktcy1JQaez43K9JlEETW6LNjG7jSv+urxPNSYS
g6NdqPehA0evq9/jv6BUZFQXiS8CEQcjbArj/51sh+h7d7ElCRwutF6mMG4s
ejzE8ryy1MDbr2wwlknooolmNOzPubeoMkmYxtW3M3exEAAoXmjaAYkPLzSN
k+RR4EMkO9Fddl2JywLjoGPy+es+2hrgIeKvNYwkCeu/6/FHIiXgDYIDLaSn
p/gqeUE1lUffHiINEH5eq3t4SKHOY1+rv4gEZgJLT20lNdznqKwvcPqJyLeM
DIOWo7eanvqxBGmeIqWOXIaJy9MA3dJkaT2qFrNnT799epXXiG9pWsoWXEfp
pqkPAGYHGlvXL6rM2Ka8hCFwIVCAjcAibFXm1gXiQEridKaKHlLwrnbZYgS9
qSMNMwsSPWJxKS7aJWe4s5SKX9oJepxutcxTkDvQskRV08wsQwiKlHFyVEwZ
I1vhJlJYiLyTfnJPqkLPjpWjtGYFCVqc4w1E07uYvqfaVGPcWy8lGkXKAHHM
U6+2ydl35wprMJ8+/Q/MY/XHZ4/v7oj0+Itvnj3+5u5uwOrhy+/OR2+m8su3
334jwDC7xMwjcTFMu76aOmj8/e8qqqSpVa1+K/n2JB2Qt7sU3kBenI1YYPh7
mVFXCMyAaMSJ30TaMy8+Iahi5FkOTG9okB/zw7cXV5BTRc2wonabJbYEJR2q
qtQScFG2aMrGQ18pkkjyGaCubmuXaRGy8R6uoGk3L/08if0MQlF3bN0JjlmU
WhUxk9dFiTEnMh+Hu9xZLC3cWtuNXH2iXeBm7UOqh4nmRLEvi8Lz6gPrkkLV
wkxE7PAlUlMHgolNpejsBy07TeTAd86hrtJZepGre9jcWwuPpW7gryTlBBYL
Jr9sLvKibdcPzwlCc6C3q1/UoU4xUiqvA++sNAyIs9DiMcKjR0ZIYQ6SGKlz
H84p+Mjok8IVnj7+Exz1KMwb41zgmn0zPa99NKFMJpyr8dMjuQwze0khSEcc
pXfEl2WMxuKnRM+a+2m1aIyifNrae3YhaOzoKD8IU4RLOL04YPWm2TWdEzXG
HE0vFKf/L88JThsvJZ0UssCF5i1YVhMsa2e34VoLscFI0woUb8z9jgXENJ4o
9aSSq22+YpQHUPaHMPpEkcI+alFKwTkFUUIZA4xEj5WPU/fAqJx4SHdnPAZR
eo6N+QM+bbOs4tVbJepEbsN4x/i8VzPeGt44Ivf9+btBaAOExpk2qZ8fN+KF
HiYTD3MucthbF6R69OPkLdcVPWcdnSxq/gPnbwcwtwu9Y1IG9onU7niQmhTI
hunsGDIqQcABP4mISVOV27WRmDF8kX+yzEiS5pqAR5TEO/KbrMUm+HNEmTTU
zgSjuphixAl2NhyQtBngweMNJQH5u/OOjTVH+N3Ifh4gvSNJjylfqPD4IO2t
lCx1SsH0woSNsCpJh0rAE67Apd0CNQrsm36XQRYaiHqz51eKWKJ1NngC6WV6
9qoOigSy+BuH1/qHyg7C6tNWuMPBX2UNqrOYVy8jVbsV2RrkadrbB1GDLTLI
yMFD5omzuq/Ow7my8FPL5eEOigu9BpCnK8n4O+ePguZxljIVCZ00Grm3fPlW
P7H4O/TkX5Fycdpn07PpMPlxev7aSsPu7omyD3+UsFub0NXTSTpsOF3Rs8Rh
Tk6PBA9M0YwbcV140mKc/5NUIG80/qWoDDrOBWqpwsY8EM0Zm+pY8HWHgm8v
l3EKbFfM3gvp8LYy3TblGvnCOLFVFwSXZiJcmp9rW16THqyi1NljU5p78FFp
8h+Td9/Fqb5DpKFWqXXhetBXnElb+KqUPqgxZsjChh3uW9QUSaAt8sEfnz5/
ghSoubRVbHj8/LGEm1xfnJ/YqEFl0xKEDZ0usFyou7gqlAizGw6QbRNgR4II
Nx9Forl4LVmDeJnQxt5HF8YXoJIf4TFMq45Ud1bXW4pYKNmyB9NMTuH8ltVx
cr7CZKEw+nWJAQhIX7WYHyiKnkzk26uV1KkgmvOeqTKEr6MLtBiRWMHZS+ut
7yVP4NbD5ZtvbRDoT+zxN99REoTJXFwjMG1HC3Y+tCrojLiF412TgU668JNR
omlsZ1wBCo0GxHSr8I32bHWrcGJ4Fs9Op9/BBJ+MMWk2VUIGbQ+RCB/tfNk6
xXRcB1Tb1uUQHxFCAqDxp9x4gzA35KYrkBwE2ez7ACzIvMdKpnh66MIH5jYa
qmaejYH9054CS8KAA7LESCgXLZmF/CrwGI/p83FyChp2WUlebrpkX08sathC
RwktWJTOk+NSsToPEg6vsbXM0yrgfOFxh76/GWO4rV0OBnr4vK1ZVmScjxiF
5z6HVv7oWlkqqlacIgmKKpVVa/aZ5tVNgDN4la1Bvk+FQEF+S1wKlEB311Tk
z8dPMUMIbX9k86O/tIYJ685EFt+Gcw9IAb+AHcRQyl3L6Cp5Eti2bKMkkyQo
oOUna/gX9AJvOL81rZCrcuWXavNSSXO6nnlUoQn74KSM2dyhJ4z5ExLeDdqo
Pn0KYNd3LDDyelHPDk+PMJo2uoe6KG8LthQkLvE1nNHHdhpwxLIZcJZmdxJg
XKHDsvAFlVoeQzoCMuZQtXK+VbSmjb9ReiFGejZ5N0nCloUHWk6yTJEB8pPp
TG1wXyU6ruh1jBXuHjFf6BTsrqkWYgkir0PBEzSPXQTqXliFISwU4ug9rkqi
OGL2PrO7FgTMdVlY5AzcZVXKxXZQxyXq8sfhGkd1dlUHiiH7ciVuYR5kfxBc
C/fJHsWO2mUT0rAytrh5MJXoctYMS3iN2QrYaMfShDdSpohzvlAkuOqGLc+a
1RM9s5RE00iwjXFzFqAEawEDm1s0yM1QaD0bhj5Z+ITdY+PJ/1E5HIrxZVUL
cyvlwJDy1U5N9lJyaA7qb0HuYUOG4jqtVIqy3m7FF/SUqfe6pZAGitf5RWyC
AZ4/yOYQ55bOrc6ttgf4ctGMysVIl4bHNcMtwEo6RZ6u/J/ThvIUWkw6MBdK
p4HYBx5R5oLrkA1ljTjWu6zFKMsyRAeo8zrHXEeeWt0X/GQL/uCtBVI+mmIx
OrZhMQmDvsQyumikgk73NGw9H4oRa2MLNWhMIwjpMDR+tnAXM8gB85aVpVIM
7LoSc7Rv9I/OrMt5jZIDt0x8ajL7UJS3K3RtU2YImjNI/MsS05dTwoBV/iHj
ezMF/eqH6tdd/WuDTrxf0+pDeZvPfh0m09t0vQNV9Ydh8g7WHmQzeNr8UOX1
skiLIeie6dVym1ykvyTv4RymINfCxx/SalukHzBrCRPx23KZYnL8l+V2Bs/k
lRExK8f43pscxLLOEmQUZUQsBtcPBPEt690gIl4hLZVcJKs9N4LhhBOczKsc
66oApYtyMs8aoCa8BxnxSfeAxOkia1En2bvphbPacSQ6ewdQXYI+Y1QIHmsY
8hYGwZqMX1zOm+IxhTbgPXVSruBYvgSVfokf/7YtclLBJek5fncKW7s6TmZX
+NCLX/iJMZAFwcSnVY651ZILdKqB8rzK72mnrumpVkMnGDdSpbCja6wOgX8X
9w2pzmCrWy0F641f/Aj78qq8ppsT7y9QFeDbvxfkQ/4BPgL5es2m9P6LcjWf
l9fjWTnefqDl+n89IG2V+9sAAA==

-->

</rfc>

