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


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

]>


<rfc ipr="trust200902" docName="draft-ietf-bier-frr-11" category="info" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true">
  <front>
    <title abbrev="BIER-FRR">A Framework for Fast Reroute with Bit Index Explicit Replication (BIER-FRR)</title>

    <author initials="H." surname="Chen" fullname="Huaimo Chen">
      <organization>Futurewei</organization>
      <address>
        <email>hchen.ietf@gmail.com</email>
      </address>
    </author>
    <author initials="M." surname="McBride" fullname="Mike McBride">
      <organization>Futurewei</organization>
      <address>
        <email>michael.mcbride@futurewei.com</email>
      </address>
    </author>
    <author initials="S." surname="Lindner" fullname="Steffen Lindner">
      <organization>University of Tuebingen</organization>
      <address>
        <email>steffen.lindner@uni-tuebingen.de</email>
      </address>
    </author>
    <author initials="M." surname="Menth" fullname="Michael Menth">
      <organization>University of Tuebingen</organization>
      <address>
        <email>menth@uni-tuebingen.de</email>
      </address>
    </author>
    <author initials="T." surname="Eckert" fullname="Toerless Eckert">
      <organization>Futurewei</organization>
      <address>
        <email>tte@cs.fau.de</email>
      </address>
    </author>

    <date year="2025"/>

    
    
    

    <abstract>


<?line 83?>

<t>This document provides a framework for the development of Fast Reroute (FRR)
mechanisms for Bit Index Explicit Replication forwarding (BIER-FRR). BIER-FRR
can provide protection against link or BFR failure by invoking locally
pre-determined repair paths that can react in the same time-scales as
(unicast) FRR for MPLS or IP networks - "sub 50msec", and without the creation
of additional per-path or per-flow state coordinated across multiple routers/LSR.</t>

<t>BIER-FRR can be implemed locally within a router/LSR with minimal interoperability
requirements against other router/LSR. It can therefore easily be introduced
incrementally or selectively where needed. BIER-FRR implementing nodes only
need to understand the routing topology of the network for calculation of
repair paths and know what type of unicast encapsulation can be used to send ("tunnel")
BIER packets to remote BFR.</t>

<t>This document proposes and discusses different options for BIER forwardng (BIFT) extensions
to support BIER-FRR. These are exemplary and non-normative. This document does not
specify any standards or experiments but aims to support such efforts.</t>



    </abstract>



  </front>

  <middle>


<?line 103?>

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

<t>With BIER <xref target="RFC8279"/>, a Bit-Forwarding Router (BFR) forwards BIER
packets based on a bitstring in the BIER header using the information
in the Bit Index Forwarding Table (BIFT).
Its entries are locally derived from a routing underlay (<xref target="RFC8279"/>
Section 4.1) or set by a controller.</t>

<t>In case of a link or node failure, BIER traffic will not be
delivered until the BIFT has been updated based on a reconverged
routing underlay or a controller, that also needs to be able to reach
all BFR whose paths are impacted by the failure. This unicast plus BIER
reconvergence may be sub-second in well optimized implementations, but
it will not be the "sub 50msec", or so-called "Fast ReRoute" speed
of recovery which this document discusses.</t>

<t>Typically, BIER packets are forwarded without an outer IP header.
Consequently, if a link or node failure occurs, the corresponding BFR
Neighbor (BFR-NBR) becomes unreachable.
Fast Reroute (FRR) mechanisms in the routing underlay, such as IP-FRR
<xref target="RFC5286"/>, apply exclusively to IP packets, leading to potential loss
of BIER traffic.
BIER traffic can only be restored after the routing underlay has
reconverged and the BIFT has been recalculated.
Tunneling BIER packets can serve as a solution to reach the BFR-NBR in
the case of a link failure by leveraging the FRR capabilities of the
routing underlay, provided such mechanisms are available.
However, tunneling a single BIER packet does not help in the case of
node failures because many next-next-hops on the way to destinations
need a packet copy when the next-hop becomes unreachable.
Given that BIER may carry multicast traffic with real-time
requirements, there is a particular need to protect BIER traffic
against prolonged outages following failures.</t>

<t>This document introduces a nomenclature for Fast Reroute in BIER
(BIER-FRR).
Upon detecting that a BFR-NBR is unreachable, BIER-FRR enables a BFR
to quickly reroute affected BIER packets using backup forwarding
entries.
To avoid the generation of redundant packets, backup forwarding
entries should be processed before normal forwarding entries.</t>

<t>The protection level offered by BIER-FRR can be either link protection
or node protection.
Link protection is limited to safeguarding against link failures and
is simpler to implement but may not be effective if a BFR itself
fails.
Node protection, while more complex, also guards against the failure
of BFRs.
The choice of backup strategy determines the selection of backup
forwarding entries.
Examples of backup strategies include tunnel-based BIER-FRR and
LFA-based BIER-FRR (Loop Free Alternative, <xref target="RFC7490"/>:</t>

<t><list style="symbols">
  <t>Tunnel-based BIER-FRR: This approach leverages the mechanisms of the
routing underlay for FRR purposes.
The routing underlay typically restores connectivity faster than
BIER, as the reconvergence of the routing underlay is a prerequisite
for the recalculation of the BIFT.
When the routing underlay utilizes FRR mechanisms, its forwarding
capabilities are restored well before control plane reconvergence is completed
with aforementioned "sub 50msec" speed.
To benefit from the rapid restoration of the routing underlay, BIER
traffic affected by a failure is tunneled over the routing underlay.</t>
  <t>LFA-based BIER-FRR: This approach reroutes BIER traffic to
alternative neighbors in the event of a failure.
It applies the principles of IP-FRR, requiring that LFAs are also
BFRs.
Normal (ie, non-tunneled or direct) BIER-LFAs can be reached without
tunneling, remote BIER-LFAs use a tunnel and topology-independent
BIER-LFAs use explicit paths to reach the backup BFR-NBR.
Unlike tunnel-based FRR, LFA-based BIER-FRR does not depend on fast
reroute mechanisms in the routing underlay.</t>
</list></t>

<t>BIER-FRR describes extensions to BIER so that both strategies can be
implemented, but it does not mandate a specific one.
The BIER-FRR mechanisms described in this document adhere to a
primary/backup path model, also known as 1:1 protection where traffic
is forwarded either over a primary path or over a backup path.
It is in contrast to a 1+1 protection model, where traffic is
duplicated across both primary and backup paths.
That principle has been implemented by Multicast-only Fast Reroute
(MoFRR) <xref target="RFC7431"/> and was explored for BIER in <xref target="BrAl17"/>.</t>

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

<t>This document uses the following definitions:</t>

<t>BIER: Bit Index Explicit Replication</t>

<t>BIER-FRR: Bit Index Explicit Replication Fast ReRoute</t>

<t>BFR: Bit-Forwarding Router</t>

<t>BFR-NBR: Bit-Forwarding Neighbor</t>

<t>BFIR: Bit-Forwarding Ingress Router</t>

<t>BFER: Bit-Forwarding Egress Router</t>

<t>BIFT: Bit Index Forwarding Table</t>

<t>F-BM: Forwarding Bit Mask</t>

<t>PLR: Point of Local Repair</t>

<t>LFA: Loop Free Alternate</t>

<t>BF-BM: Backup F-BM</t>

<t>BBFR-NBR: Backup BFR-NBR</t>

<t>BFA: Backup Forwarding Action</t>

<t>BEA: Backup Entry Active</t>

</section>
<section anchor="ex4_bier_frr"><name>Definition of BIER-FRR</name>

<t>BIER-FRR proposes a backup BIFT that comprises backup forwarding
entries.
They are executed before the primary forwarding entries in the normal
BIFT which is also denoted primary BIFT in this context.
In this subsection, forwarding actions are defined and the structure of
the backup BIFT is introduced.
Then activation and deactivation of backup forwarding entries as well
as the derivation of the backup F-BM (BF-BM) are explained.</t>

<section anchor="trigger_for_frr"><name>Definition of Forwarding Actions</name>

<t>A BFR-NBR is considered directly connected if it is a link-layer
next-hop.
Conversely, if the BFR-NBR cannot be reached directly through the link
layer, it is regarded as indirectly connected.</t>

<t>The following forwarding actions are defined:</t>

<t><list style="symbols">
  <t>Plain: The BIER packet is sent directly to a BFR-NBR via a direct
link without encapsulation in a tunnel.
This indicates that the packet is not forwarded through the underlying
network.</t>
  <t>Tunnel: The BIER packet is encapsulated with a tunnel header and
forwarded to a BFR-NBR over the routing underlay.</t>
  <t>Explicit: The packet is forwarded along an explicit path to a
BFR-NBR.
The specific path information must be provided.
If segment routing is employed for this purpose, the segment IDs
(SIDs) must be specified.
Two forwarding actions of type Explicit are considered equivalent
only if they utilize the same explicit path.</t>
</list></t>

<t>In the BIFT as outlined in <xref target="RFC8279"/>, the forwarding actions are
implicitly determined by the connectivity status of the BFR-NBR.
If the BFR-NBR is directly connected, the forwarding action is Plain.
If the BFR-NBR is not directly connected, the forwarding action is
Tunnel.</t>

</section>
<section anchor="backup_forwarding_entries"><name>Backup BIFT</name>

<t>The structure of the backup BIFT is given in <xref target="bift"/>.</t>

<figure title="Structure of the backup BIFT." anchor="bift"><artwork align="center"><![CDATA[
+--------+--------+----------+--------+-----+
| BFR-id | BF-BM  | BBFR-NBR |  BFA   | BEA |
+========+========+==========+========+=====+
|  ...   |  ...   |   ...    |  ...   | ... |
+--------+--------+----------+--------+-----+
]]></artwork></figure>

<t>The columns refer to:</t>

<t><list style="symbols">
  <t>BFR-id: the bit position of a BFER for which this row in the backup
BIFT applies.</t>
  <t>BF-BM: the Backup F-BM used for forwarding, used like the primary
F-BM.</t>
  <t>BBFR-NBR: the Backup BFR-NBR used for forwarding, used like the
primary BFR-NBR.</t>
  <t>BFA: the Backup Forwarding Action takes values as introduced in
Section 3.1 and indicates how the packet is forwarded to the
BBFR-NBR.</t>
  <t>BEA: the Backup Entry Active flag indicates if the backup forwarding
entry of this row is active.</t>
</list></t>

<t>The structure and semantics of the first three fields are identical to
the entries of the primary BIFT, as defined in Figure 3 of <xref target="RFC8279"/>,
and they are used in a very similar way.
The BEA indicates if the backup forwarding entry is executed.
In that case, the BFA indicates the forwarding action for the packet.</t>

</section>
<section anchor="a_backup_entry"><name>Activating and Deactivating Backup Forwarding Entries</name>

<t>When a primary BFR-NBR is not reachable over the implicit primary
action, a failure is observed.
Then, the BEA flag of the corresponding backup forwarding entry is
set.</t>

<t>If the primary BFR-NBR is directly connected, the information about
the failed interface is sufficient to detect its unreachability.
If the primary BFR-NBR is indirectly connected, a Bidirectional
Forwarding Detection (BFD) <xref target="RFC5880"/> session between the BFR as PLR and
the BFR-NBR may be used to monitor its reachability.</t>

<t>If the primary BFR-NBR is reachable again, the BEA flag is
deactivated.
This may be caused by the disappearance of the failure or by a change
of the primary BFR-NBR due to a reconfiguration of the BIFT.</t>

</section>
<section anchor="usage-of-the-backup-bift"><name>Usage of the Backup BIFT</name>

<t>An incoming packet is first matched against the backup BIFT.
A row in the backup BIFT matches a packet if the BEA flag in the
backup BIFT is set and if the BFR-id is set in the packet's bitstring.
Then, the BF-BM of the matching backup forwarding entry is applied to
the packet's bitstring.
That means, the packet is copied and in its bitstring the bits other
than those set in BF-BM are cleared before the packet is forwarded to
the BBFR-NBR with the indicated BFA.
Finally, the bits of the BF-BM are cleared in the bitstring of the
remaining packet.
In the absence of a match of the remaining packet, the normal
forwarding procedure continues, i.e., forwarding based on the primary
BIFT as described in <xref target="RFC8279"/>.</t>

<t>Note: If a BFR-id matches in the primary or backup BIFT, and the
transmission is not successful, the F-BM or BF-BM is still applied to
the bitstring of the remaining packet.</t>

</section>
<section anchor="f_bm_computation"><name>Computation of the Backup F-BM</name>

<t>The primary F-BM of a specific BFER identifies all BFERs that share
the same primary BFR-NBR.
The backup F-BM for a specific BFER is computed to indicate:</t>

<t><list style="symbols">
  <t>All BFERs that share both the primary and backup BFR-NBRs of the
specific BFER, and</t>
  <t>All BFERs for which the backup BFR-NBR of the specific BFER serves
as the primary BFR-NBR.</t>
</list></t>

</section>
<section anchor="alternative-representations-of-backup-forwarding-entries"><name>Alternative Representations of Backup Forwarding Entries</name>

<t>Alternative representations of backup forwarding entries are possible
as long as the same behavior is ensured.
Two other variants are introduced in the following sections.</t>

</section>
<section anchor="single-extended-bift"><name>Single Extended BIFT</name>

<t>The information of the primary BIFT and the backup BIFT may be
combined in a single extended BIFT.
Its structure is illustrated in <xref target="single_extended_bift"/>.</t>

<figure title="Structure of a single extended BIFT including backup forwarding entries." anchor="single_extended_bift"><artwork align="center"><![CDATA[
+--------+------+---------+--------+----------+--------+----+
| BFR-id | F-BM | BFR-NBR | BF-BM  | BBFR-NBR |  BFA   | BEA|
+========+======+=========+========+==========+========+====+
|  ...   |  ... |   ...   |   ...  |   ...    |  ...   |    |
+--------+------+---------+--------+----------+--------+----+
]]></artwork></figure>

<t>To ensure the same behavior, the BEA flag must be set like in the
backup BIFT.
Furthermore, two matching passes through the extended BIFT are needed.
A first one matches the bitstring combined with BEA=1.
If no further match is possible, then another pass with the remaining
bitstring combined with BEA=0 is performed.</t>

</section>
<section anchor="primary-bift-and-failure-specific-backup-bifts"><name>Primary BIFT and Failure-Specific Backup BIFTs</name>

<t>To avoid two distinct passes through a BIFT, the information of the
primary BIFT and backup BIFT may be combined into a primary BIFT and
multiple failure-specific BIFTs.
Each failure-specific BIFT corresponds to a specific failure scenario.
Failure-specific backup BIFTs are structured like normal backup BIFTs,
but do not have a BEA flag as they are enabled or disabled as a whole.</t>

<t>In the absence of a failure, packets are processed using the primary
BIFT.
In case of a failure, packets are processed using a failure-specific
BIFT that matches the occurred failure.
That means, there should be failure-specific BIFTs for at least any
adjacent link to protect against all single-link failures.
To support multiple failures, even more failure-specific BIFTs are
needed.
If failure-specific BIFTs are provided for only single-link failures,
the BIFT should be taken that covers the most relevant single failure.</t>

</section>
</section>
<section anchor="Representation"><name>Illustration and the Need for Prioritized Backup Forwarding Entries</name>

<t>In this section, BIER-FRR is illustrated using a small example.
It is pointed out that unnecessary redundant packets may occur if
primary forwarding entries are erroneously applied before backup
forwarding entries.
Therefore, it is important that the backup BIFT is applied before the
primary BIFT.</t>

<section anchor="redundant_packets"><name>Example</name>

<t><xref target="networking_scenario"/> presents an example of a BIER network.
In this example, BFRs are identified by the prefix "B" followed by
their BFR-ids.
For simplicity, each BFR also serves as a BFER, and its bit position
in the bitstring corresponds to its BFR-id.
The number assigned to each link represents its cost, which the
routing underlay uses to compute the shortest paths.</t>

<figure title="BIER network example." anchor="networking_scenario"><artwork align="center"><![CDATA[
        1              1
  B1 --------- B6 ------------ B5       BFR Bi is BFER
  |            |               |       (i = 1,2,3,4,5,6,7;
  |            |               |        i is BFR-id of Bi)
2 |            | 1             |
  |      1     |               | 1     cost of link B1->B2 is 2
  B2 --------- B7              |       cost of link B3->B4 is 4
  |                            |       cost of other links is 1
1 |                            |
  |                  4         |
 B3 ------------------------- B4
]]></artwork></figure>

<t>In the absence of a failure, traffic for BFR-id 2 and 3 is forwarded
via BFR-NBR B2 and traffic to BFR-id 4, 5, 6, and 7 is forwarded to
BFR-NBR B6.
If a packet with bitstring 0001100 (destinations B3 and B4) is
forwarded, the row for BFR-id B3 matches first.
A packet with bitstring 0000100 is sent to B2 and the bitstring of the
remaining packet is also processed with F-BM 0001100, i.e., the
remaining bitstring is
0001000.
Then the remaining bitstring is matched again so that BFR-id B4 yields
a match.
A packet copy with bitstring 0001000 is sent to B6 and the application
of the F-BM 1111000 to the bitstring of the remaining packet results
in 0000000, which terminates the forwarding process.
This BIER forwarding process avoids redundant packet copies.</t>

<figure title="B1's primary BIFT." anchor="extended_bift_plr_redundant"><artwork align="center"><![CDATA[
+------+----------+-------+
|BFR-id|   F-BM   |BFR-NBR|
+======+==========+=======+
|   2  | 0000110  |  B2   |
+------+----------+-------+
|   3  | 0000110  |  B2   |
+------+----------+-------+
|   4  | 1111000  |  B6   |
+------+----------+-------+
|   5  | 1111000  |  B6   |
+------+----------+-------+
|   6  | 1111000  |  B6   |
+------+----------+-------+
|   7  | 1111000  |  B6   |
+------+----------+-------+
]]></artwork></figure>

<t>A backup BIFT for B1 in the example of Figure 2 is given in
<xref target="extended_bift_plr_redundant"/>.
It implements LFA-based FRR as a protection strategy and link
protection.</t>

<t>If B1 cannot reach B2 or B6, BEA will be set to 1 in the rows for the
backup BIFT for which B2 or B6 is the BFR-NBR in the primary BIFT.
Thus, if B1 cannot reach B2, traffic for BFR-id 2 and 3 will be
forwarded over B6 and 1111110 is applied as BF-BM.
This mask also includes all the BFR-ids that have B6 as their primary
BFR-NBR.
Likewise, if B1 cannot reach B6, traffic for BFR-id 4, 5, 6, and 7
will be forwarded over B2 and again 1111110 is applied as BF-BM for
the same reason.</t>

</section>
<section anchor="lfa-based_FRR"><name>B1's backup BIFT for LFA-based FRR with link protection</name>

<figure title="B1's backup BIFT for LFA-based FRR with link protection." anchor="LFA-based"><artwork align="center"><![CDATA[
+------+----------+-------+
|BFR-id|   F-BM   |BFR-NBR|
+======+==========+=======+
|   2  | 0000110  |  B2   |
+------+----------+-------+
|   3  | 0000110  |  B2   |
+------+----------+-------+
|   4  | 1111000  |  B6   |
+------+----------+-------+
|   5  | 1111000  |  B6   |
+------+----------+-------+
|   6  | 1111000  |  B6   |
+------+----------+-------+
|   7  | 1111000  |  B6   |
+------+----------+-------+
]]></artwork></figure>

<t>We now consider that the link B1-&gt;B2 failed and that B1 needs to
forward a packet with bitstring 0001100.
Therefore, the BEA is set for BFR-id 2 and 3 in the backup BIFT.
If B1 needs to forward a packet with bitstring 0001100 (destinations
B3 and B4), the row for BFR-id B3 in the backup BIFT matches first.
Therefore, a packet with bitstring 0001100 is sent to B6 and the
bitstring of the remaining packet is also processed with BF-BM 1111110
so that the remaining bitstring is 0000000, which terminates the
forwarding process.
That is, only a single packet copy is sent to B6.</t>

</section>
</section>
<section anchor="primary_bift_single_backup_bift"><name>Prioritization of Backup Forwarding Entries over Primary Forwarding Entries</name>

<t>BIER-FRR defines that the backup BIFT is applied before the primary
BIFT.
The reason for that is twofold.
First, applying the primary BIFT first may erase the forwarding
information for BFERs whos primary BFR-NBR is unreachable.
Second, if that can be fixed, redundant packets can occur if the
primary BIFT is applied before the backup BIFT.
These issues are demonstrated in the above example when the link
B1-&gt;B2 has failed and B1 applies the primary BIFT before the backup
BIFT when forwarding a packet with bitstring 0011000 (B3 and B4 as
destinations).</t>

<t>We first assume that B1 just ignores the failed interface when
forwarding the packet with the primary BIFT but processes the
bitstring of remaining packet like if the transmission was successful.
That means, when BFR-id 3 matches first in the primary BIFT, no packet
is sent to B2, but the bits in the bitstring are still cleared,
leading to a remaining bitstring of 0001000.
Another pass through the primary BIFT forwards a packet copy to B6 and
clears the remaining bitstring to 0000000, which terminates the
forwarding process.
However, no packet will reach B3 as the bitstring information was lost
during the unsuccessful transmission.</t>

<t>We now assume a feature that saves the bitstring information when the
transmission to a specific BFR-id was not successful.
This can be done by AND-ing the remaining bitstring and the F-BM and
OR-ing the result with a remaining backup bitstring which was
initially zero.
Only then the bits of the F-BM are cleared from the remaining
bitstring.
When B1 is to forward a packet with bitstring 0001100, the first match
in the primary BIFT is for BFR-id 3.
As the transmission is not successful, 00000100 is saved in the
remaining backup bitstring and the remaining bitstring is 0001000.
Therefore, a second match in the primary BIFT is for BFR-id 4, which
sends a packet copy with bitstring 0001000 to B6.
Then, the remaining backup bitstring is processed with the backup
BIFT.
As there is a match for BFR-id 3, another packet is sent to B6, now
with bitstring 0000100.
This can be considered redundant.</t>

<t>Below the line, it is important to first process backup forwarding
entries before backup forwarding entries.
This avoids additions to the forwarding process with the primary BIFT
and avoids redundant packets.</t>

</section>
<section anchor="Protection_Levels"><name>Protection Levels</name>

<t>Both link protection and node protection may be supported.
Link protection is designed to safeguard against the failure of an
adjacent link, whereas node protection addresses the failure of a
neighboring node and the associated path leading to that node.
The relevance of link or node protection depends on the specific
service being supported.
Additionally, both protection levels can be combined with any of the
backup strategies outlined in <xref target="Strategies"/>.</t>

<section anchor="link_protection"><name>Link Protection</name>

<t>In link protection, the backup path is designed to circumvent the
failed link, i.e., the failed primary path from the PLR to the primary
BFR-NBR, while still potentially including the primary BFR-NBR itself.
Consequently, the backup path with link protection cannot protect
against the failure of the primary BFR-NBR.</t>

</section>
<section anchor="node_protection"><name>Node Protection</name>

<t>In node protection, the backup path is designed to avoid both the
failed node and the link to that node, i.e., the failed primary path
from the PLR to the primary BFR-NBR, including the primary BFR-NBR.
Consequently, the backup path with link protection also protects
against the failure of the primary BFR-NBR.
If a BFER and its primary BFR-NBR are the same, only link protection
is feasible for that BFER.</t>

</section>
<section anchor="protection_example"><name>Example</name>

<t>In the network depicted in <xref target="networking_scenario"/>, the primary path
from BFR B1 to BFER B5 is B1-&gt;B6-&gt;B5.
Protecting BFER B5 from a BFR-NBR B6 node failure can only be provided
through the backup path B1-&gt;B2-&gt;B3-&gt;B4-&gt;B5.
Link protection for BFER B5 is achieved via the backup path
B1-&gt;B2-&gt;B7-&gt;B6, and additionally through the backup path
B1-&gt;B2-&gt;B3-&gt;B4-&gt;B5-&gt;B6.
The specific backup entries are determined by the selected protection
level and backup strategy.
Example BIFTs illustrating link and node protection are provided in
<xref target="Strategies"/>.</t>

</section>
</section>
<section anchor="Strategies"><name>Backup Strategies</name>

<t>Backup strategies determine the selection of backup forwarding
entries, influencing both the choice of the backup BFR-NBR and the
backup forwarding action, and consequently, the backup path.
The following sections present tunnel-based BIER-FRR and LFA-based
BIER-FRR as potential strategies.
Both can be implemented with BIER-FRR presented in Section 3.</t>

<section anchor="Tunnel_Based"><name>Tunnel-Based BIER-FRR</name>

<t>The routing underlay may possess the capability to forward packets to
their destinations even in the presence of a failure, potentially due
to FRR mechanisms within the routing underlay.
In such scenarios, while the primary BFR-NBR may no longer be
reachable via the primary action (Direct), it could still be
accessible through a backup action (Tunnel).</t>

<t>Tunnel-based BIER-FRR encapsulates BIER packets impacted by a failure
within the routing underlay, thereby leveraging the routing underlay's
fast restoration capabilities.
As soon as connectivity in the routing underlay is reestablished, the
affected BIER packets can be forwarded to their intended destinations.
The appropriate backup forwarding entries in a BIFT for BIER-FRR are
determined by the desired protection level.</t>

<section anchor="tunnel-based-bier-frr-with-link-protection"><name>Tunnel-Based BIER-FRR with Link Protection</name>

<t>In the context of link protection, the backup BFR-NBRs are identical
to the primary BFR-NBRs.
If a primary BFR-NBR is directly connected to the BFR acting as the
Point of Local Repair (PLR), the corresponding backup forwarding
action is Tunnel.
Consequently, BIER packets affected by a failure are tunneled through
the routing underlay to their BFR-NBR, rather than being directly sent
as pure BIER packets.
If the primary BFR-NBR is not directly connected to the BFR as a PLR
(i.e., the implicit primary action is Tunnel), the corresponding
backup action is also Tunnel.
The backup F-BMs are identical to the primary F-BMs, which is
consistent with the computation of backup F-BMs described in
<xref target="f_bm_computation"/>.</t>

<figure title="B1's backup BIFT for tunnel-based BIER-FRR with link protection." anchor="backup_bift_tunnel_based_link_protection"><artwork align="center"><![CDATA[
  +------+----------+--------+-----------+---+-----------------+
  |BFR-id|  BF-BM   |BBFR-NBR|   BFA     |BEA|Comment: protects|
  |      |          |        |           |   |  failure of     |
  +======+==========+========+===========+===+=================+
  |   2  | 0000110  |  B2    |  Tunnel   |   |  Link B1->B2    |
  +------+----------+--------+-----------+---+-----------------+
  |   3  | 0000110  |  B2    |  Tunnel   |   |  Link B1->B2    |
  +------+----------+--------+-----------+---+-----------------+
  |   4  | 1111000  |  B6    |  Tunnel   |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   5  | 1111000  |  B6    |  Tunnel   |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   6  | 1111000  |  B6    |  Tunnel   |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   7  | 1111000  |  B6    |  Tunnel   |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
]]></artwork></figure>

<t><xref target="backup_bift_tunnel_based_link_protection"/> illustrates B1's backup
BIFT for tunnel-based BIER-FRR with link protection in the BIER
network example depicted in <xref target="networking_scenario"/>.
The backup BFR-NBRs and backup F-BMs in this backup BIFT correspond to
the primary BFR-NBRs and primary F-BMs in the primary BIFT.
However, the backup actions in this backup BIFT are Tunnel, while the
primary forwarding actions in the primary BIFT are Direct (which are
not explicitly shown but are implicit).</t>

<t>When B1, acting as the PLR, detects a failure of its link to B6, a
BIER packet with the bitstring 0100000 destined for B6 is tunneled by
B1 through the routing underlay towards B6.
The specific path of the backup tunnel depends on the routing underlay
and could be B1-&gt;B2-&gt;B7-&gt;B6 or B1-&gt;B2-&gt;B3-&gt;B4-&gt;B5-&gt;B6.</t>

<t>If a BIER packet is destined for {B2, B5, B7}, an encapsulated packet
copy is first forwarded via link B1-&gt;B2 to backup BFR-NBR B6 using the
backup forwarding action Tunnel to deliver packet copies to BFERs B5
and B7.
Subsequently, a non-encapsulated packet copy is forwarded via link
B1-&gt;B2 to BFR-NBR B2 using the primary forwarding action Direct to
deliver a packet copy to BFER B2.
Therefore, with tunnel-based BIER-FRR, and link protection, a single
redundant packet copy may occur in the event of a failure because an
encapsulated and a non-encapsulated packet copy are forwarded over the
same link.
This redundancy occurs even though BIER packets affected by failures
are forwarded before those unaffected by failures.
The redundant packet is rather caused by the fact that two packet
copies are sent over the link with different next-hops on the BIER
layer, namely B2 and B6.</t>

<t>A BIER packet with the bitstring 1000000 destined for B7 is forwarded
along the backup path B1-&gt;B2-&gt;B7-&gt;B6-&gt;B7, as it is first delivered to
the backup BFR-NBR B6.
Consequently, the backup path may be unnecessarily long.
This phenomenon is similar to the facility backup method described in
<xref target="RFC4090"/> which employs paths analogous to those in tunnel-based
BIER-FRR.</t>

</section>
<section anchor="tunnel-based-bier-frr-with-node-protection"><name>Tunnel-Based BIER-FRR with Node Protection</name>

<t>To determine the backup forwarding entries for node protection, two
cases need to be distinguished.
If the BFER is the same as its primary BFR-NBR, node protection is not
feasible for that BFER.
Therefore, link protection is applied, meaning the backup BFR-NBR is
set to the primary BFR-NBR.
If the BFER is different from its primary BFR-NBR, the backup BFR-NBR
is set to the primary BFR-NBR's primary BFR-NBR for that BFER, making
the backup BFR-NBR a next-next-hop BFR.
In both cases, the backup forwarding action is Tunnel.
In the first case, the backup F-BM is set to all zeros with the bit
for the BFER to be protected enabled.
In the second case, the backup F-BM is computed as described in
<xref target="f_bm_computation"/>.</t>

<figure title="B1's backup BIFT for tunnel-based BIER-FRR with node protection." anchor="backup_bift_tunnel_based_node_protection"><artwork align="center"><![CDATA[
  +------+----------+--------+----------+---+-----------------+
  |BFR-id|  BF-BM   |BBFR-NBR|   BFA    |BEA|Comment: protects|
  |      |          |        |          |   |  failure of     |
  +======+==========+========+==========+===+=================+
  |   2  | 0000010  |   B2   |  Tunnel  |   |  Link B1->B2    |
  +------+----------+--------+----------+---+-----------------+
  |   3  | 0000100  |   B3   |  Tunnel  |   |  BFR-NBR B2     |
  +------+----------+--------+----------+---+-----------------+
  |   4  | 0011000  |   B5   |  Tunnel  |   |  BFR-NBR B6     |
  +------+----------+--------+----------+---+-----------------+
  |   5  | 0011000  |   B5   |  Tunnel  |   |  BFR-NBR B6     |
  +------+----------+--------+----------+---+-----------------+
  |   6  | 0100000  |   B6   |  Tunnel  |   |  Link B1->B6    |
  +------+----------+--------+----------+---+-----------------+
  |   7  | 1000000  |   B7   |  Tunnel  |   |  BFR-NBR B6     |
  +------+----------+--------+----------+---+-----------------+
]]></artwork></figure>

<t><xref target="backup_bift_tunnel_based_node_protection"/> illustrates B1's backup
BIFT for tunnel-based BIER-FRR with node protection in the BIER
network example provided in <xref target="networking_scenario"/>.
BFERs B2 and B6 are direct neighbors of B1.
To protect them, only link protection is applied, as B1's primary
BFR-NBRs for these nodes are the nodes themselves.
As described above, only the bit for B2 is set in the backup F-BM of
B2, and similarly for B6.
For BFER B5, the backup BFR-NBR is B5, as it is B1's next-next-hop BFR
towards B5.
Similarly, for BFER B7, the backup BFR-NBR is B7.
When B1, acting as the PLR, detects the failure of its BFR-NBR B6, a
BIER packet with bitstring 1010010 destined for {B2, B5, B7} is
processed as follows: an encapsulated copy of the packet is sent via
tunnel B1-&gt;B2-&gt;B3-&gt;B4-&gt;B5, another encapsulated copy is sent via
tunnel B1-B2-B7, and a non-encapsulated copy is sent via link B1-&gt;B2.
In this example, two redundant packets are sent over link B1-&gt;B2.
Therefore, node protection may result in more redundant packet copies
than link protection.</t>

<t>Caveat: If the routing underlay does not support node protection,
tunnel-based BIER-FRR will similarly be unable to provide node
protection.
This limitation is illustrated in the following example.
In the network depicted in <xref target="networking_scenario"/>, the underlay offers
only link protection.
If BFR-NBR B6 fails and B1 must forward a packet to B5, according to
the backup BIFT in <xref target="backup_bift_tunnel_based_node_protection"/> the
packet is tunneled towards B5.
The underlay may route the packet along the path B1-&gt;B2-&gt;B7-&gt;B6-&gt;B5
due to FRR with link protection.
However, since B6 is also unreachable from B7, the packet is returned
to B2, resulting in a loop between B2 and B7.</t>

</section>
</section>
<section anchor="LFA_Based"><name>LFA-based BIER-FRR</name>

<t>LFA-based BIER-FRR leverages alternate BFRs to deliver BIER packets to
BFERs if their primary BFR-NBR is unreachable.
This approach does not rely on any fast restoration or protection
mechanisms in the underlying routing infrastructure.
First, the prerequisites for LFA-based BIER-FRR are clarified,
followed by the definition of BIER-LFAs.
Subsequently, link and node protection for LFA-based BIER-FRR are
discussed using a single backup BIFT.</t>

<section anchor="relation-of-bier-lfas-to-ip-lfas-and-prerequisites"><name>Relation of BIER-LFAs to IP-LFAs and Prerequisites</name>

<t>An LFA for a specific destination is an alternate node to which a
packet is sent if the primary next-hop for that destination is
unreachable.
This alternate node should be capable of forwarding the packet without
creating a forwarding loop.
LFAs have been defined for IP networks in <xref target="RFC5286"/>, <xref target="RFC7490"/> and
<xref target="I-D.ietf-rtgwg-segment-routing-ti-lfa"/>, and such LFAs are referred to
as IP-LFAs.
BIER-LFAs are similar to IP-LFAs, but a BIER-LFA node must be a BFR.
If only a subset of the nodes in the routing underlay are BFRs, some
IP-LFAs in the routing underlay may not be usable as BIER-LFAs.
To compute BIER-LFAs, network topology and link cost information from
the routing underlay are required.
This differs from tunnel-based BIER-FRR, where knowledge of the
primary BIFTs of a PLR and its BFR-NBRs is sufficient.</t>

<t>LFA-based BIER-FRR may reuse IP-LFAs as BIER-LFAs under the following
conditions: if an IP-LFA node for the destination of a specific BFER
is a BFR, it may be reused as the backup BFR-NBR for that BFER, along
with the backup action applied for that IP-LFA at the IP layer.
A normal IP-LFA corresponds to the backup forwarding action Direct, a
remote IP-LFA to Tunnel, and a TI-IP-LFA to Explicit.</t>

</section>
<section anchor="definition-of-bier-lfas"><name>Definition of BIER-LFAs</name>

<t>As with IP-LFAs, there are several types of BIER-LFAs:</t>

<t><list style="symbols">
  <t>A BFR is considered a normal BIER-LFA for a specific BFER if it is
directly connected to the PLR and:  <list style="numbers">
      <t>the BFER can be reached from it through the BIER domain.</t>
      <t>both the path from the PLR to the BFR and the path from the BFR to the
BFER are disjoint from the primary path from the PLR to the primary BFR-NBR.
These paths:      <list style="symbols">
          <t>may include the primary BFR-NBR for link protection.</t>
          <t>must not include the primary BFR-NBR for node protection.</t>
        </list></t>
    </list></t>
  <t>A BFR is considered a remote BIER-LFA for a specific BFER if it is
not directly connected to the PLR, can be reached via a tunnel from
the PLR, and satisfies the aforementioned conditions 1 and 2.</t>
  <t>A BFR is considered a TI-BIER-LFA for a specific BFER if it is not
directly connected to the PLR, cannot be reached via a tunnel from
the PLR, but is reachable from the PLR via an explicit path (e.g.,
with the assistance of a Segment Routing (SR) header), and satisfies
the aforementioned conditions 1 and 2.</t>
</list></t>

<t>For the protection of some BFERs, one or more normal BIER-LFAs may be
available at a specific PLR.
For the protection of other BFERs, only remote or TI-BIER-LFAs may be
available.
There may also be BFERs which can be protected only through
TI-BIER-LFAs.</t>

<t>The backup forwarding actions for rerouting BIER packets depending on
the type of BIER-LFA are:</t>

<t><list style="symbols">
  <t>For normal BIER-LFA: Direct</t>
  <t>For remote BIER-LFA: Tunnel</t>
  <t>For TI-BIER-LFA: Explicit</t>
</list></t>

</section>
<section anchor="bier_lfa_protection_coverage"><name>Protection Coverage of BIER-LFA Types</name>

<t>Protection coverage refers to the set of BFERs that can be protected
with a desired level of protection by a particular type of BIER-LFA.
The BIER-LFA types exhibit the following characteristics:</t>

<t><list style="symbols">
  <t>Normal BIER-LFAs  <list style="symbols">
      <t>The protection coverage is the least as some or many BFERs may not
be protected at the desired protection level or at all.</t>
      <t>Redundant packet copies are avoided.</t>
      <t>There is no encapsulation overhead.</t>
    </list></t>
  <t>Remote BIER-LFAs  <list style="symbols">
      <t>They enhance the protection coverage of normal BIER-LFAs.</t>
      <t>Redundant packet copies may occur on a link, similar to
tunnel-based BIER-FRR.</t>
      <t>The encapsulation overhead is similar to that of tunnel-based
BIER-FRR.</t>
    </list></t>
  <t>TI-BIER-LFAs  <list style="symbols">
      <t>They complement the protection coverage of normal and remote
BIER-LFAs to achieve 100% coverage.</t>
      <t>Redundant packets may occur on a link, similar to tunnel-based
BIER-FRR.</t>
      <t>The encapsulation overhead is similar or equivalent to that of
tunnel-based BIER-FRR, depending on the FRR mechanism employed in
the routing underlay.</t>
      <t>There is increased complexity as segment routing, or some other
forms of explicit tunnels, needs to be supported by the routing
underlay.</t>
    </list></t>
</list></t>

</section>
<section anchor="sets-of-supported-bier-lfas"><name>Sets of Supported BIER-LFAs</name>

<t>Normal BIER-LFAs are the simplest option, as they do not require
tunneling or explicit paths.
Remote BIER-LFAs offer greater capabilities but introduce additional
header overhead and require more functionality from the PLR.
TI-BIER-LFAs are the most complex BIER-LFAs, necessitating the use of
explicit paths.
When implementing LFA-based BIER-FRR, it is essential to specify the
set of supported BIER-LFAs.
The available options are as follows:</t>

<t><list style="symbols">
  <t>Option 1: Only normal BIER-LFAs are supported.</t>
  <t>Option 2: Both normal and remote BIER-LFAs are supported.</t>
  <t>Option 3: All types of BIER-LFAs are supported.</t>
</list></t>

<t>Options 1 and 2 may not be able to protect the reachability of all
BFERs against all single link failures and all single node failures.</t>

</section>
<section anchor="lfa-based-1backup-bift-link-protect"><name>Link Protection</name>

<t>In the following, LFA-based BIER-FRR with link protection is
illustrated.
Thereby, normal BIER-LFAs are prioritized over remote LFAs, and remote
BIER-LFAs are preferred over TI-BIER-LFAs.
Depending on the specific PLR, simple BIER-LFAs are sufficient, remote
BIER-LFAs are needed, or even TI-BIER-LFAs to protect the reachability
of all BFERs against single link failures.</t>

<t>If the link between B1 and B6 fails, B1 cannot reach the BFERs B4, B5,
B6, and B7 via their primary BFR-NBR.
Consequently, B1 forwards their traffic via the backup BFR-NBR B2,
along with the traffic for B2 and B3, as B2 is their primary BFR-NBR.
In this scenario, the backup F-BM is set to 1111110.
Similarly, if the link between B1 and B2 fails, B1 routes all traffic
to B6, with the backup F-BM also set to 1111110.</t>

<t>B1 requires only normal BIER-LFAs to protect all BFERs.
However, this situation can vary significantly for other BFRs.
<xref target="b7-backup_bift_lfa-based-link-protect"/> and
<xref target="b5-backup_bift_link-protect"/> present the backup BIFTs for B7 and B5,
respectively.
BFR B7 requires one normal BIER-LFA, three remote BIER-LFAs, and two
TI-BIER-LFAs to protect all BFERs.
BFR B5 requires one normal BIER-LFA, one remote BIER-LFA, and four
TI-BIER-LFAs as backup BFR-NBRs.
Thus, depending on the set of supported BIER-LFAs, it may not be
possible to protect all BFERs using BIER-FRR.</t>

<t>Consider a scenario where B7 holds a BIER packet with destinations
{B1, B4, B5, B6}.
If the link between B7 and B6 fails, the packet copy for B1 is sent to
B2 using the backup forwarding action Direct, the packet copy for B4
is tunneled via B2 to B3, and the packet copies for B5 and B6 are sent
via explicit paths to B4 and B1, respectively.
Since these packet copies have different next-hops on the BIER layer,
all of them must be transmitted, resulting in three redundant copies.</t>

<figure title="B7's backup BIFT with link protection." anchor="b7-backup_bift_lfa-based-link-protect"><artwork align="center"><![CDATA[
  +------+----------+--------+-----------+---+-----------------+
  |BFR-id|  BF-BM   |BBFR-NBR|   BFA     |BEA|Comment: protects|
  |      |          |        |           |   |  failure of     |
  +======+==========+========+===========+===+=================+
  |   1  | 0000111  |   B2   |  Direct   |   |  Link B7->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   2  | 0000110  |   B1   |  Tunnel   |   |  Link B1->B2    |
  +------+----------+--------+-----------+---+-----------------+
  |   3  | 0000110  |   B1   |  Tunnel   |   |  Link B1->B2    |
  +------+----------+--------+-----------+---+-----------------+
  |   4  | 0001000  |   B3   |  Tunnel   |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   5  | 0010000  |   B4   |  Explicit |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   6  | 0100000  |   B1   |  Explicit |   |  Link B1->B6    |
  +------+----------+--------+-----------+---+-----------------+
]]></artwork></figure>

<figure title="B5's backup BIFT with link protection." anchor="b5-backup_bift_link-protect"><artwork align="center"><![CDATA[
  +------+----------+--------+-----------+---+-----------------+
  |BFR-id|  BF-BM   |BBFR-NBR|   BFA     |BEA|Comment: protects|
  |      |          |        |           |   |  failure of     |
  +======+==========+========+===========+===+=================+
  |   1  | 1100011  |   B3   |  Explicit |   |  Link B5->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   2  | 1100011  |   B3   |  Explicit |   |  Link B5->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   3  | 0000100  |   B4   |  Direct   |   |  Link B5->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   4  | 0001000  |   B3   |  Tunnel   |   |  Link B5->B4    |
  +------+----------+--------+-----------+---+-----------------+
  |   6  | 1100011  |   B3   |  Explicit |   |  Link B5->B6    |
  +------+----------+--------+-----------+---+-----------------+
  |   7  | 1100011  |   B3   |  Explicit |   |  Link B5->B6    |
  +------+----------+--------+-----------+---+-----------------+
]]></artwork></figure>

</section>
<section anchor="node-protection"><name>Node Protection</name>

<t>To determine the backup forwarding entries for node protection, it is
necessary to conduct a case-by-case analysis of the BFER to be
protected.
If the BFER is the same as its primary BFR-NBR, node protection is not
feasible for that BFER, and link protection must be applied instead.
In all other cases, the BFER should be protected by a node-protecting
BIER-LFA.
In this context, normal BIER-LFAs are prioritized over remote
BIER-LFAs, and remote BIER-LFAs are preferred over TI-BIER-LFAs.
Depending on the set of supported BIER-LFAs, it may not be possible to
protect certain BFERs.</t>

<t><xref target="b1-backup_bift_node-protect"/> illustrates B1's backup BIFT for
LFA-based BIER-FRR with node protection, using the network example
provided in <xref target="networking_scenario"/>.</t>

<figure title="B1's backup BIFT with node protection." anchor="b1-backup_bift_node-protect"><artwork align="center"><![CDATA[
  +------+----------+--------+-----------+---+-----------------+
  |BFR-id|  BF-BM   |BBFR-NBR|   BFA     |BEA|Comment: protects|
  |      |          |        |           |   |  failure of     |
  +======+==========+========+===========+===+=================+
  |   2  | 1111010  |   B6   |  Direct   |   |  BFR-NBR B2     |
  +------+----------+--------+-----------+---+-----------------+
  |   3  | 0000100  |   B4   |  Tunnel   |   |  BFR-NBR B2     |
  +------+----------+--------+-----------+---+-----------------+
  |   4  | 0001000  |   B3   |  Tunnel   |   |  BFR-NBR B6     |
  +------+----------+--------+-----------+---+-----------------+
  |   5  | 0010000  |   B4   |  Explicit |   |  BFR-NBR B6     |
  +------+----------+--------+-----------+---+-----------------+
  |   6  | 1100100  |   B2   |  Direct   |   |  BFR-NBR B6     |
  +------+----------+--------+-----------+---+-----------------+
  |   7  | 1100100  |   B2   |  Direct   |   |  BFR-NBR B6     |
  +------+----------+--------+-----------+---+-----------------+
]]></artwork></figure>

<t>As B6 serves as the primary BFR-NBR for BFER B6, only link protection
can be applied.
Consequently, B2 is utilized as a normal, link-protecting BIER-LFA to
safeguard B6.
Similarly, as B2 is the primary BFR-NBR for BFER B2, B2 is protected
with B6 as its normal, link-protecting BIER-LFA.
BFER B7 is protected against the failure of node B6 by using B2 as its
normal, node-protecting BIER-LFA, as B2 has a shortest path to B7 that
does not traverse B6.
The backup F-BMs for BFERs B6 and B7 are set to {B2, B6, B7}, as
traffic for these BFERs is routed via link B1-&gt;B2 with the backup
forwarding action Direct when B6 is unreachable.</t>

<t>BFER B4 cannot be reached via a normal LFA when BFR B6 fails.
However, B3 serves as a remote, node-protecting BIER-LFA for BFER B4,
as B3 has a shortest path to B4, is reachable from B1 via a shortest
path, and the resulting backup path from B1 to B4 does not traverse
B6.
Similarly, B4 serves as a remote LFA for BFER B3 if BFR B2 fails.</t>

<t>BFER B5 is neither reachable through a normal BIER-LFA nor through a
remote BIER-LFA when BFR B6 fails.
However, B4 acts as a node-protecting TI-BIER-LFA for BFER B5 as B4 is
reachable through the explicit path B1-&gt;B2-&gt;B3-&gt;B4 and has a shortest
path to B5 that does not traverse B6.</t>

<t>Consider a scenario where B1 holds a BIER packet with destinations
{B4, B5, B6}.
If the link between B1 and B2 fails, the packet copy for B1 is sent to
B2 using the backup forwarding action Direct, a packet copy for B4 is
tunneled via B2, and a packet copy for B5 is sent via an explicit path
to B4.
Since these packet copies have different next-hops on the BIER layer,
all of them must be transmitted, resulting in two redundant copies.</t>

</section>
<section anchor="optimization-potential-to-reduce-redundant-bier-packets-in-failure-cases"><name>Optimization Potential to Reduce Redundant BIER Packets in Failure Cases</name>

<t>Redundant packets can occur with LFA-based BIER-FRR when BIER packets
are transmitted over a specific link in different forms, including:</t>

<t><list style="symbols">
  <t>Directly sent BIER packets (either primary transmission or reroute
to a normal BIER-LFA).</t>
  <t>BIER packets encapsulated for transmission to a specific BFR-NBR
(either tunneled primary transmission or reroute to a remote
BIER-LFA).</t>
  <t>BIER packets routed with an encoded explicit path (reroute to a
TI-LFA).</t>
</list></t>

<t>When different remote BIER-LFAs are utilized, multiple redundant
packets may be generated.
A similar situation can arise with TI-BIER-LFAs.
However, some redundant packets can be mitigated if remote BIER-LFAs
or TI-BIER-LFAs are selected such that they can protect multiple
BFERs, thereby reducing the need for additional remote BIER-LFAs or
TI-BIER-LFAs.
This approach, while potentially leading to longer backup paths,
introduces a new optimization objective for the selection of remote or
TI-BIER-LFAs, which does not exist in IP-FRR.
The relevance of this optimization may vary depending on the specific
use case.</t>

<t>To illustrate this optimization potential, consider LFA-based BIER-FRR
with link protection for B7, as described in its backup BIFT in
<xref target="b7-backup_bift_lfa-based-link-protect"/>.
As noted in <xref target="lfa-based-1backup-bift-link-protect"/>, B7 needs to
transmit four copies to forward a packet to {B1, B4, B5, B6}.
If the more complex TI-BIER-LFA B4 is chosen to protect BFER B4
instead of the remote BIER-LFA B3, only two redundant copies need to
be transmitted.</t>

</section>
</section>
</section>
<section anchor="Comparison"><name>Comparison</name>

<t>This section first addresses the differences between IP-LFAs for
IP-FRR and BIER-LFAs for BIER-FRR.
It then examines the advantages and disadvantages of tunnel-based and
LFA-based BIER-FRR.</t>

<section anchor="comparison-of-lfa-based-protection-for-ip-frr-and-bier-frr"><name>Comparison of LFA-Based Protection for IP-FRR and BIER-FRR</name>

<t>LFAs were initially proposed for IP networks.
They are straightforward in that they do not require any tunneling
overhead.
However, certain destinations cannot be protected against specific
link failures, and even more destinations may be unprotectable against
certain node failures.
To improve coverage, remote LFAs (R-LFAs) were introduced, which
tunnel affected traffic to another node from which the traffic can
reach the destination through normal forwarding.
Despite this, there may still be destinations that remain unprotected
against link or node failures.
To address this, topology-independent LFAs (TI-LFAs) were developed,
wherein affected traffic is tunneled via an explicit path (preferably
using segment routing headers) to another node from which the traffic
can reach its destination through standard IP forwarding.
With TI-LFAs, all destinations can be protected against any failures
as long as connectivity exists.</t>

<t>LFA-based BIER-FRR adopts the principles of LFAs but differs from
IP-FRR in that the LFA target node, i.e., the next-hop on the BIER
layer to which traffic is diverted, must be a BFR.
If an IP-LFA target is a BFR, it can be utilized as a BIER-LFA;
otherwise, it cannot serve as a BIER-LFA.
Consequently, if only a subset of nodes in the underlay are BFRs, the
BIER-LFAs will differ substantially from IP-LFAs.
Furthermore, this makes it more challenging to find normal BIER-LFAs
which do not require tunneling.
As a result, LFA-based BIER-FRR is likely to require more remote
BIER-LFAs and TI-BIER-LFAs than IP-FRR under such conditions.</t>

</section>
<section anchor="advantages-and-disadvantages-of-tunnel-based-bier-frr"><name>Advantages and Disadvantages of Tunnel-Based BIER-FRR</name>

<section anchor="advantages"><name>Advantages</name>

<t><list style="symbols">
  <t>The computation of backup forwarding entries for tunnel-based
BIER-FRR is straightforward, requiring only the primary BIFTs of a
PLR and its BFR-NBRs.
No routing information from the routing underlay is needed.</t>
  <t>The forwarding action "Explicit" is not required for tunnel-based
BIER-FRR.
However, depending on the underlay, explicit forwarding may still be
utilized to achieve FRR in the underlay.</t>
</list></t>

</section>
<section anchor="disadvantages"><name>Disadvantages</name>

<t><list style="symbols">
  <t>Tunnel-based BIER-FRR relies on the presence of a FRR mechanism in
the underlay.</t>
  <t>Its protection level is constrained by the protection level provided
by the underlay.
For instance, if the underlay supports only link protection,
tunnel-based BIER-FRR cannot offer node protection.</t>
  <t>Redundant packet copies may occur in tunnel-based BIER-FRR.</t>
  <t>Backup paths may be longer than with LFA-based BIER-FRR.</t>
  <t>A tunneling header is required for any rerouting, resulting in
additional header overhead.</t>
</list></t>

</section>
</section>
<section anchor="advantages-and-disadvantages-of-lfa-based-bier-frr"><name>Advantages and Disadvantages of LFA-Based BIER-FRR</name>

<section anchor="advantages-1"><name>Advantages</name>

<t><list style="symbols">
  <t>LFA-based BIER-FRR does not depend on any fast protection mechanisms
in the underlay.</t>
  <t>Therefore, it can provide superior protection at the BIER layer
compared to the IP layer, particularly if LFA-based BIER-FRR
utilizes BIER-LFAs with a higher protection level than those used in
LFA-based IP-FRR.
For example, the underlay may only offer FRR with link protection,
while BIER-FRR can provide node protection for BIER traffic.</t>
  <t>LFA-based BIER-FRR avoids header overhead for normal BIER-LFAs.</t>
</list></t>

</section>
<section anchor="disadvantages-1"><name>Disadvantages</name>

<t><list style="symbols">
  <t>The computation of backup forwarding entries requires routing
information from the underlay.</t>
  <t>The computation of backup forwarding entries is more complex when
some nodes in the underlay are not BFRs because then BIER-LFAs
differ from IP-LFAs.</t>
  <t>The "Tunnel" forwarding action is required to protect certain BFERs,
which adds header overhead.</t>
  <t>The "Explicit" forwarding action is necessary to achieve full
protection coverage in some topologies; without it, only partial
protection coverage is possible.
This requires support for explicit paths, such as Segment Routing.</t>
  <t>More remote BIER-LFAs and TI-BIER-LFAs are needed compared to IP-FRR
if some nodes in the routing underlay are not BFRs.</t>
  <t>Redundant packet copies may occur in LFA-based BIER-FRR, though this
is less frequent than with tunnel-based BIER-FRR as simple BIER-LFAs
do not require a tunnel.</t>
</list></t>

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

<t>This specification does not introduce additional security concerns
beyond those already discussed in the BIER architecture <xref target="RFC8279"/>
along with the IP FRR <xref target="RFC5286"/> and LFA <xref target="RFC7490"/> specifications.</t>

</section>
<section anchor="IANA"><name>IANA Considerations</name>

<t>No requirements for IANA.</t>

</section>


  </middle>

  <back>


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



<reference anchor="RFC5286">
  <front>
    <title>Basic Specification for IP Fast Reroute: Loop-Free Alternates</title>
    <author fullname="A. Atlas" initials="A." role="editor" surname="Atlas"/>
    <author fullname="A. Zinin" initials="A." role="editor" surname="Zinin"/>
    <date month="September" year="2008"/>
    <abstract>
      <t>This document describes the use of loop-free alternates to provide local protection for unicast traffic in pure IP and MPLS/LDP networks in the event of a single failure, whether link, node, or shared risk link group (SRLG). The goal of this technology is to reduce the packet loss that happens while routers converge after a topology change due to a failure. Rapid failure repair is achieved through use of precalculated backup next-hops that are loop-free and safe to use until the distributed network convergence process completes. This simple approach does not require any support from other routers. The extent to which this goal can be met by this specification is dependent on the topology of the network. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="5286"/>
  <seriesInfo name="DOI" value="10.17487/RFC5286"/>
</reference>

<reference anchor="RFC7431">
  <front>
    <title>Multicast-Only Fast Reroute</title>
    <author fullname="A. Karan" initials="A." surname="Karan"/>
    <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
    <author fullname="IJ. Wijnands" initials="IJ." role="editor" surname="Wijnands"/>
    <author fullname="B. Decraene" initials="B." surname="Decraene"/>
    <date month="August" year="2015"/>
    <abstract>
      <t>As IPTV deployments grow in number and size, service providers are looking for solutions that minimize the service disruption due to faults in the IP network carrying the packets for these services. This document describes a mechanism for minimizing packet loss in a network when node or link failures occur. Multicast-only Fast Reroute (MoFRR) works by making simple enhancements to multicast routing protocols such as Protocol Independent Multicast (PIM) and Multipoint LDP (mLDP).</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="7431"/>
  <seriesInfo name="DOI" value="10.17487/RFC7431"/>
</reference>

<reference anchor="RFC8279">
  <front>
    <title>Multicast Using Bit Index Explicit Replication (BIER)</title>
    <author fullname="IJ. Wijnands" initials="IJ." role="editor" surname="Wijnands"/>
    <author fullname="E. Rosen" initials="E." role="editor" surname="Rosen"/>
    <author fullname="A. Dolganow" initials="A." surname="Dolganow"/>
    <author fullname="T. Przygienda" initials="T." surname="Przygienda"/>
    <author fullname="S. Aldrin" initials="S." surname="Aldrin"/>
    <date month="November" year="2017"/>
    <abstract>
      <t>This document specifies a new architecture for the forwarding of multicast data packets. It provides optimal forwarding of multicast packets through a "multicast domain". However, it does not require a protocol for explicitly building multicast distribution trees, nor does it require intermediate nodes to maintain any per-flow state. This architecture is known as "Bit Index Explicit Replication" (BIER). When a multicast data packet enters the domain, the ingress router determines the set of egress routers to which the packet needs to be sent. The ingress router then encapsulates the packet in a BIER header. The BIER header contains a bit string in which each bit represents exactly one egress router in the domain; to forward the packet to a given set of egress routers, the bits corresponding to those routers are set in the BIER header. The procedures for forwarding a packet based on its BIER header are specified in this document. Elimination of the per-flow state and the explicit tree-building protocols results in a considerable simplification.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="8279"/>
  <seriesInfo name="DOI" value="10.17487/RFC8279"/>
</reference>

<reference anchor="RFC7490">
  <front>
    <title>Remote Loop-Free Alternate (LFA) Fast Reroute (FRR)</title>
    <author fullname="S. Bryant" initials="S." surname="Bryant"/>
    <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
    <author fullname="S. Previdi" initials="S." surname="Previdi"/>
    <author fullname="M. Shand" initials="M." surname="Shand"/>
    <author fullname="N. So" initials="N." surname="So"/>
    <date month="April" year="2015"/>
    <abstract>
      <t>This document describes an extension to the basic IP fast reroute mechanism, described in RFC 5286, that provides additional backup connectivity for point-to-point link failures when none can be provided by the basic mechanisms.</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="7490"/>
  <seriesInfo name="DOI" value="10.17487/RFC7490"/>
</reference>

<reference anchor="RFC5880">
  <front>
    <title>Bidirectional Forwarding Detection (BFD)</title>
    <author fullname="D. Katz" initials="D." surname="Katz"/>
    <author fullname="D. Ward" initials="D." surname="Ward"/>
    <date month="June" year="2010"/>
    <abstract>
      <t>This document describes a protocol intended to detect faults in the bidirectional path between two forwarding engines, including interfaces, data link(s), and to the extent possible the forwarding engines themselves, with potentially very low latency. It operates independently of media, data protocols, and routing protocols. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="5880"/>
  <seriesInfo name="DOI" value="10.17487/RFC5880"/>
</reference>




    </references>

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



<reference anchor="RFC4090">
  <front>
    <title>Fast Reroute Extensions to RSVP-TE for LSP Tunnels</title>
    <author fullname="P. Pan" initials="P." role="editor" surname="Pan"/>
    <author fullname="G. Swallow" initials="G." role="editor" surname="Swallow"/>
    <author fullname="A. Atlas" initials="A." role="editor" surname="Atlas"/>
    <date month="May" year="2005"/>
    <abstract>
      <t>This document defines RSVP-TE extensions to establish backup label-switched path (LSP) tunnels for local repair of LSP tunnels. These mechanisms enable the re-direction of traffic onto backup LSP tunnels in 10s of milliseconds, in the event of a failure.</t>
      <t>Two methods are defined here. The one-to-one backup method creates detour LSPs for each protected LSP at each potential point of local repair. The facility backup method creates a bypass tunnel to protect a potential failure point; by taking advantage of MPLS label stacking, this bypass tunnel can protect a set of LSPs that have similar backup constraints. Both methods can be used to protect links and nodes during network failure. The described behavior and extensions to RSVP allow nodes to implement either method or both and to interoperate in a mixed network. [STANDARDS-TRACK]</t>
    </abstract>
  </front>
  <seriesInfo name="RFC" value="4090"/>
  <seriesInfo name="DOI" value="10.17487/RFC4090"/>
</reference>


<reference anchor="I-D.chen-bier-egress-protect">
   <front>
      <title>BIER Egress Protection</title>
      <author fullname="Huaimo Chen" initials="H." surname="Chen">
         <organization>Futurewei</organization>
      </author>
      <author fullname="Mike McBride" initials="M." surname="McBride">
         <organization>Futurewei</organization>
      </author>
      <author fullname="Aijun Wang" initials="A." surname="Wang">
         <organization>China Telecom</organization>
      </author>
      <author fullname="Gyan Mishra" initials="G. S." surname="Mishra">
         <organization>Verizon Inc.</organization>
      </author>
      <author fullname="Yisong Liu" initials="Y." surname="Liu">
         <organization>China Mobile</organization>
      </author>
      <author fullname="Michael Menth" initials="M." surname="Menth">
         <organization>University of Tuebingen</organization>
      </author>
      <author fullname="Boris Khasanov" initials="B." surname="Khasanov">
         <organization>Yandex LLC</organization>
      </author>
      <author fullname="Xuesong Geng" initials="X." surname="Geng">
         <organization>Huawei</organization>
      </author>
      <author fullname="Yanhe Fan" initials="Y." surname="Fan">
         <organization>Casa Systems</organization>
      </author>
      <author fullname="Lei Liu" initials="L." surname="Liu">
         <organization>Fujitsu</organization>
      </author>
      <author fullname="Xufeng Liu" initials="X." surname="Liu">
         <organization>Alef Edge</organization>
      </author>
      <date day="28" month="March" year="2024"/>
      <abstract>
	 <t>   This document describes a mechanism for fast protection against the
   failure of an egress node of a &quot;Bit Index Explicit Replication&quot;
   (BIER) domain.  It is called BIER egress protection.  It does not
   require any per-flow state in the core of the domain.  With BIER
   egress protection the failure of a primary BFER (Bit Forwarding
   Egress Router) is protected with a backup BFER such that traffic
   destined to the primary BFER in the BIER domain is fast rerouted by a
   neighbor BFR to the backup BFER on the BIER layer.  The mechanism is
   applicable if all BIER traffic sent to the primary BFER can reach its
   destination also via the backup BFER.  It is complementary to BIER-
   FRR which cannot protect against the failure of a BFER.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-chen-bier-egress-protect-07"/>
   
</reference>


<reference anchor="I-D.ietf-rtgwg-segment-routing-ti-lfa">
   <front>
      <title>Topology Independent Fast Reroute using Segment Routing</title>
      <author fullname="Ahmed Bashandy" initials="A." surname="Bashandy">
         <organization>Individual</organization>
      </author>
      <author fullname="Stephane Litkowski" initials="S." surname="Litkowski">
         <organization>Cisco Systems</organization>
      </author>
      <author fullname="Clarence Filsfils" initials="C." surname="Filsfils">
         <organization>Cisco Systems</organization>
      </author>
      <author fullname="Pierre Francois" initials="P." surname="Francois">
         <organization>INSA Lyon</organization>
      </author>
      <author fullname="Bruno Decraene" initials="B." surname="Decraene">
         <organization>Orange</organization>
      </author>
      <author fullname="Daniel Voyer" initials="D." surname="Voyer">
         <organization>Bell Canada</organization>
      </author>
      <date day="12" month="February" year="2025"/>
      <abstract>
	 <t>   This document presents Topology Independent Loop-free Alternate Fast
   Reroute (TI-LFA), aimed at providing protection of node and adjacency
   segments within the Segment Routing (SR) framework.  This Fast
   Reroute (FRR) behavior builds on proven IP Fast Reroute concepts
   being LFAs, remote LFAs (RLFA), and remote LFAs with directed
   forwarding (DLFA).  It extends these concepts to provide guaranteed
   coverage in any two-connected networks using a link-state IGP.  An
   important aspect of TI-LFA is the FRR path selection approach
   establishing protection over the expected post-convergence paths from
   the point of local repair, reducing the operational need to control
   the tie-breaks among various FRR options.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-rtgwg-segment-routing-ti-lfa-21"/>
   
</reference>


<reference anchor="BrAl17" >
  <front>
    <title>Performance Comparison of Resilience Mechanisms for Stateless Multicast Using BIER</title>
    <author initials="W." surname="Braun" fullname="W. Braun">
      <organization></organization>
    </author>
    <author initials="M." surname="Albert" fullname="M. Albert">
      <organization></organization>
    </author>
    <author initials="T." surname="Eckert" fullname="T. Eckert">
      <organization></organization>
    </author>
    <author initials="M." surname="Menth" fullname="M. Menth">
      <organization></organization>
    </author>
    <date year="2017" month="May"/>
  </front>
</reference>


    </references>


<?line 1245?>

<section anchor="changelog"><name>Changelog</name>

<t>[RFC-Editor: Please remove this section].</t>

<section anchor="rev-11-sent-back-from-iesg-to-wg"><name>rev 11 - sent back from IESG to WG</name>

<t>Triage of IESG review feedback. Fixed the following core / simple feedback. See TBD section below for the missing IESG and directorate review feedback that will need to be folded into the next rev's.</t>

<t>Brought document into kramdown format for easier editing.</t>

<t>Rewrote abstract to answer Roman Danyliw / Éric Vyncke / Brian Haberman
questions about scope (framework) and intended status (informational) of
document.</t>

<t>Changed set of authors to meeth 5-authors max requirements. Changed
authors to contributors.</t>

<t>Removed RFC2119 boilerplate because as a framework, this document does
not use RFC2119 language (Mike Bishop).</t>

<t>Resolved Eric Vyncke Abstract text convern (removed). But see TBD for more work on refining text required.</t>

<t>Resolved expanding LFA on first use.</t>

<t>Ketan: Please remove extra "." I saw a few other similar instances in the document.</t>

<t>Ketan: minor: perhaps s/reconvergence/control plane reconvergence .</t>

<t>Ketan: fixed "persistent failure" text.</t>

<t>Ketan: In the following ? ... perhaps "In this subsection," ?</t>

</section>
<section anchor="resolved-iesg-discuss-comments-before-rev-11"><name>Resolved IESG discuss / comments before rev 11.</name>

<t>Added text for BFD referring to RFC5880 (prior no use of RFC5880 reference).</t>

<t>EVyncke: s/without encapsulation in a tunnel header/without encapsulation in a tunnel/</t>

<t>EVyncke: s/link layer technology/link-layer technology/</t>

</section>
<section anchor="tbd"><name>TBD</name>

<t>Fold in RTGDIR feedback (eckert).</t>

<t>Fold in unanswered questions from INTDIR review (Haberman):
 https://datatracker.ietf.org/doc/review-ietf-bier-frr-08-intdir-telechat-haberman-2025-06-03/)</t>

<t>Section 6.1: Add text about PMTU when using tunnels (Evyncke DISCUSS). Although: RFC7490 which explicitly require stunnels also does not address tunnels MTU issues. Maybe attempt to declare MTU problem out of scope given how we're "just" doing something similar for BIER that several unicast RFCs are doing - without addressing MTU.</t>

<t>Check/remove unused references. Add text explaining benefits of reading reference 
"Performance Comparison of Resilience Mechanisms for Stateless Multicast Using BIER" (aka: which pieces relevant to this draft does this research paper cover).</t>

<t>Add text about egress protection (Aka: node protection against BFER failure),
reference I-D.chen-bier-egress-protect (Roman Danilyv).</t>

<t>EVyncke: I fail to see the logical link between <spanx style="verb">Typically, BIER packets are forwarded without an outer IP header.</spanx> and the consequence <spanx style="verb">if a link or node failure occurs, the corresponding BFR Neighbor (BFR-NBR) becomes unreachable</spanx>. Strongly suggest adding some explanations. Answer: linkage is that BIER can not automatically use IP FRR but has to deal with unreachability events itself. But even if BIER was using per-hop IP/MPLS encap to rely on IP/MPLS FRR, then the result would not be as good as "direct" BIER-FRR. Text rewrite requires some restructuring.</t>

<t>EVyncke: Should a reference be provide for SR in <spanx style="verb">If segment routing is employed</spanx> ?</t>

<t>Evyncke: The last paragraph does not mention the 'explicit' forwarding action, is it on purpose ? If so, the read will welcome an explanation.</t>

<t>Ketan: major: Please provide a reference or explanation of "normal BIER-LFAs". Did
you mean RFC5286? Same goes for the other types - please provide references. TBD because text needs more structured rewrite of aligning the BIER behavior with the pre-defined unicast FRR terminology / cases.</t>

<t>Ketan: Is that IP-TI-LFA ? Same Q for TI-BIER-LFA. Need more structured rewrite of text...</t>

<t>Ketan: Isn't that 100% theoretical? Practically, there are limits of platform
and implementations. Also, all routers should be BFRs. Answer: No, should be as practically applicable as unicast TI-LFA is. There may be othrer platform limitations for BIER-FRR though.</t>

<t>DebCooley: The word 'tunnel' is used many times in this draft.  There is no definition of what is meant by tunnel(s), I have to assume that they are not for security purposes.  If they are specific types of tunnels, e.g. MPLS or other security tunnel options (IPsec), then it would be nice to have that defined. Yes: Need to define "tunnel" for the purpose of this ocument as an encapsulation of BIER packets into some unicast header that allows forwarding of the packet to a remote BFR. On the other hand, RFC like RFC7490 (RLFA in unicast) uses "tunnel" without explaininf/defining it.</t>

<t>Ketan:  References to respective RFCs related to different types of LFA/FRR
unicast mechanisms would be helpful in this section as well. Yes!</t>

<t>All of Mohammeds IESG review (sorry, ran out of time).</t>

</section>
</section>
<section numbered="false" anchor="acknowledgments"><name>Acknowledgments</name>

<t>The authors would like to thank Daniel Merling, Jeffrey Zhang, Tony
Przygienda and Shaofu Peng for their comments to this work.
A special thank you to Gunter van de Velde for his extensive editing
to help bring this document to publication.</t>

</section>

    <section anchor="contributors" numbered="false" toc="include" removeInRFC="false">
        <name>Contributors</name>
    <contact initials="A." surname="Wang" fullname="Aijun Wang">
      <organization>China Telecom</organization>
      <address>
        <postal>
          <street>Beiqijia Town, Changping District</street>
          <city>Beijing</city>
          <code>102209</code>
          <country>China</country>
        </postal>
        <email>wangaj3@chinatelecom.cn</email>
      </address>
    </contact>
    <contact initials="G." surname="Mishra" fullname="Gyan S. Mishra">
      <organization>Verizon Inc.</organization>
      <address>
        <postal>
          <street>13101 Columbia Pike</street>
          <city>Silver Spring</city>
          <code>MD 20904</code>
          <country>USA</country>
        </postal>
        <phone>301 502-1347</phone>
        <email>gyan.s.mishra@verizon.com</email>
      </address>
    </contact>
    <contact initials="Y." surname="Liu" fullname="Yisong Liu">
      <organization>China Mobile</organization>
      <address>
        <email>liuyisong@chinamobile.com</email>
      </address>
    </contact>
    <contact initials="Y." surname="Fan" fullname="Yanhe Fan">
      <organization>Casa Systems</organization>
      <address>
        <postal>
          <country>United States of America</country>
        </postal>
        <email>yfan@casa-systems.com</email>
      </address>
    </contact>
    <contact initials="L." surname="Liu" fullname="Lei Liu">
      <organization>Fujitsu</organization>
      <address>
        <postal>
          <country>United States of America</country>
        </postal>
        <email>liulei.kddi@gmail.com</email>
      </address>
    </contact>
    <contact initials="X." surname="Liu" fullname="Xufeng Liu">
      <organization>Alef Edge</organization>
      <address>
        <postal>
          <country>United States of America</country>
        </postal>
        <email>xufeng.liu.ietf@gmail.com</email>
      </address>
    </contact>
    <contact initials="X." surname="Geng" fullname="Xuesong Geng">
      <organization></organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>gengxuesong@huawei.com</email>
      </address>
    </contact>
    </section>

  </back>

<!-- ##markdown-source:
H4sIADaG8WgAA+192XIbR7bge35FDh0TItsARFCUaPOGp01Kopt3JLWGpNv3
zhLqApAgyipU4VYWSLFlzft81/zYnC23qgJIeY2JaEV0GwSqcjl59i2Hw6G6
OdZP1KyaltnSHOtZnc2bYW6a+XCSm3o4r+vheKymWXOs83JeKdvUJlse6/OX
V2eqyZsCXjrRZzW8fVvV7/W8qvVZZht9Yepq3Rh9mzcLfZo3+rycmQ/65YdV
kU9z/B0/ZE1elXr39PzlxfDs4mJPZZNJbWBN7hs1yxqY4mD/4KlS2bpZVPWx
Gmpe7V/WWb6s9POFKZXWVX19rM/Wzbo2tyaHL8wyy4tjvZjC7yPc07fX+M1o
Wi39EK/z90a/np7W+cxsGWOZTxeZKUbL6QSf/HbuHkkGu2zMfG5K/SovZ6Wp
3Xjfl/mNqW3e3Olqrq/WZpKX17RkGd3ye6OC3/t2XebDxj02goWF1dIy9GtT
NosHD7/EpzcPelWZujDW6pfT96ZutkChacy3UzuaZ2t8X02rsqnzybqJz+Qk
/3Fd6h+y8toN9HyRl5m+MoVBWGmNKGQAn05N/h/5jzn8VN2WA3gM3lnB6vSL
HB7Jp7gSwJQ7evLHnAacVjOY49F4/+Bg/+tH9MUaFnEns4Sl3sJg2Y9Pvp3i
1w3PPZqWsMy8tMf6uxHA0i5qfIPX/d1dVurL6Gta+99Mnf8DMPS8nI6ipY+f
jPfH+nlVrJcT2MBbQCK/2Mu8gOPQl6s6XvLrF4DDX+8fxkv+/vIE/lwtqhIe
eAIDPt0/GI6fHB6FbVzDqkZ2tKRFfXvDq0lw7t9zWwHMXuXrFN6vq0lemDBS
ka/v6FEGyZJ+TkfKyoUB4vW09Dyzmb68A+xc2mTdZd6YGWA7ANYizp0sYWHT
CPp386z8dgqvDy2/nkz0yuTxes/WP+aNXX/eDLCdAqjv/WyW91D1v62BnBKg
nBRmrl/Ors3nTfOBBgLCXG9iIP+2NnQA3xk57X58BJq7/sCPfrtYZ45zqLKq
l8AEb8wxPHtx9vzpwVfP5OPR4ZOxfPzq4Ohr/+3X++7Zr76Cj8iW0zEO9/mR
8+GLEfI+ZuXmugYiH67qqjHTxv1OrL5urm+vh9ZcI6cYIt8G1B02+bCYZ/jg
aX1SjI/wk9bC89+amqYtpwboYLnKakQuhOGFsXmRG/zhtQF2VeZ2aUkuEJyJ
07xeFw3A2TY0pNbfW6R75Pn0hePz+NnB+YcRLCNbl8mXr0dwsBNmWuHbq1Fg
Zcmzjm1q7aTK+Gi4D4JlOBzqbALUnQHXUVeL3GoQiWsEhwaA3QDLtzrT80TM
NUAtM3NjimpFD8LeE8m3SwJtmcLgHkkIj9xm9QyhEYTiKEjDKTApWZCWk8TX
susM2FoDVFG+1zjL2YWeA94BA9eTO2B5N9V7HLOopllR3KlVbYYz05h6mZdA
ALVZZXmtV1mzsLCtrNE4Dwj6aQPv0kYt7BzOfmmGFoZAaFi1CyIFD3FPw9Jo
d6/fvrrE+c/f6tI0CCkL8N+x6wnwtqU1052BzsoZKQUAIxp5CvPgJhTALwNy
xs9ZoVeAsrggHA4/z4vqFvgvnBvQWIUgypB2s2ldAUItEaFWhdEE+to+fnV5
MVLKwY32MzE6X8IzS3hNAEELgR1m8h6+xhoLACZfwjLyEr6uYAEZ8Evg76o2
/7HOa4Mnbj3cK9hIHY0x0ucMQ/zeAGSMNhmQxR0tAhhENVtPzQxod8pD0WJg
pxYlFZIyrg3fBTiamZkFFHB7KJFGdVkhZlYlnCk+qJtKrwG7agAUgBnBK9QM
v6yqoromHQG/l/OhYwNYTNcFY2A1Vwk64DjvS4D9LeJFc7cyOIKcvAYyz1bW
vStQXlteiTXw7u5Osy5LU+zs0WnAqECaADr4HbYOGIzIOuohulVlDU8/y+10
bfGvWQ56Uk3EtsIZhaZwXKEcJpyzqz1tPjSmtPiQwrWsV6uqbjwYR/pqYazR
GR7NBwMwzeo7mq2syqHnyvhYvK5ZBasoq0bZlZnmc3zjThOwYW6LJ2g+ALLk
jB6gGmnQUGmzbgF2PV1oUPfgsx0x51nmsxmIavUFcAZGDaIH9QOpzri5jx9F
CHz6BASETGR4FjjFBeEd7PvsYs/BwTI3ddCeZHgmyCn0BIRtg7qJI22aYWEy
QBs4OsKVhdFerMBK3IOed0WTX2UTIDuG+Uidw1wGtUI8OgCtozMYG6A5Aw5a
LYXa8GXC1SK707vRDtWlcLXD0XiPiaJBLpZpUjirojA1QO4c8c0SNmae8SE9
OM434J0BU5/P8ymQdVHg0QGGqpkpUGeGBYG0zgsBw9mVXmQAKwMq/Ho1I/4S
Aa4GHbKEt66BcDsbgLnj9Q2YjWaFrYiCCQWANAhYhPrZdKEANMSqbxeA647e
amJTwHpx9jtammxIkNHR3qpYyymHlaHUXWbEZoDpgkiHH2Z40LcG5kKiWeb/
gIE9E6EDtgNEVQXHGwGJZk5ZN55FNcQThSF2RNgR9u1oIAiACxwGLgbWgvwL
rBUYJaEfR8pI8XernLBDDsrhKkJAsNgEUQGshdEcZAsj60g9h6UDO4aBcZB8
EyLoajpd13bA4qaqQQ9aAVhI5Ti7UG9Mfr2YVExAwzenQEQTNBcMgpoOCk9t
pLrCXUfCXWikjRgDJnhAq/O3JMEJ0VHLI1JerYA4zIcpHCUzfcAN2KCAYqAL
2Clzb70CXgnICjKpAImHkI7Re6QSZEdOjFIBzxG2CxYayso5wq9vlYj3ERbN
tJMeKVHAEyIpQCKpK+LrTnHzx4dTW1PfGNx0BghTrImaHdbzuAxpgJqiQ0kJ
OVJdClCw6uzacSWW5SsWxjkr7fB9hx4HTkuaMfyjg0L0ym5gBj7Vv1S3OAUg
h98OLBr+U5h4X57zA/IVK3fasm4VYxvCapqBDARCBOFQghwa0v8tqhWKanrx
NqOjBuHdoCJDUooEeObmm1YrUgFKkdY8QD9mfge4UzLHoSUjB5hmNdDg0ina
ERsEoQLvFkPU5hJ1ZsDqis4tLaOGN+Gsa+00C1E4E7xTTgWCHwswbpBZrpvs
2qBoLkBnQ4A6yHTEvFeFcMYSNlZOAbnWzABSbRogTrwuUovV90DGGvXYKas4
xHIDbiVQGgQNypT4heVHUTkAEEzfA7HUMhfszBD/TRCbZeME/lqvIkVdibwD
gqgAsaqcKQd4MSCuqFQw8gxQM0PNxpH2xoG0BYZXzJB0AagAG5RAE9YiSTEp
YjPBzw6gTWwCpBxg+aQwkSRpK8MmJ62VKC68pxzzDF+N1Kv0GQRtAZKkET0v
m5vrtawnMUU8SQA/UfCSJblT40teApGWhBgrYscQ8AGjmaGjfASNxRRzhaPB
Rt+kqxugoAFiXSJ8gDhg2A8Dlry0qKClR6KU2OfZBR4akvGiyqfEgORQ0BJs
zPWd9kaSZSuI1XM+U35W9Z3Fyw8ZrsN2h8TzBa2/WMMemOMMWcXwp4OgenV2
0v5691UF5H9WGwMmLyyqJP10wKohOgU+fTpW6k/6qm/QY9YcQNzUFbJg4aqy
q4g5CjvVXQlBBAnrWK1r0szRHXbVJ0oaJ9ad4LGoF5V0puijnANVkxgiRxOu
cICSgsRSoseIodKZgNkT0CqyLgtICMM4ezxIKDkkJ8RwuT84btoZEv4sQC+y
tMMAjgFiXkyhOhU+KEq8dCUNS8hUFEFQ0bKyva3cCpYC9cCAxI8zfItsugrt
8VjrYsWKoI0aZGnmoKaRGk07yVb5TNaQ7LkrEMW74uSA53GkWTuJC4tjrEQ+
frNBWxghnnVRtI1kwk1tqoY3FSwiCxgM0oXVL69CAW6yN8UvC3cPBjVqS7ng
LHpXp7mjMdatBpqlmZcFsEaR98ANENmI4rV+w1x0Nwf6QXMvbLkGDRWOq9nj
XdEAwi5JkgSFFEHpNIaBN2X9Syj/M3mCtSmxv4c5QHEFljFsUvA/vGGcT0hc
MbHKJHxEpBtu4/uywOhFwkYIDD3sw6svPDnqIXP2vzmhd78uGztUQHOZ1vkE
Bg12Nq6XzhpYL8F/UgFuR4yPIak86zczMjyAysL6lmhLowzWbGIDygBNMJ/2
s0drdQuZ8apj7SKbkToDq8oU4MsSLPzHAkXyLC1BkBQiKtDFUSIfGh+PY0nH
Thin7OQ2skxEfhKZIEOiCbTzWcnX0XxoHSOBwTqJP5BWBmvT4y+TKWVZyczw
npqt2U8YvF4EXzcxIlk0G4m2rAmEEtT4CP5I/d4ZOySLIda61O7rigwdkTJP
xp8+sQMvs4SsxPm8DwZ29vEjO4s/fRqhQ+OKpCchflv3W1sh5aAnzoC5leQA
tMeMa8f3OEwDRt73pI7NVXjtjN/o+lHoNySxzu/OUMQnzrs/n5fkYY+Gedl9
6GXrGRBNx1scK0qdDU9fH8ff48OvM/teqbevYPy3Vc7c8hW6WnDHWQ4DAws4
1l2VgXZOI54yquAf8F3YcsJl8OmT8GxYxIm4qE5fhp9fYuCDfrmBaeDwX/jj
1GKtEvF+/MJ8OHyHMYl387r+FDGV4PXz3A7tT/ZIg8ysc/xxmwa+MHfOpTdd
N0FvFpFBhNJV2BzDY+2aDkW8FyjPkD0At65wODcGPeIYDlIzcMERuqToCxDf
1imn0WzZlH2WuEBC9cjQBi65npLlA+ZkzO5pIhs5jWmXJQ12w5hNPlITfRG0
zp69AuWiqqJE5yLPXKI6TAJmoEsE/rMnMAV1BheNlN0+3Q5uWDhnmPD6Go+5
ckd9EltnADcLJjqyEJa6wH1EVUR2Pke5QMoe2hJDEEBAMc4QJucPhr2NuH5i
rwLIGTEmnND24zcLYGzXLFFxWEXDDmSq2lwzb88Q4t1FiZUVWbZbT5cU8rcI
tGPt5Jez7xFN2CPmVlZFtutNnsFf/BvIaDKmnCcs9blT9IJVAFbJc176lGKa
RDqE/H5WhEwQYjE8WM7fsaIr8YFRsCl69xAWI6pR0HrEpYz2jI5njPe5Xcd0
fJxnDpOGwTL0OaBvMNGcWOTrWFfCAbxCQc9EDm69XNtG7G1yGpHCOdcSEfWL
w/2C7KzuROgRsYtBNBADkd84f4ER891L+O+eH13mF23+turDHqRBjLF4EZax
OeEIBRXcm6xg5ZHkNeO+t2FCtC4BCTvMvUsP8Bv2VBALIqkdxRdYJvfhNWlu
OGQRWcbeS51YeRipW1tvgbmDOE8JFfWBDpFtWAE+TLTUNwpptp8xkjgvmZOd
Rqz24xfM/t6Ft94J5/zExB9zat3Dqa/JGUdAneTzhhSh/w3/1JdD+df90Pnu
S/UTbQ+MO/yArBg/uB3/hLh9oum7lyf6J/XlN/Kv+6HzHY6tR6MRvR4+yKf4
O/zvT5+5btrqx2P9BW6eswW+eXS5BWajR4BaxGuGWZFfl9/sTFE1rXcE3lPM
simRN8/Jc0RMlWFzzGMhilfWiyLkLhwQjEMQdXXrxLw4brSQAluVIx6WdCNC
rkgKUkATxwtIMeAv2QALygUMim/wYF6pisZzJ3j/kJga5LQNRz60xJN0gW3B
q5vsPXB+YBJrlvZBdUB3u9YuvPZkNCbVIUiLBcCo2cBpm0oWdZqs5mW6mlgH
1PMiu45Gz5OjT7wqhl4j3HBHZVnDMaM21eGSrQEzEYwWz2DmeU0OPtR1gcMW
MwmkoZWN3ih0O5BvQZQgeS1W58gL5dQywJSz/Bqne4LPxvxRicrGiiYdGclg
innZfJmjy/wWJRiJSyDP+0EgAED5IoqrKJOUiuGEC5J8LNr7WJtzhPERMn87
Ec2QJOUMFLcsfNHFopcCoo9fZO+EF9LqgBzJgZa10dLxX+9qD1LdyQtPHplo
xYnHqZpQvEg0W9krwI3wR04qDdttBqCytOvz1vneL29idSCboIPHuYvpgIEh
zTP23tk1WuQ5inkK4VBMBB2FPtpAmSKjLYvo0y05sM/fUwqMig7lhXHeAdDI
X4g9jvlfYI+DTYTuF9AwmlsjHk70mgM6g4VI+lcsLSU87JI0lhUo8YA0uIF0
+VvWH46afOutI0NfhcMxPlV4RaalyJhXGWa5BfZrsjqLHL4+altL1B8TQ8lj
37ea2Zo9POxlnSPR9jh/kQy+t9m1nySS+WCVoLwGAxMhHfE+4imAEmRBxEGE
WHqBSdMRLSxY+E0bQnrOSvFwondUS3/AbAdiy0HJAS1AfpBpeMBHNiRzJLRD
Qks2SqvYTjMiAmeOSfaPDqxoabJSwugBTNNqlYshC6tDNAoZJiKeLSdIKfT5
w3eY7CCb4aWSjlsAGrQM9l4xxMjsjp9MDqbfmTjHgE2O1FlecmpBWMI8Ak48
ozs6v2oXU8bUzTLgxMhp0BnwK8HXjOHrve6tVwaxWyGCPMX1ZmuJFOQlSGow
QUdmlPgLfO5JrGA49T3xe0byCXD9TYXJjecSPUPscaiYJ2MRhQXkGzhnhGqA
Hu0yZ7Yi3N2upxiKnK8L3hTjWC3wRPRsMHekhUptoHYgxKSJGaTrJqXbSP/6
+MX83WT5bhqe+uTCnbwRh/CR05h0QJb/c3J7UK7Nywuxie0C7RlvK3U0rauW
I2ROCT6t0TmSs5YwqMNAUlBPeqZjf218AJHPVmaOQnDJZHQ46cCxgtsODzgo
pgsmMYuGaWaTZQSNDrWFKDZzYVYgdX2aELnxNikMwEajN+vum1tcUgAb0OBt
jh5PWBsb9TaYshOzyG5ylFLocbBAOChWwILmxMubrM6zUlKHEnW35WAWr5zl
nV5ylsdLDGDMKFiCwuCqpQz0qIrea5eyexRwCjBi4lRIn0hi4ik4Sy4otKgP
FMWa4yRCzvzeO/feO29J9puSX26yx3q+S0xLwu2fdLAr77M1u6bml5vszJ7v
uqZnMDz9p35bFP/vF+7bm6Z90O01VfsPUAL4m4UqmpPbrNpKkLiL4C1NynuO
TMN2YVdlAFG3rpEKMP8BXgei8CJ/lVkOsgQfX7qRLCQYgx7DCk9VGi8vUhbu
UZtrul6efDMmJbes9JzXINIQvWJCzrQhdFEzpeKKgsz2wkBtm2SfxuN6A+d8
ftumxjNWGoeXnuEFEFkVpeYAfEDrBJk7bdrwyUQMts0B4cgdDtClfh1RPyml
7XeUT1QXLXcYODSudKReYry398fIBrKs8vqfncpsAcmAF1aYrNgaIVos80nP
gMTlIKlF8XMDhdHZWcV5bxmm9AXcZP4s4RbKqJL4ueXPlP13u6gwQa1Xc/Jp
unHiZ8h4CqnIseozSvN+HzRG1oGnCnGlGNUpT5Qimi7voKX2Ith8clb/CbKm
0GDmpkVFHmze2Y8ZEj978aM8OmdSoGrCfGaYZE1RRpnLG28jDiwIEyU47WnD
UlDFceQNdLr5qZAtiasnt3LfggbKO5ADGNDd5FwVaPhLTlFl0SNQmBtMehMu
6sFKue5O5rkQFr72xsgagMCrOm8oWXmbjyLVUD6pEINzAbhQOJHKWYcbdonw
N5yx5WL0K4yqci4jbw3dxYhUSMydZD6ifkIesNrUljgj0UpdA4ut1haA7LRl
MXq2ZJRduUISF6rKl4gWuAgf42kZkq3B2yyMGalkqgEk/a7eya4AmB8/ShgI
3eCOuXz6pAXmliMvPAJ7XjE65ENH7izkkQEl4ESOuXkeXAEw5Dz/oHdOd0Rf
o58Q4fJa9BUAwxmmoDuvElh3lB1Dzg6M0rJ+y5zHK83OJPU+YtUx+FqMFV/g
GdkOKNfLCQayQKJdl6zr07xEG17RtfTeFPB+ENTybqEApz1UznJgFWABR2ls
4xI3WFPR8m+sk39j9MGOtddy9Omz8Af9/VSeRLic5ogKCAwlWpT791M6rP97
N9ff6PHgYPBkcDh4Ong2OPqXh76qZTJSLtFWyPfUQfvVdDs/hbHHG8bm7xGw
OCYB/XQ8/C+nBzjZAULjIIbGUf/a0vefwPuH+P5he2/tf+33WY/BUSy+P1bj
e97vn+AwfuD0SXKCw/Q4D4Pi2kONTm+NKc9zsy1K6FaJ7LKO5pWjPX1AtPQk
8cYoDFM7O+GUnwh5fu7Nw4F+OtDPmBiPOu4c//4zElLeW0b6X6DR/f398Xh/
X+/GOfMIORz19HAPvY5+3IHElG/jHcCzTtiTposq78a59nEuF6PHvRwEo+8+
R5HPGgmKCE1AppXsw7l70vej2iyreBH7ku+ROk/iB1MXpU++c7s+1HcUEFHi
q4q2zTUGXTjvt/b+zO+dZMrU12t6R9B4PKa3OEp0v9sHU1ZBobHIi/f5n+ea
FFbuC3EIOMWhHFf9Rb+ynm87Qpr9lLYVjO2xFsFGZdAh1bI1rH8SJPXWb4+F
S7YtkAlQ+z4fMhE+IE5kufbPB088+ZnvHRKHFOjTe88e9N7Tn/nes5/53tHP
eM+zvcRQf7cq6nfhdB37Gz+yibW1jfedJKoSsYixzz4O6oxEAA/iqD6oRFtW
gy4aVCBdgqWNUnEpt59T132qp68zQPqidKS46gLZISxMspk4ExjQApcL3BQN
MSrXE/8AkJ7fBHA+60KBqr1XJjM3EKV8x8kUqYuYNcWrxdpSllV3OVuFhawv
MGYODQpDGdO//VhXzSx7oHzQyL5nVio1E+zHDXERca+SbYqj0l6wdtmZjM6z
+QpM3NscI6l9u3jWu4tUcCkH7PZmeLPMfLdsCd8LDmeY2NIZY/4J4m77lFLE
ISbdrtQB0shn3+wU84yffAdPInr/k8H9/8bg0sOOWdrno8U2xvcDunlufT5Z
MB1jrVpi3izyUZEY+xJmR8j3aWmJveo8mhLC7NMpO8HTkfA+Xzv9wIlT9VAF
9XCTRrglbitKYrST+ybv1ZnU/crQBn3x1KtWMLpyet0WRXCrJtWJP1pXIpAD
byefj3d3x/phsil23XjnjPePbnbREI907tpeF47wahan4pqXxBMKeyRVJ3Op
xXuoy6PlPLxaONYr4pG2j17heVXMMGxco/1Oddkt96PQoCQF3GlToxcyVVFV
7DZmRMNIHdb396VRJEW8l1SrL7nM0oIFpU3+Ae2Zrs+JSrzF59T1T/cDI6Gw
K2qAkVu7Ni5reQlEE8JQbB/CAXqlyNcjk64i/ALrSiKeAVTbKtQKq+osxeXa
m6T1zWY6Y/a66+ka29DEFL83IibHp5TB1rBrjTCxHzGYAgyRShJ7k3twHTGZ
REkIPmaR7mfdeKK1XWLvEDrHcJgLJEF2rKcJEfbU70zQEY7VMmH7tDUsaZP5
VGLAcq2Vz4foeME4KIBKjmRGDFTUfiDrZTqwSW+mnsQxnjjmlBKQ60+SVrp7
lqlocruRzcGDn8/mfJG/Bw2rpqL+PXHB5rg3SiDkWwpJ20bN1j6rZV2G40qO
cuSlrKBfpueGa9o5EyC76QTWksmExNIkjDTcI8iA60pTM0RtFtYxw1De5E6f
vHkxdOvuA6kz7jkzBo7grxfR82inu8z+6G3mJGEQPgtYkqKqECoA/oepq5H6
a0l1Fybgm45dB3EqTqhr7UYGR5x+iJba52gEkgMecrlUD82IU8pTGSCz7RJp
TybMfuwqym4831RbIOU7M20U4t7tExQP6eQi8dV7d3AoxKGwB1Ob1jZ4fETA
X/k8si17wBBJqqy0eLqDoGsnwQuPYTyIgsJJRQytA0n1VvX75VIsj4ojvJDE
SlVTSDYzVjn0RE0qQQrnN9rcjyGJzvT2XuDCZ3Y8uR5m1jnDenxUvdKEEos3
eK+sU7y86+AVtndA9Sl8946/Q4Wp6toF0twqbRznewVRkBHjhD2tHkDA+sCH
7/XQ11WBvMhlGvCUQlZiVa2mdbNZ7QVnMoRyNeEIM3rN+x+traY5KShUxBMJ
KOKu+LDT8ij2yK7tpCtQtAQuhvZdWXx4GANJ2BFiYihrKEDnxDeow9xCqb9N
W25EiBlnMmAvGPEXdztCpLU4l/4HrqL9QtOhRIf/8Qvc0bswNTv0Wyc+iHU+
rnlKD3Oa19P1ksrtSXKyPsSn5t3TTk1KCpw9o8YMY8Hzls/F9eVglcJ3L8KK
JZ8+k5CA04up2Ue7uVN7J32Wr3PqyDdqA4b2TMpQpsYiCZQRXzpQLtv9R+6B
MieeuNw/B+UErV1mgMfhe+CvtsBfe/hvhfPPArCzUvFv+1nwPfd1OS4k2z73
LMqHEnu07fBCGYd9FDHx3JtvOGg7lh3eeSemS4h4uRgZ0H4+9Ql3vXHuQbKX
AHgKrI45xAU7On1KYU+0hp7B/56OlEMiLLCQJ6TzXYh2pS3K4oZdLhlDxUp0
fDZseMH/KIzJU7b5trM+ZXWg5+YG9RMM2bXGU368I9wC+zuziNPpDQtR3YXg
AMyA25lHcQ5Et3iQO+sQmvvj5g5GUaaVc5f7BjuSweLTOhDghDR9si7JcyFP
fovRKl8KGH4AZIqeAsna4d1+L9E+NhVhO5UCaXNeAOlNSbtyacGhD1FsrDv6
cO6kjhrii2rgiek2oh61qpddOqzL59jckSj4HYMzJrNRT7oAkBFrH2nH1dKX
B0fF/jQnE2CoSSNKliZGp+k6Pn7B37+j7yUFvJNggSoNZh8ay4qF79hzF1sN
oQ2ppJgkYWUjJZxM/qY3aS0SaLO1wTZirc4k0lu26VkkpcZQYzrHbKwTl30i
kbtjUVo0qMsTtC5c/Y0jZ59RLlVCL7iNDem9U0rVYjkML2dkvhATDZmPgiXu
dQY0elN6+0nFZd827ZIW96704FJbYCGJdd1ef+0HH1mFLWuSbkdxOyYyOWxV
URuXpBh5w8xcyQSjASRzu5C0AdXf/c2541oFkYA56D+ilNoYhZjUqBcSHA02
tNmc/k6Z4iEU6emrxkalbUaJmkWd8ElWO4lwNlEOUV5LifQCUdpXeD15g2rj
CxSSwkrVr3xYl8vxkAI8p8BQHhdLTfbHqN7mJnoXlJ69vm6eXX4bSsddwXeq
9aSNR3tbYpFe4hpECcGoXnTyGOE1MMDShfQ6E1vC7x55H9Y6rHCOeBnb6gb7
y9wT+KGxDfBRu0GBbFdh6jZU+oCpUo7gQhQOjFcBMdCL0y23TbZAjwx8TxVF
NrtFBhpM4WlaA5QMHhc7gdzuVAN9Cjlzm+Nt8Xf0Of7bheQkFErB0VMfHHXR
Ue1qIfDLlyc/Pa+WKNuOvU4cZXtFSV8/dT7IZ/hfpDi7dLHNIdj4O/oc/+2i
tDx0f5wWP/ARhhW8imJ/bgW/GIgbI76/5wr6Y8fbV/DsV11BfxT691xBfzz7
91xBf2T891lB6EYRAorvmJu/45yJliNla/C9Xz3+3CD8x48PXcynT1HGuo3z
RNTPWFPc7121MkUfYg0nTD9oA8E8Y17tumLFwAuSxdcYt/QFGicRF/2ZSKFd
c1iL61DTNzOKJUazSMHuS9FPBmmX+8EgrFDrXZZhVFkBwtj12EGBvsAOgtTy
vw4ylwKSHLcYpMoNSumBtA+wkb5Rzck94lxCZI/HVydE7vbgGB9TIEI0UNeS
71nSznNyp9BnEVnyPQqMXB3QNuG5qWFilkqTp5YHtT2kYptUSkVSPwPln21w
IIi/KO01lezuIwY0T5/C/46wkXqZdqKS+KdLYGBPf9Dd0WqKU16wOX9qbcPy
fAHSRpPbMTBqA0E3CqTJps5DBBB9SpA4PRqpS2wO5xXQjBqQ9qzdJ190V63C
qqPk6069VM96BYmBBt16u1FY8hkdJOEnxrg+RjPwmYuJ2eASSVRfFu5dXC6z
qeWrb6KelSqBDvmmtgMtvUDANSNRlHeHS5V4jVvbVBYjZj82WbtebLYMXDGU
SqfxqQ3Y3WBd9r3hAhMtkOBS2E5Im2PM8fodznS5rSKMdk408tj4Viu+RVx0
SUqn7Tyxful4h7ciAduS9EUiuhN9D59hNtPmM2lOv+KebBt9lkfiJj2ihjt5
1Goj3Mrhuge0afI+p7XrbeKLtfDKHVyOHPkKODF2mWeDxjXrcXG6bMpuIhlx
aeAwZ23bQ+7XAtHMkoAbwll/Ww7s/rpaS/APcQFRPCId7z+732BvxSOoijX1
Nm72Kcy70S4qDlZYO2l9S/+JkWrY6zV5QKLeatzgwHnk+aw6XvtBx8vKVqra
5KePuEpHPfEpSwNKfclTLApmsJJ0502Bhnj9gRjIAd+7he4kSnIV+yd51A1e
JLuE5WeoO/XhcJZeCKHp8qPzkn3AdDaDDSfbdWWI/4aJJ7SJittWhH1g3jTm
Y9iErpXrF0XwYoSQI8Fmg1zW62eSJISNU/luGNlvYLL/Uov9lxrsv9Ref6C5
vi/GsuRHByPpl9rKDzXW9938T3rnjzSOX3P+Q54/GIlcxrhl/me/6vxP/+D5
yUx3ajzP/+ye8/9MG/khRvp+PP/R77P/+030VhT+55ro7VtNfp6J3k4J+GUm
ekd6bjHRo9jlZhNdzA2n1HG0lbX+cNECJmyPqbuAa0UAky77g+6JWM5kh61U
D19rZI3cSOiC+fwXjm5NcSMxmiAaKLtY5hWJxCrlQavhWSxoqrlC24/6QLIG
V9yJwcsF4hL27hPsFKh/GmmetJ2OSFbeEn4KBpubZBAF1Y82jn40epDB30qa
cDXnTFq9Jn+sho9JTmw0iFFJCvl5mbuLyR53DGUymFzSRpqHB+amEiu/a6aH
7L3ucP0DwPuk8/fbb+0XY/O8p5EAWkTdlPjUKkpGiPTOvhw4SXPNpZ/GhuJR
bmDXdvUp9Ty7MXhD+vmGG2v85RaumUdbM1ebWAR1BnE4TpaNu0HQ3QKLQyVV
g2To0O1MmaPfVnupJkkCCJ0vfmZ+TLgDEVVtq/q4CNfzBNFBVzm5cgHqctRJ
50VfBKLZdFpJNn7VbYxPXZYfzqrJ9+exPET1Imq/indEqFG5Ng3yZrBv+w3b
p0p6Um50Dgcvps0xs4A9dRRfi0pC2GJxnCZyFphmXZeYHsRZ/Yy7nEeOzfIr
uiaOe4E6QXBE6S1f9N0M8xGrz3xKRc8D4bIod22P4UYekdurdbWriCGudAjl
mBtrX9KLgzy51OigoMxVvjYqveiojnOFurfXhG72oX97OcdbV6Tvka/2kSwP
f5+UbVXaxRF5PQVapMYlAxX1KZHQfOe+C7zZp+3y25igtHlW5e7NjNrWcKVW
UtFDDoULE26/CrcL0b2S/BGnfhtvlxqgwk/tJodRPgPhZxkhAK0dBhV3uGrJ
jjwNYXvZ6u3kdGzVgw3pVKHfEKV8cIH25lId7N/LF0tz/6fwIJLHSBEgqGqY
bsRxbZ/nrburXWtNd19ndNkaFUp8/PigO9Tpqs9SrqL0l1JRQ3PxdvH9oIwt
4dBIngUnlTzBdTyZP1wGkGsVl4lLYe5L+hD5Gn/tMylkmxJicEIkbWBM1dIo
hzGbHo9u7VtbbgdsY7y/Cm1u/LcDL2D8jdTehUw9VpISOuCA/bkWDEC6u9J1
GGZXj5Xc5H5vNV+qhJc9Ad/33YCT0jnLfmhpnRwrZjbt/jzq5ZasTaDn2tNb
BBPeQCqBMRtCSgaO6c7DUl6VDFF/1XygmG6rU5XLfZaU8SV+UFrHzBc3pbpq
y2VFUk21Sjmc08mVEvp3ZIFShQkkQ05lbC0ibeTkgVZnpa2eLQ5OoOort6nJ
GE3lI3isPF6dD8NP7qIM4X49dw4h3BXaHbQ5T0SUdSYqIwq4gi7esMlr3MqV
Emvy5L6azO3TE2Fvg1i5wgZs5M1ZO4JoMBWY0+NR8Ma17p0T/2USwSOxO6uW
dCuGvB+azG5K1Kc8Ick8Tx/CX3yjf02+s5cXYkPaHykZyz/70HqA4JrlIa/I
TCR3Oe+Z//2JkNZfjdmT/4QQ7ure8QDIApEf3TdK537TjafcutfvvlPenp9F
9l/rVPmiH7GSiN3p8CzJDKB4O3fVtK2LIgPn0HyXw8GWvQDZPGgf5L+/B2MH
PXcsbd0KXfMXN45PMIZebV/is2tG16OBuyKTdm8xayzzybiXctvOhUiH3cuL
Pbl2aK8FPVnLQ+B35q5QCJoZzIYCkYO5A2qRCg8toxt5A4eXPsD+imlNlxJ7
UMN2RxumYHvaz0E3qBL6wdPR4XWnEPOWvicrYmJ85TmqZ4JzwbEvDhfOZYyH
lts2NvFo1oz5xkgqbojVfk4FoKpgvtWbLjKK2CkyEuKoZ0SDCdyOhf27n1uE
dywiwP0crfnYiwDFIiCq4HlesemSrOKK2PzHL+gGOtDOIhPx3VReAEsoGsZ9
yyqbl2SiVkVtvtuAVlI365J23Z3M8cFTsml023YbatHVlyTyaPXmwyKf5E3L
lAfSqjH5usaQ3pSl15sWfiLH/BPfp9WzQYn4SfNSy1iPqI4mGG9UlD5ivAlS
iTKwKUFZc1/UrChGvIaLfieLXNBe8T1cbrVcR1pWrdvPcN1I8MT2LlqXsPqX
7+CtBbGNZsO+q3mHkO9ZZchhqEq5om4QKesEnl4lNOxpw146oemMtfc4iEyy
OQz4p4Q/RPvmm4aXUuF3z9aRATLdhfGd8Sj1Qxgi+M/+3Q0guhc4W/fycOAA
QoXr0CJQbYb9IGFSBJKkaCNc70Y3Jeles6eNlKBtYH0riRO6fRxzCJB20tvj
Brhepifk8zQ8WjqkcXrJx8smK0k638Tluc7TIEPSGNGyiP1dGi6wv/QvRYjR
5gah6o4KdbDF5UpSeKS9s3R/FltL+TuPCfrJdcUj1SZA9gjqazTEKb0lujub
FALXqj+qNlNybaA/cMZKml2aHa9LuSGHrhOP9IhRIsv83qgXsZxNaohSIUzD
XgLyGVFfadXeF/nzfSUTPtw1/FyFObrcuSQKq6VJ6t9x+hFLC9s9FqkV8QoD
H4EwwuC7RzL/K/2kx8eauip0lA8yZ0K5cnjj4FhTWVaH1B/y8pNjunaiax91
XvnrKtGmYg9B5Lh2IafkwiFS6YpCXIfd3tg6aUXNpmD4MS6mtGIL9lRNu1Zp
wzGrOEP0GlOT66GsKxSKernae6F2f4atVZGvXdSyyd2g/6BWUY9riljIiTB2
Rty4/ZpzHNFLqfr2os3fYsVzIGTeOUDn0hj0z8g9xImBUYpcQmVbjlTxker0
SPuOM9w2RV979/XYxTEpYDDodO5zxrLVp4cU/VKufvX0yNXGdf3PnSqgcWhL
wy+4boCtatmQ/DCQNDdvmyT9A8Xr/oQjpgeiVvUtxLcrl6DKthQe6QSWRCTz
LVA7iKBGUQzpniiXmUtycdvlw01ZuJ12Oi3mDwsntmxCdNA67m7vDj5J2ibx
3axd9V6Jd7dgs/nrEpE0w/PgHvRiC+HrHz9OjoZxlCeQcUK5zic7eZo+nT7j
a13TWJJ1uYwEOkAk9FtRBaEp7jCujkHfePsd0w+3h/cPtvmq3Kt0W6lNdBOB
iuZ5es88+GVrFp5kXq3rlgy0Ldy1rptnRxPaLKC8T5FZuXKXe/TuQSIUkUb3
3LUbzDyaiyMWILqo6LLGbuZp0sjvI0bThcQBaz+N+tnFUYtdRFEBCjC7Vq++
04xKEqfvdU32jneo4lgitcTm3Owng8jNFtsO9NrTOEWDqgHx1VT1oGEOJU5K
kb4IJS9zsWhse3wKbNyTBsweW2RjhXjBlz6GIF2PmoY7z0XhRYfhTuFPmyr/
s/rOpVONQ+3bOE3nkxT8Vj7X0a9eddWp/0PE/2Pr/373FUhS4X6U1PfkvhX8
BvV/vAC3gkOe0V/w/XvU/6WJhePfawUhte8h8tvn9R218vo+t8Dun7yoy4so
sdXzoifbMODpb8OL/tAV9KQ3H27jx7/+Cj6XFz2lG0p+dU7wh57C0R+4gsCL
NlsHngM9/YUciNwPv3r5DkcZwz1UdItQOVuj9k1FGcPJ3ZDuRsMypDubR5fe
uuoO5f31v3GpT29lYMhSkYQCdAiQ+/68JAuCzb6oDobvLfXJPyHaQGETXJE7
PPSHhpiJs6ulucnneWBUy3br9ZR9phvmocaVjowrd1h6auomo+uSyUhEG3ec
YHEMiM0p6T5Nvi9xpS8ffRAZR610dPWgdPR/yuJUFoskHI9Dmc+zfjn0s+ts
frYkbMuh32oFD5eEP7vW5FfTyn+rFXhZHE5hg334W63g6A9cQZDFm7nYxiqf
z63lOcF+BtHVgJuSgriu49mG1pMS2Re51XEgk4t33eQFiRJqwsQCh9N9IxkV
RfIrFbrpYu1K5NaN3cZbVnvgpm5lHPBVOCjE71sFVwxJDXcUy+9v7Ulgh8En
d87LdyATKTdRSyTHDkra04KAk9x4SF6uI1IdlM/9BumFl4ka34wiaTIS7laQ
izbQ9Vf7i5C4FuaZaw5hVeydZ4+ZZKhb9ox3W0K0m1pvbKbA7fmfdXLaBbCH
GzOlRCNBVHAt/r3rMvKZA3OM77VkXWQznCPsOBxgXjG8vwnmh4OenKzTsazP
Pa/w+eDKDP7AuPLevcoOy84pqhZ+wzPdTel0+U/oqqazCx/I8DCljqalyUlZ
DMsP3QzbyZklHbv8qtpJfVuhf4jHbR1JpzBvZ9S51SHU8XZJ1V0bQjBNc0tr
qwjM6Xkpf15PJXe+l0a2udnHD3az3+tib8eWfm0Xe9bjYEdQthzsLhe48/DT
pIqsnVRIQa/DP8h3ntSsec85mooYNl+663Te+qaqsFjMrYGVhhQbmv+ta7ZZ
uovP9XO0mZTq5uKEe2K4C2SP5k/4H6XyUWuTaCNs4URJjIQSMHnUXQEzWaKW
05St8CJudpgmC+4K9TrZlly04HMMMRGJrr5oEfQeZSckAybVhMTmt9+fgV0e
tF+Gx6571uNvQuEkqS3rEbEivd9xeRUaS60U13hYGA8YioxGKScBvL0WqNM3
BuFycI9fKk7FArS8NqWRpIQTn0CVRmKBYQA10IJTYzZUq1XLbm2kb40KuJJf
c43hvLNg1c5hZWktTZ+pMMZd6nRHAzo10G1NSV5sI81icRnTYJvKoYc8oi7I
qrqV6ppUnbn2YHFf3+h2Add7N4g8O1A+f4mEg7mlzB1Px9XkRw7W+RKOpDm0
z+1NVuWaZHoebz7kfM/P+VsOp14tWpcbkJ8jmRnPnOLq3Rivu+EAM53QzTIi
t1TwF/SM5iEyCBfHdbmI6k2I4Zj6oN0QhO/kTgo5Hx7lpxpyAI1zPTwkqecT
qoLhGjvH2yhgHjXr6itC3Rh6pmQ0l1YWqwJ8s/QUu/+UcYhctDIlTq/oOrhE
HcG4MSdo9wgM17lHpaIG5Yh+DmtBIqZUp/AHNcomoShnwpdjJbdvOE4zpetO
WNS7+iX0FzHysej3BBV3K6Z7TxtkWugfkkvaMK8P0LTh4lF4d5bb6JtWUitl
b3QRizuCR3vDdsDwFHdMepviWnudiJhc7HdL2Zr+aiLsy1zZbskf0ded3IVV
Z/n1onFIQeFvx6LStEiqUPWpkSpkJXvW6Tx4SZvxYBl0LS9PqUmeFKs9lIRF
6JcM57tfyWhcfcDjKbeAVqIcEv8SXXnGZ/UOInUcBDUf9p4DoHC8mbtgSOo9
fL+z6P5v1yGAp0QDQS7sitKlAAQqpHLFNW5OYxbRHzRG9K7aVS68yhVy4eZd
i/MULHRofJdRgA32KRNIJ5fDJJARGnHzSL3iMC+Zr6JgZhix3HZAmmG6e7XC
EmHSv7Esuw2edspIt/qF/ctwhneK1edWPrEUusCkDwM1uTAY1Hlje0GNtTUz
RHUgiBjeP4hOIB7xouigcT8Oc922a5dnSYh2mrOTgLP9xZTZDCSRd4KUU1QE
rDAATiGOiz4dl4oIlUzKJquvTfdeFV+U3GmOFwqbo+OaYaF7w9pWu9Q2lGzK
XEk1psAndQ85Nvovik5O7iZuHE8g6zh9su10yntKfJPy3p6yXkxEDgyc+ksw
BGkMvBiL2SOhkK9IPlvXuMalXOdKFzO/N9RChYXgAl4y5bXoSvOcittbdSdO
r0n4pueZJNQzMZh6E26pq8V77AjQVGlCeDdnFeZPc+0WmVOgpAKXNM5Q/sVC
5iSVVi/a0qq3Vx9bcOFVqsZYbOpnviHW1yqIiDfdEkMD2TsrddI3p1u/DIP0
VTBjEeabKm6IkNRa99Y7sLPFzCQn/Gphesz3Hec533F96l119rb94XK8iOwo
q+GGCM8ao4ljhg/DeOqKilU8MzBxlQSVCcdHS7vqbcACejZdz9V3E0haOEL1
Iq2J/qTPGxtrw1wHJXWZeKzRvQ6dx/wtQNo9EobWVASHPBaNAJ8F7E9Mwoy2
15eNJZX9/WaE93DVRl+R7P3FUK1ul2mR0mlkPTltRQwrotANDgqpaQ2lJ1Ii
Qr7LCMlQ3PjaxNT5AluOTMNWiYn0RrmP+oPSuY30eziXt+UYw5OOJnFs3Lcw
gdV20VYqjriHkUgV1wQIzttgKDu57qhp+atg1Clp0aGS1xXuD6ICRLygbd5n
4Hkai/sZSIHjAjiUqbtITMcqPXGtK6sKYzublvE5dHdatHrwEBozWm6qvaBC
YbLgY3RO2iR1DFMEjUj40Yazk/sY20VJ824Fq93IWj5HGPjE71Di1cuk24jx
8BlQeseWK116rNm3s1l9QPSlpj+uL3PjnIYs3bXTI1LNQRa3w+x1p7+fqSfi
yFZOMh7kbLHRzKx7GGGWIIN650kyZ5yMmK+LAobvLYYtGSqi+APw/sU1lwEC
FCOdCCfbOIT1+RyI5dJ3Wo7YdQObd0rpBqyfgPrXKnGnvb4OSo/eovSEyp2E
7pnmEK/mPYfe22jFHf7DZUBffZw01kb9EWcHdQ5tq3nNGm0kATbcQmY71UuI
dS07XF7m29wuDSwHbQwXGhGD5eMX7hfvGxFrm+nHM+y+AkX0o/CoIMUBTUur
JuaOrjYgPpcVYGTN7nRo2RQ1dQRwAt4hmqDPntoJfXVw9PWnT+1yIuDM1Jwr
dB9y17AlTYiSdRMH0ucnb066G8ZvP2H9pwMVYhXrnvgTvDkcDolrkCcJzuIa
bNhrpf7n/4DZhi9h91V9rN9iZTgj3434CsWt9L9Yha7NjR6P9ZBd/jiecISX
l98h9v3wHUC8zqXwmL6FV3Jzq+eAqvj8SJ/hlfdpCR42kjH6scOA8OylMfrq
9IV3bk3o2l/ncCUHPrxN87ADCiMSFXk6W/OyzUgmUdQdG1bAOU4iMdFoxDcf
UTSSzGYMyE3XRKX02Ps6W87wLghm20zemc2xVyIiEVHxhblFdqGzCSqCU27R
XNpbeOiiWgIlvAAVochvYc//9//UYIH+7a4EaoM/TwF6pf5LNgGDLCsVEI+V
ctEJMiYL5Gj07hwWYdCjtcc2gLujDDTGZm31biRUsmIPi17dJjCSSMc/c0lr
2Rowm9seLI0BBH06dF8tsw8JQo0EdWYqeglz8OocrHX4m7aOyDPTgFcH4/HX
elKB1K5XBV2S5rr+040Ybg9idHowI33S9Rv4qBumgHnXiFe7r8FM1Ke5Bdt+
j+azVYETvozgeOLhjgcKKwSGXWI8hta2N9KnCEtBrrlr9kEJcBW6UeZ8MXbD
6OD6UIW5gJ9nbMwgyXqv65o87v/VgN7eJiYYqc70zmhHn2ub3dK98beSEOkC
Nk7j9+w6OjQZdJmXSKigDy6yFVDn49rw7q7RdHlMZ1GBdQHgwqmj33QYZE4U
uAODuGu6xI2zQzsOD7ZLZfWf9Wg08rPv+PJG9FCwnraj/0ycwoOKiFO4JeD3
lLP3/LXbzFHwdoIZXbuHEOdg+wtpoSZuB+SUX321j56znNQzKef2P9DTuFPE
ipeMCMcAISfT044D1ExRvJuscdz/4ONkXNJQxaEEun1J3kP6dtj5lq+9PH2B
7WcKEhkXV9+9OL8I7GnXwLA1XSjjHlmXzDIALIENMLt9c4UvC4vbddxi71jp
RdOs7PHjx7MMWEGNIrymDnajqr5+DPj0mF8aUlc77JEynNf1cP+rIfAQYJ/D
BoNYwCqHCxl0eLB/8HS4/2y4/+TxnlLuKs9no/Ex2EZyYsyc3r6++p7DzZIR
wN0O9O7LGybLF+eXz7+/vAT6OylYXzjWIu3cfQvhxh0n9K0bhqpWvfD23lv5
FecGeQCAGunX2R068JrGLFcNN7LExo6GHgJFDvS1Jd7KTTm7xFGvc3S6L0C4
3JpH8ODOj2sLiuasItdshZdF0Ceh1GBfoFRxHcbWJYhqYAOwJbkIl14ferVS
1oxfwkqIFcOxPxYWsS7JiPJ4DBvxAEa4ZMyUJqYE/sRdIGoJYfp3tNp5a2pi
/vhXGlcBmgQLjx57HRpq4l4uAVkMKWyv0aimXXzvCz139G72PjuWIwJ1cEqm
DAUppTMH8m8wtSR7pWFF2BrUh0CRXGHWNyrNe0zoMdKYazrGSL3ePcHJOvf7
iteZwmzCr/awjtftHHs1TgH5GKt5WJ9uuOvFbl7c3eAyAimf03DU0MFw5j6a
A3jPYZIb8/eruxV+271YMrkpxp91iRhmKPzEDGb0d59l5e/xhXX/HZsC9oYp
5OKavrswMZ/pjXT81rvi/9tDAQu4mqSq/X2E9x2D9omJGuvra8PRQYfXjFnu
WlN9QhznmJbjOwZlkt2BFjeRHsh6VC4IGJqbIZI+iy57zG4iigP4kb7r18J9
IOgyIOvugSdBzPfxcuMJfZu5GmPAGnLgn799/Prtq0vmy+we5sax7gexP0wZ
ZbCBMMeiAtedwurrqiLf/A4riTvB/6SvWMzf1nljIvuN0yFcQ1lW7DzSXHLR
QhaRXrjbm2mKvJN/P593QjvYR0Q60fwdxaWwx2MycwvyG2VgX9bZKsoUkLZm
tMVHjk0+6rsoOifXPYb21zVGQUFq4yKk+QCyDNaDb02B2OKCU4IEka6R/RgZ
BW5r8Y7Fss1C38qdtttkZ6Rf5DN1V63p1hctBs+f9SXWolxXxneXF2WI25AM
QYVJpo25Iipt3lGBZ8eRf9LhfP/fmT9RalOBLQgknYTQbGIW2Q0qEt4mW9Vm
6DrFOk6OSM0lPdzL9DEXr0QaktAHmN0cQdOys/9G24os9hHQK4y8ZZGke43i
sctHckUU9WWCRcLLRHZ/1m9RvXXsqPHNLqkzOIkG1LhRDtDNZL67jafzAvEB
Y32UoQSafKjCIV+A5wRv4LnwG15pG2bmhOmp6w3roCaQyPGofPR2QgdcoxtR
Vha1MU+zDcSXAJB4YSbPq6owd0wboKDP9COW+I8oJRcFJnUva/KlCXcEkiwa
6aS1WNq/+RbBis4ygzJs4uL7u3ZvAAKB0gTRZgOFAl1EPjHA+Utwud5TIHQG
25Ue8ZJh4BLSfGcd3/4Jex9q4l2+GYYfTZRS1yZo9/wt/LQnDC53jA3AWeJt
8rBIXiy3XSb0Hel/N/aY8a2RjYNK0wQvHSO8sAefZCT2V2bTewSibqvhHnA0
hYlDukMXtx2tI6OWRjFvSu8giNLsKMiq/1pGHAAUk9kAGQVFBL2CuHtBSFW6
Gffw9G3Yllffnao0fzxzhlweGTWgBvlkGBImrusC62214SRDBJxP0PMnCEt4
jP41t+v4Qnh3LgtTrObrwiOjc15kmKZSFHQ6/wn0IE4vfV0tMjCJgH/F7pJd
C+L+Dq+YLp2iihi+Rz6gk6lrcUymFNZalOvlBC2Fb3bmoCabnU/c6dGZ6bw2
Aic3UgNlA3UhwLPXpi4ooPKvZj6vAXX/O5r4A31VlXfqbf2Pu2vQGGcZqS6X
i6yar/VbAyAVLMrrYNI5TRDtaEpERALICpkPRQA88d0aSzc0qI6AmPpvphBx
yRdAgDVq8SjElYIJvQhOPWEzMPEToD95PSnEPTZS/w9ZNtoS8N4AAA==

-->

</rfc>

