<?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-ietf-teas-ns-ip-mpls-00" 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="June" day="16"/>

    
    <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="NRPBoundary" 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>
  <t>Expand <xref target="NRPBoundary"/> on NRP domain boundary and multi-domain aspects.</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='18' month='May' 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-20'/>
   <format target='https://www.ietf.org/archive/id/draft-ietf-lsr-flex-algo-20.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:
H4sIAM0tq2IAA71963fbVpLn9/tXYO2zx2KHpJ/pTGt6ek3LcqKO7WhFjTOz
m505EAmKiEmAA4CSGVv7t2897wsARSd91h8SkQTus27devyqajQamSZvVtlx
cpGlq/y3vLhO3mfNbVl9TKarfJbVSV4kZ+eP352/neovtUmvrqrs5jj+gV6B
Jsy8nBXpGlqdV+miGeVZsxg1WVqPinqUb0brzaoePXliZmmTXZfV7hg6WZQm
31THSVNt6+bZkyd/efLMYJvXVbndHCeXp5Np8jN8xhF+j9+Zj9kOHpjDKIom
q4qsGb3G3oypm7SY/2e6KgsYwS6rzSY/Tv53U86GSV1WTZUtavhrt8Y//o8x
6bZZltWxMcnIJPAvL2rob5xM03ROX/BULtMq++i+LKvrtMh/S5u8LI6Tv2+L
fJNVboXwkWyd5iuYUQ3vvPyVnxjDOMOePoyTV1lWpWuvrw95vSy2yXl6kxb+
r4d3enNFb/V3+/dx8rqErXKd/j3P3FdhTz9s09ssTy6z2bIoV+V1ngWd/Zpn
4zm8+XJJz41n5Trs7NU4+TkrvL5eAVXpN2FXJ+V6ltaN3zw8/J/w8MtZerXK
sHF8wO+E+ng9Tk6y2Qx2abXKje3pNbSdrbLot7DP0yqf1XVJw5E+5/zaeGZf
e5nJU62eYSl/SFewyoXr9u9ltvK/vbfDX+GF8ZJf6O9qOk7OM94i7me6TMvF
1n4ZdvO/Lk9hPatNWdEXXm8beH5c07svf2toUcezIujqAtZzmXlTugBa1G8O
7WcGz4+rtOjr5N/Gydt86/r4t+0CRqbfhb18KFdNGhC7dPKJXhqv8u0YOc3L
a/y6tXRvYT5lAae/SmvX4dttXifvop/Cfi+BDhZlkc9Sr88VvLfOr7cZdiSv
rrdVvlqVLxv7QmsQsKgX5cetR58X2W+p+y46C3lW+J1WFT73coZfd83v78DC
V/7c0p37LlpMILHfgq1awdPjX/Hplzf8I3dRlNUaXrrJgEMim3afRqNRkl7V
TZXOgLm4C6SQ26DmC2QNo6iy/9rmVZY0yyyZZtUN/JCcV+VNPgf+1ZTJMr3h
H9OrfJU3O/jObNIK7iYYbZImm+WuhvVc2bbzAt5ab1dNvoHDjSzJ+7VOykVy
k1Y7HE2d/5bVQ7gUqu2s2VbwdwLXQ7LYFjNsvIY7AXpOmyRLZ0seczIDUr/K
knk2z/GOmuMQ6002yxf5zNQ8fuikSmZwWZXrrKrHyTsdTDR9aaui5YGmYD44
0Rq2yOijt8scXsyKGigIh0yDyFbA5uA+hdUAbglX3Jrmpe/ATMptNctMCjQ3
o20dJ5dLIGe4fbfrrGhg/PWsyq9gEGlSw/og/4Tprra0qjAnGZS2aWq+v/07
3y7p1S6ptxs44w0+YZferQa2uMERQmfwyCozrV27QkpY0bbA40Bem1We4kBL
oEHYCtyYooRh4+A2TB8GSO42reb4EpyztKGpHdXAWubbFXw7BCkDOt6UMPjd
0K5Lsq3T62zA40o26exj1tSGdho4egWLOoeGYEdh95gA8oK3m/dHlkLmJ0/Q
wGA30w2MPJubpqSHpfWx4UOxzudzmL55iKJJVc63RGnGvPcoA9vGnbvFzek6
EjOca4aDyoBb41hpeYTUjSN1f92XcFfNu07LAviTngAQbbZA6v6mOzotF4us
Yoq3xI2Uvq3hy5wkLRj2Drey6zDjimTFMi1mvIzzbAXMAlYbxgef88ouKHUE
qwBHZ9JeABxNuqpLA/0GJ4rIAE6jToYWRXgbdwncF0mEDksOWx5P/nLpHYJ5
XsM0eW7wtn96eHlv82YJfexgj5ulIV5fruA0iiS0A0rExUzr5GL64Xx0eTrE
1ZpeDBIhNVpVWj1YsvZWm/YxTPYcw3FizOfP/+Ns9HrspGr6S54Y8Xbe3en5
qWUfFnnB3JQoJdj8ZMEbTJPNmT+dnV6+obXVFeJ2rrMCrrpVAku6zmiw8K5B
9p7VxBhoO0CISekTtRIqFEOhgxnQKlwcQAPI5YQrw09A2fBUDdwbZPS6ydbE
J0CWxy3FZ4gIFyk8NE7OGqKSJBqlMneYq4ENaI+C7/tytQJSk371jhLaKZB2
gBlVzfKq3MIj8JgBzqIf/VEYE/LdXE69jKYo3bpT76M3cO6TyfV1lV3jGQf2
DySE04TFANEanoT5Ih2ty0q2IrhVgBGmC7iL8Bhk6dpbCMfycSl1zhfKE8/t
nXr0/uJ8YOcOH5JzYqBtsoWrGHgz6FRNjoPVI0C0kYJEtlmlMNirDO7wvKxo
6Wo4g7MG+VKpV7OeSpOCYDvL6Vals6XdU79yw9TBShm3UiPYJWAbyefP9PNr
S9VA70jEiy3sF/w+zxoQapAhXyot9+4/7BzcGUBhdY73IzZDkoh0KmRkL7xg
N6J9YLGke5dF7IDTgncdDK8gVgY9reE2wb+FAIFRQOtZRudwzfxqDfwGOFwN
XSgrwf2duVk0uPcoJORFFrR6ADHBkE0nYcJtkgDJ18BG+FKcwdFmVu7ROw9x
AZ9q/c24s1CrxOPNwc4Utpy5E/HEVXYDWhMOZz6HLWEaDo/lootJ8vXreKQx
Zyg0vs4XC7xtkqPX04HIGEA5/+PizcmzF999e3c31ItbBqQbgrJZ4sQO0yl2
8AFwkseAVmsGQluNQgUxDNiE6qNH6AYJDU4GXInJCT4J1wGeFNicoxMY4wnI
Ppsyx46ECi+FwPjpo8uTQQKNr5iQ6GbQKfDEvn3x52d3dwNd2NdTnTeMmJaU
xKtxwiKAvosjr9Oc5JmrbFXyHZsmr+RQeyRx9GoiV9syxWMKXGtNJ77BzVEu
AAJKxN+RAOOnrXDg7zGMbdLgwYLz2PBwhwbncjJFYgJWhCvIEkpI8SqhJ50S
I03NiOAGfy5K0UeEeqBteS+b4xhAiF3nq7RCWa8qUTeAJ9J5uWmcsODIvP8W
jwQOaGtTdskb0FaG29MA0RRzXGpLvyxzgtIH/EledN04SRkFQFVSupYAzsXP
oI+3taWYJQPzR46MVBGoLaGY2RbvQ0lrCDco7dgaWXrKiwQXOjIroWrmDMZu
XKzb1IlTAlUAF3UnoyMAg7kGEio6bwvYxbMWcxj6ArtMR7vv4oEG1VdYfast
EPP1OaojOzyYNWkXuSyl7BV3B4JuYXBh9SySJIGCDlJ5cnQLN1fWLSHogmUo
ddR6Zw7MptxsV/BALRKM5S40lqN64NijKDmwcwavBj5APQIJvFRWooeQksLi
DnICHL+qaEYWZUe8Do/WLjyI5xm/8ANQjuUlKHmMzn94NWjRHdJC13j4CMlr
LMrKjD127E46DGaIU6hBeTGztM6CTReeXZVXYmvA62LhDhuQmJ40bweFfLih
vVsEopNRMYQVTe8mAh5GChJp4vOcdC2Sq0RA7Dq2NR5mu4kypu6Ng6m8gWez
Tylo1nAAb/G4b1EbT+iuII6NQhvJbHpAgR+x6ANDszuqCjNfB6J12cuxcwXg
XNCE+XL09GvcDPiChvA2hRaTaQPNJ6cgvYAC9XZ6OhibyXxOBx34iV0uvU3Z
vJHoUSzULCObI5ek8S7Jq7wRYQR0lhXs9Yq7X1H3lqytvLhvK9z9X7N0KDsN
/4fbqw6kBiDScawOzEp8zPUBbAPPD/QBT9eRkrUEDkaWKHyI5HAyC2V0ccBI
YedmdFHi+53bgIoqiNnQqscP3Onoe01mBaN/+DC5pGuVFFwWoeH1OcvK2Sd3
/8JmLFK4JXO4Jq0w37h3lRPQVh2ot4rMvihxg2htvfbyWg0RLDfKEh+DUnyc
3NRAtNm/PHjy4M60Rf5jcyzKgxByqBI/agvGj7Cbw0e9X8s4ej89GewbA8um
h3XVr9f9o3roIhFsG0W4FYqssmzB3bJOm5mVHkSdpJsByJevaWv57GJ0/9x3
HVnNuEuZMXs143/+Ol2oNnsuRTRls+ZmNbD9quWYKDm45evk3eTfWVXXxqA/
b3z27mwPTi3PeK3zMN9M0OS4R8uXTSBln7ePlRXU4llQE9s33UgkXYuiL/vr
KW14o7J6nqCFokORtGO/10Zg9hsJeNcy9DY4ZhfSFapSoJLXygrIXKpmlkL4
MD5/5q4hkjzOXvNKBBeUCpd8VYAYsy3y/9pag5h0LaoUG03YSmLUSqLDkJkj
iaVFes2j5+n716uIayLl9thEZAYn6YbkhfdAP7yJJC+GBhOi64W1pvAVo9ag
trahi1PM9jRuNRLdd7SDfl0nnSfpHG4oocaUZsuLD1rhFjSMm6wKjUJ5h4ay
X2jv7xi5lXZN0iD1IDc5Mph/TO/49pt8BVdXcsn0veNeRfPtIvqObvpPtvQB
pxXNNLfIYS9PmcAvT+Wo27NLUgv8TKvNx85qVE36MVO71WwGrIoNB+lNmrO/
qK2T7VkOJloQICazqix2a5ZuJgQXYaZSG/O35NXkuMO2gL+cTI8jywh+K6L/
MTMAWNRAoUgjGhTjILxwd4dvv5lAoxEl+K3D7297HxCBtacPfYo7mr6FeamB
/y0ZsybQnhg+6YGf4gd+uvqVRTR54DR+4JTkLbd2Khwf018qtMKo5DV6CGXd
Y3FJVmVTwqWtkjds2WyJUi089nZ6fhx8D83g4cTf0J1x7CgP/oD2mcWeS5P4
2CUMWI1Up6goZOTVoclc4FyuiQNelNtGvv5w8eY4+XD+Xr8jEnnjpG14ZHJy
nEwa0BGW9PJJXs22eUP0Ad2diF8qOZ1fE9Gcw5fWc2S/PDmF8eNsEFOy2fIS
Jqd82pIj+B0Nbuv1tlD9QudFP4J2bR62T6BAnJJ32foKWMYy3xgzKe6xYPuy
DFnWfYv6nJkOWjpqub0ir09ylI2vx0PUWfBiic0lxh1NuYXgJGc1ulScDZvc
UjOUeuStARukcTwoK5HkBoe2rp2p27pl5yCA53VDjkHyYonFqRonqporS9uh
loa3ogptc7b0qcoGfT7GObCnss1cZKqgLliPN3SG08FV35S3WTWEAZcV3K08
gyv4z20+b5YDUR1adinXumiQiy3e8YF7v5OnB7akQLNWMTNQj/dsud4wxnXa
Hh1yUzgT0Ch5nrfEGsQXC3IFnnSg0kVVrp0FbWFK0mC7ekZb6mvbX++yxP5o
vC3qHOfpMBginTb7lzddw2LUTfdgdHqG7Sliwc3JbbjNa2eNjvTqPStm4CF0
JRcrNsntNcywRhDsRti+PUdoPUdRp8nXeJlflkm5gb994y5wrpWAaYZEzIct
kJwNuEryitBsaKEkBzLaqYbOjtC/WSiwMSikNvMcT+Gc191hMsis4HMj91MX
bddiou4BD7jRC++yROEp4k7IP1q4c0LMAs2CuDrQ/JwEFVJB0CJCLtVluoG/
B8oYOhpXmVqUiJ1wH6JYi4eosg0MFI6I1QKCrVjlxUffbQGHS0WxZYeMY5z8
g1I7SrIPu3Q9Bj1xl58fvp96n+/QUV/UI3x6Aet9dxc6Z9EUvvFcYZ4HQV3W
ndofGdMsA7bPiJmvOcjXMDY/E+LoTX6NpqUXuA5fiypAgIaCv9IKRIomY0CG
XGGtxRryGGqRPtGiXMwJUENQkCQ1lbeatDNkr/aa9j089pJse/9O0X4mW8ur
jM4dMfVlsK0IVGSfBi0mEQOoeyAWyOigkf8L/wiF2v1vNIr/3//wl5PTL/H/
/zFNT06S4/j/vQ+POv+FP/a9fJR8OT/9MoZ//v+TgfxIu50M5O1g7+l3bP/Y
n9Qx/X9AP+qT+jofLZWC+XV4Y+z947b4dXnevn7BYBR/7F1H14490bZUrrRr
cPM7FpD+/pBnt+1Wxnv+/WL/ehz90jua7n+/yP8f6xcWaBS087fwX+JfnX5D
tpmuWf1Hq3d3674TkxY+d7Pnre417fjX34ajTY88o7+JWi2JuF5dG45EE3f0
EqVU/2tt5Yv9Xv/qoNSAYP1/fivvpyd+e0qTe/T/jkbiv752Zbva6Pr3H+3n
hYbaw0QK+NK76Aky6chMkrjnmXb2joV6739+77TDR3obOWIqGllySvQv/C8x
Ebtfg75WjpiMvpx/ESI6RlqTv0bEfaARWYq9zYzxndGxJWvdhWPhp0duJfc0
gyPxqTNscHDQnPARWsTWDvJ7hy3vIXtkSa6DeSWuXxlHiys9/ipW/Ev40WfH
X8eKf/E/AB/91wK48AoUgNbED20GGjk6F4m2ffLvOba2HWLpwllsI/a2/hIO
7Wv4h3N8YCMeVx5F3Jiejnhz93yYLfMnIXVdruMRES5/GumfbQ4/ElpWDjwK
2bN/ENxp8qg+cdt9JF11/aMjZGWBpLMdJdz2AQz/2d+O283AdX5dgRqLsq09
gT3/4t/8wXji2e/b7t5/R9ZLk2ds/0UjXD34k8E3/5Qc+24csoOtVizz47Nk
o3ZObgGizuDvipFI2n1ZkfEA9KktyPJjltc/HycPPZ0roeDGf3nQ4avydQ3S
EcYP7shyrQsTsZWabUt6/OxjalGihxgij4agYovmQXe/GWkuJ6OMcKpUIlCw
jbyYrbbzzDPP+85Ach2STx8V2ZpM9eI9LRVPjY4cBLToqqOqfZXWrOeoHmdu
ESi2kd0R8x270rg1HWUEAU6WJYjU5G+N4kNp0ywADR5fbFfJLcxIgbS67owK
xy9L87HAzSH9Dm2ai8gfBp92NH5RakvS/Vuw9XUGep8z2739iSeESibsqI3i
YdfYYoU4wTlF2BhsjoQT3IKbvNmJeXS7QmhgAiPFQCeY+XxXpGvc8NXOpDX0
fwtaPAL0EDSZ12geUncDEbRSTaDtL3GySk5MKdaY0geHDgzE4mx254adLB1a
jWpNqgR9fii/i7uCfpUf75ikNcwjERR/3a2+26Z5wXdibTAnp6PJyej8NCHg
Kluwrel+qAacIpOFRpBAlX9ycH/ctsfTt6d1h4/lMLACTKLOIvrHwJAVUGGt
tDl3ZyHt89EkR9O3k4Hx4NcR05jBIdiuvZgBawdXzI+HTVO744KMqkTsavUE
EhPLHPAzAmlpyFHGcHRmdWS+xeAfCZgKUNRkPcuKWTn3TI9tp0lyNDkZDPuw
CroQyIEIlCBsyEX6qZ/wNoeDyqApbEsP86M6cSD0WizVCzIrkZ33/LQOgbq3
5DhXktM1ImAv2oNgPZhvwDft8XajbCKa591f5R8zhCMCM64qREBBtzdwZMtt
bdCua30lq3yRRXbAoWC3ZU1gt9awyghjQrgFHLwOOzNbAOkHqwSLDgznbGIJ
Se4L5ChAC9sNh6epnZbQ0Gu0PfvzNBo5w2SX18KpxOJJsX1IBEAZ0Gpx7SYn
kThlYcIZMjTWYjzRATWDDaHG+4jFaJCDTEGdS3rpUaR+dDUphjoCg49xRfpA
NmkMTnHwn/axsoge4xA94QUlARQOYdPxjNza3TBiHhOchYYvdIQfr9xtJoAa
esjGHWWfstnWcW7jYYL4yu2cvCwsbKs9RPOhBAIS5+KrZ8jTZYr0byi+Fcjl
ee5ggjcCwo3VtM8P8Un7IFBpi9lsSWXZ+UG9LvJNQbUg23EAAUku1mxvcVk+
mPgK7ySB/TOUFri/lRQcQtJGlSqY+mpn+pC3sqKR4Gi34kibKMMgCAOdki/T
8a8BoWHt3S+LEK+boEKMna93fnvHaMz7shFYTWMlFBb8vKhTvSCADcOui4PK
enz4DBtvV+KxlX7oaEriSvQIcjASc50MfubJ4HgwPdSiXcUNqx11t4OLJBcV
Kmk74Y6arwg72zqyLURx/6bWTlQlgQh5gj994DgkS7GAxZ163VF8wF6ozjFH
5UgzwLiqbMUnsfqI3yiHDXD8cpm7QJlwEiamzFvaZYnyC+U4pCNRgZy/S4ej
Qga+L4ST+TemBBdhE+hsW1vnl07Z4uYDbcvC+6JAEmjHhc91wGmoiTO/BUKK
KscJfvl6XpJ2kh36S2V9qBEPNsrQJ7u7e2jJRvi7teMtBx2JtpB5GAwP2JLd
hYiN0nn11wXk/pB/3vVtt2ORgVC/Z99YyBCxRqQIFtaz+XWmkrbqxvauiDlR
hM6U9oCV6m3Y+OK/hbWX3f77oQYK7FgtC2RE7JYCq6w024UPlRHcprUqGyTk
wsSMPzFf8tJjz7NDkg9Oot1aN117nElkJU2T92Lj2yQqAR9p+6SIoxCA7moG
7lKskgrXNmKpZ3lklz1HY3SIBCR1WU7fTJBw+PDsM/G/I3ilCJX04c5ijeRA
R0o63CR0KvJut3biwzlUIuxF4kSggm5MhwwAlI4cdKk5AfFha48TghJm1b88
uEqrB7CUO7TDML0k/302eHBnkj/hwnjIAYRxDOXr0OdPv6DUwz9elc2yB2MM
ouVnRMD/1x1fc69d8/esNCz0a42MEZDX3b14Ipm+D1pwxhYJa62Nj4JILX7R
42UuNorioojIgrvGB6yYqHnCkOBO2rAZxOWuiKV2xJjObIxp7sQrEdnElU5R
9l6ksR+Lac8IM8kfXtEAjVXw9sdltYKvEi+2SeMTPZJQlDGJ18xhXNCup03b
yM1WSGEbmNd7TVBkFsXaiGoPomB39hE5Z/auCC50HWhypIEYpitcHcWH2wEr
YqzTEQIo7UWqHr2ZwPatgV2zAml3jsKFFM4cYcy7J4o7lqsEg1vKOQyyQED2
MPcKfJ+j2QvxshKEnLP2lTNKPF1hlNDOeEITDa2HXXJI5FkLQKR7TvqFCYmv
E4+/FTkZx4XUqRa1IGauN8S96Igk3hdRwafXdIQzWri47H+QHMZRQ4BPpjju
KGvBgOU2jndW1s5nzgslxKPHxgOvE6A1ttF0BLS5sDUlYy++MYrqM77mEh9K
gtv5JxPHOLRiK+d7IkQeLLqVAJo4m81NDtqJXELWOtraCtIY6W4dm/CkBL96
dnM5nJw9wDu+9JgfsqQBUohAtPmTMo+8ozOm7DHmdR6roQBVj+OxhoD8SJVF
HAXLdyLvoox5/+1kzLsA3dfKKqUKNW2kQNvsxWUvLGA3CI7iKOQ6CmoOQ2I0
WCa5JzYGZ+cOo1M5eMMrBxtnxZA4Av4uM/BCqsrQbiBxEajTktF25sVVEbPy
rmMLTa956yPVz0WR23UTJpXNDUHAmkC7x64Y+cyI6xgvGEsExsZwHDGfsp4a
TrECR59jnXyhvL0+CHrG7jGKgtYxitQPPCToO9lssrTyLyE7DQxN0l5Tmj9G
A5cIXS7xjVH2CTHV90JWrfHBCDCb5HsKaIUVAfl2w6pk7TCtgzgKuQ3EtJBt
9YIokJXscItKHGNDppYQp3041p6leLskfZ4WL6tZdzsmSuKkqoNGVtS0puKj
kRv08fnJKa/VjIIPKLGqngpjA3aEsSHEWOxO3tmRp9rBFTbOZxj4zXxiwgA7
Wjxab5SUNHUZZXbAlt1RDYiQ+7anE2PY5oZsnszSmWdyCi+0hy70ExFIfFQV
kx+CmmlQYu1cZ+opdTnlSFu06hqLK14KImcnRF5o52FkHojaxYRWBNHOvAAB
Sk1E2bp4BHh1beZEEUdq8UeX3BzIu8HQhQFtYXZDONtbT5EnO2OciqM1EMeR
hhaCy3dXGEuqexUuK/JC/QYXtWubZYMkgBHO97zuYYfAWco6E/dxNO74cgmg
4/16H5FrynZ/YnOkSlLLrfAxL0bFJfBAgRvmPW6JwIXGvvP2GKFy3Vy3ocGN
ghd6+jFjJoI+BPTM8WkIx+S9j7EUHEBBM/elIZqX8LJ8tdoi1pltodsKYdVw
7D9/1mmNJAYg8Pu6fkLFu7IRAxowoasoOQFoRQSc/SwdKquKL2y2iGmcPN/X
9THexk+H+PEZ/fc57Q388YJIl+I5tfti5wZZ27xTJOzQqgQDuXIDIQzHU234
GUcR6e6brpUmFot0HO++XYMGs12ZKXuMUN8Px+668F8AueqG7ttd1/6aoDd8
fphcbelNuiJ1LbqJw3+ZFjXh/CfPWGljK4RLL/Iu/aRRctjOK9sOshW8bjN2
eMPltgUeGDLDdniHy1GB/ABZkH/jCkCdIepne/E6ZwKYue8pbOmvoxFOdPS3
TmRPf0tn/lPhkM72NQQdhv21G2q91N3QWdTd7x5R3MCeEXX9+4oR/ZV+RoLi
B//W01BfF25E+/fD/v+v3Nkhi935SGtq2tHvHlG8u394sXtH9Fde6ufthQ4b
6vulZ2rxC64hYhjfMHs8YGq9DX3NWds/on3/vmqx721IFvvFPYv9j5vaX3lv
D6Xs/oa+go3sH9H/PzbCpPYNEhr+5/k3dF22G+rr4qtH9Ffe2z2L3drYrjU7
7ND23aojv/972chh/w4Y0aEN7fvmqxoiIeibxO7p723o/rP2FSPqp7Y/skbB
r39kasE0D29oP7URevkoHSTvS09GVEk6+Hd0NcDCDPSDe1Skax2PCtss7/f9
I6lfPXVOK0ms+IeI51gJUdizE0HzumR8x+NA8+DOH/i+MpS3v9Iy6SPJVGtE
YPasSa63aQVaeyYmuc7o42Gnr7LTt6a+vyaOCjahF1CMDqETMYhll1B3asjL
HMTOcLIaeFBo9ANZoxOXCbjH8pT4zhQ1jJMhkdJrBAkpyK4j+ShQVVB3RvdY
/IzNbEwKTOYUqI7aRYSG8tNGMIpM0DiMsGZ7kiybZ+oP1syG/lpqija1HXRP
kEWDhjIxzpNJzCk7LqtBOZttMUnelvxwV/C3JPBTMI/T1DtBeta7EebzcSbx
bjf3fT74ANWivvguKIyP8XRFJOoN/MfatRqvfg5DTPUXzbBRUW0NI4k3uvC/
UR8+dlsz6A5bQHlFwocJY7wlDZOgBfUmkBqGepSGhu1kYWYrzbNtR+OnmI+w
H9kntLzL1uQVw34bdJF7uPIg5zOsyZItXIWfjsyLl28seNqHkBuCXeyBv99F
fgTFePuZwRe+tbhzRoZnIHZ+GlCNiTU1ky6lD95UZLg8LFOb/D0YO7NcR6Y6
Mua4TK4dTjzfy9mdvqiFVI6XhKJFyJRWN2Jv1ZH6iQVrPxRHRiO2y9jYiEOp
l+WtpCMMEiRIHgrhUzb1envpZcn1SLgk/TYrv96Zs1aef+MQ9OpbhVXs2N/+
hC6dadFNnBadOiQMEgJkOKM5r36dAV8lQ7Y8Wo9jTKaDCijT8cADvEch6EDD
IuyOeQBqhJtunVM6wo/omXYxSNV2pS4mW/DCNzVi7R8fWeP8bGKyP+YoHGmv
Vu/8kOx0CzjZt+hY424Q1UN30Qib0fAYxrr/z3KKtw58158kL0g0WewM5Yx1
UAHK3TGyIs2BA3ZSm+8bofHDaNsJdCJzbujAGApvcGb5DWEBMiqSUkKDG0yt
DHv7W+QQDNNT42TJEEg8u6Z5WeTv2uajiicVxKSEUUihj0U95zhDEOweo2Hy
sYNiug7CdEma8haTVxMKnjyBXEhhsco+5YL0yQvhjx01okLgoiuxxBmpXKZy
YUUCygvhkzVfaPZOvYGLs6xqRRK7ijk+vJDEaXU8AhOzB9MVJJpnm1W50+CR
njowVjTbFkUm36OXnENiKA20Sigyp8ABc9aEqXXJu5tQIUNEL6AMSFIZIbto
ZdHNJJRPPAaYHi6zAslDpG90absUjkZYaGc+QotZcOFn2mVERxiXI8nZYVn9
fNLuXojPKxB+xIhEFq3R3wbjcHf9UA5m4HRNtO7O+9PLk5/ev0G3ysXplP4m
h2z2Cd8noDlcx9w2OvJhkXBwsRc3kQgtlpt0SCQAz/KNZEW3xX7Ovj/HNKzQ
zavvzwWwk32CW6lWICmnVHVANDdwSxFhRlPvQsUdlTxR7s7uuTX2iq8jQpON
OtIayq1iExii/MqKCl7PEgeZxlnBbdrMA/KeGamxkHMUrwMNeozc5iLvrtnA
dI6gmrH5yUvcK5n2Wxn2JWYUgd0UxSiIsHlJNzP78rSXidQYeUVhgZgjErMG
JmetlOiYgvwaHbDO7ewNVkuVYMEOSkfk5Q2H5jjfOAJaMZoDDp6f12/g/Jed
cga5fYMYYGwydjpz4Y/nT54/vbtThy88MxWN69n4KZH2cfJoiiFeoo1iS8AR
VjvMNyXL98hyWhj3DihhyVm/qShFVkk83WxZlrVfOuMRNVYA+SfLcsMeNmIE
gWbqdfIAI5yyOd5/D3BPH9CdjaIetCO8/8GjcTKhledzK6Cjw1ael32AzamX
sVuQYyvAHoBiLfgwTRKom8BYCi97nWOTHqDMHyO+1T1MK6SFaFyFSFKWzSXj
CrkQiahHDkNAfKwnCaBYCSyl+cOLI0A6zCtRCmcq71VwhnphFzE9BtgfdcNH
+qBnTqiMJJHV36ncl+SNfPT+kZSA4cHTo49+fAQL+ytI+QXLLiXVeSuy/BrU
ALrxgXK2ayYciyVguBzlOCUp6tG7R96R7g55YN0DW2AuIJH1ChCpuUVXtJIG
zKRq2qSaMVKokwrqwPVNkw377T8Bpv8EOAbDxfC61k6qUbDFzrigB0UU6uM7
1xhJbRLu0pQN4sZsvoMewqkVk5k2xg+DhruHs4JqiNmaD0Aq5PWo9mcFp+Do
/Tc/Dn750ztpcWx+QD4yRI4Piz/EGbLAjfuLN+Y6I+ubhtRJGjp7mOotkoAI
j1wlk3fTRdOa+w8GXi7fc50JL+F4eLeEoRu+wpUm7Xfx7jr6fkSgb4ajRmzC
RNDvoGiLxUDnjVoHDsK6DY0P0RVBsYPp9lGcHSTr4yDktTC2FzY8x97eHpib
UD9yvXhX6f3Mvg0d9h7By2kElxPIbKzuahe0wIpmD0QJisJcKKp2f2kpje2P
yoMmgjxSrDtzcu1Uw7cc05cc7laD6RNzhsncMwsaxc/zQUPxJ2LCeRGIHWJx
90fBiQSyuQew98ul7Luf4IB6j9ZY2GVsJqvVvmDJfkMVngpRl/Q5HqcgjVtd
JT2KB1UUtitJbTzCC3Nj7hvDuHObdIFai2NTBVgwriowMJxcgb2MEGqtUwsn
i3mx1VTKT1LbiOLFO4CHZKFB+LStbMuJCgKDYLdvIkbbcbXedteIVKIz73rW
0H+LjELYOOz1KXs6MNsD2SygLSQCqhaLFm280+xmtDqq/UnqVklFkU04wHsJ
yEZA4GVlu/TGJ4s3C4GkHWNiDDnNBD1cDRd0okscLifQLOmwdrzolq2D/nY0
p2AtXOClsXPt3rlJYTPrYnagLYlzaJ3QUoueZRUurKZcj4jQyK4raLHpBag+
v46mZ6+9nIS8u0etyVD55PPTZ8fJ0ydPnrLr8i9PnsLn86ej82f6xbPn8MWz
ETxonLv1Mflffznoo3xyL3+BXp/Cf+l7+vg00Y8j/PgMPrpPp8+8NIDJL/T9
44M+yifyYkqAx3FivuGmv5GHoo/tL/Sz+ZKcnScui9kXWq0gtSKulvviCy0s
DP4P9Hie7kZBj34Htgf3WUYIb74t07n95fAu+Y/km54ekmgREh1i7Iq/t0cd
Yfxi3EESLYIb6n099vcQNtjbYl8D9nnrpfcPpHro+dwBo8GTJ/dJk/CTlGvE
uyweUI2JM65r5wNP9Z5Rcc2xalTcrzidOQgTnzD8SJ417SuJlf34enAN8lMM
wwW2tN3wXbgztv++ay65tFpGaqNJRXv0rEumfzLU2lCtIXi3MgZbujFRHHSQ
U4MjfdglJPdYx+x5W0LnFKg5o3rlM89kH//0mWTSwSeTXlaZ/EFumfxBhpn8
Tp4Jf58RoEUYp0laR+xwrpK0zvUB3PPN5EwywP6xfu/jodyP+yxcO3EM4Pf0
G/0Wd9PLuzswTV/Vb/TvdzPwQ/rtY5Ad3RzMxrv63dvPgcx8fzMxS3/I/EF5
Oe4dKgM+t9QcYy02/nNv0jc2vFARGL9UZ6yxeQoJ8U14Wqy1HIfFBnD4+ubP
BAoCjsq/D+73GnQV/THGoclwli0fqAjVHHWEfoprzQUUhXNhBVo0hqF3iktx
cvIIh13yS1xyzJUXa2qhCVTBoG7Q+YWJIDWfSZNW16C+UzZIYy66gqa8Oif4
RugZ64wEEeiA9dNawFj2SdyRbvq+Uc05ekecfnCDqQZpO4xEBzoEVGjtb60v
pUAbW2Chj7Gx0VWgYnSOvzvMyPieUK8mSWg96AFBePKF+NYok6dRe05XvNY/
i+2N1z+IuzIhwhHXUG00XTNyMEEKj+nFhSENnJRoxNM17s13wnHrmAlVbIHb
q1GLJI0lScxd4vKVBSQ+1uMNc2Vc29DfeFTdyj79lRsXPdvuiWitVESNTJAy
IVCy2zTmn8TZEoZtyzu26bd/DEZLHEpKOhw9JUCcUs0da62PyrxT7pDGDyMl
L2wm9uR8ndkoMuNCc+WlMDbaMxMjhCrVXIOBz8J5WhVueXnqIy7bBcAc3pLr
aGrgbYo7pdP3dtzmDWVQZsUbTiP0aiG26Ol+NtsqZKfwwh9e3ZE+6grAuxK4
w9i0qUU1rZWOPQZxVSvGxbAVj5KNpe3+KfsM+7LjQtueKdY57xSnIInIxHAa
1wQ8mSb4Bpa4YwyIYEebUkpXhdXg7axHHP/sglQt6Kk1bpuCI+fRoie+Kihp
b3ll2VDXonm5OoJ8AR1O7j2lya/LdOXSpVASiJyuAZcY2VVCBma8ZUbS5kF+
eenIxX5PycmJWo4oMYfy9Vb9p+6q1nhJK+TGP/Y2dWKQXSLKSqC5Y/YW39LS
3S5+lfMcWJC0Vsk1nEAhqCWeBEZPPdxeUpQO87yJzPMWic6G0beTI8yzYszP
SK09lRSTI6XFQUepdDZT26V1oCUW4HQ/gFnD52t35YylDKnWfrJlm3BtOyfA
SE86Y3K44ExRfVZymfhJe+Du+Ve8PA06Q5tEwXCIU2nV24T5vZrUA90bm5FY
LJ9UsdlHTJzCaG/SFZ18KbX+5vRkIACEZy+++5Zz4LXJrjOLUh2RVac7qk/6
kBOK+QGJ0AVQ41jmybSVC8lSiX2oa1gmduGwVNl1KO3QGQI3acJUWcyqT9rZ
ZCxwVF0kFrYS+7AcfEgzbcXZZ3zfHIbg28RbHv0IEMfvzSbMYl9pHlqVurJ0
Gc/XeP/d5mWZ7cqOjmijj9nO5XhxF6mXR6sjBGKnfgHnPMVlwoKOxMX2pmmx
jbjUF/qN4YzKzDQD0H4IzfeRgY99D4NV1YyPCRy74qBeZhYi/FW6SbQQZpBg
hlI0CCiisDKyN/aJ522342cgHuEqVNFS1D9d4wSJQjSbj/6zUDzodJ034Smx
I7aAwA5PHlF+pC5E4EA7Jp77irxj15mlGjNZMPAtkxTwPFxOAI+M5bsnz+7u
JCsu7TiD++jPWVZRDXXOa0HoAiWk3C9nbqu9uYLZi8hFFuS8igDWcX50Ssfh
ILwgHIBUpCO385eUOZpYlLQKzO+GmFggmcnqGqXx5dpHex+9mbwemNY62ET4
q7oaIap2lMLbd3cMKEEiHNkjd/baW0fDi/jiL0+/1XSte47tK61V//khzF4/
dQS3wMCv0aOPe8Z0Qwk8+fLuCP9wifIv/UAdToRMhTPsZUBZeOtNyf7tPagF
EyqjNkciZ5fisuawELfZiuo3s7ShP1CkAF6HfGt2RYJQ3oYC4UiETvPwhwcU
xo0OBWIzrtNCNK9HlHEc7oqMMI5o7JmeC55Gx2DhUWQbwvVgyYNAOJimkOUG
FMDnIEewwtTK4Vmh0QIaqjmATrgW6+YdqavfTmquxujgbDbFVTEfNeUI/nc/
98cazFRRvuYy5R5t4O0oFKMi3z56sd0zhJ7UiDDWy4LhQuRSey38VMGpi+c7
JJSvDsgbGXa8IypoYP+dFOp6D5Nh71xWXaAoxH/nftZVgYAg6wAFl0E1eo9r
qeQIBc93IzWFVkHpz8N2fjtqthtSmBOxHJJ9C0UXogSLiGaDYS3QmhlKLaUm
NqbT1KjjRQ4xpjmPAnU80ZTBHXiupawE/i44IcXGWwS2Ugen/jZcVSBFdmuD
P4IoMaRqjidZCEaNxXGYN1K1ZBkOXiGSondwBzuDuzSzveDHjRd/xsvQGQqU
xKFA92Q2zdbow0dZTC/mcN26CC6dzyNAO3kSCxD9e4A3+xVI9ORQo1zS2JG7
YcyC5F0OmXMkbQfxhTbA2VnJmt0G2vOCOrv1yx5Qzj0850wZuvAdkbsCPu8M
ERLipWRnk3+1Ie+NzYtbf5VKjkfbO9ESAmU6dQFPtNZcct6rLAMyJzBtzLsT
iH1lJ6x63SIGzzDUTQ7B9XV7SFpeXWnR4H0gH7steModE/AzCrduf7SmmA7T
zZg32m9v/xVihTij3NG3NiEJS1NRPl01MiDA2j7N1jQcWgRjZIGRtareVKyd
6rDxUiH7CY2Ds9GZzrh7Cw84MSoMvZdM49A6fXkFWj4IfefdjGSfQ0BMtlYW
k5zRXMmZE4VaGSyGGihujt1VkmjPGVyMqz4Unl7O9gZHRWLHs3j1BCjFybhx
Y7xzjhb/tQtO6g5DYVun7dEwjry2gUs6P6JXnd2hPF+3XE0YbOyS2bp4Vyes
xuxpPfZtLk5OC4LAYUZDexbD9INRcYtU6q/pHtpYqI6TNhp5oVmB3E1GBf2k
mcqjxKC2VoCMKQJWqpSoYJgQsWHIneovX+HIjra9a3e8QdHJLTFWBYNSJQVz
kDYQpIafpI4S/bikiF5v0G9RONfCHOWmPcikY5BXeDWgSoFpJ9HeSyGD2Xxg
7FEPB2rnUSJpauTgp0bzRZLWa/kB5feMYCwjIiDcMQ3ydmBAPPsRmoWmxmgW
/PTy5cugZmOGdR9mWonx6Z+fPD0mtEnfPypk6b2PXsNWGwiVeWY/IUjmuf30
Aj69sJ++hU/fhuCZl8G/3uquh6eCcWP33zkQoxO8EwBxEgXiJBaI85zxD8E7
B2Jxvm4+jH5wq/Q7Xj78lZ6lObwBWJkXIX7p227cS8+/7jUzIdncAxkKPkdg
qwAw84WItA0Par/4R3oEyvd77AZ1/iN7jLBYwQBCTM3X9BjgpWIIW4jCCtFB
+4a6H4Ll/+sYqgdkjXBCvS9G/6IBHP7i/qE6nFHAwBVwdIrxxvNWNL2r+BZf
Iejy4iq3mH1+fcWBg/dVoNHYbt/3xdILZXrGZlIfsalSjly8tyD7mnlez7aa
/kKSj3BFmzs/kUtkBYq0kLnkpzJhXifXnyKjRLTCvtDiHRokh4wc6mmkqw0n
ANjWPCDS2FWfszUIhmxpni1FsiXZRFMTky1jWzR2sVrJkoN8/Zed+pNVSUUo
jku0yP3ar1KpY6trSolmlxedrEOEHXvjogAiT55kZJYrN6G5mDxdYF76UkDU
geHqH+TOKoWmccTytK0LLaI7S+dxb0ZJX+27D7WQls2oXhbdUZ+gCLWKNbF9
eFtj5t4wuQOZvsL6UIzh0dJIqB/PaCgoOroAS/vKDVEWvpLVaMrhaOIDqtfF
8rRvoj6iCO7RM/yC/3w+8INVnHsor4BoV1wUjLW3vsEcEk5ENJVV5kNeUZrj
C0mzgLvp+ZKPPly8GYh/ZhZZdLlga631IM5Vjyer8tH56UCx47RyivVwuX9a
U/OiolKz32hD5TmS0/42RVEwflo6McQyDO7D28l7Npny0bSVR73NoWd8m1x3
bRqtDjARN2Bpiy2EROcb97xQy9otAK2UQypEaLVLD5RnTWK4CZJ3DBWk9jIT
K2a0pXoSwvByjYa0o2i5emQgOk2ko2qu07RAFEUokoeccTWS2x+TMjjWYRML
sd8RE4KQmYbjaR0oc502s6VAKNXmIHb2XM3ScK9xzRitFWPEAA5nmEFLzn7l
yijde2B5qXmCxoOheuXBqpyM1+SnlURMnrofQZRkib2z23dKfyhvcapDBLJY
l4m3eB0lRkrj2UkUJUeATDETw7rNltmMCwos4WRTWYnAx9hJ1xcCAcNkQjVz
VpfG3qXPx66uswL3RxGLlf+mzahJXox2uUGK0LbGZ/+ig3tlteU9aCVGCzOS
GVMmE5fYjjGiXFrdP9BddYfpVTg5hKPpq8xNLfouOL94aV8PqLhzH8kZzYcz
L9FzlCYPX+wolC04XXhdsEmTk3srg+tsqe6YVgdP4CiV2+tlEpQJV44XeYPJ
eaS85xOx9CSYJokYdp/6lvKVnyHHiybtKuespUU8tp/sj6wMzocv7NLpLHTF
O0rGSa2g5NctAayll87a5SWLijEqRUbLXEsy0unsuHqvSRRQk9saTsxu4wLA
Lg1UjXnF4GgX6n3ogNXr6vf4LygzGZVJ4otAxMEIqsLhAE62QzC+u9iSBA4X
Wi9TGDfWQB5itV5ZauDtVzY2yyR00UQzGvan4FtUmeRP42LcmbtYCA8ULzTt
gISLF5rVSdIq8CGSneiuwq7EZXFy0DH5/HUfbUnwEADYGkaShOXg9fgjkRIO
B7GCFuHTU4uVvKCa2aNvD5EGCE6vxT484FDnsa/VX0QCM2Gnp7awGu5zVOUX
OP1E5FsGikHL0VtNTzlZQjhPkVJHLuHE5WkAdmmytB5Vi9nzZ989u8prhLs0
LWULrqN009QH4LQDja3rF1VmbFNe/hC4ECjeRmARtkhz6wJxmCVxOlOBD6l/
V7vkMQLm1JGGiQaJHrHWFNfwkjPcWVnFr/QEPU63WvUpSCVoWaKqaWaWIQRF
qjo5KqYEkq3oE6kzRN5JP9cnFaVnx8pRWrOCBC3O8Qai6V1MP1CpqjHurZch
jQJngDjmqVfq5Oz7c4U1mM+f/xumtfrz8yd3d0R6/MW3z598e3c3YPXw1ffn
o7dT+eW7774VnJhdYuaRuBimXW5NHTT+/nfVWNJMq1a/lfR7kh3I212KdiAv
zkYsMPy9zKgrImZANOLEbyLtmReuEBQ18iwHpjdSyA8B4tuLC8qpomZYUbvN
EluRkg5VVWpFuCh5NCXnoa8USSTpDVBXt6XMtCbZeA9X0Cycl37axH4GoSA8
tu4ExyzKtIoQyuuixBAUmY+DYe4stBZure1Grj7RLnCz9gHXw7xzotiXReF5
9YF1Sd1qYSYidvgSqakDwcRmVnT2g5adJnLgO+dQVyUtvcjVPWzuLY3HUjfw
V5JyAosFk182F3nRtutH6wSROtDb1a/qUKeQKZXXgXdWGhXESWnxGOHRIyOk
MAfJk9S5D+cUi2T0SeEKz578BY56FPWNYS9wzb6dntc+mlAmE87V+NmSXMKZ
vaQQZCeOsj3iyzJGY/FTomfN/SxbNEZRPm0pPrsQNHZ0lB+EKcIlnF4csHrT
7JrOiRpjjqYXCtv/pxeEro2Xkk4KWeBC8xYsqwmWtbPbcK2F2GCkaQWKN6aC
x3piGl6UelLJ1TZfMcoDKPtjGIyiwGEftSiV4ZyCKJGNAUaix8rHmXxgVE48
pLszHoMoPcfG/AmftklX8eqtEnUit1G9Y3zeKyFvDW8coPvh/P0gtAFC40yb
1M9PG/FCD5OJB0EXOeydi1k9+mnyjsuMnrOOThY1/4HzdwOY24XeMSkD+0Rq
dzxITQpkw3R2DBmVIOCAn0TEpJnL7dpICBm+yD9ZZiQ5dE3AI0riHflN1mIT
/DmiTBpqZ75RXUwx4gQ7Gw5I2gzg4fGGkoD8/XnHxpoj/G5kPw+Q3pGkx5Q+
VHh8kAVXKpg6pWB6YcJGWJWkQyXgCVfv0m6BGgX2Tb/LIAsNRL3Z8ys1LdE6
GzyB9DI9e10HNQNZ/I2jbf1DZQdh9Wkr3OHgr7IG1VlMs5eRqt0KdA3SNu3t
g6jB1hxk5OAh88RZ3Vf24VxZ+Knl8nAHxXVfA8jTlSQAnvNHQfM4S5mKhE4a
jdxbvnyrn1j8HXryr0i5OO2z6dl0mPw0PX9jpWF390TJiD9JFK7N7+rpJB02
nK5gWuIwJ6dHggem4MaNuC48aTFOB0oqkDca/1JUBh2nBrVUYUMgiOaMzXws
+LpDwbeXyzgjtqtt70V4eFuZbptyjXxhnNgiDIJLMxEuzU+9La9JD1ZR6uyx
Kc09+Kg0+ffJ++/jzN8h0lCL1rroPegrTqwtfFUqIdQYQmRhww73LWqK5NMW
+eDPz148RQrU1NoqNjx58USiT64vzk9sEKGyaYnJhk4XWD3UXVwVSoTZDcfL
tgmwI1+Em48i0Vz4lqxBvExoY++jC+MLUMlP8BhmWUeqO6vrLUUslGzZg2km
p3B+y+o4OV9h7lAY/brEAASkr1rMDxRUTyby7dVKylYQzXnPVBnC19EFWoxI
rOBkpvXW95IncOvh8s23Nib0Z/b4m+8pJ8JkLq4RmLajBTsfWhV0RtzC8a7J
QCdd+Lkp0TS2M64ehQYHYvZV+EZ7trpVODE8i2en0+9hgk/HmEObCiODtodI
hE92vmydYjquA6pt63KIjwghAdD4M268QZgbctMVSA6CbPZ9ABZk3mMlUzw9
dOEDcxuNXDPPx8D+aU+BJWHAAVliJLKLlsxCfhV4jMf0xTg5BQ27rCRNN12y
byYWNWyho4QWLErnyXGZWZ0HCYfX2NLmaRVwvvC4Q9/fjjH61i4HAz183tYs
KzLOR4zCc59DK392rSwVVStOkQRFlcqqNftM8+omwBm8ztYg36dCoCC/JS4j
SqC7a2byF+NnmDCEtj+y+dFfWtKEdWcii+/CuQekgF/ADmJk5a5ldJW0CWxb
tkGTSRLU0/JzN/wTeoE3nO6aVsgVvfIrt3mZpTl7zzwq2IR9cI7GbO7QE8b8
BQnvBm1Unz8HsOs7Fhh5vahnh6dHGE0b3UNdlLcFWwoSlwcbzugTOw04YtkM
OEuzOwkwrtBhWfiCSi2PIR0BGXOoWjnfKlrTxt8ovWA/T71+/MhBatxL72tj
vmz5q5H8khImnyWzs8n7SRIOUxiqZUvLFLkpP5nO1KD3MNFJRq9jHHL39Fk6
oCFoGodYHMnrUIoFNWYXIcQXVvsIi5C4wxNXPFFQMruy2fcL0uq6LCwMBy7G
KuVCPqgwE6n643CNo268qgMtkx3DEgQxDzJLCEiG+2T3ZEddtAmpaxmb7zzM
S3TTa/YmvBNtdW00imkyHSmBxPlkKMpcFc2Wm84qnZ6NS0JzJHLHuDkL6oJV
ioHNWxrkfSi0Vg7jqCwWw+6x8ZSJqNQOxQ+z3oZ5m3Lgbvlqp/Z/KWc0B126
IF+zIatznVYqklnXuYIVugx3YbcUH0HBP7+KgTEIDggyRcR5q3OrwKshA75c
NKNyMdKl4XHNcAuwSk+Rpyv/57ShHIgW4A6cilJ1IJCCR5S5SD3kaVkjXvou
0zMKxoz3Aeq8zjGPkqej90VS2WJCeAWCyoB2XQy1bVjmwggyMbMuGqnO0z0N
WyuIAs7aQEWNQNNwRDoMTQerAhGUg/EtX0yl0Nh1JbZt34MQnVmXTxvFEG6Z
+NRk9rEob1foJ6esEzRnUB+WJaZGp2QEq/xjxpdwCsraj9Vvu/q3Bj2Cv6XV
x/I2n/02TKa36XoHeu+Pw+Q9rD0IevC0+bHK62WRFkNQZNOr5Ta5SH9NPsA5
TEFIho8/ptW2SD9iRhQm4nflMsXE+8C3Z/BMXhmR2XIMFr7JQcbrLG9GIUvE
YnD9QKrfshIP8uYV0lLJBbjacyNMTzjBybzKsWYLULpoOvOsAWrCS5Xho3QP
SNAvshb1uL2fXjgTIEe5s6sBdS/oM4aY4LGGIW9hEKwW+YXrvCkeU5wEXnon
5QqO5au0apb48e/bIid9XhKq43ensLWr42R2hQ+9/JWfGANZEOZ8WuWYty25
QA8daOKr/J526pqeajV0gkEoVQo7usbKE/h3cd+Q6gy2utVSsN74xU+wL6/L
a7o58f4CvQO+/deCHNI/wkcgX6/ZlN5/Wa7m8/J6PCvH24+0XP8PjANnYlXc
AAA=

-->

</rfc>

