<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.43 (Ruby 4.0.9) -->
<?rfc docmapping="yes"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-lisp-8111bis-02" category="std" consensus="true" submissionType="IETF" obsoletes="8111" updates="9301" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="LISP-DDT">Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT)</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-lisp-8111bis-02"/>
    <author initials="L." surname="Iannone" fullname="Luigi Iannone" role="editor">
      <organization/>
      <address>
        <email>ggx@gigix.net</email>
      </address>
    </author>
    <author initials="L." surname="Jakab" fullname="Loránd Jakab" asciiInitials="L." asciiSurname="Jakab" asciiFullname="Lorand Jakab" role="editor">
      <organization abbrev="Cisco">Cisco</organization>
      <address>
        <email>lojakab@cisco.com</email>
      </address>
    </author>
    <date/>
    <area>Internet</area>
    <workgroup>LISP Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 198?>

<t>This document describes the Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT), a hierarchical distributed database that embodies the delegation of authority to provide mappings from LISP Endpoint Identifiers (EIDs) to Routing Locators (RLOCs).  It is a statically defined distribution of the EID namespace among a set of LISP control plane elements generically called "DDT Nodes".  Each DDT Node is configured as "authoritative" for one or more EID-Prefixes, along with the set of RLOCs for Map-Servers or "child" DDT Nodes to which more-specific EID-Prefixes are delegated.</t>
      <t>This document obsoletes RFC 8111 and updates RFC 9301.</t>
      <!--
CHECKLIST

- Check about interchangeable terms! Should be OK
- Check about multiple signatures. DONE
- Add somewhere that for timeouts and retries 9301 applies. DONE
- Set TTL in referral cache.... DONE
-->



    </abstract>
  </front>
  <middle>
    <?line 213?>

<section anchor="SEC_intro">
      <name>Introduction</name>
      <t>The Locator/ID Separation Protocol (LISP), defined in <xref target="RFC9300"/> and <xref target="RFC9301"/>, specifies an architecture to create overlay networks leveraging two separate namespaces, namely the Endpoint Identifiers (EIDs) used for end-to-end communications, and the Routing Locators (RLOCs) used for routing and forwarding.</t>
      <t><xref target="RFC9301"/> specifies an interface between a database storing EID-to-RLOC mappings and LISP devices that need such information to forward packets.  The internal organization of such a database is beyond the scope of <xref target="RFC9301"/>. Multiple architectures of the database have been proposed, each having its advantages and disadvantages (see, for example, <xref target="RFC6836"/> and <xref target="RFC6837"/>).</t>
      <t>This document specifies an architecture for a scalable distributed database of LISP EID-to-RLOC mappings: the LISP Delegated Database Tree (LISP-DDT).
LISP-DDT is a hierarchical distributed database that embodies the delegation of authority to provide mappings, i.e., its internal structure mirrors the hierarchical delegation of address space.  It also provides delegation information to Map-Resolvers, which use the information to perform EID-to-RLOC mapping lookups. A Map-Resolver that requests a given mapping will follow a path through the tree-structured database and will contact, one after another, the nodes along that path, until it reaches the leaf node(s) authoritative for the mapping it is seeking.</t>
      <t>In organizing a database of EID-to-RLOC mappings, this specification extends the definition of the EID numbering space by logically concatenating the Instance Identifier (IID), Address Family Identifier (AFI), and the EID-Prefix, in order to use it as the database index key. The resulting concatenation of these fields is termed an "Extended EID-Prefix", or XEID-Prefix  (see <xref target="SEC_XEID"/>).</t>
      <t>LISP-DDT defines a new LISP device type, the "DDT Node", that is configured as authoritative for one or more XEID-Prefixes.  It is also configured with the set of more-specific sub-prefixes that are further delegated to other DDT Nodes.  To delegate a sub-prefix, the "parent" DDT Node is configured with the RLOCs of each child DDT Node that is authoritative for the sub-prefix. Each RLOC either points to a DDT Map-Server (MS) to which an Egress Tunnel Router (ETR) has registered that sub-prefix or points to another DDT Node in the database tree that further delegates the sub-prefix.  See <xref target="RFC9301"/> for a description of the functionality of the Map-Server and Map-Resolver.  Note that the target of a delegation MUST always be an RLOC (not an EID) to avoid any circular dependency.</t>
      <t>To provide a mechanism for traversing the database tree, LISP-DDT defines the Map-Referral message, which is returned to the sender of a Map-Request when the receiving DDT Node can refer the sender to another DDT Node that has more detailed information. See <xref target="SEC_MapRef"/> for the definition of the Map-Referral message.</t>
      <t>To find an EID-to-RLOC mapping, a DDT Client, usually a Map-Resolver, starts by sending an Encapsulated Map-Request to a pre-configured DDT Node RLOC. The DDT Node responds with a Map-Referral message indicating either (1) where to find the requested mapping to complete processing the request or (2) another DDT Node that has more-specific information the DDT Client should contact. In the latter case, the DDT Client then sends a new Map-Request to the next DDT Node and the process repeats in an iterative manner.</t>
      <t>Conceptually, this is similar to the way that a client of the Domain Name System (DNS) follows referrals (DNS responses that contain only NS records) from a series of DNS servers until it finds an answer <xref target="RFC1035"/>.</t>
      <t>This document obsoletes <xref target="RFC8111"/> and updates <xref target="RFC9301"/>.</t>
    </section>
    <section anchor="requirements-language">
      <name>Requirements Language</name>
      <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they appear in all capitals, as shown here.</t>
    </section>
    <section anchor="SEC_Terms">
      <name>Definitions of Terms</name>
      <t>This document assumes that the reader is familiar with LISP and the LISP terminology. For definitions of terms like Map-Request, Encapsulated Map-Request, Map-Reply, ITR, ETR, Map-Server, and Map-Resolver, please consult the LISP Data Plane specification <xref target="RFC9300"/> and the LISP Control Plane  specification <xref target="RFC9301"/>.</t>
      <dl>
        <dt>Authoritative XEID-Prefix:</dt>
        <dd>
          <t>an XEID-Prefix delegated to a DDT Node and for which the DDT Node may provide further delegations of more-specific sub-prefixes.</t>
        </dd>
        <dt>DDT Client:</dt>
        <dd>
          <t>a network infrastructure component that sends Map-Request messages and implements the iterative following of Map-Referral results. Typically, a DDT Client will be a Map-Resolver (as defined by <xref target="RFC9301"/>), but it is also possible for an Ingress Tunnel Router (ITR) to implement DDT Client functionality.</t>
        </dd>
        <dt>DDT Map-Referral:</dt>
        <dd>
          <t>a LISP message sent by a DDT Node in response to a DDT Map-Request for an XEID that matches a configured XEID-Prefix delegation.  A DDT Map-Referral includes a "referral" consisting in a set of RLOCs for DDT Nodes that have information about the more-specific XEID-Prefix covering the requested XEID.  See <xref target="SEC_MapRef"/> for a complete definition of the message and  <xref target="SEC_DDTNode"/> and <xref target="SEC_DDTClient"/> for details on its processing.</t>
        </dd>
        <dt>DDT Map-Referral Cache:</dt>
        <dd>
          <t>Data structure to temporarily maintain previously received Map-Referral message results, containing RLOCs for DDT Nodes responsible for XEID-Prefixes.</t>
        </dd>
        <dt>DDT Map-Request:</dt>
        <dd>
          <t>an ECM Map-Request sent by a DDT Client to a DDT Node, with the "DDT-originated" flag set.  <xref target="SEC_DDTMapReqProc"/> describes how DDT Map-Requests are sent. <xref target="RFC9301"/> defines the position of the
"DDT-originated" flag in the Encapsulated Control Message header.</t>
        </dd>
        <dt>DDT Map-Resolver:</dt>
        <dd>
          <t>a Map-Resolver that also implements DDT Client functionality. Map-Resolver functionality is defined by <xref target="RFC9301"/>. A DDT Map-Resolver accepts Map-Requests from ITRs, sends Map-Requests to DDT Nodes, and implements the iterative following of Map-Referrals. Note that Map-Resolvers, as of <xref target="RFC9301"/>, do not respond to clients that sent Map-Requests; they only ensure that the Map-Request has been forwarded to a LISP device (ETR or      proxy Map-Server) that will provide an authoritative response to the original requester. This document uses the terms "DDT Map-Resolver" and "Map-Resolver" interchangeably.</t>
        </dd>
        <dt>DDT Map-Server:</dt>
        <dd>
          <t>a Map-Server that also implements DDT functionality. Map-Server functionality is defined in <xref target="RFC9301"/>. This document uses the terms "DDT Map-Server" and "Map-Server" interchangeably.</t>
        </dd>
        <dt>DDT Map-Server peers:</dt>
        <dd>
          <t>a list of all DDT Map-Servers performing Map-Server functionality for the same prefix. If peers are configured on a DDT Map-Server, then the latter will provide complete information about the prefix in its Map-Replies; otherwise, the Map-Server will mark the returned reply as potentially incomplete.</t>
        </dd>
        <dt>DDT Node:</dt>
        <dd>
          <t>a network infrastructure component responsible for specific XEID-Prefix(es) and for the delegation of more-specific sub-prefixes to other DDT Nodes.</t>
        </dd>
        <dt>Extended EID (XEID):</dt>
        <dd>
          <t>a LISP EID extended with data uniquely identifying the address space to which it belongs (LISP IID, address family, etc.).  See <xref target="SEC_XEID"/> for a detailed description of XEID data.</t>
        </dd>
        <dt>Extended EID-Prefix (XEID-Prefix):</dt>
        <dd>
          <t>a LISP EID-Prefix prepended with XEID data. An XEID-Prefix is used as a key index into the DDT database. XEID-Prefixes are used to describe database organization and are not seen as a single entity in protocol messages, though messages contain individual fields constituting XEID-Prefixes.</t>
        </dd>
        <dt>Negative DDT Map-Referral:</dt>
        <dd>
          <t>A Negative Map-Referral is a Map-Referral sent in response to a DDT Map-Request that matches an authoritative XEID-Prefix but for which there is no delegation configured (or no ETR registration, if sent by a DDT Map-Server).</t>
        </dd>
        <dt>Pending Requests List:</dt>
        <dd>
          <t>Data structure storing the set of outstanding requests for which a DDT Map-Resolver has received ECM Map-Requests from its clients seeking EID-to-RLOC mapping for an XEID. Each entry in the list contains additional state needed by the referral-following process, including the XEID, requester(s) of the XEID (typically one or more ITRs), saved information about the last referral received and followed (matching XEID-Prefix, action code, RLOC set, index of the last RLOC queried in the RLOC set), and any LISP-Security (LISP-SEC) information <xref target="RFC9303"/> that was included in the DDT Client Map-Request. An entry in the list may be interchangeably termed a "pending requests list entry" or simply a "pending request".</t>
        </dd>
      </dl>
    </section>
    <section anchor="SEC_DBOrg">
      <name>Delegated Database Tree Organization</name>
      <t>This section firstly defines the DDT database index key, namely XEID-Prefixes, and then details of the DDT database organization and how to configure prefix delegation.</t>
      <section anchor="SEC_XEID">
        <name>XEID-Prefixes</name>
        <t>A LISP-DDT database is indexed by Extended EID-Prefixes (XEID-Prefixes). An XEID-Prefix is a LISP EID-Prefix that includes additional data to uniquely identify the address space associated with the prefix. An XEID-Prefix is composed of three binary-encoded concatenated attributes:</t>
        <ul spacing="normal">
          <li>
            <t>Instance ID (32 bits),</t>
          </li>
          <li>
            <t>AFI (16 bits),</t>
          </li>
          <li>
            <t>and EID-Prefix (variable, according to the AFI value).</t>
          </li>
        </ul>
        <t>The Instance ID (IID) is a 32-bit value describing the context of the EID-Prefix, see <xref target="I-D.ietf-lisp-rfc8060bis"/> for more discussion on Instance IDs. 
The AFI is a 16-bit value defining the syntax of the EID-Prefix. AFI values are assigned by IANA <xref target="AFI"/>.</t>
      </section>
      <section anchor="SEC_DBStruct">
        <name>Structure of the DDT Database</name>
        <t>The LISP-DDT database is organized as a prefix tree structure that is indexed by XEID-Prefixes, where each node of the tree is a DDT Node which is delegated for a set of sub-prefixes (see <xref target="SEC_ConfDel"/> for details regarding delegation).</t>
        <t>DDT Map-Requests sent by DDT Clients to DDT Nodes always contain specific values for the IID, and AFI; unspecified values or ranges of values MUST NOT be used for any of these attributes. Map-Requests that contain unspecified values or ranges of values MUST be silently dropped and the DDT Node MAY log the event.</t>
        <t>LISP-DDT does not store actual EID-to-RLOC mappings; it is, rather, a distributed index that can be used to find the devices (ETRs that registered their EIDs with DDT Map-Servers) that can be queried with LISP to obtain those mappings. Changes to EID-to-RLOC mappings are made on the ETRs that define them, not to any DDT Node configuration. DDT Node configuration changes are only required when branches of the database hierarchy are added, removed, or modified.</t>
      </section>
      <section anchor="SEC_ConfDel">
        <name>Configuring Prefix Delegation</name>
        <t>Every DDT Node is configured with one or more XEID-Prefixes for which it is authoritative, along with a list of delegations of XEID-Prefixes to other DDT Nodes.  A DDT Node is required to maintain a list of delegations for all sub-prefixes of its authoritative XEID-Prefixes.  A delegation consists of an XEID-Prefix and a set of RLOCs for DDT Nodes that have more detailed knowledge of the XEID-Prefix, and accompanying security information (for details regarding security information exchange and its use, see <xref target="SEC_DBSec"/>).  Those RLOCs are returned in Map-Referral messages when the DDT Node receives a DDT Map-Request with an XEID that matches a delegation.</t>
        <t>DDT Nodes may also have a list of "hints", which are XEID-Prefixes, for which it is not authoritative. Each of such XEID-Prefixes "hints" includes the list of RLOCs of the DDT Nodes authoritative for the XEID-Prefix. The list of "hints" is statically configured similarly to delegations. How these "hints" are known is beyond the scope of this document.</t>
        <section anchor="SEC_DDTRoot">
          <name>The Root DDT Node</name>
          <t>The root DDT Node is the logical "top" of the distributed database hierarchy. It is authoritative for all XEID-Prefixes, namely, for all valid tuples (IID, AFI) and their EID-Prefixes.</t>
          <t>The root DDT Node is the starting point for a XEID-Prefix lookup via a DDT Map-Request. However, not all DDT Map-Request will go through a root DDT Node thanks to the DDT Map-Referral Cache maintained by intermediate nodes (see <xref target="SEC_DDTOps"/> for details). A root DDT Node instantiation MUST be configured, at a minimum, to cover all EID space of all &lt;IID, AFI&gt; tuples.</t>
        </section>
      </section>
    </section>
    <section anchor="SEC_MapRef">
      <name>The DDT Map-Referral Message</name>
      <t>This specification defines a new LISP message called the DDT Map-Referral message.  A DDT Map-Referral message is sent by a DDT Node to a DDT Client in response to a DDT Map-Request message. The message consists of an action code along with delegation information about the XEID-Prefix that matches the requested XEID.</t>
      <section anchor="SEC_MapRefFmt">
        <name>Map-Referral Message Format</name>
        <t>The format of the Map-Referral message is depicted in <xref target="FIG_MapRef"/>.</t>
        <figure anchor="FIG_MapRef">
          <name>Map-Referral message format.</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="432" width="560" viewBox="0 0 560 432" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,160 L 8,192" fill="none" stroke="black"/>
                <path d="M 8,304 L 8,416" fill="none" stroke="black"/>
                <path d="M 40,64 L 40,352" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,96" fill="none" stroke="black"/>
                <path d="M 104,224 L 104,256" fill="none" stroke="black"/>
                <path d="M 168,192 L 168,224" fill="none" stroke="black"/>
                <path d="M 248,144 L 248,160" fill="none" stroke="black"/>
                <path d="M 264,144 L 264,160" fill="none" stroke="black"/>
                <path d="M 280,144 L 280,160" fill="none" stroke="black"/>
                <path d="M 280,320 L 280,352" fill="none" stroke="black"/>
                <path d="M 296,112 L 296,128" fill="none" stroke="black"/>
                <path d="M 296,192 L 296,256" fill="none" stroke="black"/>
                <path d="M 296,320 L 296,352" fill="none" stroke="black"/>
                <path d="M 312,112 L 312,128" fill="none" stroke="black"/>
                <path d="M 328,112 L 328,128" fill="none" stroke="black"/>
                <path d="M 344,192 L 344,224" fill="none" stroke="black"/>
                <path d="M 360,192 L 360,224" fill="none" stroke="black"/>
                <path d="M 360,272 L 360,288" fill="none" stroke="black"/>
                <path d="M 376,192 L 376,224" fill="none" stroke="black"/>
                <path d="M 424,64 L 424,96" fill="none" stroke="black"/>
                <path d="M 552,64 L 552,352" fill="none" stroke="black"/>
                <path d="M 40,64 L 552,64" fill="none" stroke="black"/>
                <path d="M 40,96 L 552,96" fill="none" stroke="black"/>
                <path d="M 40,128 L 552,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 24,160" fill="none" stroke="black"/>
                <path d="M 40,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 40,192 L 552,192" fill="none" stroke="black"/>
                <path d="M 40,224 L 552,224" fill="none" stroke="black"/>
                <path d="M 40,256 L 552,256" fill="none" stroke="black"/>
                <path d="M 40,288 L 552,288" fill="none" stroke="black"/>
                <path d="M 40,320 L 552,320" fill="none" stroke="black"/>
                <path d="M 40,352 L 552,352" fill="none" stroke="black"/>
                <path d="M 40,384 L 552,384" fill="none" stroke="black"/>
                <path d="M 8,416 L 24,416" fill="none" stroke="black"/>
                <path d="M 40,416 L 552,416" fill="none" stroke="black"/>
                <path d="M 32,368 L 40,384" fill="none" stroke="black"/>
                <path d="M 32,304 L 40,288" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="32,416 20,410.4 20,421.6" fill="black" transform="rotate(0,24,416)"/>
                <polygon class="arrowhead" points="32,160 20,154.4 20,165.6" fill="black" transform="rotate(0,24,160)"/>
                <g class="text">
                  <text x="48" y="36">0</text>
                  <text x="208" y="36">1</text>
                  <text x="368" y="36">2</text>
                  <text x="528" y="36">3</text>
                  <text x="48" y="52">0</text>
                  <text x="64" y="52">1</text>
                  <text x="80" y="52">2</text>
                  <text x="96" y="52">3</text>
                  <text x="112" y="52">4</text>
                  <text x="128" y="52">5</text>
                  <text x="144" y="52">6</text>
                  <text x="160" y="52">7</text>
                  <text x="176" y="52">8</text>
                  <text x="192" y="52">9</text>
                  <text x="208" y="52">0</text>
                  <text x="224" y="52">1</text>
                  <text x="240" y="52">2</text>
                  <text x="256" y="52">3</text>
                  <text x="272" y="52">4</text>
                  <text x="288" y="52">5</text>
                  <text x="304" y="52">6</text>
                  <text x="320" y="52">7</text>
                  <text x="336" y="52">8</text>
                  <text x="352" y="52">9</text>
                  <text x="368" y="52">0</text>
                  <text x="384" y="52">1</text>
                  <text x="400" y="52">2</text>
                  <text x="416" y="52">3</text>
                  <text x="432" y="52">4</text>
                  <text x="448" y="52">5</text>
                  <text x="464" y="52">6</text>
                  <text x="480" y="52">7</text>
                  <text x="496" y="52">8</text>
                  <text x="512" y="52">9</text>
                  <text x="528" y="52">0</text>
                  <text x="544" y="52">1</text>
                  <text x="68" y="84">Type=6</text>
                  <text x="268" y="84">Reserved</text>
                  <text x="460" y="84">Record</text>
                  <text x="512" y="84">Count</text>
                  <text x="264" y="116">Nonce</text>
                  <text x="312" y="148">Nonce</text>
                  <text x="268" y="180">Record</text>
                  <text x="312" y="180">TTL</text>
                  <text x="8" y="212">R</text>
                  <text x="84" y="212">Referral</text>
                  <text x="144" y="212">Count</text>
                  <text x="192" y="212">EID</text>
                  <text x="244" y="212">mask-len</text>
                  <text x="320" y="212">ACT</text>
                  <text x="352" y="212">A</text>
                  <text x="368" y="212">I</text>
                  <text x="452" y="212">Reserved</text>
                  <text x="8" y="228">e</text>
                  <text x="8" y="244">c</text>
                  <text x="68" y="244">SigCnt</text>
                  <text x="144" y="244">Map</text>
                  <text x="192" y="244">Version</text>
                  <text x="252" y="244">Number</text>
                  <text x="420" y="244">EID-Prefix-AFI</text>
                  <text x="8" y="260">o</text>
                  <text x="8" y="276">r</text>
                  <text x="300" y="276">EID-Prefix</text>
                  <text x="352" y="276">.</text>
                  <text x="368" y="276">.</text>
                  <text x="8" y="292">d</text>
                  <text x="268" y="308">Reserved</text>
                  <text x="24" y="324">R</text>
                  <text x="24" y="340">e</text>
                  <text x="156" y="340">Reserved</text>
                  <text x="288" y="340">R</text>
                  <text x="424" y="340">Loc-AFI</text>
                  <text x="24" y="356">f</text>
                  <text x="40" y="372">~</text>
                  <text x="304" y="372">Locator</text>
                  <text x="552" y="372">~</text>
                  <text x="40" y="404">~</text>
                  <text x="252" y="404">Signatures</text>
                  <text x="328" y="404">Section</text>
                  <text x="552" y="404">~</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |Type=6 |                Reserved               | Record Count  |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                         Nonce . . .                           |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                         . . . Nonce                           |
+-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|   |                         Record TTL                            |
|   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
R   | Referral Count| EID mask-len  | ACT |A|I|     Reserved        |
e   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
c   |SigCnt |   Map Version Number  |        EID-Prefix-AFI         |
o   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
r   |                           EID-Prefix ...                      |
d   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  /|                        Reserved                               |
| R +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| e |          Reserved           |R|            Loc-AFI            |
| f +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  \~                             Locator                           ~
|   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|   ~                     Signatures Section                        ~
+-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          </artset>
        </figure>
        <dl>
          <dt>Type:</dt>
          <dd>
            <t>DDT Map-Referral type 6, as allocated in <xref target="RFC9301"/>.</t>
          </dd>
          <dt>Record Count:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>Nonce:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>Record TTL:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>Referral Count:</dt>
          <dd>
            <t>This is the number of referral records in this message. A referral record is comprised of that portion of the packet labeled "Ref" and occurs the number of times equal to Referral Count.</t>
          </dd>
          <dt>EID mask-len:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>ACT:</dt>
          <dd>
            <t>The DDT Action (ACT) field in a Map-Referral message encodes one of the action types defined in <xref target="SEC_ACT"/>. Note that, despite the same position and same name as in Map-Reply messages defined in <xref target="RFC9301"/>, the actions in DDT Map-Referrals message are different from the ones in Map-Replies.</t>
          </dd>
          <dt>A:</dt>
          <dd>
            <t>The Authoritative flag MUST only be set to 1 by a DDT Node that is authoritative for the XEID-Prefix. DDT Nodes not authoritative for the XEID-Prefix MUST set this flag to 0.</t>
          </dd>
          <dt>I:</dt>
          <dd>
            <t>Incomplete (I) flag indicating that a DDT Node's Referral Set of locators is incomplete and the receiver of this message MUST NOT cache the referral (see <xref target="SEC_ACT"/> for details).</t>
          </dd>
          <dt>SigCnt:</dt>
          <dd>
            <t>Indicates the number of signatures sections present in the Record. If SigCnt is larger than 0, the signature information captured in a Signature section as described in <xref target="SEC_Signature"/> will be appended to the Record. The number of Signature sections at the end of the Record MUST match the SigCnt, otherwise the message is silently dropped.</t>
          </dd>
          <dt>Map Version Number:</dt>
          <dd>
            <t>As defined in <xref target="RFC9302"/>.</t>
          </dd>
          <dt>EID-Prefix-AFI:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>XEID-Prefix:</dt>
          <dd>
            <t>The requested XEID-Prefix. Uses the LCAF type 2 <xref target="I-D.ietf-lisp-rfc8060bis"/> to encode the IID and IP address prefix that form the XEID. It can also use natively IPv4 or IPv6 addresses, in this case the IID MUST implicitly be considered to be  the value 0. The EID-Prefix-AFI MUST be set accordingly.</t>
          </dd>
          <dt>R:</dt>
          <dd>
            <t>As defined in Section 5.4 of <xref target="RFC9301"/>.</t>
          </dd>
          <dt>Loc-AFI:</dt>
          <dd>
            <t>AFI of the Locator field. Values for this field include the value 16387 of the LISP Canonical Address Format (LCAF) <xref target="I-D.ietf-lisp-rfc8060bis"/>.  LCAF Security Key Type 11 is used to store security material associated to the locator. DDT Nodes and DDT Map-Servers use this LCAF Type to include public keys associated with their child DDT Nodes for an XEID-Prefix Map-Referral Record.</t>
          </dd>
          <dt>Locator:</dt>
          <dd>
            <t>RLOC of a DDT Node to which the DDT Client is being referred. This is a variable-length field; its length is determined by the Loc-AFI setting.</t>
          </dd>
          <dt>Signatures Section:</dt>
          <dd>
            <t>When present, this section contains one (or more) signature section(s) covering the Map-Referral Record. See <xref target="SEC_Signature"/> for the details.</t>
          </dd>
        </dl>
        <t>Fields marked as "reserved" MUST be sent as 0 (zero) and MUST be ignored on reception.</t>
      </section>
      <section anchor="SEC_ACT">
        <name>Action Codes</name>
        <t>The possible values of the action field are defined hereafter, where the number in parenthesis indicates the decimal value of the 3-bit ACT field.</t>
        <dl>
          <dt>NODE-REFERRAL (0):</dt>
          <dd>
            <t>Indicates that the replying DDT Node has delegated an XEID-Prefix that matches the requested XEID to one or more other DDT Nodes. The Map-Referral message contains a record with additional information, most significantly, the set of RLOCs to which the XEID-Prefix has been delegated, which is used by a DDT Client to "follow" the referral.</t>
          </dd>
          <dt>MS-REFERRAL (1):</dt>
          <dd>
            <t>Indicates that the replying DDT Node has delegated an XEID-Prefix that matches the requested XEID to one or more DDT Map-Servers. It contains the same additional information as a NODE-REFERRAL, but is handled slightly differently by the receiving DDT Client (see <xref target="SEC_MapRefRec"/>).</t>
          </dd>
          <dt>MS-ACK (2):</dt>
          <dd>
            <t>Indicates that the replying DDT Map-Server received a DDT Map-Request that matches an authoritative XEID-Prefix for which it has one or more registered ETRs. This means that the request has been forwarded to one of those ETRs to provide a Map-Reply to the querying ITR.</t>
          </dd>
          <dt>MS-NOT-REGISTERED (3):</dt>
          <dd>
            <t>Indicates that the replying DDT Map-Server received a Map-Request for one of its configured XEID-Prefixes that has no ETRs registered.</t>
          </dd>
          <dt>DELEGATION-HOLE (4):</dt>
          <dd>
            <t>Indicates that the requested XEID matches a non-delegated sub-prefix of the XEID space. This is a non-LISP "hole", which has not been delegated to any DDT Map-Server or ETR. See <xref target="SEC_MissDel"/> for details.</t>
          </dd>
          <dt>NOT-AUTHORITATIVE (5):</dt>
          <dd>
            <t>Indicates that the replying DDT Node received a Map-Request for an XEID for which it is not authoritative.  This can occur if a cached referral has become invalid due to a change in the database hierarchy. However, if such a DDT Node has a "hint" covering the requested EID, it MAY choose to return NODE-REFERRAL or MS-REFERRAL as appropriate, setting the A flag to 0 (zero). When returning action code NOT-AUTHORITATIVE, the DDT Node MUST provide the EID-Prefix received in the request and the TTL MUST be set to 0.</t>
          </dd>
        </dl>
      </section>
      <section anchor="referral-set">
        <name>Referral Set</name>
        <t>For "positive" action codes (NODE-REFERRAL, MS-REFERRAL, MS-ACK), a DDT Node MUST include in the Map-Referral message a record with the list of RLOCs for DDT Nodes that are authoritative for the XEID-Prefix being returned. A DDT Client uses this information to contact one of those DDT Nodes as it "follows" a referral.</t>
      </section>
      <section anchor="incomplete-flag">
        <name>"Incomplete" Flag</name>
        <t>A DDT Node sets the "Incomplete" (I) flag in a Map-Referral message if the Referral Set is incomplete; this is intended to prevent a DDT Client from caching, in the DDT Map-Referral Cache, a referral with incomplete information. A DDT node MUST set the "Incomplete" flag in the following cases:</t>
        <ul spacing="normal">
          <li>
            <t>If returned action code is MS-ACK or MS-NOT-REGISTERED, but the matching XEID-Prefix is not flagged as "complete" in the configuration DDT Map-Server. The XEID-Prefix configuration on the DDT Map-Server MUST be marked as "complete" when the configuration of the XEID-Prefix includes all DDT Map-Server that are authoritative for the same XEID-Prefix, or when a DDT Map-Server is the only one authoritative for the XEID-Prefix.</t>
          </li>
          <li>
            <t>If the returned action code is NOT-AUTHORITATIVE.</t>
          </li>
        </ul>
        <t>If the Map-Referral message has the flag "incomplete" set, but the action code is not MS-ACK, MS-NOT-REGISTERED, or NOT-AUTHORITATIVE, the message is silently dropped, and the DDT Node MAY log the event.</t>
      </section>
      <section anchor="SEC_Signature">
        <name>Signature Section</name>
        <t>SigCnt counts the number of signature sections that appear at the end of the Record. The format of the signature section is described in <xref target="FIG_Signature"/>.</t>
        <figure anchor="FIG_Signature">
          <name>Map-Referral Signature Section format.</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="240" width="560" viewBox="0 0 560 240" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 40,32 L 40,192" fill="none" stroke="black"/>
                <path d="M 168,160 L 168,192" fill="none" stroke="black"/>
                <path d="M 296,128 L 296,160" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,192" fill="none" stroke="black"/>
                <path d="M 40,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 40,64 L 552,64" fill="none" stroke="black"/>
                <path d="M 40,96 L 552,96" fill="none" stroke="black"/>
                <path d="M 40,128 L 552,128" fill="none" stroke="black"/>
                <path d="M 40,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 40,192 L 552,192" fill="none" stroke="black"/>
                <path d="M 40,224 L 552,224" fill="none" stroke="black"/>
                <path d="M 8,176 L 24,208" fill="none" stroke="black"/>
                <path d="M 8,96 L 40,32" fill="none" stroke="black"/>
                <g class="text">
                  <text x="252" y="52">Original</text>
                  <text x="316" y="52">Record</text>
                  <text x="360" y="52">TTL</text>
                  <text x="256" y="84">Signature</text>
                  <text x="340" y="84">Expiration</text>
                  <text x="8" y="116">s</text>
                  <text x="256" y="116">Signature</text>
                  <text x="336" y="116">Inception</text>
                  <text x="8" y="132">i</text>
                  <text x="8" y="148">g</text>
                  <text x="152" y="148">Key</text>
                  <text x="184" y="148">Tag</text>
                  <text x="400" y="148">Sig</text>
                  <text x="444" y="148">Length</text>
                  <text x="8" y="164">|</text>
                  <text x="104" y="180">Sig-Algorithm</text>
                  <text x="340" y="180">Reserved</text>
                  <text x="40" y="212">~</text>
                  <text x="312" y="212">Signature</text>
                  <text x="552" y="212">~</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   /|                      Original Record TTL                      |
  / +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
 /  |                      Signature Expiration                     |
|   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
s   |                      Signature Inception                      |
i   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
g   |            Key Tag            |           Sig Length          |
|   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
\   | Sig-Algorithm |                 Reserved                      |
 \  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  \ ~                             Signature                         ~
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          </artset>
        </figure>
        <dl>
          <dt>Original Record TTL:</dt>
          <dd>
            <t>The original Record TTL for this Record that is covered by the signature. This is different from the Record TTL in the Map-Referral header. The latter indicating the remaining time before expiration of the original Record TTL.</t>
          </dd>
          <dt>Signature Expiration and Signature Inception:</dt>
          <dd>
            <t>Specify the validity period for the signature. The signature MUST NOT be used for authentication prior to the inception and MUST NOT be used for authentication after the expiration. Each field specifies a date and time in the form of a 32-bit unsigned number of seconds elapsed since 1 January 1970 00:00:00 UTC, ignoring leap seconds, in network byte order.</t>
          </dd>
          <dt>Key Tag:</dt>
          <dd>
            <t>An identifier to specify which key is used for this signature if more than one valid key exists for the signing DDT Node (see <xref target="SEC_Sec"/>).</t>
          </dd>
          <dt>Sig Length:</dt>
          <dd>
            <t>The length of the Signature field in bytes.</t>
          </dd>
          <dt>Sig-Algorithm:</dt>
          <dd>
            <t>The identifier of the cryptographic algorithm used for the signature.  Sig-Algorithm values defined in this specification are listed in <xref target="TAB_SigAlgos"/>.  Implementations conforming to this specification MUST implement at least RSA-SHA256 for DDT signing. Sig-Algorithm type 1 (RSA-SHA1) is deprecated and SHOULD NOT be used.</t>
          </dd>
        </dl>
        <table anchor="TAB_SigAlgos">
          <name>Sig-Algorithm Values</name>
          <thead>
            <tr>
              <th align="left">Sig-Algorithm</th>
              <th align="left">Name</th>
              <th align="left">Reference</th>
              <th align="left">Notes</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">1</td>
              <td align="left">RSA-SHA1</td>
              <td align="left">
                <xref target="RFC8017"/></td>
              <td align="left">DEPRECATED</td>
            </tr>
            <tr>
              <td align="left">2</td>
              <td align="left">RSA-SHA256</td>
              <td align="left">
                <xref target="RFC6234"/></td>
              <td align="left">MANDATORY</td>
            </tr>
            <tr>
              <td align="left">3</td>
              <td align="left">RSA-SHA512</td>
              <td align="left">
                <xref target="RFC6234"/></td>
              <td align="left">RECOMMENDED</td>
            </tr>
          </tbody>
        </table>
        <dl>
          <dt>Reserved:</dt>
          <dd>
            <t>MUST be set to 0 on transmit and MUST be ignored on receipt.</t>
          </dd>
          <dt>Signature:</dt>
          <dd>
            <t>Contains the cryptographic signature that covers the entire Map-Referral Record to which this signature belongs. For the purpose of computing the signature, the Record TTL (<xref target="SEC_MapRefFmt"/>) value is set to the value of Original Record TTL and the Signature field is filled with zeros.</t>
          </dd>
        </dl>
      </section>
    </section>
    <section anchor="SEC_DDTOps">
      <name>DDT Network Elements and their Operation</name>
      <t>As described above, LISP-DDT introduces a new network element, namely the DDT Node and extends the functionality of Map-Servers and Map-Resolvers to send and receive DDT Map-Referral messages. The operation of each of these devices is described below.</t>
      <section anchor="SEC_DDTNode">
        <name>DDT Node</name>
        <t>When a DDT Node receives a DDT Map-Request, it compares the requested XEID against its list of XEID-Prefix delegations and its list of authoritative XEID-Prefixes, and depending on whether or not there is a match, different actions are taken, as described in the following. For messages exchange operations, in particular timeouts and retransmissions, this document uses the specifications detailed in <xref target="RFC9301"/>.</t>
        <section anchor="xeid-match">
          <name>XEID Match</name>
          <t>If the requested XEID matches one of the DDT Node's delegated prefixes, then a Map-Referral message is returned with the matching more-specific XEID-Prefix and the set of RLOCs for the referral target DDT Nodes, including associated security information (see <xref target="SEC_DBSec"/> for details on security). If at least one DDT Node of the delegation is known to be a DDT Map-Server, then the Map-Referral message MAY be sent with action code MS-REFERRAL to indicate to the receiver that LISP-SEC information (if saved in the pending request) MUST be included in the next DDT Map-Request; otherwise, the action code NODE-REFERRAL MUST be used.</t>
          <t>A DDT Node MAY also be configured with "hints" for XEID-Prefixes anywhere in the database hierarchy and for which it can provide referrals. This feature may be useful for reducing the number of iterations needed to find an EID-to-RLOC Mapping, particularly for private network deployments. However, the incorrect use of hints may create circular dependencies (or "referral loops") between DDT Nodes.  A DDT Client MUST handle such circular referrals as described in <xref target="SEC_RefLoops"/>. Furthermore, the use of hints in DDT deployments that span multiple administrative domains (i.e., different authorities manage DDT Nodes in the same DDT database) may not be a reliable information. Indeed, in this case, an operator managing a DDT Node may not be aware of the fact that the node is being referred to by hints managed by another operator. Locator addresses in hints may become stale when referred DDT Nodes are taken out of service or change their locator addresses.</t>
        </section>
        <section anchor="SEC_MissDel">
          <name>XEID Miss</name>
          <t>If the requested XEID did not match a configured delegation but does match an authoritative XEID-Prefix, then the DDT Node MUST return a Negative Map-Referral that uses the least-specific XEID-Prefix that does not match any XEID-Prefix delegated by the DDT Node. The action code is set to DELEGATION-HOLE, which indicates that the XEID is not a LISP destination.</t>
          <t>If the requested XEID did not match either a configured delegation, an authoritative XEID-Prefix, or a hint, then a Negative Map-Referral with action code NOT-AUTHORITATIVE MUST be returned.</t>
        </section>
      </section>
      <section anchor="SEC_DDTServer">
        <name>DDT Map-Server</name>
        <t>When a DDT Map-Server receives a DDT Map-Request, its operation is similar to that of a DDT Node, with additional processing as follows:</t>
        <ul spacing="normal">
          <li>
            <t>If the requested XEID matches a registered XEID-Prefix, then the Map-Request is forwarded to one of the ETR RLOCs associated to the XEID-Prefix (or the Map-Server sends a Map-Reply, if it is providing a proxy Map-Reply service), and a Map-Referral with action code MS-ACK MUST be returned to the sender of the DDT Map-Request.</t>
          </li>
          <li>
            <t>If the requested XEID matches a configured XEID-Prefix for which no ETR registration has been received, then a Negative Map-Referral with action code MS-NOT-REGISTERED MUST be returned to the sender of the DDT Map-Request. This Negative Map-Referral contains the least-specific XEID-Prefix in the range for which this DDT Map-Server is authoritative and in which no registrations exist. In order to avoid long periods of lack of connectivity,  the TTL value of the Negative Map-Referral should be short. The RECOMMENDED value is of 1 minute, unless it is somehow known that there will be no registration for a longer period of time.</t>
          </li>
        </ul>
      </section>
      <section anchor="SEC_DDTClient">
        <name>DDT Client</name>
        <t>A DDT Client queries one or more DDT Nodes and uses an iterative process of following returned referrals until it receives one with action code MS-ACK (or an error indication).  MS-ACK indicates that the Map-Request has reached a Map-Server that will forward it to an ETR that, in turn, will provide a Map-Reply to the locator address in the Map-Request.</t>
        <t>DDT Client functionality is usually performed by DDT Map-Resolvers.  Just as would any other Map-Resolver, a DDT Map-Resolver accepts Map-Requests from its clients (typically ITRs) and ensures that those Map-Requests are forwarded to the correct ETR, which generates Map-Replies.  However, a DDT Map-Resolver implements DDT Client functionality to find the correct ETR to answer a Map-Request, which in turns requires a DDT Map-Resolver to maintain additional state, namely a DDT Map-Referral Cache and a Pending Requests List of XEIDs that are going through the iterative referral process.</t>
        <section anchor="SEC_DDTMapReqProc">
          <name>Queuing and Sending DDT Map-Requests</name>
          <t>When a DDT Client receives a Map-Request to resolve an XEID, it first performs a longest-prefix-match search for the XEID in its DDT Map-Referral Cache. Note that in normal use, the statically configured initial DDT Map-Referral Cache for a DDT Client should include a "default" entry with RLOCs for either the root DDT Node or one or more DDT Nodes that contain hints for the root DDT Node. Without such configuration, a DDT client would return a Negative Map-Reply for Map-Requests for an EID outside the subset of the mapping database known to it. There is no need to configure the same set of root DDT nodes on all DDT Clients. Additional entries are added when referrals are followed, as described below. If the longest-prefix-match for the XEID in the Map-Request does not return any result, or if a negative entry is found, then a Negative Map-Reply MUST be returned, and no further processing is performed by the DDT Client.</t>
          <t>If a match is found, the DDT Client creates an entry in the Pending Requests List for the XEID, storing the original request (in the case of a DDT Map-Resolver, this will be the original Map-Request minus the encapsulation header) along with other information needed to track progress through the iterative referral process; the referral associated to the request is also initialized to indicate that no referral has yet been received.</t>
          <t>The DDT Client then creates a DDT Map-Request, which is an ECM Map-Request with the "DDT-originated" flag set in the message header, for the XEID but without any authentication data that may have been included in the original request. It sends the DDT Map-Request to one of the RLOCs in the selected DDT Map-Referral Cache entry.</t>
          <t>If DDT message exchanges are  authenticated as described in <xref target="SEC_DBSec"/>, then the DDT Client MUST also be configured with public keys of DDT Nodes pointed to by the "default" cache entry.</t>
        </section>
        <section anchor="SEC_MapRefRec">
          <name>Receiving and Following DDT Map-Referrals</name>
          <t>After sending a DDT Map-Request, a DDT Client expects to receive a DDT Map-Referral response. If none occurs within the timeout period, the DDT Client retransmits the request, sending it to the next RLOC in the referral cache entry if one is available.  If all RLOCs have been tried and the maximum number of retransmissions has occurred for each, then the Pending Request List entry is discarded. In this case, the DDT Client returns no response to the sender of the original request. The DDT Client MAY log the event.</t>
          <t>When a DDT Client receives a DDT Map-Referral, it processes the message according to the action code it contains:</t>
          <dl>
            <dt>NODE-REFERRAL:</dt>
            <dd>
              <t>The DDT Client checks for a possible referral loop as described in <xref target="SEC_RefLoops"/>.  If no loop is found, the DDT Client saves the returned XEID-Prefix in the DDT Map-Referral Cache. It also updates the XEID-Prefix and saved RLOCs in the corresponding Pending Request List entry, and follows the referral by sending a new DDT Map-Request to one of the DDT Node RLOCs listed in the Referral Set. Security information saved with the original Map-Request MUST NOT be included.</t>
            </dd>
            <dt>MS-REFERRAL:</dt>
            <dd>
              <t>The DDT Client processes an MS-REFERRAL in the same manner as a NODE-REFERRAL, except that LISP-SEC security information saved with the original Map-Request MUST be included in the new DDT Map-Request sent to a Map-Server (see <xref target="SEC_DBSec"/> for details on security).</t>
            </dd>
            <dt>MS-ACK:</dt>
            <dd>
              <t>An MS-ACK is returned by a DDT Map-Server to indicate that it has one or more registered ETRs that can answer the DDT Map-Request for the XEID and the message has been forwarded to one of them (or, if the Map-Server is providing a proxy service for the prefix, then a reply has been sent to the querying ITR). If the pending request did not include saved LISP-SEC information (i.e., LISP-SEC is not used) or if that information was already included in the previous DDT Map-Request (sent by the DDT Client in response to either an MS-REFERRAL or a previous MS-ACK), then the pending request for the XEID is complete, processing of the request stops, and all request state can be discarded. Otherwise, when LISP-SEC information is included in pending request, but has not yet been sent to the authoritative DDT Map-Server, the DDT Client MUST resend the DDT Map-Request with LISP-SEC information included, and the Pending Request List entry remains until another Map-Referral with action code MS-ACK is received. Unless the "Incomplete" flag is set, the XEID-Prefix and its referrals is stored in the DDT Map-Referral Cache.</t>
            </dd>
            <dt>MS-NOT-REGISTERED:</dt>
            <dd>
              <t>The DDT Map-Server queried could not process the request because no ETRs registered the XEID-Prefix and returned a Negative DDT Map-Referral. If the DDT Client has not yet tried all of the RLOCs saved with the Pending Request List, then it sends a Map-Request to the next RLOC in that list. If all RLOCs have been tried, then the destination XEID is not registered and is unreachable. The DDT Client MUST return the Negative Map-Reply to the requester (or, in the case of a DDT Map-Resolver, to the sender of the original Map-Request).  A negative DDT Map-Referral Cache entry is also created for the XEID-Prefix, whose TTL MUST be set to the value in the Map-Referral message, and the processing of the request stops.</t>
            </dd>
            <dt>DELEGATION-HOLE:</dt>
            <dd>
              <t>The requested XEID-Prefix does not belong to the EID space and the queried DDT Node returned a Negative DDT Map-Referral. The DDT Client MUST return a Negative Map-Reply to the requester (or, in the case of a DDT Map-Resolver, a Negative Map-Reply to the sender of the original Map-Request);</t>
            </dd>
            <dt>NOT-AUTHORITATIVE:</dt>
            <dd>
              <t>The DDT Node queried is not authoritative for the requested XEID-Prefix. This can occur, for instance, if a cached referral has become invalid due to a change in the database hierarchy. If the DDT Client receiving this message used a cached information, it MAY choose to delete that cached information and retry the original Map-Request, starting from its "root" DDT Map-Referral Cache entry. If this action code is received in response to a query that did not use cached referral information, then it indicates a database synchronization problem or configuration error. In this case the DDT Client SHOULD log the event and the pending request MUST be silently discarded.</t>
            </dd>
          </dl>
          <t>A DDT Client is not required to cache referrals, but doing so will decrease latency and reduce lookup delays.</t>
        </section>
        <section anchor="SEC_MapRefErr">
          <name>Handling Referral Errors</name>
          <t>If a DDT Client receives a message and detects unexpected behavior, like for instance an iteration loop, the message is silently discarded, it MAY mark that the DDT Node sending the message is unusable in its DDT Map-Referral Cache, and update the pending request to try a different DDT Node if more than one is listed. In any case, the DDT Client SHOULD log the error and any prefix contained in a DDT Map-Referral message that causes a referral error (including a referral loop) MUST NOT be stored in the DDT Map-Referral Cache.</t>
        </section>
        <section anchor="SEC_RefLoops">
          <name>Referral Loop Detection</name>
          <t>In response to a Map-Referral message with action code NODE-REFERRAL or MS-REFERRAL, a DDT Client is directed to query a new set of DDT node RLOCs that are expected to have more-specific XEID-Prefix information for the requested XEID.  To prevent a possible "iteration loop" (following referrals back and forth among a set of DDT Nodes without ever finding an answer), a DDT Client saves the last received referral XEID-Prefix for each pending request and checks to see if a newly received NODE-REFERRAL or MS-REFERRAL message contains a more-specific referral XEID-Prefix; an exact or less-specific match of the saved XEID-Prefix indicates a referral loop. If a loop is detected, the DDT Map-Resolver handles the request as described in <xref target="SEC_MapRefErr"/>.</t>
        </section>
      </section>
    </section>
    <section anchor="SEC_DBSec">
      <name>Securing the Database and Message Exchanges</name>
      <t>This section specifies the DDT security architecture that provides data origin authentication and data integrity protection of XEID-Prefix delegation.</t>
      <t>Each DDT Node is configured with one or more public/private key pairs that are used to digitally sign Map-Referral Records for XEID-Prefix(es) for which the DDT Node is authoritative. In other words, each public/private key pair is associated with the combination of a DDT Node and an XEID-Prefix for which it is authoritative. Every DDT Node is also configured with the public keys of its child DDT Nodes.  By including the public keys of target child DDT Nodes in the Map-Referral Records and signing each Record with the DDT Node's private key, a DDT Node can securely refer XEID sub-prefixes for its child DDT nodes. A DDT Node configured to provide hints MUST also have the public keys of the DDT Nodes to which its hints point. DDT Node keys can be encoded using LCAF Type 11 to associate the key to the RLOC of the referred DDT Node.  If a node has more than one public key, it should sign its Records with at least one of these keys. The revocation mechanism is described in <xref target="SEC_PKRevocation"/>.</t>
      <t>Map-Resolvers are configured with one or more DDT Nodes' public keys, referred to as "trust anchors". Trust anchors are used to authenticate the DDT security infrastructure. Map-Resolvers can discover a DDT Node's public key by either (1) having it configured as a trust anchor or (2) obtaining it from the node's parent as part of a signed Map-Referral. When a public key is obtained from a node's parent, it is considered trusted if it is signed by a trust anchor or if it is signed by a trusted key that was previously received. Typically, in a Map-Resolver, the root DDT Node's public keys should be configured as trust anchors.  Once a Map-Resolver authenticates a public key, it locally caches the key along with the associated DDT node RLOC and XEID-Prefix for future use.</t>
      <t>If the signature verification of a record fails, i.e. the signature is not valid, the record MUST be ignored and silently discarded and the node SHOULD log the event.</t>
      <section anchor="xeid-prefix-delegation">
        <name>XEID-Prefix Delegation</name>
        <t>In order to provide referrals to XEID sub-prefixes for its child DDT Nodes, a parent DDT Node signs its DDT Map-Referrals. Every signed Map-Referral MUST also include the public keys associated with each child DDT node. Such a signature indicates that the parent DDT Node delegated the specified XEID-Prefix to a given child DDT Node. The signature is also authenticating the public keys associated with the child DDT Nodes, and authorizing them to be used by the child DDT nodes, to provide origin authentication and integrity protection and mapping information of the XEID-Prefix allocated to the DDT Node.</t>
        <t>As a result, for a given XEID-Prefix, a Map-Resolver can form an authentication chain from a configured trust anchor (typically the root DDT Node) to the leaf nodes (Map-Servers). Map-Resolvers leverage this authentication chain verifying the Map-Referral signatures while walking the DDT tree until they reach a Map-Server authoritative for the given XEID-Prefix.</t>
      </section>
      <section anchor="ddt-node-operation">
        <name>DDT Node Operation</name>
        <t>Upon receiving a Map-Request, the DDT Node responds with a  Map-Referral as specified in <xref target="SEC_DDTOps"/>. For every Record present in the Map-Referral, the DDT Node also includes the public keys associated with the Record's XEID-Prefix and the RLOCs of the child DDT Nodes. Each Record contained in the Map-Referral is signed using the DDT Node's private key.</t>
        <section anchor="SEC_PKRevocation">
          <name>DDT Public Key Revocation</name>
          <t>The node that owns a public key can also revoke that public key. For instance, if a parent DDT Node advertises a public key for one of its child DDT Nodes, the child DDT Node can at a later time revoke that key. Since DDT Nodes do not keep track of the Map-Resolvers that query them, revocation is done in a pull mode, where the Map-Resolver is informed of the revocation of a key only when it queries the node that owns that key. Since the parent DDT Node is configured to advertise that key, the parent DDT Node must also remove the key from the Records it advertises for the child DDT Node; this is necessary to avoid further distribution of the revoked key.</t>
          <t>To securely revoke a key, the DDT Node creates a new Record for the associated XEID-Prefix and locator, including the revoked key with the R flag set.  (See Section 4.7 of <xref target="I-D.ietf-lisp-rfc8060bis"/> for details regarding the R bit.) The DDT Node MUST also include a signature in the Record that covers this Record; this is computed using the private key corresponding to the key being revoked. Such a Record is termed a "revocation record". By including this Record in its Map-Referrals, the DDT Node informs querying Map-Resolvers about the revoked key. A digital signature computed with a revoked key can only be used to authenticate the revocation and MUST NOT be used to validate any data. To prevent a compromised key from revoking other valid keys, a given key can only be used to sign a revocation for that specific key; it MUST NOT be used to revoke other keys. This prevents the use of a compromised key to revoke other valid keys as described in <xref target="RFC5011"/>. A revocation record MUST be advertised for a period of time equal to or greater than the TTL value of the Record that initially advertised the key, starting from the time that the advertisement of the key was stopped by removal from the parent DDT Node.</t>
        </section>
      </section>
      <section anchor="map-server-operation">
        <name>Map-Server Operation</name>
        <t>Similar to a DDT Node, a Map-Server is configured with one or more public/private key pairs that are used to sign Map-Referrals. However, unlike DDT Nodes, Map-Servers do not delegate prefixes and as a result do not need to include keys in the Map-Referrals they generate.</t>
      </section>
      <section anchor="map-resolver-operation">
        <name>Map-Resolver Operation</name>
        <t>Upon receiving a Map-Referral, the Map-Resolver MUST first verify the signature(s) by using either a trust anchor or a previously authenticated public key associated with the DDT Node sending the Map-Referral. If multiple authenticated keys are associated with the DDT Node sending this Map-Referral, the Key Tag field (see <xref target="SEC_Signature"/>) of the signature can be used to select the correct public key for verifying the signature. If the key tag matches more than one key associated with that DDT Node, the Map-Resolver MUST try to verify the signature with all matching keys. If a key is found, the Map-Resolver MUST use it to verify the associated signature in the Record. If (1) no matching key is found, or (2) such a key is found but the signature is not valid, the Map-Referral Record is considered corrupted and MUST be discarded.  This may be due to expired keys. The Map-Resolver MAY try other siblings of this node if there is an alternate node that is authoritative for the same prefix. If not, the Map-Resolver CAN query the DDT Node's parent to retrieve a valid key.</t>
        <t>Once the signature is verified, the Map-Resolver has verified the XEID-Prefix delegation in the Map-Referral. This also means that public keys of the child DDT Nodes were authenticated; the Map-Resolver MUST add these keys to the authenticated keys associated with each child DDT Node and XEID-Prefix. These keys are considered valid for the duration specified in the Record's TTL field.</t>
      </section>
    </section>
    <section anchor="SEC_Sec">
      <name>Security Considerations</name>
      <t>This document extends the LISP control plane defined in <xref target="RFC9301"/>; as such, the security considerations in that document apply here as well. A LISP threat analysis can be found in <xref target="RFC7835"/>.</t>
      <t>This document specifies how DDT security and LISP-SEC <xref target="RFC9303"/> complement one another to secure the DDT infrastructure, Map-Referral messages, and the Map-Request/Map-Reply protocols. LISP-DDT provides data origin authentication and data integrity protection of XEID-Prefix delegation but does not provide origin authentication, integrity, and anti-replay protection to the LISP's Endpoint-ID-to-Routing-Locator (EID-to-RLOC) mapping data, which is protected by LISP-SEC <xref target="RFC9303"/>. This document includes the description of when and how transfer LISP-SEC information in DDT Map-Request message so to make possible using LISP-SEC with LISP-DDT. DDT security as described in <xref target="SEC_DBSec"/> MUST be enabled by default.</t>
      <t>LISP-DDT security does not provide Map-Referral Records privacy. Unless the deployment is private, DTLS <xref target="RFC9147"/> SHOULD be used to provide communication privacy and to prevent eavesdropping, tampering, or message forgery to the messages exchanged.</t>
    </section>
    <section anchor="deployment-experience">
      <name>Deployment Experience</name>
      <t>Two independent implementations of LISP-DDT are known: the Cisco implementation, available in several Cisco network operating systems (IOS, NX-OS, and IOS-XE), and OpenLISP. The Cisco implementation provides DDT Node, DDT Map-Resolver, and DDT Map-Server functionality. In the LISP Beta Network it ran on IOS, on ISR and 7200 platforms, and on NX-OS, on Nexus platforms. IOS-XE has supported it since Release 3.8S and still does <xref target="Cisco-IOS-XE-DDT"/>, and DDT support in NX-OS is documented for the Nexus 7000 platform <xref target="Cisco-NX-OS-DDT"/>. OpenLISP is an open-source implementation for FreeBSD, developed at LIP6 (Sorbonne Universite), Telecom ParisTech, and INRIA, with full DDT support including root DDT Node capability <xref target="OpenLISP-CP"/>.</t>
      <t>The primary DDT deployment was the mapping system of the LISP Beta Network (lisp4.net / lisp6.net), which replaced LISP+ALT with LISP-DDT on 14 March 2012, after a first cutover attempt a week earlier had been abandoned. By November 2012, DDT resolved lookups for the EID-Prefixes of approximately 200 LISP sites <xref target="DDT-IETF85"/>. The hierarchy had three levels: a shared root published under ddt-root.org and authoritative for all Instance IDs; a top-level DDT Node for the Beta Network EID space (153.16.0.0/16 and 2610:d0::/32, Instance ID 0); and regional DDT Map-Servers authoritative for /19 IPv4 and /36 IPv6 sub-prefixes <xref target="DDT-IETF85"/>. Over its lifetime, root DDT Nodes were operated by seven organizations: Cisco, VeriSign, InTouch NV, Vinci Consulting, Job Snijders, LIP6 / Sorbonne Universite (running OpenLISP), and CSUC. The top-level Beta Network node was operated by UNINETT and Cisco, and later by UPC. The shared root was not limited to the Beta Network: in 2014 it delegated 17 IPv4 and IPv6 EID-Prefixes belonging to nine independent organizations and LISP networks to 18 DDT Nodes and Map-Servers, and all but one of these prefixes was delegated to two to four targets <xref target="DDT-ROOT"/>. Besides operating root DDT Nodes, VeriSign ran a pilot EID-to-RLOC mapping service based on LISP-DDT <xref target="DDT-NANOG55"/>, and VXNet (Vinci Consulting), which had started as a LISP island not connected to DDT, connected its own Map-Servers to the shared root <xref target="VXNET-LISP"/>.</t>
      <t>DDT was still the mapping system of the LISP Beta Network in November 2018, more than six years after the cutover; at that time the hierarchy consisted of a single root operated by CSUC and two top-level DDT Nodes operated by UPC <xref target="LISP4-NET"/>. The Beta Network stopped providing service on 29 February 2020 <xref target="LISP4-BETA"/>. Cisco and OpenLISP DDT Nodes operated side by side in the same hierarchy, including at the root. The 'rig' tool <xref target="RFC8112"/>, which shipped in Cisco IOS and NX-OS <xref target="DDT-IETF84"/>, was developed to troubleshoot the hierarchy by issuing iterative Map-Referral queries. Measurements of the Beta Network found that switching from LISP+ALT to LISP-DDT considerably reduced the configuration and maintenance burden of the mapping system, at the cost of a slight drop in performance <xref target="LISP-BETA-PERF"/>. Because DDT Map-Resolvers cache referrals, the hierarchy was rarely traversed in steady state. Lookups often went directly from the Map-Resolver to the Map-Server, and cached referrals were discarded after about a day of inactivity <xref target="LISP-BETA-PERF"/>. In a laboratory evaluation, the OpenLISP DDT Map-Resolver processed requests in approximately 20-25 microseconds and scaled to 2000 sites with over 260,000 EID-Prefixes <xref target="OpenLISP-CP"/>.</t>
      <t><xref target="RFC8111"/> was published as Experimental, and its Section 11 identified open issues that operational experience was expected to resolve. The deployment described above addressed them as follows:</t>
      <dl>
        <dt>Interconnection with other mapping databases:</dt>
        <dd>
          <t>The LISP Beta Network replaced LISP+ALT <xref target="RFC6836"/> with LISP-DDT in a flag-day cutover, and removed the LISP+ALT configuration in April 2012 <xref target="DDT-IETF85"/>. No interface between the two mapping systems was needed for the transition, so this document does not specify one.</t>
        </dd>
        <dt>Additional key structures:</dt>
        <dd>
          <t>The deployment used Instance-ID-scoped XEIDs with IPv4 and IPv6 EID-Prefixes, with the root DDT Nodes authoritative for all Instance IDs <xref target="DDT-IETF85"/>. This document encodes XEIDs using LCAF <xref target="I-D.ietf-lisp-rfc8060bis"/>, which can accommodate additional EID formats.</t>
        </dd>
        <dt>Referral cache management:</dt>
        <dd>
          <t>The small number of delegations in the hierarchy meant that referral cache management was not an operational concern; implementations discarded cached referrals after about a day of inactivity <xref target="LISP-BETA-PERF"/>. This document specifies that cached referrals expire according to the Record TTL defined in Section 5.4 of <xref target="RFC9301"/>.</t>
        </dd>
        <dt>Hints:</dt>
        <dd>
          <t>The DDT configurations published for the LISP Beta Network use only delegations <xref target="DDT-IETF85"/>, and no use of hints is documented for it. This document keeps hints optional and documents the risks associated with their use (see <xref target="SEC_DDTNode"/>).</t>
        </dd>
      </dl>
      <t>Operating a hierarchy whose DDT Nodes were run by independent, largely volunteer organizations also produced lessons beyond the open issues of <xref target="RFC8111"/>:</t>
      <dl>
        <dt>Failover between delegated DDT Nodes:</dt>
        <dd>
          <t>The Beta Network EID space was delegated to three top-level DDT Nodes <xref target="DDT-IETF85"/>, but the delegations were not updated as these nodes went out of service. In July 2016 the last working top-level DDT Node failed, and the Beta Network EID space could not be resolved until the root operators replaced the stale delegations with a delegation to a new node. A DDT Client that receives no answer moves on to the next DDT Node in the Referral Set (<xref target="SEC_MapRefRec"/>), using the timeouts and retransmissions of <xref target="RFC9301"/> (<xref target="SEC_DDTNode"/>), so each unreachable DDT Node left in a Referral Set can add a timeout to a resolution. Operators should delegate each XEID-Prefix to at least two DDT Nodes, preferably operated independently, and should remove delegations to DDT Nodes that are taken out of service.</t>
        </dd>
        <dt>Consistency of static configuration:</dt>
        <dd>
          <t>Delegations were configured by hand on every root instance, in each implementation's own configuration syntax, and changes were coordinated by email among the root operators. Partially applied changes left the root instances inconsistent until all operators had updated their nodes. A DNS-style transfer of DDT data was proposed during the deployment <xref target="I-D.wiley-lisp-ddtxfer"/> but not pursued. Keeping the delegation data of a DDT Node with several independently operated instances consistent remains an operational task outside the scope of this document.</t>
        </dd>
        <dt>Security mechanisms:</dt>
        <dd>
          <t>The LISP Beta Network did not enable the DDT security mechanisms described in <xref target="SEC_DBSec"/>, which the implementations of 2012 did not yet include <xref target="DDT-IETF85"/>; Map-Referrals were exchanged unsigned throughout the deployment. The deployment therefore provides no operational experience with these mechanisms.</t>
        </dd>
      </dl>
      <t>Section 4.1.1 of <xref target="RFC2026"/> describes a Proposed Standard as generally stable, with known design choices resolved and well understood, and notes that implementation and operational experience, although not required, usually represents a strong argument in favor of that designation. The experiment documented in this section provides such experience. The delegation model, the Map-Referral message, and the referral procedures were in use for more than six years, in a hierarchy that combined two independent implementations, root DDT Nodes operated by seven organizations, and a shared root that delegated EID space for nine independent networks. The open issues that <xref target="RFC8111"/> left to operational experience are resolved as described above, the operational lessons are either reflected in this document or outside its scope, and LISP-DDT remains available in shipping implementations <xref target="Cisco-IOS-XE-DDT"/>. The experiment also had limits: it ran on a pilot network with hundreds of sites rather than at Internet scale, and it did not exercise the security mechanisms. Experience at larger scale and with DDT security enabled would be relevant to any further advancement of this specification.</t>
    </section>
    <section anchor="SEC_IANA">
      <name>IANA Considerations</name>
      <section anchor="lisp-ddt-map-referral-packet-type">
        <name>LISP DDT Map-Referral Packet Type</name>
        <t>IANA has made an early temporary allocation for message type 6, "LISP DDT Map-Referral", in the "LISP Packet Types" registry group. IANA is requested to make the allocation permanent and modify the "LISP Packet Types" as shown in <xref target="TAB_MsgType"/>.</t>
        <table anchor="TAB_MsgType">
          <name>LISP DDT Map-Referral Message Type Allocation</name>
          <thead>
            <tr>
              <th align="left">Code</th>
              <th align="left">Message</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">6</td>
              <td align="left">LISP DDT Map-Referral</td>
              <td align="left">[This document]</td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="lisp-ddt-action-codes">
        <name>LISP DDT Action Codes</name>
        <t>IANA is asked to create a registry named "LISP DDT Action Codes" under the "Locator/ID Separation Protocol (LISP) Parameters" group. Such registry 
should be populated as shown in <xref target="TAB_DDTACT"/>:</t>
        <table anchor="TAB_DDTACT">
          <name>LISP DDT Action Codes Allocation</name>
          <thead>
            <tr>
              <th align="left">Code</th>
              <th align="left">DDT Action</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">0</td>
              <td align="left">NODE-REFERRAL</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">1</td>
              <td align="left">MS-REFERRAL</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">2</td>
              <td align="left">MS-ACK</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">3</td>
              <td align="left">MS-NOT-REGISTERED</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">4</td>
              <td align="left">DELEGATION-HOLE</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">5</td>
              <td align="left">NOT-AUTHORITATIVE</td>
              <td align="left">[This document]</td>
            </tr>
            <tr>
              <td align="left">6-7</td>
              <td align="left">Unallocated</td>
              <td align="left">[This document]</td>
            </tr>
          </tbody>
        </table>
        <t>Values can be assigned by IANA on the "IETF Review" basis according to <xref target="RFC8126"/>.</t>
      </section>
      <section anchor="lisp-ddt-signature-algorithm-codes">
        <name>LISP DDT Signature Algorithm Codes</name>
        <t>IANA is asked to create a registry named "LISP DDT Signature Algorithm Codes" under the "Locator/ID Separation Protocol (LISP) Parameters" group. Such registry 
should be populated as shown in <xref target="TAB_IANASIG"/>:</t>
        <table anchor="TAB_IANASIG">
          <name>LISP DDT Signature Algorithm Codes</name>
          <thead>
            <tr>
              <th align="left">Code</th>
              <th align="left">Name</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">1</td>
              <td align="left">RSA-SHA1</td>
              <td align="left">
                <xref target="RFC8017"/></td>
            </tr>
            <tr>
              <td align="left">2</td>
              <td align="left">RSA-SHA256</td>
              <td align="left">
                <xref target="RFC6234"/></td>
            </tr>
            <tr>
              <td align="left">3</td>
              <td align="left">RSA-SHA512</td>
              <td align="left">
                <xref target="RFC6234"/></td>
            </tr>
            <tr>
              <td align="left">4-255</td>
              <td align="left">Un-assigned</td>
              <td align="left"> </td>
            </tr>
          </tbody>
        </table>
        <t>Values can be assigned by IANA on a "First Come, First Served" basis according to <xref target="RFC8126"/>.</t>
      </section>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC9300">
          <front>
            <title>The Locator/ID Separation Protocol (LISP)</title>
            <author fullname="D. Farinacci" initials="D." surname="Farinacci"/>
            <author fullname="V. Fuller" initials="V." surname="Fuller"/>
            <author fullname="D. Meyer" initials="D." surname="Meyer"/>
            <author fullname="D. Lewis" initials="D." surname="Lewis"/>
            <author fullname="A. Cabellos" initials="A." role="editor" surname="Cabellos"/>
            <date month="October" year="2022"/>
            <abstract>
              <t>This document describes the data plane protocol for the Locator/ID Separation Protocol (LISP). LISP defines two namespaces: Endpoint Identifiers (EIDs), which identify end hosts; and Routing Locators (RLOCs), which identify network attachment points. With this, LISP effectively separates control from data and allows routers to create overlay networks. LISP-capable routers exchange encapsulated packets according to EID-to-RLOC mappings stored in a local Map-Cache.</t>
              <t>LISP requires no change to either host protocol stacks or underlay routers and offers Traffic Engineering (TE), multihoming, and mobility, among other features.</t>
              <t>This document obsoletes RFC 6830.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9300"/>
          <seriesInfo name="DOI" value="10.17487/RFC9300"/>
        </reference>
        <reference anchor="RFC9301">
          <front>
            <title>Locator/ID Separation Protocol (LISP) Control Plane</title>
            <author fullname="D. Farinacci" initials="D." surname="Farinacci"/>
            <author fullname="F. Maino" initials="F." surname="Maino"/>
            <author fullname="V. Fuller" initials="V." surname="Fuller"/>
            <author fullname="A. Cabellos" initials="A." role="editor" surname="Cabellos"/>
            <date month="October" year="2022"/>
            <abstract>
              <t>This document describes the control plane and Mapping Service for the Locator/ID Separation Protocol (LISP), implemented by two types of LISP-speaking devices -- the LISP Map-Resolver and LISP Map-Server -- that provide a simplified "front end" for one or more Endpoint IDs (EIDs) to Routing Locator mapping databases.</t>
              <t>By using this control plane service interface and communicating with Map-Resolvers and Map-Servers, LISP Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) are not dependent on the details of mapping database systems; this behavior facilitates modularity with different database designs. Since these devices implement the "edge" of the LISP control plane infrastructure, connecting EID addressable nodes of a LISP site, the implementation and operational complexity of the overall cost and effort of deploying LISP is reduced.</t>
              <t>This document obsoletes RFCs 6830 and 6833.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9301"/>
          <seriesInfo name="DOI" value="10.17487/RFC9301"/>
        </reference>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="RFC9303">
          <front>
            <title>Locator/ID Separation Protocol Security (LISP-SEC)</title>
            <author fullname="F. Maino" initials="F." surname="Maino"/>
            <author fullname="V. Ermagan" initials="V." surname="Ermagan"/>
            <author fullname="A. Cabellos" initials="A." surname="Cabellos"/>
            <author fullname="D. Saucez" initials="D." surname="Saucez"/>
            <date month="October" year="2022"/>
            <abstract>
              <t>This memo specifies Locator/ID Separation Protocol Security (LISP-SEC), a set of security mechanisms that provides origin authentication, integrity, and anti-replay protection to the LISP's Endpoint-ID-to-Routing-Locator (EID-to-RLOC) mapping data conveyed via the mapping lookup process. LISP-SEC also enables verification of authorization on EID-Prefix claims in Map-Reply messages.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9303"/>
          <seriesInfo name="DOI" value="10.17487/RFC9303"/>
        </reference>
        <reference anchor="I-D.ietf-lisp-rfc8060bis">
          <front>
            <title>LISP Canonical Address Format (LCAF)</title>
            <author fullname="Alvaro Retana" initials="A." surname="Retana">
              <organization>Futurewei Technologies, Inc.</organization>
            </author>
            <author fullname="Dino Farinacci" initials="D." surname="Farinacci">
              <organization>lispers.net</organization>
            </author>
            <author fullname="Job Snijders" initials="J." surname="Snijders">
         </author>
            <author fullname="Alberto Rodriguez-Natal" initials="A." surname="Rodriguez-Natal">
              <organization>Cisco</organization>
            </author>
            <date day="21" month="August" year="2026"/>
            <abstract>
              <t>   This document defines a canonical address format encoding used in
   Locator/ID Separation Protocol (LISP) control messages and in the
   encoding of lookup keys for the LISP Mapping Database System.

   This document obsoletes RFC 8060 and RFC 9306.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-lisp-rfc8060bis-05"/>
        </reference>
        <reference anchor="RFC9302">
          <front>
            <title>Locator/ID Separation Protocol (LISP) Map-Versioning</title>
            <author fullname="L. Iannone" initials="L." surname="Iannone"/>
            <author fullname="D. Saucez" initials="D." surname="Saucez"/>
            <author fullname="O. Bonaventure" initials="O." surname="Bonaventure"/>
            <date month="October" year="2022"/>
            <abstract>
              <t>This document describes the Locator/ID Separation Protocol (LISP) Map-Versioning mechanism, which provides in-packet information about Endpoint-ID-to-Routing-Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. This approach is based on associating a version number to EID-to-RLOC mappings and transporting such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is optional and transparent to implementations not supporting this feature, since in the LISP-specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support or do not want to use the mechanism.</t>
              <t>This document obsoletes RFC 6834, which is the initial experimental specifications of the mechanisms updated by this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9302"/>
          <seriesInfo name="DOI" value="10.17487/RFC9302"/>
        </reference>
        <reference anchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="M. Cotton" initials="M." surname="Cotton"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="June" year="2017"/>
            <abstract>
              <t>Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t>To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t>This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="AFI" target="http://www.iana.org/assignments/address-family-numbers/">
          <front>
            <title>Address Family Numbers</title>
            <author>
              <organization>IANA</organization>
            </author>
            <date/>
          </front>
        </reference>
        <reference anchor="OpenLISP-CP">
          <front>
            <title>The OpenLISP Control Plane Architecture</title>
            <author initials="C. D." surname="Phung" fullname="Cong Duy Phung">
              <organization/>
            </author>
            <author initials="L." surname="Iannone" fullname="Luigi Iannone">
              <organization/>
            </author>
            <author initials="S." surname="Secci" fullname="Stefano Secci">
              <organization/>
            </author>
            <date year="2014" month="March"/>
          </front>
          <seriesInfo name="IEEE Network" value="vol. 28, no. 2, pp. 34-40"/>
        </reference>
        <reference anchor="Cisco-IOS-XE-DDT" target="https://www.cisco.com/c/en/us/td/docs/ios-xml/ios/iproute_lisp/command/ip-lisp-cr-book/lisp-ddt-cfg-cmds.html">
          <front>
            <title>Cisco IOS IP Routing: LISP Command Reference - LISP DDT Configuration Commands</title>
            <author>
              <organization>Cisco Systems</organization>
            </author>
            <date year="2014" month="November" day="23"/>
          </front>
        </reference>
        <reference anchor="Cisco-NX-OS-DDT" target="https://www.cisco.com/c/en/us/td/docs/switches/datacenter/sw/nx-os/lisp/configuration/guide/b_NX-OS_LISP_Configuration_Guide/b_NX-OS_LISP_Configuration_Guide_chapter_0110.html">
          <front>
            <title>Cisco Nexus 7000 Series NX-OS LISP Configuration Guide - Configuring LISP Delegate Database Tree (DDT)</title>
            <author>
              <organization>Cisco Systems</organization>
            </author>
            <date year="2015" month="July" day="14"/>
          </front>
        </reference>
        <reference anchor="DDT-IETF85" target="https://www.ietf.org/proceedings/85/slides/slides-85-lisp-3.pdf">
          <front>
            <title>LISP-DDT: Implementation Status and Deployment Considerations</title>
            <author initials="V." surname="Fuller" fullname="Vince Fuller">
              <organization>Cisco</organization>
            </author>
            <author initials="D." surname="Lewis" fullname="Darrel Lewis">
              <organization>Cisco</organization>
            </author>
            <date year="2012" month="November"/>
          </front>
          <refcontent>IETF 85 Proceedings, LISP Working Group</refcontent>
        </reference>
        <reference anchor="DDT-IETF84" target="https://www.ietf.org/proceedings/84/slides/slides-84-lisp-2.ppt">
          <front>
            <title>LISP-DDT update</title>
            <author initials="V." surname="Fuller" fullname="Vince Fuller">
              <organization>Cisco</organization>
            </author>
            <date year="2012" month="July"/>
          </front>
          <refcontent>IETF 84 Proceedings, LISP Working Group</refcontent>
        </reference>
        <reference anchor="DDT-ROOT" target="https://ddt-root.cba.upc.edu">
          <front>
            <title>LISP DDT Root</title>
            <author>
              <organization>LISP DDT Root Operators</organization>
            </author>
            <date year="2014" month="May"/>
          </front>
        </reference>
        <reference anchor="LISP4-NET" target="https://lisp4.net.cba.upc.edu/images/lisp-ddt.pdf">
          <front>
            <title>International LISP Beta Network High Level Topology - November 2018</title>
            <author>
              <organization>Universitat Politecnica de Catalunya</organization>
            </author>
            <date year="2018" month="November"/>
          </front>
        </reference>
        <reference anchor="LISP4-BETA" target="https://lisp4.net.cba.upc.edu/beta-network/">
          <front>
            <title>LISP Beta-Network</title>
            <author>
              <organization>Universitat Politecnica de Catalunya</organization>
            </author>
            <date year="2020" month="May"/>
          </front>
        </reference>
        <reference anchor="DDT-NANOG55" target="https://archive.nanog.org/meetings/nanog55/presentations/Tuesday/Fuller.pdf">
          <front>
            <title>LISP-DDT</title>
            <author initials="V." surname="Fuller" fullname="Vince Fuller">
              <organization>Cisco</organization>
            </author>
            <author initials="G." surname="Wiley" fullname="Glen Wiley">
              <organization>Verisign</organization>
            </author>
            <date year="2012" month="June"/>
          </front>
          <refcontent>NANOG 55, Vancouver, BC</refcontent>
        </reference>
        <reference anchor="VXNET-LISP" target="https://mailarchive.ietf.org/arch/msg/lisp/EBeTjeC7iy_CtZ7YyECCKh687S0/">
          <front>
            <title>Re: [lisp] lisp deployment document</title>
            <author initials="P." surname="Vinciguerra" fullname="Paul Vinciguerra">
              <organization/>
            </author>
            <date year="2012" month="November" day="07"/>
          </front>
          <refcontent>message to the lisp@ietf.org mailing list</refcontent>
        </reference>
        <reference anchor="LISP-BETA-PERF" target="https://dl.ifip.org/db/conf/networking/networking2014/CorasSID14.pdf">
          <front>
            <title>On the Performance of the LISP Beta Network</title>
            <author initials="F." surname="Coras" fullname="Florin Coras">
              <organization/>
            </author>
            <author initials="D." surname="Saucez" fullname="Damien Saucez">
              <organization/>
            </author>
            <author initials="L." surname="Iannone" fullname="Luigi Iannone">
              <organization/>
            </author>
            <author initials="B." surname="Donnet" fullname="Benoit Donnet">
              <organization/>
            </author>
            <date year="2014" month="June"/>
          </front>
          <refcontent>IFIP Networking 2014</refcontent>
        </reference>
        <reference anchor="RFC6836">
          <front>
            <title>Locator/ID Separation Protocol Alternative Logical Topology (LISP+ALT)</title>
            <author fullname="V. Fuller" initials="V." surname="Fuller"/>
            <author fullname="D. Farinacci" initials="D." surname="Farinacci"/>
            <author fullname="D. Meyer" initials="D." surname="Meyer"/>
            <author fullname="D. Lewis" initials="D." surname="Lewis"/>
            <date month="January" year="2013"/>
            <abstract>
              <t>This document describes a simple distributed index system to be used by a Locator/ID Separation Protocol (LISP) Ingress Tunnel Router (ITR) or Map-Resolver (MR) to find the Egress Tunnel Router (ETR) that holds the mapping information for a particular Endpoint Identifier (EID). The MR can then query that ETR to obtain the actual mapping information, which consists of a list of Routing Locators (RLOCs) for the EID. Termed the Alternative Logical Topology (ALT), the index is built as an overlay network on the public Internet using the Border Gateway Protocol (BGP) and Generic Routing Encapsulation (GRE). This document defines an Experimental Protocol for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6836"/>
          <seriesInfo name="DOI" value="10.17487/RFC6836"/>
        </reference>
        <reference anchor="RFC6837">
          <front>
            <title>NERD: A Not-so-novel Endpoint ID (EID) to Routing Locator (RLOC) Database</title>
            <author fullname="E. Lear" initials="E." surname="Lear"/>
            <date month="January" year="2013"/>
            <abstract>
              <t>The Locator/ID Separation Protocol (LISP) is a protocol to encapsulate IP packets in order to allow end sites to route to one another without injecting routes from one end of the Internet to another. This memo presents an experimental database and a discussion of methods to transport the mapping of Endpoint IDs (EIDs) to Routing Locators (RLOCs) to routers in a reliable, scalable, and secure manner. Our analysis concludes that transport of all EID-to- RLOC mappings scales well to at least 10^8 entries. This document defines an Experimental Protocol for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6837"/>
          <seriesInfo name="DOI" value="10.17487/RFC6837"/>
        </reference>
        <reference anchor="RFC1035">
          <front>
            <title>Domain names - implementation and specification</title>
            <author fullname="P. Mockapetris" initials="P." surname="Mockapetris"/>
            <date month="November" year="1987"/>
            <abstract>
              <t>This RFC is the revised specification of the protocol and format used in the implementation of the Domain Name System. It obsoletes RFC-883. This memo documents the details of the domain name client - server communication.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="13"/>
          <seriesInfo name="RFC" value="1035"/>
          <seriesInfo name="DOI" value="10.17487/RFC1035"/>
        </reference>
        <reference anchor="RFC8111">
          <front>
            <title>Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT)</title>
            <author fullname="V. Fuller" initials="V." surname="Fuller"/>
            <author fullname="D. Lewis" initials="D." surname="Lewis"/>
            <author fullname="V. Ermagan" initials="V." surname="Ermagan"/>
            <author fullname="A. Jain" initials="A." surname="Jain"/>
            <author fullname="A. Smirnov" initials="A." surname="Smirnov"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>This document describes the Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT), a hierarchical distributed database that embodies the delegation of authority to provide mappings from LISP Endpoint Identifiers (EIDs) to Routing Locators (RLOCs). It is a statically defined distribution of the EID namespace among a set of LISP-speaking servers called "DDT nodes". Each DDT node is configured as "authoritative" for one or more EID-prefixes, along with the set of RLOCs for Map-Servers or "child" DDT nodes to which more-specific EID-prefixes are delegated.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8111"/>
          <seriesInfo name="DOI" value="10.17487/RFC8111"/>
        </reference>
        <reference anchor="RFC8017">
          <front>
            <title>PKCS #1: RSA Cryptography Specifications Version 2.2</title>
            <author fullname="K. Moriarty" initials="K." role="editor" surname="Moriarty"/>
            <author fullname="B. Kaliski" initials="B." surname="Kaliski"/>
            <author fullname="J. Jonsson" initials="J." surname="Jonsson"/>
            <author fullname="A. Rusch" initials="A." surname="Rusch"/>
            <date month="November" year="2016"/>
            <abstract>
              <t>This document provides recommendations for the implementation of public-key cryptography based on the RSA algorithm, covering cryptographic primitives, encryption schemes, signature schemes with appendix, and ASN.1 syntax for representing keys and for identifying the schemes.</t>
              <t>This document represents a republication of PKCS #1 v2.2 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series. By publishing this RFC, change control is transferred to the IETF.</t>
              <t>This document also obsoletes RFC 3447.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8017"/>
          <seriesInfo name="DOI" value="10.17487/RFC8017"/>
        </reference>
        <reference anchor="RFC6234">
          <front>
            <title>US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)</title>
            <author fullname="D. Eastlake 3rd" initials="D." surname="Eastlake 3rd"/>
            <author fullname="T. Hansen" initials="T." surname="Hansen"/>
            <date month="May" year="2011"/>
            <abstract>
              <t>Federal Information Processing Standard, FIPS</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6234"/>
          <seriesInfo name="DOI" value="10.17487/RFC6234"/>
        </reference>
        <reference anchor="RFC5011">
          <front>
            <title>Automated Updates of DNS Security (DNSSEC) Trust Anchors</title>
            <author fullname="M. StJohns" initials="M." surname="StJohns"/>
            <date month="September" year="2007"/>
            <abstract>
              <t>This document describes a means for automated, authenticated, and authorized updating of DNSSEC "trust anchors". The method provides protection against N-1 key compromises of N keys in the trust point key set. Based on the trust established by the presence of a current anchor, other anchors may be added at the same place in the hierarchy, and, ultimately, supplant the existing anchor(s).</t>
              <t>This mechanism will require changes to resolver management behavior (but not resolver resolution behavior), and the addition of a single flag bit to the DNSKEY record. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="74"/>
          <seriesInfo name="RFC" value="5011"/>
          <seriesInfo name="DOI" value="10.17487/RFC5011"/>
        </reference>
        <reference anchor="RFC7835">
          <front>
            <title>Locator/ID Separation Protocol (LISP) Threat Analysis</title>
            <author fullname="D. Saucez" initials="D." surname="Saucez"/>
            <author fullname="L. Iannone" initials="L." surname="Iannone"/>
            <author fullname="O. Bonaventure" initials="O." surname="Bonaventure"/>
            <date month="April" year="2016"/>
            <abstract>
              <t>This document provides a threat analysis of the Locator/ID Separation Protocol (LISP).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7835"/>
          <seriesInfo name="DOI" value="10.17487/RFC7835"/>
        </reference>
        <reference anchor="RFC9147">
          <front>
            <title>The Datagram Transport Layer Security (DTLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
            <author fullname="N. Modadugu" initials="N." surname="Modadugu"/>
            <date month="April" year="2022"/>
            <abstract>
              <t>This document specifies version 1.3 of the Datagram Transport Layer Security (DTLS) protocol. DTLS 1.3 allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t>The DTLS 1.3 protocol is based on the Transport Layer Security (TLS) 1.3 protocol and provides equivalent security guarantees with the exception of order protection / non-replayability. Datagram semantics of the underlying transport are preserved by the DTLS protocol.</t>
              <t>This document obsoletes RFC 6347.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9147"/>
          <seriesInfo name="DOI" value="10.17487/RFC9147"/>
        </reference>
        <reference anchor="RFC8112">
          <front>
            <title>Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT) Referral Internet Groper (RIG)</title>
            <author fullname="D. Farinacci" initials="D." surname="Farinacci"/>
            <author fullname="A. Jain" initials="A." surname="Jain"/>
            <author fullname="I. Kouvelas" initials="I." surname="Kouvelas"/>
            <author fullname="D. Lewis" initials="D." surname="Lewis"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>A simple tool called the Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT) Referral Internet Groper (RIG), also referred to in this document as "rig", can be used to query the LISP- DDT hierarchy. This document describes how the "rig" tool works.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8112"/>
          <seriesInfo name="DOI" value="10.17487/RFC8112"/>
        </reference>
        <reference anchor="I-D.wiley-lisp-ddtxfer">
          <front>
            <title>LISP-DDT Database Transfer</title>
            <author fullname="Glen Wiley" initials="G." surname="Wiley">
              <organization>Verisign, Inc.</organization>
            </author>
            <date day="12" month="March" year="2012"/>
            <abstract>
              <t>   This draft describes a protocol for transferring a LISP Delegated
   Database Tree (LISP-DDT) between DDT nodes and for notifying DDT
   nodes that the database has changed.  In the absence of a formally
   defined protocol the LISP-DDT database is transferred using files
   containing device configuration commands.  This protocol provides for
   transferring a complete database or the deltas between two versions
   of the database.  This document does not describe the use of DDT as
   part of the LISP mapping service.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-wiley-lisp-ddtxfer-01"/>
        </reference>
        <reference anchor="RFC2026">
          <front>
            <title>The Internet Standards Process -- Revision 3</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="October" year="1996"/>
            <abstract>
              <t>This memo documents the process used by the Internet community for the standardization of protocols and procedures. It defines the stages in the standardization process, the requirements for moving a document between stages and the types of documents used during this process. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="9"/>
          <seriesInfo name="RFC" value="2026"/>
          <seriesInfo name="DOI" value="10.17487/RFC2026"/>
        </reference>
      </references>
    </references>
    <?line 723?>

<section anchor="SEC_Pseudocode">
      <name>Pseudo-code and Decision Tree Diagrams</name>
      <t>To illustrate the DDT algorithms described in this document and to aid in implementation, each of the major DDT Map-Server and DDT Map-Resolver functions are described first using simple "pseudo-code" and then in the form of a decision tree.</t>
      <section anchor="map-resolver-processing-of-map-request">
        <name>Map-Resolver Processing of Map-Request</name>
        <section anchor="pseudo-code-summary">
          <name>Pseudo-code Summary</name>
          <artwork><![CDATA[
if (Map-Request already in Pending Request List) {
   replace old Map-Request with new  
   use new Map-Request nonce

} else if ( no match in DDT Map-Referral Cache ) {
   return Negative Map-Reply to requester

} else if ( match type DELEGATION-HOLE ) {
   return Negative Map-Reply to requester

} else if ( match type MS-ACK ) {
   forward DDT Map-Request to Map-Server

} else {
   Add Map-Request to Pending Request List 
   Forward DDT Map-Request w/o security material

}
]]></artwork>
        </section>
        <section anchor="decision-tree-diagram">
          <name>Decision Tree Diagram</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="512" width="504" viewBox="0 0 504 512" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 80,96 L 80,136" fill="none" stroke="black"/>
                <path d="M 80,208 L 80,248" fill="none" stroke="black"/>
                <path d="M 80,320 L 80,360" fill="none" stroke="black"/>
                <path d="M 80,432 L 80,464" fill="none" stroke="black"/>
                <path d="M 24,32 L 152,32" fill="none" stroke="black"/>
                <path d="M 168,64 L 192,64" fill="none" stroke="black"/>
                <path d="M 24,96 L 152,96" fill="none" stroke="black"/>
                <path d="M 24,144 L 152,144" fill="none" stroke="black"/>
                <path d="M 168,176 L 192,176" fill="none" stroke="black"/>
                <path d="M 24,208 L 152,208" fill="none" stroke="black"/>
                <path d="M 24,256 L 152,256" fill="none" stroke="black"/>
                <path d="M 168,288 L 192,288" fill="none" stroke="black"/>
                <path d="M 24,320 L 152,320" fill="none" stroke="black"/>
                <path d="M 24,368 L 152,368" fill="none" stroke="black"/>
                <path d="M 168,400 L 192,400" fill="none" stroke="black"/>
                <path d="M 24,432 L 152,432" fill="none" stroke="black"/>
                <path d="M 8,400 L 24,432" fill="none" stroke="black"/>
                <path d="M 8,288 L 24,320" fill="none" stroke="black"/>
                <path d="M 8,176 L 24,208" fill="none" stroke="black"/>
                <path d="M 152,368 L 168,400" fill="none" stroke="black"/>
                <path d="M 8,64 L 24,96" fill="none" stroke="black"/>
                <path d="M 152,256 L 168,288" fill="none" stroke="black"/>
                <path d="M 152,144 L 168,176" fill="none" stroke="black"/>
                <path d="M 152,32 L 168,64" fill="none" stroke="black"/>
                <path d="M 8,64 L 24,32" fill="none" stroke="black"/>
                <path d="M 8,176 L 24,144" fill="none" stroke="black"/>
                <path d="M 8,288 L 24,256" fill="none" stroke="black"/>
                <path d="M 152,96 L 168,64" fill="none" stroke="black"/>
                <path d="M 8,400 L 24,368" fill="none" stroke="black"/>
                <path d="M 152,208 L 168,176" fill="none" stroke="black"/>
                <path d="M 152,320 L 168,288" fill="none" stroke="black"/>
                <path d="M 152,432 L 168,400" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="200,400 188,394.4 188,405.6" fill="black" transform="rotate(0,192,400)"/>
                <polygon class="arrowhead" points="200,288 188,282.4 188,293.6" fill="black" transform="rotate(0,192,288)"/>
                <polygon class="arrowhead" points="200,176 188,170.4 188,181.6" fill="black" transform="rotate(0,192,176)"/>
                <polygon class="arrowhead" points="200,64 188,58.4 188,69.6" fill="black" transform="rotate(0,192,64)"/>
                <polygon class="arrowhead" points="88,464 76,458.4 76,469.6" fill="black" transform="rotate(90,80,464)"/>
                <polygon class="arrowhead" points="88,360 76,354.4 76,365.6" fill="black" transform="rotate(90,80,360)"/>
                <polygon class="arrowhead" points="88,248 76,242.4 76,253.6" fill="black" transform="rotate(90,80,248)"/>
                <polygon class="arrowhead" points="88,136 76,130.4 76,141.6" fill="black" transform="rotate(90,80,136)"/>
                <g class="text">
                  <text x="72" y="52">Map-Request</text>
                  <text x="132" y="52">in</text>
                  <text x="184" y="52">Yes</text>
                  <text x="56" y="68">Request</text>
                  <text x="120" y="68">Pending</text>
                  <text x="232" y="68">Replace</text>
                  <text x="280" y="68">old</text>
                  <text x="344" y="68">Map-Request</text>
                  <text x="412" y="68">with</text>
                  <text x="448" y="68">new</text>
                  <text x="48" y="84">List?</text>
                  <text x="216" y="84">use</text>
                  <text x="248" y="84">new</text>
                  <text x="312" y="84">Map-Request</text>
                  <text x="384" y="84">Nonce</text>
                  <text x="92" y="116">No</text>
                  <text x="48" y="164">Match</text>
                  <text x="84" y="164">in</text>
                  <text x="112" y="164">DDT</text>
                  <text x="180" y="164">No</text>
                  <text x="68" y="180">Map-Referral</text>
                  <text x="220" y="180">Send</text>
                  <text x="276" y="180">Negative</text>
                  <text x="352" y="180">Map-Reply</text>
                  <text x="52" y="196">Cache?</text>
                  <text x="240" y="196">(unlikely</text>
                  <text x="308" y="196">event,</text>
                  <text x="348" y="196">as</text>
                  <text x="380" y="196">root</text>
                  <text x="412" y="196">or</text>
                  <text x="444" y="196">hint</text>
                  <text x="244" y="212">configured</text>
                  <text x="300" y="212">on</text>
                  <text x="336" y="212">every</text>
                  <text x="416" y="212">Map-Resolver)</text>
                  <text x="96" y="228">Yes</text>
                  <text x="48" y="276">Match</text>
                  <text x="92" y="276">type</text>
                  <text x="184" y="276">Yes</text>
                  <text x="84" y="292">DELEGATION-HOLE?</text>
                  <text x="220" y="292">Send</text>
                  <text x="276" y="292">Negative</text>
                  <text x="352" y="292">Map-Reply</text>
                  <text x="92" y="340">No</text>
                  <text x="48" y="388">Match</text>
                  <text x="92" y="388">type</text>
                  <text x="184" y="388">Yes</text>
                  <text x="56" y="404">MS-ACK?</text>
                  <text x="232" y="404">Forward</text>
                  <text x="280" y="404">DDT</text>
                  <text x="344" y="404">Map-Request</text>
                  <text x="404" y="404">to</text>
                  <text x="244" y="420">Map-Server</text>
                  <text x="92" y="452">No</text>
                  <text x="16" y="484">Add</text>
                  <text x="80" y="484">Map-Request</text>
                  <text x="140" y="484">to</text>
                  <text x="184" y="484">Pending</text>
                  <text x="248" y="484">Request</text>
                  <text x="300" y="484">List</text>
                  <text x="32" y="500">Forward</text>
                  <text x="80" y="500">DDT</text>
                  <text x="144" y="500">Map-Request</text>
                  <text x="224" y="500">without</text>
                  <text x="292" y="500">security</text>
                  <text x="364" y="500">material</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
  +---------------+ 
 / Map-Request in  \ Yes
|  Request Pending  +--> Replace old Map-Request with new     
 \ List?           /     use new Map-Request Nonce
  +------+--------+
         |No
         V
  +---------------+ 
 / Match in DDT    \ No
| Map-Referral      +--> Send Negative Map-Reply
 \ Cache?          /     (unlikely event, as root or hint
  +------+--------+      configured on every Map-Resolver)
         |Yes
         V
  +---------------+ 
 / Match type      \ Yes
| DELEGATION-HOLE?  +--> Send Negative Map-Reply
 \                 /
  +------+--------+
         |No
         V
  +---------------+ 
 / Match type      \ Yes
|  MS-ACK?          +--> Forward DDT Map-Request to
 \                 /     Map-Server
  +------+--------+     
         |No
         V
Add Map-Request to Pending Request List
Forward DDT Map-Request without security material
]]></artwork>
          </artset>
        </section>
      </section>
      <section anchor="map-resolver-processing-of-map-referral-message">
        <name>Map-Resolver Processing of Map-Referral Message</name>
        <section anchor="pseudo-code-summary-1">
          <name>Pseudo-code Summary</name>
          <artwork><![CDATA[
if ( authentication signature validation failed ) {
   silently drop
}

if ( no Pending Request List entry matched by Map-Referral Nonce ) {
   silently drop
}

if ( XEID-Prefix in Map-Referral less specific than last used ) {
   if ( gone through root ) {
      silently drop
   } else {
      send Map-Request to root
   }
}

switch (map_referral_type) {

   case NOT-AUTHORITATIVE:
      if ( gone through root ) {
         return Negative Map-Reply to requester
      } else {
         send Map-Request to root
      }

   case DELEGATION-HOLE:
      Store in DDT Map-Referral Cache 
      send Negative Map-Reply to requester

   case MS-REFERRAL:
      if ( Map-Referral RLOC Set contains last used RLOC ) {
         if ( gone through root ) {
            return Negative Map-Reply to requester
         } else {
            send Map-Request to root
         }
      } else {
         Store in DDT Map-Referral Cache
         follow Map-Referral with LISP-SEC security material
      }

   case NODE-REFERRAL:
      if ( Map-Referral RLOCs Set contains last used RLOC ) {
         if ( gone through root ) {
            return Negative Map-Reply to requester
         } else {
            send Map-Request to root
         }
      } else {
         Store in DDT Map-Referral Cache 
         follow Map-Referral without LISP-SEC security material
      }

   case MS-ACK:
      if ( Map-Referral has no LISP-SEC security material ) {
         resend Map-Request with LISP-SEC security material
         if { !incomplete } {
            Store in DDT Map-Referral Cache 
         }
      }

   case MS-NOT-REGISTERED:
      if ( all Map-Server delegations not tried ) {
         follow Map-Referral without LISP-SEC security material
         if ( !incomplete ) {
            Store in DDT Map-Referral Cache 
         }
      } else {
         send Negative Map-Reply to requester
         if { !incomplete } {
            Store in DDT Map-Referral Cache 
         }
      }

   case DEFAULT:
      Silently Drop
}
]]></artwork>
        </section>
        <section anchor="decision-tree-diagram-1">
          <name>Decision Tree Diagram</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="1024" width="560" viewBox="0 0 560 1024" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 40,368 L 40,400" fill="none" stroke="black"/>
                <path d="M 48,432 L 48,608" fill="none" stroke="black"/>
                <path d="M 48,640 L 48,888" fill="none" stroke="black"/>
                <path d="M 64,960 L 64,992" fill="none" stroke="black"/>
                <path d="M 80,768 L 80,800" fill="none" stroke="black"/>
                <path d="M 128,672 L 128,696" fill="none" stroke="black"/>
                <path d="M 144,400 L 144,512" fill="none" stroke="black"/>
                <path d="M 144,544 L 144,640" fill="none" stroke="black"/>
                <path d="M 168,768 L 168,800" fill="none" stroke="black"/>
                <path d="M 200,400 L 200,456" fill="none" stroke="black"/>
                <path d="M 200,472 L 200,552" fill="none" stroke="black"/>
                <path d="M 216,624 L 216,656" fill="none" stroke="black"/>
                <path d="M 232,96 L 232,136" fill="none" stroke="black"/>
                <path d="M 232,208 L 232,248" fill="none" stroke="black"/>
                <path d="M 232,320 L 232,360" fill="none" stroke="black"/>
                <path d="M 264,400 L 264,456" fill="none" stroke="black"/>
                <path d="M 264,472 L 264,544" fill="none" stroke="black"/>
                <path d="M 304,624 L 304,696" fill="none" stroke="black"/>
                <path d="M 304,768 L 304,816" fill="none" stroke="black"/>
                <path d="M 344,400 L 344,416" fill="none" stroke="black"/>
                <path d="M 344,448 L 344,504" fill="none" stroke="black"/>
                <path d="M 344,968 L 344,992" fill="none" stroke="black"/>
                <path d="M 352,576 L 352,608" fill="none" stroke="black"/>
                <path d="M 408,720 L 408,832" fill="none" stroke="black"/>
                <path d="M 408,864 L 408,896" fill="none" stroke="black"/>
                <path d="M 408,960 L 408,992" fill="none" stroke="black"/>
                <path d="M 416,368 L 416,400" fill="none" stroke="black"/>
                <path d="M 496,384 L 496,400" fill="none" stroke="black"/>
                <path d="M 176,32 L 280,32" fill="none" stroke="black"/>
                <path d="M 296,64 L 312,64" fill="none" stroke="black"/>
                <path d="M 176,96 L 280,96" fill="none" stroke="black"/>
                <path d="M 176,144 L 280,144" fill="none" stroke="black"/>
                <path d="M 296,176 L 312,176" fill="none" stroke="black"/>
                <path d="M 176,208 L 280,208" fill="none" stroke="black"/>
                <path d="M 176,256 L 280,256" fill="none" stroke="black"/>
                <path d="M 296,288 L 312,288" fill="none" stroke="black"/>
                <path d="M 176,320 L 280,320" fill="none" stroke="black"/>
                <path d="M 40,368 L 416,368" fill="none" stroke="black"/>
                <path d="M 416,384 L 496,384" fill="none" stroke="black"/>
                <path d="M 40,400 L 416,400" fill="none" stroke="black"/>
                <path d="M 312,512 L 392,512" fill="none" stroke="black"/>
                <path d="M 408,544 L 424,544" fill="none" stroke="black"/>
                <path d="M 184,560 L 248,560" fill="none" stroke="black"/>
                <path d="M 312,576 L 392,576" fill="none" stroke="black"/>
                <path d="M 152,592 L 168,592" fill="none" stroke="black"/>
                <path d="M 184,624 L 248,624" fill="none" stroke="black"/>
                <path d="M 80,704 L 168,704" fill="none" stroke="black"/>
                <path d="M 272,704 L 336,704" fill="none" stroke="black"/>
                <path d="M 192,736 L 256,736" fill="none" stroke="black"/>
                <path d="M 80,768 L 168,768" fill="none" stroke="black"/>
                <path d="M 272,768 L 336,768" fill="none" stroke="black"/>
                <path d="M 408,864 L 424,864" fill="none" stroke="black"/>
                <path d="M 24,896 L 96,896" fill="none" stroke="black"/>
                <path d="M 336,896 L 408,896" fill="none" stroke="black"/>
                <path d="M 160,912 L 256,912" fill="none" stroke="black"/>
                <path d="M 112,928 L 136,928" fill="none" stroke="black"/>
                <path d="M 280,928 L 312,928" fill="none" stroke="black"/>
                <path d="M 160,944 L 256,944" fill="none" stroke="black"/>
                <path d="M 24,960 L 96,960" fill="none" stroke="black"/>
                <path d="M 336,960 L 408,960" fill="none" stroke="black"/>
                <path d="M 128,976 L 288,976" fill="none" stroke="black"/>
                <path d="M 64,992 L 104,992" fill="none" stroke="black"/>
                <path d="M 312,992 L 344,992" fill="none" stroke="black"/>
                <path d="M 408,992 L 424,992" fill="none" stroke="black"/>
                <path d="M 128,1008 L 288,1008" fill="none" stroke="black"/>
                <path d="M 8,928 L 24,960" fill="none" stroke="black"/>
                <path d="M 96,896 L 112,928" fill="none" stroke="black"/>
                <path d="M 64,736 L 80,768" fill="none" stroke="black"/>
                <path d="M 168,704 L 184,736" fill="none" stroke="black"/>
                <path d="M 320,928 L 336,960" fill="none" stroke="black"/>
                <path d="M 168,592 L 184,624" fill="none" stroke="black"/>
                <path d="M 256,736 L 272,768" fill="none" stroke="black"/>
                <path d="M 408,896 L 424,928" fill="none" stroke="black"/>
                <path d="M 248,560 L 264,592" fill="none" stroke="black"/>
                <path d="M 336,704 L 352,736" fill="none" stroke="black"/>
                <path d="M 264,544 L 304,624" fill="none" stroke="black"/>
                <path d="M 160,288 L 176,320" fill="none" stroke="black"/>
                <path d="M 296,544 L 312,576" fill="none" stroke="black"/>
                <path d="M 352,608 L 408,720" fill="none" stroke="black"/>
                <path d="M 160,176 L 176,208" fill="none" stroke="black"/>
                <path d="M 160,64 L 176,96" fill="none" stroke="black"/>
                <path d="M 392,512 L 408,544" fill="none" stroke="black"/>
                <path d="M 280,256 L 296,288" fill="none" stroke="black"/>
                <path d="M 400,400 L 408,416" fill="none" stroke="black"/>
                <path d="M 424,448 L 432,464" fill="none" stroke="black"/>
                <path d="M 280,144 L 296,176" fill="none" stroke="black"/>
                <path d="M 280,32 L 296,64" fill="none" stroke="black"/>
                <path d="M 160,64 L 176,32" fill="none" stroke="black"/>
                <path d="M 160,176 L 176,144" fill="none" stroke="black"/>
                <path d="M 48,432 L 64,400" fill="none" stroke="black"/>
                <path d="M 160,288 L 176,256" fill="none" stroke="black"/>
                <path d="M 280,96 L 296,64" fill="none" stroke="black"/>
                <path d="M 280,208 L 296,176" fill="none" stroke="black"/>
                <path d="M 64,736 L 80,704" fill="none" stroke="black"/>
                <path d="M 280,320 L 296,288" fill="none" stroke="black"/>
                <path d="M 128,672 L 144,640" fill="none" stroke="black"/>
                <path d="M 168,592 L 184,560" fill="none" stroke="black"/>
                <path d="M 8,928 L 24,896" fill="none" stroke="black"/>
                <path d="M 168,768 L 184,736" fill="none" stroke="black"/>
                <path d="M 248,624 L 264,592" fill="none" stroke="black"/>
                <path d="M 296,544 L 312,512" fill="none" stroke="black"/>
                <path d="M 96,960 L 112,928" fill="none" stroke="black"/>
                <path d="M 256,736 L 272,704" fill="none" stroke="black"/>
                <path d="M 392,576 L 408,544" fill="none" stroke="black"/>
                <path d="M 336,768 L 352,736" fill="none" stroke="black"/>
                <path d="M 320,928 L 336,896" fill="none" stroke="black"/>
                <path d="M 380,888 L 408,832" fill="none" stroke="black"/>
                <path d="M 408,960 L 424,928" fill="none" stroke="black"/>
                <path d="M 160,912 C 151.16936,912 144,919.16936 144,928" fill="none" stroke="black"/>
                <path d="M 256,912 C 264.83064,912 272,919.16936 272,928" fill="none" stroke="black"/>
                <path d="M 160,944 C 151.16936,944 144,936.83064 144,928" fill="none" stroke="black"/>
                <path d="M 256,944 C 264.83064,944 272,936.83064 272,928" fill="none" stroke="black"/>
                <path d="M 128,976 C 119.16936,976 112,983.16936 112,992" fill="none" stroke="black"/>
                <path d="M 288,976 C 296.83064,976 304,983.16936 304,992" fill="none" stroke="black"/>
                <path d="M 128,1008 C 119.16936,1008 112,1000.83064 112,992" fill="none" stroke="black"/>
                <path d="M 288,1008 C 296.83064,1008 304,1000.83064 304,992" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="504,400 492,394.4 492,405.6" fill="black" transform="rotate(90,496,400)"/>
                <polygon class="arrowhead" points="440,464 428,458.4 428,469.6" fill="black" transform="rotate(63.43494882292201,432,464)"/>
                <polygon class="arrowhead" points="432,992 420,986.4 420,997.6" fill="black" transform="rotate(0,424,992)"/>
                <polygon class="arrowhead" points="432,864 420,858.4 420,869.6" fill="black" transform="rotate(0,424,864)"/>
                <polygon class="arrowhead" points="432,544 420,538.4 420,549.6" fill="black" transform="rotate(0,424,544)"/>
                <polygon class="arrowhead" points="388,888 376,882.4 376,893.6" fill="black" transform="rotate(116.56505117707799,380,888)"/>
                <polygon class="arrowhead" points="352,968 340,962.4 340,973.6" fill="black" transform="rotate(270,344,968)"/>
                <polygon class="arrowhead" points="352,504 340,498.4 340,509.6" fill="black" transform="rotate(90,344,504)"/>
                <polygon class="arrowhead" points="320,928 308,922.4 308,933.6" fill="black" transform="rotate(0,312,928)"/>
                <polygon class="arrowhead" points="320,288 308,282.4 308,293.6" fill="black" transform="rotate(0,312,288)"/>
                <polygon class="arrowhead" points="320,176 308,170.4 308,181.6" fill="black" transform="rotate(0,312,176)"/>
                <polygon class="arrowhead" points="320,64 308,58.4 308,69.6" fill="black" transform="rotate(0,312,64)"/>
                <polygon class="arrowhead" points="312,816 300,810.4 300,821.6" fill="black" transform="rotate(90,304,816)"/>
                <polygon class="arrowhead" points="312,696 300,690.4 300,701.6" fill="black" transform="rotate(90,304,696)"/>
                <polygon class="arrowhead" points="240,360 228,354.4 228,365.6" fill="black" transform="rotate(90,232,360)"/>
                <polygon class="arrowhead" points="240,248 228,242.4 228,253.6" fill="black" transform="rotate(90,232,248)"/>
                <polygon class="arrowhead" points="240,136 228,130.4 228,141.6" fill="black" transform="rotate(90,232,136)"/>
                <polygon class="arrowhead" points="224,656 212,650.4 212,661.6" fill="black" transform="rotate(90,216,656)"/>
                <polygon class="arrowhead" points="208,552 196,546.4 196,557.6" fill="black" transform="rotate(90,200,552)"/>
                <polygon class="arrowhead" points="200,736 188,730.4 188,741.6" fill="black" transform="rotate(180,192,736)"/>
                <polygon class="arrowhead" points="176,800 164,794.4 164,805.6" fill="black" transform="rotate(90,168,800)"/>
                <polygon class="arrowhead" points="144,928 132,922.4 132,933.6" fill="black" transform="rotate(0,136,928)"/>
                <polygon class="arrowhead" points="136,696 124,690.4 124,701.6" fill="black" transform="rotate(90,128,696)"/>
                <polygon class="arrowhead" points="112,992 100,986.4 100,997.6" fill="black" transform="rotate(0,104,992)"/>
                <polygon class="arrowhead" points="88,800 76,794.4 76,805.6" fill="black" transform="rotate(90,80,800)"/>
                <polygon class="arrowhead" points="56,888 44,882.4 44,893.6" fill="black" transform="rotate(90,48,888)"/>
                <circle cx="144" cy="592" r="6" class="closeddot" fill="black"/>
                <g class="text">
                  <text x="228" y="52">Authentication</text>
                  <text x="308" y="52">No</text>
                  <text x="208" y="68">signature</text>
                  <text x="356" y="68">Silently</text>
                  <text x="412" y="68">Drop</text>
                  <text x="196" y="84">valid?</text>
                  <text x="248" y="116">Yes</text>
                  <text x="188" y="164">In</text>
                  <text x="232" y="164">Pending</text>
                  <text x="308" y="164">No</text>
                  <text x="208" y="180">Request</text>
                  <text x="356" y="180">Silently</text>
                  <text x="412" y="180">Drop</text>
                  <text x="200" y="196">List?</text>
                  <text x="248" y="228">Yes</text>
                  <text x="212" y="276">XEID-Pfx</text>
                  <text x="268" y="276">less</text>
                  <text x="312" y="276">Yes</text>
                  <text x="212" y="292">specific</text>
                  <text x="268" y="292">than</text>
                  <text x="356" y="292">Silently</text>
                  <text x="412" y="292">Drop</text>
                  <text x="196" y="308">last</text>
                  <text x="240" y="308">used?</text>
                  <text x="244" y="340">No</text>
                  <text x="456" y="372">Unknown</text>
                  <text x="132" y="388">What</text>
                  <text x="164" y="388">is</text>
                  <text x="192" y="388">the</text>
                  <text x="260" y="388">Map-Referral</text>
                  <text x="332" y="388">ACT?</text>
                  <text x="500" y="420">Silently</text>
                  <text x="340" y="436">MS-ACK</text>
                  <text x="412" y="436">DEL-HOLE</text>
                  <text x="484" y="436">Drop</text>
                  <text x="196" y="468">NODE-REF</text>
                  <text x="268" y="468">MS-REF</text>
                  <text x="408" y="484">Cache</text>
                  <text x="440" y="484">&amp;</text>
                  <text x="476" y="484">Return</text>
                  <text x="420" y="500">Negative</text>
                  <text x="496" y="500">Map-Reply</text>
                  <text x="140" y="532">NOT-AUTH</text>
                  <text x="348" y="532">LISP-SEC</text>
                  <text x="424" y="532">Yes</text>
                  <text x="340" y="548">material</text>
                  <text x="460" y="548">Resend</text>
                  <text x="520" y="548">Request</text>
                  <text x="352" y="564">stripped?</text>
                  <text x="452" y="564">with</text>
                  <text x="508" y="564">LISP-SEC</text>
                  <text x="160" y="580">Yes</text>
                  <text x="192" y="580">Pfx</text>
                  <text x="232" y="580">equal</text>
                  <text x="196" y="596">last</text>
                  <text x="240" y="596">used?</text>
                  <text x="372" y="596">No</text>
                  <text x="72" y="628">MS-NOT-REGISTERED</text>
                  <text x="228" y="644">No</text>
                  <text x="176" y="676">Cache</text>
                  <text x="208" y="676">&amp;</text>
                  <text x="244" y="676">Follow</text>
                  <text x="204" y="692">Map-Referral</text>
                  <text x="92" y="724">Gone</text>
                  <text x="144" y="724">through</text>
                  <text x="248" y="724">Yes</text>
                  <text x="280" y="724">Pfx</text>
                  <text x="320" y="724">equal</text>
                  <text x="104" y="740">root?</text>
                  <text x="284" y="740">last</text>
                  <text x="328" y="740">used?</text>
                  <text x="92" y="788">No</text>
                  <text x="184" y="788">Yes</text>
                  <text x="316" y="788">No</text>
                  <text x="92" y="820">Send</text>
                  <text x="128" y="820">Req</text>
                  <text x="180" y="820">Send</text>
                  <text x="236" y="820">Negative</text>
                  <text x="84" y="836">to</text>
                  <text x="116" y="836">root</text>
                  <text x="200" y="836">Map-Reply</text>
                  <text x="280" y="836">Cache</text>
                  <text x="312" y="836">&amp;</text>
                  <text x="348" y="836">Follow</text>
                  <text x="308" y="852">Map-Referral</text>
                  <text x="380" y="852">with</text>
                  <text x="292" y="868">LISP-SEC</text>
                  <text x="444" y="868">Do</text>
                  <text x="472" y="868">Not</text>
                  <text x="512" y="868">Cache</text>
                  <text x="432" y="900">Yes</text>
                  <text x="48" y="916">Other</text>
                  <text x="84" y="916">MS</text>
                  <text x="128" y="916">Yes</text>
                  <text x="372" y="916">Incomplete</text>
                  <text x="32" y="932">not</text>
                  <text x="76" y="932">tried?</text>
                  <text x="172" y="932">Follow</text>
                  <text x="224" y="932">other</text>
                  <text x="260" y="932">MS</text>
                  <text x="348" y="932">flag</text>
                  <text x="388" y="932">set?</text>
                  <text x="428" y="964">No</text>
                  <text x="76" y="980">No</text>
                  <text x="132" y="996">Send</text>
                  <text x="188" y="996">Negative</text>
                  <text x="264" y="996">Map-Reply</text>
                  <text x="456" y="996">Cache</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
                     +------------+
                    /Authentication\ No
                   | signature      +-> Silently Drop
                    \valid?        /  
                     +------+-----+ 
                            |Yes
                            v
                     +------------+
                    / In Pending   \ No
                   |  Request       +-> Silently Drop
                    \ List?        /  
                     +------+-----+ 
                            |Yes
                            v
                     +------------+
                    / XEID-Pfx less\ Yes
                   |  specific than +-> Silently Drop
                    \ last used?   /  
                     +------+-----+ 
                            |No
                            v
    +----------------------------------------------+ Unknown
    |         What is the Map-Referral ACT?        +---------+
    +--+---------+------+-------+---------+------+-+         v
      /          |      |       |         |       \       Silently   
     |           |      |       |      MS-ACK  DEL-HOLE   Drop
     |           |      |       |         |         \
     |           |  NODE-REF  MS-REF      |          v
     |           |      |       |         |     Cache & Return 
     |           |      |       |         v     Negative Map-Reply
     |           |      |       |     +---------+
     |       NOT-AUTH   |       |    / LISP-SEC  \ Yes
     |           |      v       |   | material    +-> Resend Request
     |           |    +-------+  \   \ stripped? /    with LISP-SEC
     |           |Yes/Pfx equal\  \   +----+----+
     |           *--+ last used?|  \       | No
     |           |   \         /    \      +
MS-NOT-REGISTERED|    +---+---+      |      \
     |           +        |No        |       \
     |          /         v          |        \ 
     |         +   Cache & Follow    |         \
     |         v   Map-Referral      v          \
     |   +----------+            +-------+       +
     |  /Gone through\       Yes/Pfx equal\       |
     | |  root?       |<-------+ last used?|      |
     |  \            /          \         /       |
     |   +----------+            +---+---+        |
     |   |No        |Yes             |No          |       
     |   v          v                |            |
     |   Send Req   Send Negative    v            | 
     |   to root    Map-Reply   Cache & Follow    | 
     |                          Map-Referral with/
     |                          LISP-SEC        / +-> Do Not Cache
     v                                         v  |           
  +--------+                             +--------+ Yes
 / Other MS \ Yes +-------------+       /Incomplete\ 
| not tried? +-->|Follow other MS|---->| flag set?  |      
 \          /     +-------------+       \          /
  +----+---+                             +--------+ No
       |No    +---------------------+     ^       |
       +---->|Send Negative Map-Reply|----+       +-> Cache
              +---------------------+
]]></artwork>
          </artset>
        </section>
      </section>
      <section anchor="ddt-node-processing-of-ddt-map-request-message">
        <name>DDT Node Processing of DDT Map-Request Message</name>
        <section anchor="pseudo-code-summary-2">
          <name>Pseudo-code Summary</name>
          <artwork><![CDATA[
if ( I am not authoritative ) {
   send Map-Referral NOT_AUTHORITATIVE & set "Incomplete" bit

} else if ( delegation exists ) {
   if ( delegated Map-Servers ) {
      send Map-Referral MS_REFERRAL 
   
   } else {
      send Map-Referral NODE_REFERRAL 
   }

} else {
   if ( EID in site ) {
      if ( site registered ) {
         forward Map-Request to ETR
        
         if ( Map-Server peers configured ) {
            send Map-Referral MS_ACK

         } else {
            send Map-Referral MS_ACK & set"Incomplete" bit
         }

      } else {
         if ( Map-Server peers configured ) {
            send Map-Referral MS_NOT_REGISTERED 

         } else {
            send Map-Referral MS_NOT_REGISTERED & set"Incomplete" bit
         }

      }

   } else {
      send Map-Referral DELEGATION_HOLE

   }

}
]]></artwork>
        </section>
        <section anchor="decision-tree-diagram-2">
          <name>Decision Tree Diagram</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="720" width="528" viewBox="0 0 528 720" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,480 L 8,544" fill="none" stroke="black"/>
                <path d="M 80,96 L 80,136" fill="none" stroke="black"/>
                <path d="M 80,208 L 80,248" fill="none" stroke="black"/>
                <path d="M 80,320 L 80,360" fill="none" stroke="black"/>
                <path d="M 80,432 L 80,472" fill="none" stroke="black"/>
                <path d="M 80,544 L 80,584" fill="none" stroke="black"/>
                <path d="M 80,656 L 80,688" fill="none" stroke="black"/>
                <path d="M 144,480 L 144,544" fill="none" stroke="black"/>
                <path d="M 256,208 L 256,240" fill="none" stroke="black"/>
                <path d="M 256,432 L 256,464" fill="none" stroke="black"/>
                <path d="M 344,400 L 344,416" fill="none" stroke="black"/>
                <path d="M 24,32 L 128,32" fill="none" stroke="black"/>
                <path d="M 144,64 L 160,64" fill="none" stroke="black"/>
                <path d="M 24,96 L 128,96" fill="none" stroke="black"/>
                <path d="M 24,144 L 128,144" fill="none" stroke="black"/>
                <path d="M 200,144 L 304,144" fill="none" stroke="black"/>
                <path d="M 144,176 L 176,176" fill="none" stroke="black"/>
                <path d="M 320,176 L 344,176" fill="none" stroke="black"/>
                <path d="M 24,208 L 128,208" fill="none" stroke="black"/>
                <path d="M 200,208 L 304,208" fill="none" stroke="black"/>
                <path d="M 256,240 L 272,240" fill="none" stroke="black"/>
                <path d="M 24,256 L 128,256" fill="none" stroke="black"/>
                <path d="M 144,288 L 160,288" fill="none" stroke="black"/>
                <path d="M 24,320 L 128,320" fill="none" stroke="black"/>
                <path d="M 24,368 L 128,368" fill="none" stroke="black"/>
                <path d="M 200,368 L 304,368" fill="none" stroke="black"/>
                <path d="M 144,400 L 176,400" fill="none" stroke="black"/>
                <path d="M 320,400 L 344,400" fill="none" stroke="black"/>
                <path d="M 24,432 L 128,432" fill="none" stroke="black"/>
                <path d="M 200,432 L 304,432" fill="none" stroke="black"/>
                <path d="M 8,480 L 144,480" fill="none" stroke="black"/>
                <path d="M 8,544 L 144,544" fill="none" stroke="black"/>
                <path d="M 24,592 L 128,592" fill="none" stroke="black"/>
                <path d="M 144,624 L 160,624" fill="none" stroke="black"/>
                <path d="M 24,656 L 128,656" fill="none" stroke="black"/>
                <path d="M 8,624 L 24,656" fill="none" stroke="black"/>
                <path d="M 8,400 L 24,432" fill="none" stroke="black"/>
                <path d="M 128,592 L 144,624" fill="none" stroke="black"/>
                <path d="M 8,288 L 24,320" fill="none" stroke="black"/>
                <path d="M 8,176 L 24,208" fill="none" stroke="black"/>
                <path d="M 128,368 L 144,400" fill="none" stroke="black"/>
                <path d="M 8,64 L 24,96" fill="none" stroke="black"/>
                <path d="M 184,400 L 200,432" fill="none" stroke="black"/>
                <path d="M 128,256 L 144,288" fill="none" stroke="black"/>
                <path d="M 128,144 L 144,176" fill="none" stroke="black"/>
                <path d="M 184,176 L 200,208" fill="none" stroke="black"/>
                <path d="M 128,32 L 144,64" fill="none" stroke="black"/>
                <path d="M 304,368 L 320,400" fill="none" stroke="black"/>
                <path d="M 304,144 L 320,176" fill="none" stroke="black"/>
                <path d="M 8,64 L 24,32" fill="none" stroke="black"/>
                <path d="M 8,176 L 24,144" fill="none" stroke="black"/>
                <path d="M 8,288 L 24,256" fill="none" stroke="black"/>
                <path d="M 128,96 L 144,64" fill="none" stroke="black"/>
                <path d="M 8,400 L 24,368" fill="none" stroke="black"/>
                <path d="M 128,208 L 144,176" fill="none" stroke="black"/>
                <path d="M 184,176 L 200,144" fill="none" stroke="black"/>
                <path d="M 128,320 L 144,288" fill="none" stroke="black"/>
                <path d="M 8,624 L 24,592" fill="none" stroke="black"/>
                <path d="M 128,432 L 144,400" fill="none" stroke="black"/>
                <path d="M 184,400 L 200,368" fill="none" stroke="black"/>
                <path d="M 304,208 L 320,176" fill="none" stroke="black"/>
                <path d="M 128,656 L 144,624" fill="none" stroke="black"/>
                <path d="M 304,432 L 320,400" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="352,416 340,410.4 340,421.6" fill="black" transform="rotate(90,344,416)"/>
                <polygon class="arrowhead" points="352,176 340,170.4 340,181.6" fill="black" transform="rotate(0,344,176)"/>
                <polygon class="arrowhead" points="280,240 268,234.4 268,245.6" fill="black" transform="rotate(0,272,240)"/>
                <polygon class="arrowhead" points="264,464 252,458.4 252,469.6" fill="black" transform="rotate(90,256,464)"/>
                <polygon class="arrowhead" points="184,400 172,394.4 172,405.6" fill="black" transform="rotate(0,176,400)"/>
                <polygon class="arrowhead" points="184,176 172,170.4 172,181.6" fill="black" transform="rotate(0,176,176)"/>
                <polygon class="arrowhead" points="168,624 156,618.4 156,629.6" fill="black" transform="rotate(0,160,624)"/>
                <polygon class="arrowhead" points="168,288 156,282.4 156,293.6" fill="black" transform="rotate(0,160,288)"/>
                <polygon class="arrowhead" points="168,64 156,58.4 156,69.6" fill="black" transform="rotate(0,160,64)"/>
                <polygon class="arrowhead" points="88,688 76,682.4 76,693.6" fill="black" transform="rotate(90,80,688)"/>
                <polygon class="arrowhead" points="88,584 76,578.4 76,589.6" fill="black" transform="rotate(90,80,584)"/>
                <polygon class="arrowhead" points="88,472 76,466.4 76,477.6" fill="black" transform="rotate(90,80,472)"/>
                <polygon class="arrowhead" points="88,360 76,354.4 76,365.6" fill="black" transform="rotate(90,80,360)"/>
                <polygon class="arrowhead" points="88,248 76,242.4 76,253.6" fill="black" transform="rotate(90,80,248)"/>
                <polygon class="arrowhead" points="88,136 76,130.4 76,141.6" fill="black" transform="rotate(90,80,136)"/>
                <g class="text">
                  <text x="36" y="52">Am</text>
                  <text x="56" y="52">I</text>
                  <text x="156" y="52">No</text>
                  <text x="76" y="68">authoritative?</text>
                  <text x="196" y="68">Return</text>
                  <text x="296" y="68">NOT-AUTHORITATIVE</text>
                  <text x="376" y="68">&amp;</text>
                  <text x="196" y="84">I-flag</text>
                  <text x="232" y="84">=</text>
                  <text x="248" y="84">1</text>
                  <text x="96" y="116">Yes</text>
                  <text x="68" y="164">Delegation</text>
                  <text x="160" y="164">Yes</text>
                  <text x="248" y="164">Delegations</text>
                  <text x="336" y="164">Yes</text>
                  <text x="64" y="180">exists?</text>
                  <text x="216" y="180">are</text>
                  <text x="380" y="180">Return</text>
                  <text x="456" y="180">MS-REFERRAL</text>
                  <text x="252" y="196">Map-Servers?</text>
                  <text x="92" y="228">No</text>
                  <text x="268" y="228">No</text>
                  <text x="308" y="244">Return</text>
                  <text x="392" y="244">NODE-REFERRAL</text>
                  <text x="40" y="276">EID</text>
                  <text x="68" y="276">in</text>
                  <text x="100" y="276">Site</text>
                  <text x="156" y="276">No</text>
                  <text x="76" y="292">configuration?</text>
                  <text x="196" y="292">Return</text>
                  <text x="288" y="292">DELEGATION-HOLE</text>
                  <text x="96" y="340">Yes</text>
                  <text x="76" y="388">Site</text>
                  <text x="156" y="388">No</text>
                  <text x="244" y="388">Map-Server</text>
                  <text x="336" y="388">Yes</text>
                  <text x="80" y="404">Registered?</text>
                  <text x="224" y="404">peers</text>
                  <text x="248" y="420">configured?</text>
                  <text x="356" y="436">Return</text>
                  <text x="456" y="436">MS-NOT-REGISTERED</text>
                  <text x="96" y="452">Yes</text>
                  <text x="268" y="452">No</text>
                  <text x="220" y="484">Return</text>
                  <text x="320" y="484">MS-NOT-REGISTERED</text>
                  <text x="400" y="484">&amp;</text>
                  <text x="48" y="500">Forward</text>
                  <text x="224" y="500">I-bit=1</text>
                  <text x="64" y="516">Map-Request</text>
                  <text x="28" y="532">to</text>
                  <text x="56" y="532">ETR</text>
                  <text x="68" y="612">Map-Server</text>
                  <text x="156" y="612">No</text>
                  <text x="48" y="628">peers</text>
                  <text x="196" y="628">Return</text>
                  <text x="252" y="628">MS-ACK</text>
                  <text x="288" y="628">&amp;</text>
                  <text x="68" y="644">configured</text>
                  <text x="200" y="644">I-bit=1</text>
                  <text x="96" y="676">Yes</text>
                  <text x="52" y="708">Return</text>
                  <text x="108" y="708">MS-ACK</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
  +------------+
 / Am I         \ No
| authoritative? +-> Return NOT-AUTHORITATIVE &
 \              /    I-flag = 1
  +------+-----+ 
         |Yes
         v
  +------------+        +------------+
 / Delegation   \ Yes  / Delegations  \ Yes
|   exists?      +--->|  are           +--> Return MS-REFERRAL
 \              /      \ Map-Servers? /     
  +------+-----+        +------+-----+
         |No                   |No
         v                     +-> Return NODE-REFERRAL
  +------------+
 / EID in Site  \ No
| configuration? +-> Return DELEGATION-HOLE
 \              /   
  +------+-----+ 
         |Yes
         v
  +------------+        +------------+
 /     Site     \ No   / Map-Server   \ Yes
|   Registered?  +--->|  peers         +--+ 
 \              /      \ configured?  /   v 
  +------+-----+        +------+-----+   Return MS-NOT-REGISTERED
         |Yes                  |No
         v                     v 
+----------------+      Return MS-NOT-REGISTERED &
| Forward        |      I-bit=1
| Map-Request    |
| to ETR         |
+--------+-------+
         |
         v
  +------------+
 / Map-Server   \ No
|  peers         +-> Return MS-ACK &
 \ configured   /    I-bit=1
  +------+-----+ 
         |Yes
         v 
   Return MS-ACK
]]></artwork>
          </artset>
        </section>
      </section>
    </section>
    <section anchor="generic-ddt-example">
      <name>Generic DDT Example</name>
      <t>This section shows an example of DDT tree and several possible scenarios of Map-Requests coming to a Map-Resolver and subsequent iterative DDT referrals.  In this example, RLOCs of DDT Nodes are shown in the IPv4 address space while the EIDs are in the IPv6 address space.</t>
      <section anchor="reference-ddt-tree-topology">
        <name>Reference DDT Tree Topology</name>
        <t>To show how referrals are followed to find the RLOCs for a number of different requests, the DDT topology in <xref target="FIG_ToyTopology"/> is used.</t>
        <figure anchor="FIG_ToyTopology">
          <name>Reference DDT tree topology.</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="544" width="544" viewBox="0 0 544 544" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,304 L 8,400" fill="none" stroke="black"/>
                <path d="M 24,160 L 24,224" fill="none" stroke="black"/>
                <path d="M 40,32 L 40,80" fill="none" stroke="black"/>
                <path d="M 56,432 L 56,528" fill="none" stroke="black"/>
                <path d="M 136,80 L 136,152" fill="none" stroke="black"/>
                <path d="M 136,224 L 136,296" fill="none" stroke="black"/>
                <path d="M 216,32 L 216,80" fill="none" stroke="black"/>
                <path d="M 216,160 L 216,224" fill="none" stroke="black"/>
                <path d="M 216,304 L 216,400" fill="none" stroke="black"/>
                <path d="M 240,32 L 240,80" fill="none" stroke="black"/>
                <path d="M 240,160 L 240,224" fill="none" stroke="black"/>
                <path d="M 240,304 L 240,368" fill="none" stroke="black"/>
                <path d="M 272,368 L 272,424" fill="none" stroke="black"/>
                <path d="M 280,432 L 280,528" fill="none" stroke="black"/>
                <path d="M 312,432 L 312,528" fill="none" stroke="black"/>
                <path d="M 320,80 L 320,152" fill="none" stroke="black"/>
                <path d="M 320,224 L 320,296" fill="none" stroke="black"/>
                <path d="M 408,368 L 408,424" fill="none" stroke="black"/>
                <path d="M 416,32 L 416,80" fill="none" stroke="black"/>
                <path d="M 432,160 L 432,224" fill="none" stroke="black"/>
                <path d="M 440,304 L 440,368" fill="none" stroke="black"/>
                <path d="M 536,432 L 536,528" fill="none" stroke="black"/>
                <path d="M 40,32 L 216,32" fill="none" stroke="black"/>
                <path d="M 240,32 L 416,32" fill="none" stroke="black"/>
                <path d="M 40,80 L 216,80" fill="none" stroke="black"/>
                <path d="M 240,80 L 416,80" fill="none" stroke="black"/>
                <path d="M 24,160 L 216,160" fill="none" stroke="black"/>
                <path d="M 240,160 L 432,160" fill="none" stroke="black"/>
                <path d="M 24,224 L 216,224" fill="none" stroke="black"/>
                <path d="M 240,224 L 432,224" fill="none" stroke="black"/>
                <path d="M 8,304 L 216,304" fill="none" stroke="black"/>
                <path d="M 240,304 L 440,304" fill="none" stroke="black"/>
                <path d="M 240,368 L 440,368" fill="none" stroke="black"/>
                <path d="M 8,400 L 216,400" fill="none" stroke="black"/>
                <path d="M 56,432 L 280,432" fill="none" stroke="black"/>
                <path d="M 312,432 L 536,432" fill="none" stroke="black"/>
                <path d="M 56,528 L 280,528" fill="none" stroke="black"/>
                <path d="M 312,528 L 536,528" fill="none" stroke="black"/>
                <path d="M 216,224 L 252,296" fill="none" stroke="black"/>
                <path d="M 216,80 L 252,152" fill="none" stroke="black"/>
                <path d="M 204,152 L 240,80" fill="none" stroke="black"/>
                <path d="M 204,296 L 240,224" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="416,424 404,418.4 404,429.6" fill="black" transform="rotate(90,408,424)"/>
                <polygon class="arrowhead" points="328,296 316,290.4 316,301.6" fill="black" transform="rotate(90,320,296)"/>
                <polygon class="arrowhead" points="328,152 316,146.4 316,157.6" fill="black" transform="rotate(90,320,152)"/>
                <polygon class="arrowhead" points="280,424 268,418.4 268,429.6" fill="black" transform="rotate(90,272,424)"/>
                <polygon class="arrowhead" points="260,296 248,290.4 248,301.6" fill="black" transform="rotate(63.43494882292201,252,296)"/>
                <polygon class="arrowhead" points="260,152 248,146.4 248,157.6" fill="black" transform="rotate(63.43494882292201,252,152)"/>
                <polygon class="arrowhead" points="212,296 200,290.4 200,301.6" fill="black" transform="rotate(116.56505117707799,204,296)"/>
                <polygon class="arrowhead" points="212,152 200,146.4 200,157.6" fill="black" transform="rotate(116.56505117707799,204,152)"/>
                <polygon class="arrowhead" points="144,296 132,290.4 132,301.6" fill="black" transform="rotate(90,136,296)"/>
                <polygon class="arrowhead" points="144,152 132,146.4 132,157.6" fill="black" transform="rotate(90,136,152)"/>
                <g class="text">
                  <text x="92" y="52">DDT-Root1:</text>
                  <text x="176" y="52">192.0.2.1</text>
                  <text x="292" y="52">DDT-Root2:</text>
                  <text x="376" y="52">192.0.2.2</text>
                  <text x="100" y="68">authoritative:</text>
                  <text x="180" y="68">::/0</text>
                  <text x="300" y="68">authoritative:</text>
                  <text x="380" y="68">::/0</text>
                  <text x="76" y="180">DDT-Node1:</text>
                  <text x="164" y="180">192.0.2.11</text>
                  <text x="292" y="180">DDT-Node2:</text>
                  <text x="380" y="180">192.0.2.12</text>
                  <text x="92" y="196">authoritative:</text>
                  <text x="308" y="196">authoritative:</text>
                  <text x="152" y="212">2001:db8::/32</text>
                  <text x="368" y="212">2001:db8::/32</text>
                  <text x="60" y="324">Map-Server1:</text>
                  <text x="160" y="324">192.0.2.101</text>
                  <text x="292" y="324">DDT-Node3:</text>
                  <text x="384" y="324">192.0.2.201</text>
                  <text x="76" y="340">authoritative:</text>
                  <text x="308" y="340">authoritative:</text>
                  <text x="116" y="356">2001:db8:0100::/40</text>
                  <text x="348" y="356">2001:db8:0500::/40</text>
                  <text x="36" y="372">Site1:</text>
                  <text x="140" y="372">2001:db8:0103::/48</text>
                  <text x="36" y="388">Site2:</text>
                  <text x="140" y="388">2001:db8:0104::/48</text>
                  <text x="116" y="452">Map-Server2:</text>
                  <text x="216" y="452">192.0.2.211</text>
                  <text x="372" y="452">Map-Server3:</text>
                  <text x="472" y="452">192.0.2.221</text>
                  <text x="164" y="468">authoritative:</text>
                  <text x="420" y="468">authoritative:</text>
                  <text x="164" y="484">2001:db8:0500::/48</text>
                  <text x="420" y="484">2001:db8:0501::/48</text>
                  <text x="84" y="500">Site3:</text>
                  <text x="196" y="500">2001:db8:0500:1::/64</text>
                  <text x="340" y="500">Site5:</text>
                  <text x="452" y="500">2001:db8:0501:8::/64</text>
                  <text x="84" y="516">Site4:</text>
                  <text x="196" y="516">2001:db8:0500:2::/64</text>
                  <text x="340" y="516">Site6:</text>
                  <text x="452" y="516">2001:db8:0501:9::/64</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
    +---------------------+  +---------------------+ 
    | DDT-Root1: 192.0.2.1|  | DDT-Root2: 192.0.2.2|
    |authoritative: ::/0  |  |authoritative: ::/0  |
    +-----------+---------+  +---------+-----------+ 
                |          \/          |
                |          /\          |
                |         /  \         |
                V        V    V        V
  +-----------------------+  +-----------------------+
  | DDT-Node1: 192.0.2.11 |  | DDT-Node2: 192.0.2.12 |
  | authoritative:        |  | authoritative:        |
  |         2001:db8::/32 |  |         2001:db8::/32 |
  +-------------+---------+  +---------+-------------+
                |          \/          |
                |          /\          |
                |         /  \         |
                V        V    V        V
+-------------------------+  +------------------------+
|Map-Server1: 192.0.2.101 |  | DDT-Node3: 192.0.2.201 |
| authoritative:          |  | authoritative:         |
|    2001:db8:0100::/40   |  |    2001:db8:0500::/40  |
|Site1: 2001:db8:0103::/48|  +---+----------------+---+
|Site2: 2001:db8:0104::/48|      |                |
+-------------------------+      |                |
                                 V                V
      +---------------------------+   +---------------------------+
      | Map-Server2: 192.0.2.211  |   | Map-Server3: 192.0.2.221  |
      |      authoritative:       |   |      authoritative:       |
      |    2001:db8:0500::/48     |   |    2001:db8:0501::/48     |
      |Site3: 2001:db8:0500:1::/64|   |Site5: 2001:db8:0501:8::/64|
      |Site4: 2001:db8:0500:2::/64|   |Site6: 2001:db8:0501:9::/64|
      +---------------------------+   +---------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>DDT Root nodes are configured with IP addresses 192.0.2.1 and 192.0.2.2. DDT Map-Resolvers are configured with default referral cache entries for these addresses.</t>
        <t>The DDT Root nodes delegate 2001:db8::/32 to two DDT nodes, DDT-Node1 and DDT-Node2, having IP addresses 192.0.2.11 and 192.0.2.12 respectively.</t>
        <t>DDT-Node1 and DDT-Node2 delegate 2001:db8:0100::/40 to a Map-Server1, who has RLOC 192.0.2.101. Map-Server1 is configured to allow ETRs to register the sub-prefixes 2001:db8:0103::/48 and 2001:db8:0104::/48.</t>
        <t>DDT-Node1 and DDT-Node2 also delegate 2001:db8:0500::/40 to DDT-Node3 who uses the address 192.0.2.201. DDT-Node3 further delegates 2001:db8:0500::/48 to Map-Server2, who has RLOC 192.0.2.211,  and 2001:db8:0501::/48 to Map-Server3, who has RLOC 192.0.2.221.</t>
        <t>Map-Server2 is configured to allow ETRs to register the sub-prefixes 2001:db8:0500:1::/64 and 2001:db8:0500:2::/64.</t>
        <t>Map-Server3 is configured to allow ETRs to register the sub-prefixes 2001:db8:0501:8::/64 and 2001:db8:0501:9::/64.</t>
      </section>
      <section anchor="SEC_Lookup1">
        <name>Lookup EID registered at with Map-Server1</name>
        <t>The first example shows a DDT Map-Resolver following a delegation from the root to a DDT Node followed by another delegation to a DDT Map-Server. The example assumes that DDT Map-Referral Caches contain only the default configuration.</t>
        <t>ITR1 sends an ECM Map-Request for 2001:db8:0103:1::1 to one of its configured (DDT) Map-Resolvers.  The DDT Map-Resolver proceeds as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Send a DDT Map-Request (for 2001:db8:0103:1::1) to one of the root DDT Nodes (192.0.2.1 or 192.0.2.2).</t>
          </li>
          <li>
            <t>Receive (and save in the DDT Map-Referral Cache) the Map-Referral for EID-Prefix 2001:db8::/32, action code NODE-REFERRAL, RLOC set (192.0.2.11, 192.0.2.12).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.11 or 192.0.2.12.</t>
          </li>
          <li>
            <t>Receive (and save in the DDT Map-Referral Cache) the Map-Referral for EID-Prefix 2001:db8:0100::/40, action code MS-REFERRAL, RLOC set (192.0.2.101).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.101; if the ITR-originated ECM Map-Request had a LISP-SEC signature, it is included.</t>
          </li>
          <li>
            <t>The DDT Map-Server1 (192.0.2.101) decapsulates the DDT Map-Request and forwards the Map-Request to the registered Site1 ETR for 2001:db8:0103::/48.</t>
          </li>
          <li>
            <t>The DDT Map-Server1 (192.0.2.101) sends a DDT Map-Referral message for EID-Prefix 2001:db8:0103::/48, action code MS-ACK, to the DDT Map-Resolver.</t>
          </li>
          <li>
            <t>The DDT Map-Resolver receives the Map-Referral message with action code MS-ACK and removes the request for 2001:db8:0103:1::1 from the Pending Request List.</t>
          </li>
          <li>
            <t>Site1's ETR for 2001:db8:0103::/48 receives the Map-Request forwarded by Map-Server1 and sends a Map-Reply to ITR1.</t>
          </li>
        </ol>
      </section>
      <section anchor="SEC_Lookup2">
        <name>Lookup EID registered at with Map-Server3</name>
        <t>This example shows a three-level delegation: root to first DDT node, first DDT Node to second DDT Node, and second DDT Node to DDT Map-Server. The example assumes that DDT Map-Referral Caches contain only the default configuration.</t>
        <t>ITR2 sends an ECM Map-Request for 2001:db8:0501:8:4::1 to one of its configured DDT Map-Resolvers, which are different from those for ITR1. The DDT Map-Resolver proceeds as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Send a DDT Map-Request (for 2001:db8:0501:8:4::1) to one of the root DDT Nodes (192.0.2.1 or 192.0.2.2).</t>
          </li>
          <li>
            <t>Receive (and save in the DDT Map-Referral Cache) the Map-Referral for EID-Prefix 2001:db8::/32, action code NODE-REFERRAL, RLOC set (192.0.2.11, 192.0.2.12).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.11 or 192.0.2.12.</t>
          </li>
          <li>
            <t>Receive (and save in the DDT Map-Referral Cache) the DDT Map-Referral for EID-Prefix 2001:db8:0500::/40, action code NODE-REFERRAL, RLOC set (192.0.2.201).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.201.</t>
          </li>
          <li>
            <t>Receive (and save in the DDT Map-Referral Cache) the DDT Map-Referral for EID-Prefix 2001:db8:0501::/48, action code MS-REFERRAL, RLOC set (192.0.2.221).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.221; if the ITR-originated ECM Map-Request had a LISP-SEC signature, it is included.</t>
          </li>
          <li>
            <t>Map-Server3 (192.0.2.221) decapsulates the DDT Map-Request and forwards the Map-Request to a registered Site5 ETR for 2001:db8:0501:8::/64.</t>
          </li>
          <li>
            <t>Map-Server3 (192.0.2.221) sends a DDT Map-Referral message for EID-Prefix 2001:db8:0501:8::/64, action code MS-ACK, to the DDT Map-Resolver.</t>
          </li>
          <li>
            <t>The DDT Map-Resolver receives a Map-Referral message with action code MS-ACK and removes the request for 2001:db8:0501:8:4::1 from the Pending Request List.</t>
          </li>
          <li>
            <t>Site5's ETR for 2001:db8:0501:8::/64 receives the Map-Request forwarded by Map-Server3 and sends a Map-Reply to ITR2.</t>
          </li>
        </ol>
      </section>
      <section anchor="lookups-using-cached-ddt-map-referrals-to-map-servers">
        <name>Lookups using cached DDT Map-Referrals to Map-Servers</name>
        <t>This example shows a lookup for 2001:db8:0104:2::2, where the DDT Map-Resolver uses a saved DDT Map-Referral Cache entry to skip the iterative referral process and go directly to a DDT Map-Server.</t>
        <t>In this case, ITR1 uses the same Map-Resolver used in the example in <xref target="SEC_Lookup1"/>. It sends an ECM Map-Request for 2001:db8:0104:2::2 to that DDT Map-Resolver. The DDT Map-Resolver finds an MS-REFERRAL cache entry for 2001:db8:0100::/40 with RLOC set 192.0.2.101 and proceeds as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Send directly a DDT Map-Request (for 2001:db8:0104:2::2) to 192.0.2.101; if the ITR-originated ECM Map-Request had a LISP-SEC signature, it is included.</t>
          </li>
          <li>
            <t>Map-Server1 (192.0.2.101) decapsulates the DDT Map-Request and forwards the Map-Request to the registered Site2 ETR for 2001:db8:0104::/48.</t>
          </li>
          <li>
            <t>Map-Server1 (192.0.2.101) sends a DDT Map-Referral message for EID-Prefix 2001:db8:0104::/48, action code MS-ACK, to the DDT Map-Resolver.</t>
          </li>
          <li>
            <t>The DDT Map-Resolver receives the DTT Map-Referral with action code MS-ACK and removes the request for 2001:db8:0104:2::2 from the Pending Request List.</t>
          </li>
          <li>
            <t>Site2's ETR for 2001:db8:0104::/48 receives the Map-Request from Map-Server1 and sends a Map-Reply to ITR1.</t>
          </li>
        </ol>
      </section>
      <section anchor="lookup-using-cached-ddt-map-referrals-to-ddt-nodes">
        <name>Lookup  using cached DDT Map-Referrals to DDT Nodes</name>
        <t>This example shows how a DDT Map-Resolver uses a DDT Map-Referral Cache entry to start the referral process at a non-root, intermediate DDT node for the prefix 2001:db8:0500:2:4::1, which is similar to one previously requested.</t>
        <t>In this case, ITR2 uses the same Map-Resolver used in the example in <xref target="SEC_Lookup2"/>. It sends an ECM Map-Request for 2001:db8:0500:2:4::1 to that DDT Map-Resolver, which finds a NODE-REFERRAL cache entry for 2001:db8:0500::/40 with RLOC set 192.0.2.201.  It proceeds as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Send a DDT Map-Request (for 2001:db8:0500:2:4::1) to 192.0.2.201.</t>
          </li>
          <li>
            <t>Receive (and save in the referral cache) the Map-Referral for EID-Prefix 2001:db8:0500::/48, action code MS-REFERRAL, RLOC set (192.0.2.211).</t>
          </li>
          <li>
            <t>Send a DDT Map-Request to 192.0.2.211; if the ITR-originated Encapsulated Map-Request had a LISP-SEC signature, it is included.</t>
          </li>
          <li>
            <t>Map-Server2 (192.0.2.211) decapsulates the DDT Map-Request and forwards the Map-Request to the registered Site4 ETR for 2001:db8:0500:2::/64.</t>
          </li>
          <li>
            <t>Map-Server3 (192.0.2.211) sends a Map-Referral message for EID-Prefix 2001:db8:0500:2::/64, action code MS-ACK, to the DDT Map-Resolver.</t>
          </li>
          <li>
            <t>The DDT Map-Resolver receives the Map-Referral (MS-ACK) and removes the request for 2001:db8:0500:2:4::1 from the Pending Request List.</t>
          </li>
          <li>
            <t>Site4's ETR for 2001:db8:0500:2::/64 receives the Map-Request and sends a Map-Reply to ITR2.</t>
          </li>
        </ol>
      </section>
      <section anchor="lookup-of-a-non-existent-eid">
        <name>Lookup of a non-existent EID</name>
        <t>This example shows the lookup of 2001:db8:0500::1/128, which uses the cached MS-REFERRAL for 2001:db8:0500::/48 learned because of previous lookups at the DDT Map-Server at 192.0.2.211. The DDT Map-Resolver proceeds as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Send a DDT Map-Request for 2001:db8:0500::1 to 192.0.2.211; if the ITR-originated ECM Map-Request has a LISP-SEC signature, it is included.</t>
          </li>
          <li>
            <t>Map-Server2 (192.0.2.211), which is authoritative for 2001:db8:0500::/48, does not have a matching delegation for 2001:db8:0500::1.  It responds with a DDT Map-Referral message for 2001:db8:0500::/64, action code DELEGATION-HOLE, to the DDT Map-Resolver.  The prefix 2001:db8:0500::/64 is used because it is the least-specific prefix that does match the requested EID but does not match one of the configured delegations (2001:db8:0500:1::/64 and 2001:db8:0500:2::/64).</t>
          </li>
          <li>
            <t>The DDT Map-Resolver receives the delegation, adds a Negative DDT Map-Referral Cache entry for 2001:db8:0500::/64, removes the request for 2001:db8:0500::1 from the Pending Request list, and returns a Negative Map-Reply to ITR2.</t>
          </li>
        </ol>
      </section>
    </section>
    <section anchor="contributors" numbered="false" toc="include" removeInRFC="false">
      <name>Contributors</name>
      <contact initials="V." surname="Ermagan" fullname="Vina Ermagan">
        <organization>Google</organization>
        <address>
          <postal>
            <country>United States of America</country>
          </postal>
          <email>ermagan@gmail.com</email>
        </address>
      </contact>
      <contact initials="V." surname="Fuller" fullname="Vince Fuller">
        <organization>VAF.NET Internet Consulting</organization>
        <address>
          <email>vince.fuller@gmail.com</email>
        </address>
      </contact>
      <contact initials="A." surname="Jain" fullname="Amit Jain">
        <organization>Juniper Networks</organization>
        <address>
          <email>atjain@juniper.net</email>
        </address>
      </contact>
      <contact initials="D." surname="Lewis" fullname="Darrel Lewis">
        <organization>ICANN</organization>
        <address>
          <postal>
            <city>Los Angeles</city>
            <code>CA 90292</code>
            <country>United States of America</country>
          </postal>
          <email>darrel.lewis@icann.org</email>
        </address>
      </contact>
      <contact initials="D." surname="Saucez" fullname="Damien Saucez">
        <organization abbrev="Inria">Inria</organization>
        <address>
          <postal>
            <country>France</country>
          </postal>
          <email>damien.saucez@inria.fr</email>
        </address>
      </contact>
      <contact initials="A." surname="Smirnov" fullname="Anton Smirnov">
        <organization>Cisco Systems, Inc.</organization>
        <address>
          <postal>
            <street>De Kleetlaan 6a</street>
            <city>Diegem</city>
            <code>1831</code>
            <country>Belgium</country>
          </postal>
          <email>as@cisco.com</email>
        </address>
      </contact>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+2963YbR5Ig/B9PkU2fs02uAJDgRZLpmXZTJGWzrduQtNv9
jWd9ikCRrBZQha0CSHFM+V32WfbFNm6ZGZmVBVK2vLvnfMuesUigKjMyMjLu
ETkYDHrjalKUV/tmubgcPO/1FsVimu+btVfVOFtU9ebJkTnL51mdLYqqNO/q
alGNq6k5yqf5VbbIJ+YoW2QXWZOb8zrPzfqrk7N3g6Oj8421XnZxUec3OJZ8
ttabVOMym8H4kzq7XAyKHCadFs188Hw0Gl0UzWBruwfz5ldVfbdvmsWk1yzq
PJvtm5Pj85e9DH6HX8tFXpf5ondb1e+v6mo53zc4hfk7/A1rMd/gZ733+R08
MPHPD45w0l510VTTfJE3+wZn7S3nk4z++nJna9QDeHd6vWJe75tFvWwW21tb
XwJQ+Mi++eXo4Pz4I8CUlZOfs2lVwmd3edObF/vm3wExfdNUNQB82cBvdzP+
BdY8y+ZzAOw/er1subiu6v3eoGfgpyhh2ldDc5KVJQxGnzF+Xi2LqyL4vK5w
X/JJAbvS+wI/qWrYtm+X2W1emPN8fF1W0+qqyBvzss7KcW7OhgfDs+H3Q37a
7ga/wJ8hcvPFvhk975t/W2aFmSzNu6ooF/jL36qlTDQuFrAbL6oljF/mgxfF
dAoTwNcL+h5+Kxe4XzyvfDYBaP/85fZoa+vPBH8+y4rpvrm6+vDXK1jbhyHu
YIiGv2XvswuNhKr+n/+jnKjPs2ZcFC+X06l7IAu+D5DkcHRYNOOqp5HAn2gc
6JXK73ZZ9k9ckV7KtPonTvzXMQ42HFezHhwmeKW4WC7cHtPafhia43qWXWVl
zy3uh6LM9KcE6TdVdTWl/Xazf18WeMzOFkikpro0B7O8LsZZzwOS8yh/vcI/
CZBgasRXXgczA3X4T2nmHw5eDt8cn7vDYg6rsllOF0C2aqYbfHV4Sa/q6Yyb
7wC3sVDrPJgVC/cRTfW3ZVnM89q8yRd4ghs1frb4Jzz513/yE55EaOijoXmV
3xaNH/soq+t86j+l4U8OD9686bnNfFU15qC8An7V9Nw2Hh4YONVfbn8qpic0
4XCKE/4VvirLIcypyRiAPMuW4/w/FR0fZbMiL/XnDGhZF1lAlvxJJ1kGVKkO
W4I2JzTlsKEp/1rguMPLOtqos1lRl9WN2qtyAUxefeyPjzm7axb5DPjZSTke
9hTzOMrNd1P4bZplpXmaecwfFflVPvNIHz3fGQUIf5FPr4rlTO9/o09TWQFh
L4qbfB84cnmp/oI3Dl6e7NOKRWIdTCZ13gDzg5VP78yb5ewir2nLDTFv+s0A
u86Ata+tMbYsO+bveFcO3hzwuFl9heu7Xizm+5ubt7e3wyIrM9zwzaxpiqty
lpeLZjPjiQeXNPGg5Ik3Cci387wk6Xf4LgB27fw6d1/iUVsA5zLvgK3m5qAe
XwMhjhfLOl/z8JvtrdHuYGuHPmmAMPMGcWJhXzs5Pj62R2oNZrippkOzDYy9
rODfvpnPh2Znd7C7tdZa+UC2H+C4MkfLO/PuesnH3n3Vlkf2m7NFfpmVQB/5
eFzQooleBidvzwY/HqPYD1fO1ATfmpN35rRaLkj7EDzMZsjPT/PLvM6RSQ34
CxgEgbssrpaiiMijTXsxKaKNsTgaDbZ3WpvcyC47Ctwcb+bl5rLZXEw2QYo3
m0XVDD7MpvjvJqgIAHz+M6ovm2MGBz5kdWZcDy6q6v0m/TGZLAbjy6vBeDZp
hteL2VRh6c2PA8BTB5Le5B+WjXm2tbUF2MUNN/S4RZbGxzfLYoLosp+iGsSo
E0Ut1tNYRft05O0Ntp4NRru/AXnNbbEYX+fNJoyVjXOUM/DZZvlhANgULKol
bV7hkjYvfqY1/4yL+TlY88/fPOqBn8fX2Rzm+nlrNNry6If1D1CnfL4XYt7q
qsAIZvNpjkecMYxiAXYD6fMon0+rO/yKpCRMwhMmqHHQIXNNSzUZdMi09pNu
L7aBkFntyS9R8wCAWFE2z/dQVR/nOer2wLMT6nHXBqJOTjxu7gfYfL632Uxh
nY38M3i+x4S+M5xPLkOE7qYRaljP/j0oUgvfetax8N3PvPDdeOG7vPDt4Xy+
cAs/ffv2vL1s4lunVbXoPGjBUygQajS6Wvxqay8JNTKWGl4cji+y4XI+HuaT
JYGEw+4OQJ0LYWLdjkg1m/LcL/JFZqWG+ba4ugbCuwHyO6/maE3cwe68qW5y
FGkIyvPOlYDydANir4BTAibEFAVYCQqSAa50COd9uizvsnBZzy31xstC/O6i
7qfXtVmAjps3jqM6uuO1vjg+P0hsAC5vYIXiZwN9e6trR9KgXyAUJUOx6Wjm
zcGbt9/sdbCfz8FJvpmC0vn3Yprf6ed+AEmCykvrRD1tnSiC0Ozt9c0PZO8B
lvrmxWFy5RlqLTf5sARd4IqO0Qx0QjpD9NHeHpyrvLHstNk8X+bNJLvb5JW4
7fzhRyDbAaIhRMwp/OffEb3/YfC/sDmOB4N0WeIv3Th7ly2nhDiQDXldZ/Ha
QR9IMJQZaHVAc2ZRmQWoazjtXy2TMKivIk+BTxdJhOADFimOteAHm7PmiuXd
8Yv8/J/54bPi7ufDxf/37B93x4eH310/ff7sbGvT0TaR9uDd8enLECFvS4Lq
XV6TYoxEASYLftQ62N2IeTmtQFUAKVZnTSSFYpPlYU3wRV5WYOsdVSXabTEL
a5PXyUvQAAVERCU+l+Zz02FxWcwJg5MLUhM2S/ee+hVH2KTFnJ0cjXaZqAaD
ARhYYK1kY2DY59dF4ygGqKgZg70OmhUh7vf6vPomM9cFMHHc9zHw2AlQB/kD
4KWJfWlxDYwGWGo1KWTiCY+Ms8Ee8kaBCYWUB8LoBlU7cSE15rKuZrzFx+Vk
Ts6akwmsBTAETMysH58cNRv4pujWdlXw1emrt4fNxtCYk4UBLGRgwsGkACfY
S5P8sigRSguxAIPgwZC0xc0c9DaTzdBMgJfzBT5AoIzFgpmTBZOz3tSYq7wk
CxonwP/C+Gso7d6APdisASDH2fja2E8QJqsCwpNZY9YsKsjuWzNA6QaoDhiZ
mVU1ATZ4ByRVfMhB1qND7sqAlnlNUAt8tGh683U2H4AejbweR1iDPZpO1tz0
DSLtFvbtmgYfNPN8DEgdB7OYrHbblU+GMT0536I5fXlI7kVSGMXFSB+ilxHe
+5c/DQa9w2+PD78DBJ4DlZrD63z8HigVtg0sdJDUoLiWV3l2MQWSyetZ8ydz
dl0tpxNzAbbjd9EbM/TVgMJqkLdnaDs2Q3P09s0xPAemsWmqWX57DWYVkx/i
Y1HMcniVddo6X5CFgeAZoLVpoQY4A1Sen78CsPAAIwedwn6CMj+EH3lo8Bc+
arNiMpnmvd4X6Eqqq8lyTKT0yxdnx4f7BX70EbH24GmjUwUnyhImzP3LL38C
DAKEWx8/EtDug9HHj30jG4abVJpMWdG4seM6RysIdJl6mt0Z4RmNmYK6U2dX
eFDgEyAagiT39A6Ehb8DBdNRWHHmlg2AiYjNy8lgUQ3gH4OG4RK1CRJ6fYIa
x+k6nH6QWp7AN+Dv26xGjRQoRy86XDNRzSWeUdA4bnPg35nnOs2iIqsQqRmA
w+k8U8FJ6CBP8ptiTFwJiKQELdg0SzgQzvsCOwTIFHgM4Od9vgA6MbihBauX
U9QzsrL4T8fQaAgFCpyYi/yuElSA2jIn2aUXNjSvLUHrnWwsS3JjXWc3uFxY
K3DKeQXY65scuQp8gcstkL4nNxnoHVc5LxRYnPpkvcnzPm/bhwxNvj4A8jUA
8vT5zlNHZ/LBs48fN1qHvpvucFRglMD66BQnpYFloal92ffy/GHhM+w5U4uY
+x8siPqmGObDPiHY7TxMsuSlz4q6RrrGUUNIwinEa0dHjSVTNm3cbI1+PCJC
ZOenOfBbZOh94dxLWlYePztnLSmFZDOtqvfLORDxQTAkY6fO/zvoqUhD5gpE
UOneui2mU9jf6bS6he/mGQkdOLNXLHzQNzpw2FA4R3Kid1FkgkbSJ4GWXQIC
4bsK3gUdG0coSSSxTCNQcI6+WQLXmQLSATJkwIzgaZ5d0gvrwEECmcmM/tpt
G74J1AE0/565yUlpjysxm4AuUySJwOEAIhwZw/kH0OgmloSAXxct9YG8ojgF
KxEXdwaDVaIaVCUG/dAypcXmIDowxgbPeTZr1k9OjkAeRH5e/cDBy5MNz2K9
2O6j8KjqCW5qRSQCWMiakJEU5ST/YN7nd0NiZjAHRz80dG5N8DxMOYUlAy5Q
OKO+Upq1Y0IE/OEnX+ujsvGj/8AQywGeggIRP2ee4g4vCzykuDK/1VzZLO7m
OROH06LW+kwcLdWpTQVacfpR6zReIcSTp4aJValQLWqWF4O5VYsICNSNLpc1
0rDXkRDlRNZe0UJ5UbknkEO6oWR5IITRoOtSDR1grNwBaMTySaHz71jEpA+E
n3PIaiiReV4QqCTjSSHMaDyvOpr112cbXlOETT++Ino8X4LZMyXBjk8dn59u
gAxqgJCugPfmCDYB5OfF3VATlSGWkGYDAkWWIspbhOOmtSDQqPJAnoooYntn
rk/n5bIcs0cIGb18qNaLx0nzRRj8TbUQSIjVkbVGzFxz69ffn50DRd1mdyjt
EVGE4HVYJmENDjMt+6Yq8OwAFyjq8RJMZjTt8RCV4zsUtV7yZGCRo05cNDPe
xTojv43wjABR7PkLzpNd16nVYMW+t6KjwL0Cbl0yzTLdl8g0aGn8KkkDeCHn
zanzcV6QnuG2bZyJkqxHSO0vIRAphE7kBOz1Ykp6rpNcQ9lGZBQwPQAuG5nm
s6nFMQbhyYkgPWbofaHwQ1D4S5BGy2ZJPDkLNr2PpmINhAp8G5fEiilow+Ns
DnySzrlGEB0cIMaBOrRu4Tg9M1n3EZygeYUShE52llwKcmgSODC3HNP10YYR
o0YWyZtCQMCUVuih/l+hbgd0S97dxlGNPIxncX1744Fd8swv0C9kJYxC07CR
JvJ9CLKMZXS2QMYwBgrtx68skJ4aEqHM9SNckj4AQtaDZYWcrAaWMQf7BjUx
MgQWFJG4QbEPXKkGKjgEKZbPF7S5IsNRjBcz9FLZOeCwCic3Y4ZMSOuommUw
9BswhCQsZNaP3gAjZA2ocWZhQ5/LfjZWMBAuUAaXGJnFr8cgjkFXIWdGJuFM
nAxfbsRGd6oO7iwr12VzCzhkdXy0tbMHhkK3Cc6PoREuarw1wwNDo4emKuK6
qMVr8QrM7iUQHJupoBEYzCNqzBqyNBC49K9585Z+Pz3+t+9PTo+P8Pezbw9e
vXK/2CfOvn37/asj/5t/8/Dt69fHb474ZfjURB+9PvjHGusza2/fnZ+8fXPw
ao3Fgl5wxuR/IQYYnLoFqwDWuUW284vDd2a0K0vfHo2+BJzwH89Hz3bhD+Rp
PBntEv8Je3+H3oAcaARJC/XWbA6idIq2bIO0flsaPIGMxyPHlGg3z9FtIaY/
/f4x3q2saeCXxksTUGuRYcIzFE8vYGLiCaQHWaqnP1DtKijnCVS2l1WtOCKb
iTT5tHif6+PU72Raffljjgfk5PwUnsT/eFHYb8nCvgGegiJnzMkyylwDYSTx
/FBVbvkw3CthFkDXa0yyB4FKo7S5/d4+HhStbgaaWBayEBQmLP0Wmh3PgA9Y
qRspGxa73boggOdZG8FjvS3INevM24jIk0ErJQaImhExQM36hPOz2V7YeCyL
cs/jmAchQwe4AsnBSjzom+d3c7Y1QnHHlhhqJ6Hpt06nh/1OIPE08sHAuEAH
nVeY5xVIEzTvScUqgd8nFcITVAhhB9wyNByBEiYI1CthNBKZWGmIoRQELgs0
Rst4Q9XV4lMgROpglIMEIyMy09p1gnhIGQEDOYYLphxPl2SomjUrA9boOIDS
S/Zm6V3F3hWrfK4sX29Ck519mmS3BnSmQRujLy8S4wK9U4BbmlPmFYG2AmVR
i9QmLwOgCKfzA8lnvG0yJqtucCpKcoZ4BWNo2jtpDtFs3ze9feYR/jSgDM7h
QNRZjYYtClwSmnCubopq2cBnrG46thXpR0LtfStuETcplAuNOJoNjUENMuFU
WMrx4euAlkL6s4qM5jB9b6ehvToAhnVVlMiJ1szlNLtCshgqRNNG/XcM3wNi
fWQGRExMyOyGRwiGoZWjdX04l3p3e2kYxMoKhILlxK8FsdckkwLMMKPgY9n2
GhFfUPyq86SH74amWNHJg4bBSZSXszHqd02IJtKvgPNgPnLMXcnqdFTR/408
FpirNwcjl1zWxG5dzIY2aAGKwk+aOSGmcTJgEQD5FesgpJPkIGRrZXlqckQV
ndzA4pu24k77T9AoR0WffuCYfrhT0n2DxyWJ4CzOMnIeaPaKEAg5TR3/qdGw
0QrOshFyZHVkLd63Ndbvwo/C8M+d5iMMrCc8sdI7yS5Bb/JKJ7UVkbrxyBXx
sGo99oMHV2PmOdALrwnj6WRwwzaETzXWi4tU2LkO595BU8W6Q04ueQpiG0rS
oaSJZumzMaYstoAinPRISytx7BQsCaw+CbbNV+wDuy2s9acWQBPMMtCPWJKJ
D6JGTRTP0LzCeHlBZjnIW4FA2BEe3kcqWTHfT0nV9Rw9yKIZtiMCqzyAbTdf
r6f9oWYd59lQqgx+mNsnSFagDwfsvgIOEy6Wfbt3VsgHwQLvgwNd7CJHP3nD
0RBzcnLUdw9zWm7f5IvxcCNQDNj36jxj4n+JXGSkKyFY0WqsFrKukBetzT4y
r9mhJWv0I5qDUFOHU0bhP3Tfkt3JPmk4P5XTz62XaxiKbaJsenlROdmpnPk6
Iofbi48jH24oSki5AIBlIAzEOLIDiqdxJNZq4Ui4FOBwarm169EzA8djCYxQ
3OKoAcJAHMKMFYw3RFE3eUudRPwdGPd1qGk2sV+IZMWDOm+o58YMXaMf9frA
IKrJ71xW+hAo7rEOz8KXKFTYycsh7L4pLiPtSEkZWP47caA5OfyqYC0rUght
xFZ54DFcj8VH+LELTXmYs7ZawC5oURsjHU70A2RVVghLYCgZKFPWg7jMc8zj
tyoUcW6hCIy5TgpJNMQsk5yCyazKMJfjTRx4xUL05r7YFHblOF3fy1eMcIm6
TgdpfWFNuyDAgToPmGpNdhO6VBWvngKT9OkMDkfM/BAo3GIinIiGgbeMhRZQ
ySUcwf705bgKdDQ8fQeQ1wXLVRuzwOclVIWub/JVn+XjJQVbOaQLHGojgNzJ
5B1gWqyrZI01wNzoStVUO02spr1baOdbv5EX0C6gZdbmeURr9BoNtIa4blDb
uEs8uWb9Qemo9VvNj9g/dPQCPrT+oSZnDF8WdbNw2UlNiwv6qJ3L0giYjYsG
lt5Ku2yP0mKPaHMsVCzMCnZlDuP6voiYMK+E5Eqvd6BCECrzgSDmg5CQJ5iQ
EIy5kZISbRnDsS5njPvDRxIVo56xUE1I1KxpqnFB2+UsN6tCtYEgxQIlDmEU
d/UCVOH6bpCXeDAmKnCKxLSQ/APQ83oDFeCFI7yzDa8u8LxistLLE7M+eqo+
wQ3REvcGDGTMp8BziH5k8fAjtPjyTTZd5ijp2X8bzIQhZEbgzvYAZuCHrcC0
LIcyFD8sVPzanXyO3P7pZHA09MWr9eX4+dbTrYuiEXWCIzpFM142DekRpQYD
TCaCDIElWEZPA1gu2XQntn8H7PRDG5ChXymLfi5IYrLCCiYAEp4Q9/YX5swJ
FUX+7kjaA8hP2fSsFPHKQbE6ipwKikwqR4bEXRWlR4eSYzYUs8WsBQsUjUMY
cS4tF5rzXkxJqmGBGKigKq6OhSDAfCIPDYhpTqNSB3kj9NIIn7Py27PT0Fy2
kU2rATmdWPbEqs+sigIBw258BYfQ5gpN7IOY6YWMlxiTfGbjC8ibXT4YygmX
fOBP0zAy6XW45VOmu8DMwSmsE7ltXc3nIgoDv/Drg39g2gZ9mN+Q+0UnLlR5
w0rlAukfhCQqhKkkkq/YfwpiPeOElyxIUGKmzksBhePCa7Yuxmfz1NCkb2yq
jgq050WNM0tAMTIkN4KxrXj2YQY0ZS4Ig6AqNj7laWgOrxl58EQ6jw4znzKk
aHErOehYguGHsz4hiULCdypurEuXhh2fm7EAgBORT6TmyNWEY9IXWBR6nUqT
kxSsO+YWkwnmydX5rLrBX4hlTYhQhGHoOjLhu0deCWaGYc8YGEaAVbWURLJG
Z/KJ0l6LdrZGkNTrnQNRLCIcMJlvchBA55AGzzo/a3p4OnpgnweMBp6hvMIu
U0KmDM0G9IjTq1F8hpTAx7nIw0yB92V1C/9e5Voh9joqDjtGIQ1kRolXVr/U
SuV6mj0mn80/MPWxp3BBxqqViCJA8jEmM2E6KJ4bXgwSnHNqAJ5TvuvGp1So
nADSyJuETcfkkA5k6IiFd5E0pOuSg4ww6Td77RozcNZsFkgWE2i/RaGUwaK3
Xqwhm+kakqOM75Uzp3277VYyWYRLMmPpRy3/z9UobopGZ/SrIyhh/ukdewcc
dQ/Nt6jokkixgyACkLLKrjTdIPqMOAZ+8QXBQ0Vsbv9Eqzg6x49FqaiDJwpB
BicCmrVFNV9znCuVsOq42NBmrLUQhWc12j82DPruaxB7BaxpOZ+iACEJjZmD
Vtyx5FAneQXolBVDxislhbNqog83J5eamyJrkzFhPyefI5GU8nh6QocPr1C3
5dTSLAIDaL983xjlH2rHmhyHY1WMjD0w7woyyonclN4EQ7ydN6HahCZIvHzS
ZheFSvW60J5VYD+YRDIDTXa2BIFHthRFKaakEYjBIX7ef7F78BfZFTYez1NL
sjEZpi6J7VmrMQiZJ/IobaRMalGSOLOJU8lwp0tFalLxV+d/EgP8Qd+Um+tc
RR8jUaF8DVoYduRFe/fGj7F1aFlkMlxKQj+J6Jc0doDvlzN7nnniVQlorLvP
i/HCRhZennzjYrKw0b/++qvJsuaG+w2YLdP+GSU+2058tmOHGMHXO2bX7Jmn
5pl5br78lM9okCeD3/k/GuX+/G6e/+tTcx9DeppTktMk+vgevkCLFtSvJdCP
uf+csCQQxj9vMDXMDOl/3T//e2BhKBiiVbA8GfzlM8ByvxIW2QssfFoJy/1n
wcup4f23rBsp4J545Sxr3g+wlhe+Pzg8N/cH9yf3AmFIRve9/LPAMsaxzoqr
QyBCnAmOK9YNky+DG6sovHk+M0CnhIel+iyw1Cv3SE9vsBitY48mnwUWgGOz
E5aOM52il9PPAkuu8ZKY/f40gPVVNQ42SGC5/Dx4+enXlauWOrcVT/z6mc4R
jpKG5cxVRmKzGhKXnbB8Hv4Csq33y775wos8Lt/+17WkqGRpOlxD4QqCY99Q
llCsg2AViHlK2RWgxiBeEzH7Xk9LEoqrBQF+i4C94W6r9K7XI/77qS95dvnp
b2qmh2+fS34yJT4zw4HXdLCGMnJtLqzTow7iZ6yjui6cpxpLqapa531xGaOZ
Zhc5lSgDPJzGUI3BDI6hwLLZxoAChXtRRRwbrQXNsz8VFcDfef2smR7ws+vw
8QaHVjmhLkk+7Hdv2NfCKxPlEUkmyu9AbQ5GxfQOl7+DxbbNvFjkKoPCJlEh
OugTtKYMBZ58vqw34ztySPoKGno1purGJ9+R6/ySOkAtOEBJmTaoyqs5C7IS
DiyywoRYyuwiq4R8ZBccP4XNGsUa+8oSocDg9tZ5y/5PvcDT07RIoQQRALCF
JXcI9IlL5AATdMPmorkCB8nCt5P+ufF0dsaeoqmtHCZPuxvM+mzFe1I7i93i
1zmXqYA7CMZqQ5BoI7ICez3WCRh+gjWPT4cvP7dBPMyIzG2sngKgdDIpK0d0
DABvilVElMdUmi0mFzdUYOGMszmXVNJBcDzdhQzjxHdejnsOM91t0u9c0jLE
fLZwnQcLas3QGEk/w/puOWfC+wi3ZGfRp7y6vk/9CbJMqfwi9Lgjitu6VpuH
uKO1TUwj1MA+leVE2ePnLfPQHYHvbebXq8ODlyyHth+IhgFqmS3ZaAgR6Mk7
F3mcKwuVSnTtOSIXD7royWmHRZslHTas+Xx3s4veZPj3qR0op8QBJvVx1vj5
aE8wTF2MiwUzg7E07eKthw/oYQ6/bfH+R0qtC5HA2XNBxylmap9+KrpFDaPX
YGTbs0X0I+LxQ/ODjiIh+xDWTy5EBe3o6c7zZ0Hfl8OsrEpyp7lCWbbR13HT
NlZvF6jPtLUuFeG7/A5z52GikctOApRxgMc5iWH4vC5gShVAtk1zeF2afVIH
tSizj8u2YQaanmbEVHlZ73x5AbuHUf4mFaMu6qjys9GpKo4fa5EpR512I6Nm
rfucl0GlftqhE1ZHWMcOekY52wEHzCdDp7FkxoanUfxfAYS0d1+Rw1w+IZcI
l6/4jBirngOJLbg0u62vIph/v6ZeB8RRbTF2bn1EknyDGsC6hFs2FB+VBzGH
JsieT+FGJcpp5unzAkkqAJgvOeMLExila0sttsiaOjdU62O2zPp/5nXFvlb7
JYxeSTYmSq25Sq8Q/eeQNpVdUCiY2PnkCi9sbDPQefjIcLsWPpoYdKZCexuA
VpIL892o5vg6bzh0raTbJB8Xs2wqZ06m2aGYPdrjfGZBa357dDw4PX55fHp6
8Mqsb23EctKVOIHKFNSMXmc6wB0R7gPOO4p3qehaK/Z13uWZ87laVlnmuIpP
HlFytw+jY9Y/bBa5WFFs9XVqGocyghOjV+Hys906Vd0t8ZVELcEaJ2KtBVoK
YPr1mcLz6P8MniMWxuLKYtTpz2lkcvZEQC9SVtQAjOUErZBmWlxdk25glWEU
XjZ7TpcdC76U8sa25ilH4whdB4ffYX3rYzClMpN9UtzvSKsMwme4AxqLKmiP
sXLho7M8KwPwVuX4O3MHQ44ccNc1495IEZGE8X5a7Mn5KSlcZwNQh2Ejvjk5
Oz8+PcaEpN+BqLjeSsCjJMtkjZWP8DaSTqqbBlAQ8/jV8TcHWAA6+Pbtq2Oz
vtsNX0CyPioKSsHAU77uQaByKaUJixdl+BZpFWvX1TR3MVKGdBGdZ53RoFAD
KDhGRKuCrKJpWrk5sE7Tw304+P7827enJ+ew3h9gqXuPP90rNsHGih8RyuXl
o+JJ1j8m82ZsK028ocSUCEYX2iYcT5wsJcgjQfK4fYOKXbqwX+F6IwUsKuNg
7FpXiRtlxMICMB1nfF1VHF7iGHvIVRD7mlni4HNslFSjCtW3ygbnznkjVaT0
kJUNHphK/lUsqrVXvqqdc4VQuttjGGav+Z0qyuCAW+MVXe5a5RbDGTUCbQaD
7oF93NhHgf3hFHyNWY/4q8ID/QEscaOvUc+WguicAllScIbysh3PT6RvUNbN
gz4Dq1RysoQt8xL+LnU3pJ0EzY2k00DICJW+3SCtiCjFAL+WpIjSNe+LWDMv
gQYwd9VhBfDP8ix4TPksOts1WNNY+S0CX8VXxrYhwJi0tcSx3JG0xaBqDt1A
eAipY4VKdW6Hu/tqgbxByjsSNNfgRZZu69lZEy1UFwn6XHW0MCWR9dInt+jj
AasSsctHMBQxLO3JG5BIMLecCee+Ep3aQyTAhHlhIdNlpS8sltVPVyEChVPb
E6c0eT+ry8+JRmplHqks5FYJ10NngVSmIIuJ+HXeLtOyzmHy71EHrYc9eLJd
zHDSW9ZiauiuWxHcvpYuUkQla4WiGyoIsJsczYJ7y8TRT5EGwN7BXFe4jvqP
ydaUZGBnD1pPBVtW3syzjj6+qqHTxec9Yryv3CeiyzvGRBlmDLSGYts4cN9h
8ERZoK2Ugd8fpjHdYb23tsDzoWAwhsc3Pwcsm53hTr9vxx/mhRzANCyfJ5TW
mEfAclKKyd6Fl+KzwHIVw0KuqewqmCsE0Lxid8tnx8tPNBfMMDiYXiHTuZ4l
8LQ6Hgz08tPnod2fOsKd7a3q+vn1M50jHe70s6Yinm0WpGKfiTNnHdNV4jg6
J6l85vvh3ZBdKTazYzXewEmEmdS4KQ1QOgFw9iWXBwdBG5QsM2m9gHFCEKeX
aObm/sAK50usRAIs7TOOnD1x4BApZ5TydmddwsUE/bFzMBoqX8IbrFzz3HSd
AQhSrBCSLDqwFCrXH6pwZ9357x54nRtbkjxw65F0WXbQqeap1C6cxVgxy73S
Vc/YLSslO8tSSl2URAIcYneDfJrNG8p3xfyhkflbVi6z+s6Mvny2Zba29un/
zPfnh312OlL7zzyb2wFItbR11Bd32C+45s4Pwm04JH9Q2iqqgnu7NbILbFpS
5W7jUcI+Wh/M4jJqDnWh6sL2I76VfyhsQafduMDCVS6eM+vc8YyOgSPSZMYn
pOZJx0WQcW0Nv+x5mD1kam0ywri+my+qqzqbwwJBr7NMTy0xILOIN4p/VoVI
Ej1EUStEM8qK/fODF8hEcBSOTIT3sbA3RboBEHm2RnSRH263A1wBmzUtzOnZ
weDs24PtvafOUhNMDyPAKcQ1MuvyxmhDshnB/BMPIhxM19TLngPA630wzj32
Tbs/tbca3WPAvQFhNLq3A99Lr7Kt0bOPH++Pjt+dHh8enB8fwUPb9x5eeezp
9s4uPPb64M3Rwfnb03/AUzv2qb3RdviU6il2T9xZI9Yy53DZHH1CVmxlGJJG
bJCTFVFnZYMXvK3w5xfzhQ5m4FCH2k8aEpc/J1LKRPEhVigXRZ2MVWivc3DU
pC0AtwejTI9ljTWLSNeoqi8d23bv9GMxsK5dqpj5+nFDAgEUeXH9+VxwIKUy
Wt28dRQxtEe5yGSpotdFkp/pzAsnOrYNPXyGOl8Vo6pnOW8bLHetP2cX1Y1u
hVlIR3aXFW15nXTsD1qdB43CdIffVsdQHcmLW6SRNxZ7z0iXeXL8dCZWS7ii
cquzrV1d5Zst/ArsBNznW7Fu2vUH1MCp1/u7tyMfqC8h5xpVztTpUEB2hdS7
4JieuH7SXbMaVyzjGpt0Fw2xDcftT6nVTonGL8VzqNUAGVa1lEiS46CvdBib
XUP9ALP31M0vMqYCJwafCpe546p7HPJZHM6xwoEbs7YuDKDDTyWuti90u0tM
wJMb3ec06jJjjK0lIRy/xvU567vDsa1SnVSqjHdJzx1mF7z7XSnqziHgXHrO
MdPdgcye6lbtlg5X2f64qtOSb3Cgotnp8qxWdVXcccy+tkH5NE7GIWIcpduS
GlUy0EiND+c/rGiCk0QYehZsVJdjhsrBof3NFMRn173lky4xifi7bXUQrhr9
4pnyD0fNBTa8qIm6H7gmqeo0t1rvhF5s7S23w4oUPwh9KZSIEpS58OJt5VSr
lxqGQzjS3BkMiLowFpzyYt3mloZsXOwyZ+EhfRsAzMvllG+LyIGtW2HmFWNp
4IUHT/pvLNLdgF/bbsD+uE+5mRIYADfcv4NFhb94qVGRDLEOqhq2lw4/zk54
IWDl9o12i2dU/DFTwTUPxIqpebO24a6waFdx2vYWuFkcLeUoihvdoa0jGQzo
+RXOglznJbe3xEPOqwhgl0xFtWYm22YO+HNXrmQTLHTi/i/A0yfULBfWxRck
KA4trL+gcsQST5J30wuJkAtUl91vEAI53Eau7Slll4Su7BNAJvoAdQYUShNh
5sjncT5u8e+IWg98m/nmAJcYTXCBtlK8lmHGC3GOO7fFuBgO4UsDZTvx0KU2
uUQthNKThoTRmkU2zdnX66ZQMQwr07ADDlt8NbV0q2obb2O9aBpPNgyFCkgr
W8okUcguETMBmwyRw+l8QYNMxUjRw0t17/LYikC4YqphyEkCd1lH4yPaCCdO
ib2nxRHXmdsifAvQXUoz8W4RCworXpGjWtTbKP7sEjfaQVnCnI2r2t572AjU
9kx5DK6luXcHyvsPIJlKMJG8nMxPo7Ult9rBZysOXEDOa5gqEuH0TP471DTb
OQId+majlN64MXe2CPPS+q1EHdXUPGtsU+79IODRkRigEjDStKpD6UXTkXpB
iRe23ruVBKgJcF3UI4UY2/hctV8uLiVAz5KQ+Zbv2Mj5HMIDbB+lB7ZXonHx
nrZb/YehRa7UfQwmOzroeuGe6BXmU1psSPxTqbadvfLbVsgKRnrSIK1pBQOy
0Xzix7qTWtEkwnfhGSYzqfSY0lhq2DFGrfTdNS58cQQVxLK/kxIAp9n4PVv3
ZYme5RtQjfvGJRUEGXzpxTbujjX4rV4wX1ROFG/8wzAjLHFeYibFspxisq1c
rwMSDVtIiY4t3BFkmE09jxYoheO4GOqGSe5bKTVRTEcUH8dwpAuxVVTla+5n
0rSS1Xz2LQmT4JoAe40AzOmD3KoTpdWn1O1Dwsxwlq6zts6ZNzneBOX85NRx
xz6RECFxU1e+58iebx1HliuY+CqyQjqq0BHjYhYkR1hAP+rp2s4Ii5SG0PNv
GYDORog7p9pLM6RBKUvXuBUfKrB/WzaUB3tLNEYtfUjW6ef6JtHGr7u7r+7e
p5rhUQM8dt1Q11yHYXR/tVopB1ydo/ysyVMLfD6UdJkj7ZWuwTHeBkiA/Yge
yEFbHzUtbyfd95CFwtJqH7S7rplLk5o/6O8SdSR0zi79XtA4gcVKsl2j9fio
9J6riu0vfwmYP1/OupGDNhSl1PzbMl/aW/7OZKJWMyp34F/7DtmBliF4VRpG
kKqJzIYQYvPg+nyrRg1fCsk2lv0Ab2enyYCVsSZHOzVIqLDtbdNY0/2gMZqC
RsqUW8WQFEo2KKFG7Nm0ayOYPaqVCpO2yVqZWZvklxnYY2vS5ZBYknfIiEpJ
0iloZBHdixVlbdlGWmytOM+OHmFo/l5gW9SF2KA6O8YeCblLhQ99l7Y/F3s7
POHMQRHp6HizqXTN8kJ8Tuyp4v6czrvgXDsFiy/Xx5QudAz6GjqTU8Zzayul
lNBl8UgXtCHWldhzhLgubAe6ycR2oVL2d20djpSh0vbZWq0qSXsx0cXiwdk6
FqflnTTBJzOAMjdLi2Xpfok4XZadahbuQqxAsX4J6LNXYShtu2hCpm9VK8YW
Gzziqw3n1tTM3hESyUGPzjTn0VjpB01i427kZt3mismFfm0OKW5bq5cEowSd
SkDNsWEY2ymf9FcKiG/oziQs0bQ/z7ue8BLm94g/viLjcczyq9Cf2rYvam+e
cAt05ibUpzDwQNKlplWYxnuXL0IN3HWO1LUISCxum9r2m6tkSFyU8PAlCHa/
XVYZIbUf0j96Gm6F1SChR4F27vPJSfl36lbU2EMa0wjVLTQuttNK8w+MPGao
1lMFJjl1delg2kTK6H6BI4CPuDLlD7qJnV5H3r62KPB9Rx4U7Qfs8s3q0rHq
UvF3atjk3Fi0PU6EjEP4WVKfupoL5AYvnZbcrmTWrXKwBgP0c8qCcBentekn
EG75BzCuuN+kjZclVBTbWYhYaEmbxNXquG7ZIgnYiEXR4jsuhLMIolx9B2kR
3j5GnmKXsq3vgbZ865KoBc/BTVbQpbcYuOcuT0w8njIX1HXRxlBm2QdsFRVU
+wcBJi4dwSXWknSAhoEiiYhbMrN0XB+7sZKGKxeyOSdpGyekVRKbCC97CA3o
9kGKeEYq/XKlzhZvMWlpwgPF++cy0OPGt4Hjzhci7UdVabq3gBU+eIm4aBq+
pC5wxz/Cjc5EyE93yjmM6VhKE9My4T7oUivt1cD2FrfYs8QdCjBqFLApMino
shHqZdlJJH3V+bsJSVxfekhh89Vc0imXDIdPaiEWqtLhh77QVotLXoQTG0l5
rHOvLIsPC+MSW+1pCcSUDtPp2APfGJisUAPODUZoFLhLxi0fvYRkDK+N4MZd
LqScAJ8SHLVFcPucvmXdDyrwm2jW31YeHq5gM661rBivKakaCHbHAVVO+Yoq
N7x6seLaociPmnSX2kCJnXKu/buZXDLiprR4xid1ndyGU9SjUKxz3VtTjHe+
I6xL8TD/HSvvGGzdEH1drEb/zi11ucFLAe9ahGIvxmqhd9325ov4T9SPz8YZ
wrPAfNAO7eqEnJiJERAaKY27IaavzYQq8B2j0j6XbA+UjP5jCpJyW2IlsN4u
XPya7KskdovwLoAITK5FsIV7TufV+x36YxMJAS2li4rQ4zaKSulNwylA+oKF
FYKbs2mt39HGFh/l6C8apdF/z95ZUvPa1T0NV2ukBAqqRt6cpQarVe1JsENW
JYpKNTtWZ9Y2nx6TbwD3xrpiNb1c5OOMOmC0ykOTQPvqFtN51Yo70GpTNXmI
dgbUGej+EWNPbZ2clWIRBXbat9l6fRLzVtjDv0JXVIdQBRWDmKNCDO0eUg45
kFkVjTU0FX1NBASUh9hdPyK89xFm9UqdUWFkg/Iayq590saUv6OdLNFJwHtc
5O6WXLyJEkp8UoIX3bk9/lg+wL6Grbrkld1jvLOGkzItQL4ZrJ3XHgmVqPcY
cl6xt0kvz2/e2VWjPWK7vzK9dp2z5g60ZndnzKp2Ux1tesICZnYjFHL9RP+P
qGducxLfoCDoPcW3W9nZg+4SrXJmjPhbtav9gktBvOvEdN93Z3aBkjX0b649
4LE4kY5ZUTKELloO2/qSpsSQWnUIuXWM5GC9lkf6CFjmcdvclePrunJX0sBR
BP41o2yXoPySQmuhRRtvheSnB5aoP+ORMtO+CsJpIVGU0TFc30mfPQFOWvYl
OYb6yVfsYpzkyLoaKp7Jy/GdbCOmJNtW2bDv2Z0LkHyL+V0sYQSLx7jk0MkC
H30UT2vastYXu2LnHfSuLEv2s5ArGiRNgcefbovW50WFSQHdaN6uqMS0uHLU
LJf6SWRTlVSX7norNdCyXDaS2rUivtJXV5kn95DcrHd0pYZNPHMzt2pPCmuf
EhGhXzHpFYmJiCK69vaquSsxli7jRZlyWNmVyonmILQ/HTzmusqNDZ0QG4HN
+0g1jGjIfYreCnNE++8z550XAygoPthJ+BOJQ90dFyLXHjmiaqY6mIEZB/sU
JADjStKln46NLjpiXVT+LoiuNAzPJtOiArtc6Ep75/ZZC2l9De+H8OkAVg2+
QCe+JK4iLmYVbZdaAftYrbs6p2s6C/GgWMt4I8KN9w7JzWzCbh0VxFk1VBgQ
Uz+CJS4tKjzIbRjoVt+fvLJJRqI/UojsFERfUfTmA/VhqA1aG/55Dv/YkmfS
oMP98iIgIHlWh51TjTlXrvxqQaybU2FDwyHtuPNc8+OQk+7FESU8yV0MRcUc
go1j57Z310WRbzu4r81X81kQnXsIdYUCF+BqeyQjo+HYBYvwVv1gydc/UIuI
KxoI76WU6TrLLqgNK5KH53yr76ThOMGmTXbGYrx5VtTqALrLNQHMBcWvsWYo
VY7UxJngdKlqcLNkAFfUgAaTnMjMvcWx+kLmafjo9cStbaDJXVj7KGxpx0y7
u0FTG5725T5sg0TYJFEURlsoNSXszAf09sJ6ciy5RW9JvUTc0i9ls1h8k+tX
iiUJXadRfxZVHKJQGHR/QYWZiDUnRgEzSFMkffEPqQbBqkpelSoVUIhRjag4
hcDHqoiHp1avoFXt1HBSHoICV+p+KHpRfEb25r0lWW2+l+JoRPLMEgpNgiRk
G59K50Pv9FbmlwRwWCihnRAqEB580nokMYOOBsJsd4iFpq5OcRVduIChGI43
lZz7WY7cpmhmiYYQyH3efXfqHqaeEGHNWXTPc+u4Owz/WeO/H2S3Y/+TRU0J
W6CNg865BlDqvwO2oMOYbeYX3skcXvvOu4fKI9+QEhCrAw7dmeKwXB9tIPlI
gE4tk3z2GmRc7/r2htxmJi+4WvdS5shq6c6ItR/MLqTCOrSwJXilYMIkyAtR
+mjYLBy0LxxFN1xF8HAnbYavv7ewDXv3QzkXTLtrUK3DVgn5IdI+pxr1dZsi
n/gQpfIE+G5UImiI4oAm4HS8JTMhStdT1NAEOCOUYMIhZUBlrtkgrkYlUZBD
1jP2QCskdhcz8MslCVYgR59l7wthsY2Yq4umHZYOVpcYKgGYhkCU4Sti4JEz
QJClmhyrMl9mvrEN5ExMAjtlhEpia7ASf8ccaeMu2bdVEIUfPoY9S8VdZqnc
22AAfpM0sxor8hKHQDFw3Yx3VYNakkehvBiaM+76pjtctxJhY4hVo71rV1YZ
qZJktVwB9ZcRDuLWD1aKa3UrIY6TukULuahSsM7wnzLITAoLbWPP8L2S31P7
2q38JfU+/MJmvWlrJ9GNyl+RoC7JIoxQrXTmEsY4AM64Cy/SC482MmvqSZG1
4AWRBYsQRqjVAM3WVI5uiwNtuIzkPLu0l3Op6uqNWHJM0bRio1oUtxY4dPTv
kp1+Va920DKw/CqbvndGAMBEF7Jy7AU+uuNc7DAIm/ZMttAYF2e7+vVe7/u5
bRTA2TWhDy9QliWQb9UJEy4na9Sp8LlDcqMZlzvndLJFPYz60oe5F8HE+sQ3
jzolPAWIlFTBcHDtX0tDPlYabOBUaW2gl4ys8XWrutYXgt++Y9CxpYlXosSq
C/QqToMr3UUJ1W0ZCjPfnx1Vt/fWrnPfM84j33PM17IJ7MmiaCJB2WqeGrOd
Nu4YHHRooHuR69UDyAikM2oO43XsSUWC7n2ezyU/MbjOzLUxwAGspxcvcVXa
KhW+lzlrGfPldIrXqea6zXSYFW9bOOYTr3a7wUg8IwKot92t+IltVceivSPx
0lLCIzR/UUxYrLvX+8kXZ8S6eIvxtlinrEQtk6j0RW2l5QThDvmWj2WOwSVs
zuNqeWx6rbv6UbF03sWJkPJ5pU012t/ML8GTg0vYRAebnCgLmDq08RGVepB+
ZKcqGNQ5d1mcoAquY5Nb29Fqd/hM2v8/cFt4+/pVHviiWAw3wrBQW/0IlQi1
ISbsn+L6Y/kt4A4oAfPQ/oUwcUoEE1kiUghM2HC6zKm7b4fvl8SkfEXVrDyC
CRWZ/75vl3i9A1Us2lA+NY1PTYmsPnf5oSYXvIiXfTYKVW7tIkn03lLoTO6N
6TTv1NKSvbDgHVKduaXVHTmxhqHXle4lqmZ0M5E7UQQIxVzpLLjeUKTEsljt
gpGM7kxDxrRO9eriioR36fLtFLxyknhia5UXjYWYec/SBkZj6OMBPOQJLyT2
J9rbGlHfjwPTIhNnYziGYq99D2vj/C1M8OUVnXa5QgZBbRX8BQ3iOEccy3/8
HELhceQQP6bpnG7u3qFeJzI88YWMUkTo+vSLO+aZAKEbJmKvohYpfUopRme+
BljX/gbq12dza7acmbq7w7KkwJgSvrrljwhQa5+4pitsGHgd2z5oq1AsCyMa
Sag3DSudtu5M4cpJUt8GqVOP1Ppc8C7RGBdBsY4cGsB4SQbsIPNGV5Ieeygy
7XkIU9mVKpNSEJPRwFaGju8xEYzNx6rOHzty0SSwYTtocisq3VvOd1vdaHdq
FV+jIxwqAxCvM1fvRUpcaIGoNnEn/twsAA5bSh06GNP4yxbqRKS3dsG6RWpv
heujnma7/DC/O7G6V5jD3B4c2SBnx6vxdTeftFCmGdB/V1bB1Go+cdlJX3j9
nWsnvMpJk/CPRx443KXl3Lavs5xWpRvKHQzcY0bSQKh7oxCevlLE4uTgH4Rv
Zv0YS4SFNe7usVJizwvXvgrNBmDWpb2E2qy+iY3vopP8Fko1XyR25vDgjdfQ
A0OIuS43yQc1mioqnIACxvLW6s0BatlrlqeIAB3h9uuWzyG4mzlxrgm/pMWp
iy4ScYA4BHKb1xEj+KqDPLPJRHnXdYZnzENWe6tcyCi+e96OLI52S1uMU3dH
kE1TCczywDqmBq5yf07vC+MT4g9lUGkAIB2qfcTRNRrTnemo4QiazHU1NfNp
VvrLf6J2Y1+Rt2ApBSTeUT8Op7XJiW62bE750rQRuCHTKSowNO/iGhUQwFY2
vWsKF5Pho+u0nmfPd/YoYBGuwgdOsW9AGDgtVT61W8MOGA+cx8oqCLZAl/TY
hbWO3DEIww/9dOs9n/mnHDCbPsUN/W/VuELFwDUU/ANDuL61jmTFdjsK+35o
8UbCVwNMbc+CueQYIPRAesflhGJpA2mDVVE3yIFtV7Su2mNtBDW2qtxPBmdl
L7lJctrdRgdOJNaK5xYR3Oke4EcaoOInjEJ2ZFG3Uq5t2gKwFSp7f69uyJKA
oB3JZ2fDIMOI3FZV4DlxkZeYqUTLlrI5vEzNkoUbrLV/yfAtqafjuyBN27fc
YjyTAts3R+evzuQkfTnafQYQSWhBaSR2Ljges2WpGhnjJEzk3gzLMeuEeuhT
+7NFNpvTlSskiNXFvFd57eKlrZ6JyL2+MEce5OMPOAo2e4WDfktVJNLxbOF7
IgiPgY13iEN2StXb+zTRIQYFoxf6vrYOt6chD/BUHrVN2qSXEGbe3TWLHEzm
9ZO3Z33z5scB/kN3ML49G/x4LM1zQI8uEQgW7alp/VH3elciN7Z1t1/Y7EFS
FYVTv8gXmWtyik1FSOUzBCn+e3ZKAz7b3tpCbr4g458nwcsxeS34W/5h2fgn
hrI2EtLNco63/ebUIYT7Qp/mU8pB3Bk+P+Po1YJyE5FWf/mFFj/gEXBPsOzU
LksGQ7zT7EadbJWOzfA821Jgu4HpPR536NAuKhHsWjloqmUNQEbYx6Ff1nn+
4uwIb+m9yacVmphUiPXuqVk/q+oLbHkDRwibKzbFAvsinaNuDpbnu6wumvMc
pR1t/ZvTkwNpInW5lPp+vzbrnAk7JYyzeXZRUMeOX36xgA8O34kwI9/RLJNM
EXV6b+WKDMtBmSCDOysDOlhHJ9nuECjZbGJu4vwp/r5hmS5x9bGUGD05eHUe
MjMkh9Eu0B82rdjeGm33pQV5JqbeeLngMPsCoJijG+Y2z98DG6inBel1E644
yC4AUxXdwvPiDjBwk1NdKg+JE0lLjYnkrXqPZ9ABEl0leOHShwIvyQQpirRM
i8YtQnqDsQYnx+cvn++xsNDNIREaVCtyCvRMm310911nqGnR5pDO2GCS8ZLy
zieTxQC/GAK/0mE5pU2j0XNik1tPjpqv0Kit5gOawO+2XUywNT5Xf320tzMc
PR1uDbc2R09pqu2no639ydb+/uYOYEhNYbY2vpI83ytuGxFyiJTOvzn6km95
xfc2d57yVa9BrDfG3Ftyh1Cj3cscvTX9kIBFfWbOyJILeScGma8ym2kNGKZj
2screAu0g3Ep5xUaY29+gE/hdBSkm6JdjlLib9WFOSuLfwL6mz4fxk2TOI1m
vV6WlIJhz46w3sOz7w953/02BFgn8whPkQb9+zcnb47Pz3kEhpg81+QBw+/f
yaCaXG6lvmdazAoVEdWz7SNvAyLfRXbpI86jZ347aCsCIueKDvESwxrzQN4F
+HXarBVVZJyMnqttsh2khTp8mRwqhEHmkKOF2+BeR1zWLSlBoHvXkk9mCeb0
7VtivS/yhqSZl5QhtXgKILGUmXkxhe91z1TH0aTEElMmSTI5ZsRTvjl48/ab
vT0rSH74EXBt1mNS2vC3603Y/2gzekRCTLkLycL2NuOVwgR99Qk1Erwtg+Nl
a1MUJfzyC0BxfE6X+xEDR2jZd4mi8FP4NcpCxR2f95X/pgGN/g5Ya6PugRAG
/BXfE4T/Yc+q5ntkhVGSj2QjlVdTCZXrQ4BHh/U52u6YiUUn5h0q5gj/7gCW
bpltsBbrufVltK7PKJyKL83L/KKmCyW2t7a33Ggvjs8PcDhWm7Q6lQKFmvgg
8yn8LXPk3nDLDxpESzwDmTrB+2cwgP4MiwUDV+4MGI22kbSYeJrrglYAAzM4
oMgQSKyvKKa5Sy/RwbHaBFUOVCBT8ua64m7jalMu0BPVLDmLzPZqCfR5iVEO
zWvQr8DQ5MZfQjkBotko5tAEyG/2g5GT3Il1AMadI2eVX1DAD8tFbL8wXQ3D
aSF0mRzJnotlPcldCDEk6L5F7bhqbNIb3bhKF2pxBS319aGReKtppwfvjk9f
MgfhosxYC27ahTAhIhHp8Cv12a8zfIM3DMDCMmeqAsa2uaxWVHBySpBd5UJK
B6Yq9ho3O7Of2apdyoYPy5BEDqpELdaPKHaGNUjU0r8oM+memFw71oqAsLmo
qMfvnckxzuIrm8IDEABpexBMbI46OVliHWmwvWdmxbiu7M0upKaPsylT6Taq
1qxAccgDR95+utXHzwPR1FZV3akZgfFIqYNOiYI/2HAjvXvadxXANqSLt6Db
y1EmpK7TkbBZW66DK5azOAuQJtHlG6I58nlWmnJ0b4PrYUykPgsbu54Akde2
ySXWyfvOS3E7sMYWF7Z5d1uZlqtDnu88RewEmjUlN2Cwe4A0Imy8L5odpgZM
nISgocKzCW8fgIUwJQ26pby9qciFU1+icmk7f1PY7baKDi5Le2kpZdVUcpYU
TH+NXAbjXC7OCWGv6QElArO/fB8z9LI795jDl9oaci1YnRYdRsBa55I5IDTY
rR/1fWgm0kgfVs8TBkLg/Cz5rlOGQ6V9//JLd9KBlRWULTNGL0nFYWqPELkr
F84jVuL5RrDE2LjbN85vMdXMEG7fukfffyEizrM/9HmL6K+7BnaqqmthznAB
TY3zuvyq5UTx7KzF7n4Lf+tyzupqVD8DB0faTXnUBTDKDW2Zyd5wl/ND/B0Y
vd63mOOvq4GDU6SZlSX99qmmED3mBuhtCOnItbQLu923vBnFIsYFpknZUoRq
LttCLl55QgqQiuZ9MjGuqGlO3btFbmih26zeOnU80xIzutKWJBjYU6STeFOj
DyIJdH1Y+U01XcIi6OKUwPrAoMuc78CZUJUWfnqR31Xi+tY8nTbHCwvgui8z
MAJQ1lgW5Y0OB5zdvA7LuW2qkH2f0l7jLbPhP72thAkqOKaCUE5QJ+OoFEyh
BRb0zCfp/bclyVmw3XFEKrhDQJl4294AurLFBwg61uabWFD3RPGPuPxRrcBj
+YSTPqQCU///YGmcmaMiApQIQdcWUUZzUI8s/ERKfkvXOxYFE/UC0o0nVEKR
HFR1R3Fw4dMpXbPWVylSqy7BkXwvd6DtWJ7ESTxRkE01pvDwTPPLBQvaACTi
1BNMqbId3QgVhOIl17u9dWiVugWXjkGzxUnithIH5auyeefE1EjNdgaLOmBT
ia/IFJIRqDdtoYbzSSapqxvgsB+KmYeF4PgFtYYNOR6epqOY3lXGC15BIf5g
Tu0lGlMZpyWvP5QXf2YjOdRQmjv49oPozFLqKNMRW7eGJLakmUrRa5uqh+hs
tZlFc+yR7Eej3XWvWCD5SmzBxMK2usHGK25L0SVgDzjzUF929uZs0CzuprkP
GEkNLsXcuDamwkvPsKWDK/FUug3wONQVbuGI37GyMJksPsBAQL/Icih8s6yB
JU6G5jtg/34MdzI5/BcUGtLxtdGJgIY0aVkUKATYnj+R6F9kzfuwCS6qYC7F
wIofvGrORp9cEdkKFdg2bOCAlouYNu0xVjam9JWdifAOqbx2ImyuYzOfQg7/
VZT9RMTnQkz+3kvpmlo5cWC3smVRUL4FXUDqojfAGbvMFJHQTa4WzeiUfNbR
cOSF4vbWNtoIFinoqHpnCe0MdnWCXdmB+jh9i+plF4hi0Ya5RzG8jR628XVF
l7o5mYFnEIPr7NduFlXluvC6GpkoQkJcILmyPuaaXFOjWd2you/atte5VALg
IsAOoHL2+soGbEH83VTS1CVbCMxSZowIz53NqNUnd8uloM/tAGX2eOjsprmz
hKnj00QyT6tBT9gnd8J1HHLbFOpYlzYLMPTFSTGc164kURgrhnP2pa0IV7a8
6g841O3lHNr7KGi0SpBXIBDilv/YOord1YCh0R3Y88xhO0k8q5VeEgS65aZE
UQHdu1ZDpA4MnAMIWJe+t3aHnW6MRCIMCr0GxKD6Pn+Do0bC3IIYLjrtyK8W
8Y5UNLJFc1JOPGG3frOvIqnWa23DwnTyruFMwVY0fJU7HidY7rVNnAWMkm8B
42/kcLFeEM8pP+T1uJBGMwk+OVTRb1I0UCeveTA+2AhFwGRtNsGtrbisgThu
Mun5WN650oBscoPywmfdxpe+chrRycGbg3QGEX7zkfJII/eUHKV32fg9rByr
pns9GoZKnjNKg6IoIZyXfDavanQDS3GZDdC6DidYc/20b9aSc6y5LlP8vZqy
WZMOZjD2FTB57ACBMBSNauBhkzsoo8sDACgH+9k29wEmYrMSU7NkpCbelsZd
tfu6ucLvyAi9P4STfS+NH9S9tb37p/fJJd3/e2Ak/oe/aFaGtffMppFuW0zQ
kwduSWvmYy/cqgNmpQheI9tDDRDeM1rklrnMIxFveJiofdADrEnQlHHEWT+b
wIrO8nkmKuE7SXky6xSwQ9UOBoTTAS/L/lD1g5uv54uG59Ucm6Qzo4mQDaAc
HJ6TScm49rAF6N66DxqVtNF8P7pXnUsS32/fczvExFc7960mhYmndu+jLm+J
Z/buWw3NEk89HTy7/7509ZjdNMPYaZGM3ruYSuTKYptzlzW+YJyopJIDh6oW
Fr0V+e0axuuoy5fy2rDx9nyEqs0wIj5/d6+/Kfm3U2LnaP8HyRKXcXbyjaLL
6OLq7iurV91Tvep2aiCwwfbe3r35vhzYXbv3pCAQtWihG3tADA/TQmbWXlI2
yGGFeQL8O8VMJo8gC7yodjAYUBskEjfvmnw5qQZjmyx7BAIJ/QHmHF07R0V2
BftjJRA/jM9+pEK2Yjpd0j1Q3vhwF6y3ru/V2oYksmUFl05FSWLq1mQQF/+U
e8514W45aUdnbLIWazx+cs6dYSdIQ1OZtblf9ZrVSV3CM+U8kUE4scjAYuIh
l/wHc74L+kyqjEauWNXIPVvOMMWo1/v11197xSXXRtv8R98mONmWdMP8gjsn
TidTTSdB9iQpJehbMvgUNVuFP/QTZUXpfB9NPm0om33dZfGH6ZhBT0E3LXWi
THeOdD0ow9F5aFImIh78mUaVTrkymL1JK84rhaE82bix6JWDySR+NNnMF599
2TH87WaltEjMXymyKUxDe8xXLyTPExGBybLm5gqGfzIIf57AnJvBPLBF5ifz
D2DX98ZBZ6HF9/9iTh+kDTz6MAou6mvjfzbpvymieUNE4+BzYD7puZfv31T+
jx9WrEURmsG1wHv3IcnRDy0F75JK0AUCT3T5dQz8Otd4Te+4OQdd1sOerZq8
/ak18PvKG+e8cPqAb6ilIvofvVaiUcNr5X2LjsHXDy82/tn8jHvRhk9OlEIu
wddF+osqCSL9Vx25Lsx3gv3IY9nrPJL2RqvWsZQz+TADDzX7R3DyuGpA9a7h
MloysvjqeGFYvulMXc2BYfQsT17RUJxrzEgZCAClc7p64OiqiuB1Slt3RbZk
SFNMheLGMioNcoUJbPbaIzpf8m1rWvhAs1r8Pi9b+4pD0KMIJqfSmPVZNv/Z
Ood+RirFOfAp6g+baD7M4z8IoHm0xOGHI/gfWAKtwkHZ6i3NT5xh388V4laj
6kGxaOcKbs1QuAiLFTDlj4Ixti2k32H6LsDTY3D5qehMYvRhpBJeu15/AJ/+
QU49SbTeb18E4rhFa1Oju2hWobr5/x2uzcPIRqb8Kfi2d550IZob/q8YMj78
reU/jgR48l/Mnwp39wLgJ8Ts47HzMbnQ+LoFtWYMpinLR8cr0aHJVx0EK/1d
G2Cn1auNifE3rDbNTB9Nzn/sBhwdvzz4/tW5Y9NWlB2xBCW9gRsQpXX5QJlP
/AR62JPkM5sHgQZB+nHisXulWsjQf4ngTY3+E6khTrPb1OpXAtAnTltc8ROq
w4mfm9+ODEzycNaN6UaGU5Ls0I9CRmgB/d+PDNbdLj+QosbaegoEE+lwj8WG
k05fm8+FjfR+uR9GRmydPPDzxHxfUty1J6uVn79L7X0r5HhweO422c/1xM6t
PgoNlMQXTyLQrZ1jEa8huo+/cFaS2wyLY/9o1yji5ECFkn0nRu3kw68Hv/2U
fMtqNUYUyfgtu+JPmIw57n+Bw0k6yye8f0P/TRnDjxoi3mX3tbUa4jc2vTw0
6mAlJrpRf957DcMw0zll3cK6/tKDOPpiivgJg/VU7/A1U1OgjSTGAPA2kQtQ
26CfeJAnjkyftN/4rziXP933nhLvHUeNofQWPcEkfz5pXwnllvRk4JwpMliC
0NwBAtYQYTbxuD9cN/5D9/1PLYrC0S3R8d2m4fetGXDYtu9JTabeUGzKswET
bCf/7V7Z/Eap8xah8e7xw/YdeAsVccuv7v/FDR7sX/BO6H1RDOmn1of3j1vO
E/2hekdvGqxDv6a/8xj2ryqcql/Dp+PpzuQs2V8dP4gHuVcTiSmDf3plMk0W
bfKMflqa8+aDr3g+wj+bxBeOKrxPXlujLSR0/tyE82l33pPOl/BHPUYcbZOv
4AP+zjwuErx2sE1/tRycsHtvXHxNfsB7waBcYnd2j+/+5d41EPzagRu4BTdD
kIIZ9WM9xcsevTyvZggVplUKHu+/2Ud7eqC/3Hf4X++Dsw17GbkUEuvywsd6
Gn1CYehmjH2WgafxAVfjiclmiWu1rPfP27jWOfj2/OfAYwanAS87Ca4SvCgW
YaBFpXTlHwosdNKOQJ/+pEs1N1LOPutLPfvZXVHSM8whuj2EDvSj4/C1j2EI
h4ChG/RKygZSINBX9Jm6Vi8yk9mBHDlEjs9P3TORTazM8HlOtXI+ehDbyEkU
gC7Xe7yPJniPd621aX4wO3B71M8DO9KRF//mN60jGuPRS+o9ily81/Vn1JV7
lmCUAf/J0bgnyD8PZnDq7I+EroLT97Vogeyji13U5r+0IiXEFk8GxDz/1Yx6
K+yr0LS8aQFov2mD7VPPjai3Jvi0UbEfOeVf+7GAt/Md90bN4BapvM7pxeHY
ijmIjmvaKw3Bf2LBd8vX+oX+VOEk8YAJd0R5bpM7LDzkDPmF3eEgwT7Y4ci9
n0TAH7Ol+MNAGoaTZlNnW2/pqWN8X/st5cOvZnhiujfQ84iv+dObx24gTW8p
JbQcQjz8pr0FMFqiVwDpmhUO4b2LZdqZ+J+TAbCdfx25eLRzKd3DRywRPHB+
YmcAqAWt2tVee6eIzlpbog8Zcf5esBXGsQ8G+/GERt8EY1vWaL7BRPdiTJrJ
8YcM+XF8O9Y1Xi3P94RRDo3oMdRmn+pqpFzC9e1qxnmZ1UXVRKkx1LxZkpPi
q0dwnOVFgw9i+rYr1ef0Y9fc1V0aKcD0fVd6VaBa5z5JDN1DXOXKhcm2oo2u
DpDON/yKf/hp+PDQcFKdSymjuUiQnFfzalpd3Rlu740t0PD/VR1nnYtfnnPs
8EI5rt4iuLk/sKpBdbcf2kJz30x6Yeei1LeXJ9/sn1d3FoCPH+kyxgbLXVqO
6U71uOsLcbVR6xEwrkb7ZvTl9nBruD0c3esvtv0X23wG7gP5uG/29ze36MB1
fNGCT/lyAsdOG76Ad/hff9IuulUPbv70uAc3tcXSfvCH4Bf/V8wHHoN5ZiqM
X6RljfiRuddfKdSPtgmsSDfZVyvp/KqnF7q9tTXan1w8p25I/FrHV621PWLX
Un7u/xu3rds9vWLbYG33nsfrbduK9m1HHRn8LlYp9z2IKzaO3jNqX7ZGW9jF
anfLvhd8uee+hPdQjwAI9as7+O3ze+8Nam3uE35vO3xv174X7ZGFcSUuO96J
P2n9/ND6QN5ZFVh48tD3PQuQ30bN3eD4iQ/Yf6+3cnvkYZdFJXfu/qHv9Rit
DXwejqG/H6nv7Ri4Yzv70TD44NPde/v93n40zHP+Xo+xG4+xHY7xNB7jy2CM
37cvqKlgZnUk8Gx2dSiUF1KWTo8MMa+amkShrJLa8tQleyfvXNuSxp9cUkrc
Bg8TLXNSY0lj0bhLBCZyFf6GkcY3SmmkE2EEp6uEDlmvtAk78hdSOVlhk6NZ
PPTtbXvpxYWrAwmCt2agxneTT++4tVZq1ARYnvM4tU64IBaYVpSuQekviiUO
9WOJa17I4wjqd8NpAWzOcOmW7qbXZmHc1K/FoVYsiArREqvaU6tyvJsWRHdA
Ux2TKImKnw/Vs+5mGBm8SZ3nIE95uwNjwH36JlqaO/HBCDtdI2yP5LpJmelz
IN1zkxZslkUEk+58nkkti0og5Es7KdXA8NXsaOIrV2Am6T+aALnGgZ8fyQVS
XDxgbR4xghK1B+6m6aDpg+t1xaWj+i4Mbw7gxZDS/TruFxGWPdjqSYYla5rl
zBaSptNeGpuDxi1VuOCa+VLg3cBbF89PR+RTIxvv+PB1YAwjuwpPGWw43cuq
L7nyW7oO8GyEXJJa8ydufqb6X6zoDFpEwQkix3zW8pWvp2HZUMAkmhWte3YO
r7vjgF1bgKWfcusNs072J15uu/Ju9o12sgECpVJsA2bd775wne1W8sd7COGQ
e4aMEO50IgPbT3pWrlY22ob3dv/IlTl+Hy4vuD4+sbitEa5o71Er2hp9JRcv
GCDPAbdP56rriD6xgjhTyW02Scre4So9C7DV9dNhQIf27AcQYt1PNm+o1qyJ
0OVvapcAgk49cWvgEnfHbUjXJkdSm3pFMD17DFxyQNu7p5p9d+0Wz9TarYPD
7/r6ekl9OAGs58P0sXXdarpK/aUFTmsy1XMtvO69g8c4FppKjAcAvxwydrEp
fid+U+C6WW+595Zk1VvEs0uL0R2kJyKn/ETRshOIlm17DUQsVaibkrQv8pJg
3wkPlkVW5+urv0mg8NUJVen7OUnDm/BD2+bmf5tc2X6sXGGZvrtSsrS0b9u+
hGr+nNtMqKaSThK0Z3+I/PEw/z8J9PkkUOu7Tr62l5RCDy5x+xPkEOrzJDf+
8KWM0ix65UK2aSHPHrWQ7T9CoD4fBpwugOz3C9IsFqN7CTbvjQEWCN3w/HYB
6uf4VBE62npIhmZ/hARV3PQhGToasRDdSwpRZWp9qhjdWSlGt+0t6rZdMNdo
S4vKeIua0MRtOoQo32jQ0gN20RLd1rfatrZjybf44sFuzy6ZZFyIh5L2fTHn
llkuRhW2NGq4yd5V5Tsfp0w6uiqeQllYitAnSeVdC9RbOwbSXURll+46elnT
FZscLx5vzTFumIIDmS8knKZeDGHR8IpDKS/XXWsacaQQVTtGph3kiK/V4tih
8hF2Ia9q44+3KLZDN9Yfb0lsJzVd5+LaWQXP77Egdn+TBbH7GAvi6DwC5/da
D0LTD3G+PWZ82x3Ww+5D1gMO/xuthkdwO6c9JnkdRpgTrihhYw8yMLylIdGK
DfkW9houq5KuY+H7yfBSZOyF66wP18J3ntLItknuqLvGGn8dLKrI6t5R1xsq
xQq3fycr3P40VuhB72SGdk3C/UJNcwX721vN/shnjJD+bnPErmCjrcKusjPC
OMWn+IGsD/vT1NbR6NF2BTzbybVLx10nv5V972p2uR2C+Iew792kjqVc5Xtd
GuxIMfBP1V7t+J/Kvp9+sgNonQfdeLSe6g7dQ9z6GXPr3Q411S6xm18/RhsV
9kz9f5AJUmYk3Yt3cpTkwzjJ1L0UHYzR5mj7uWUajpkJ09eaU5JdPMdOxzU1
gJILO2AGyzzd5V1yGUjcI2mhT9Bn8n4koBw99qy2NKzmN2lY0RFVQqZ9I0GK
S7kbFa4zukrXXWWs4zaJZTJ/xvgoXeohHb5X6lHx9PHpixJJu48hx06SopYI
XnK+HJUUriSSOmUPXGWoDCH3wuJ91dwNxp9O6WkaXGDKDynflnLI6YL09U8K
CooAeJi7+Cn6GGwlsWsLNlaqOV178DimtIohTYEn2OtDMJ8ygCnFWf4Xyhin
Ca46AQA=

-->

</rfc>
