
From nobody Thu Jan  4 07:56:33 2018
Return-Path: <internet-drafts@ietf.org>
X-Original-To: lisp@ietf.org
Delivered-To: lisp@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id D6B5C127867; Thu,  4 Jan 2018 07:56:27 -0800 (PST)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: <i-d-announce@ietf.org>
Cc: lisp@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 6.68.2
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <151508138785.23714.4958525868416178405@ietfa.amsl.com>
Date: Thu, 04 Jan 2018 07:56:27 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/uE087vocVqIRmRFIhMbHM3nBGT0>
Subject: [lisp] I-D Action: draft-ietf-lisp-yang-06.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 04 Jan 2018 15:56:28 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Locator/ID Separation Protocol WG of the IETF.

        Title           : LISP YANG Model
        Authors         : Vina Ermagan
                          Alberto Rodriguez-Natal
                          Florin Coras
                          Carl Moberg
                          Reshad Rahman
                          Albert Cabellos-Aparicio
                          Fabio Maino
	Filename        : draft-ietf-lisp-yang-06.txt
	Pages           : 56
	Date            : 2018-01-04

Abstract:
   This document describes a YANG data model to use with the Locator/ID
   Separation Protocol (LISP).


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-lisp-yang/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-ietf-lisp-yang-06
https://datatracker.ietf.org/doc/html/draft-ietf-lisp-yang-06

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-ietf-lisp-yang-06


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/


From nobody Thu Jan  4 09:00:49 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id E8F4712D849 for <lisp@ietfa.amsl.com>; Thu,  4 Jan 2018 09:00:46 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 1.559
X-Spam-Level: *
X-Spam-Status: No, score=1.559 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, FREEMAIL_REPLY=1, HTML_COMMENT_SAVED_URL=1.391, HTML_MESSAGE=0.001, HTML_TAG_BALANCE_BODY=1.157, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, T_HTML_ATTACH=0.01] autolearn=no autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id S7_lj2Y3P0qj for <lisp@ietfa.amsl.com>; Thu,  4 Jan 2018 09:00:37 -0800 (PST)
Received: from mail-pf0-x233.google.com (mail-pf0-x233.google.com [IPv6:2607:f8b0:400e:c00::233]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 09A1212778D for <lisp@ietf.org>; Thu,  4 Jan 2018 09:00:37 -0800 (PST)
Received: by mail-pf0-x233.google.com with SMTP id m26so993308pfj.11 for <lisp@ietf.org>; Thu, 04 Jan 2018 09:00:36 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=from:mime-version:subject:message-id:date:to; bh=CV1G8gHreQYr1RmSfF2VJoloQM/AhQ2dGtBWv7MRw60=; b=oYZrIf03z079aonDJgFMGI3PMBk8XD97H2fAbaaVhTM8//9gz9awLAkelyvK2xYbL5 fy/8MBFCaQTzcJ1gIw0/8P2Cpb0ajbCJmpoj1slWSz+HVjdx70jvv+9PuoiVg5WDQ7uy TdUOWXVRVc9vDo6CpLoBAaXYS+5ub/OVYG/UFYtlNppcwvn2Rp+UbWgJjive3gEZI84g 6RYgHsae9ICnAydRIuG+5D9rxlnDDFYZOtQWoygUDt0yhNW2VDDcSJh4rln9XqtWEw2I 4ktaO+AZGYvLK6y0sqTMPNoLlJBY5qh58RI0dOE8voqQNWlhvCgFlOLH9H16Rwv+5ktT LXIw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:mime-version:subject:message-id:date:to; bh=CV1G8gHreQYr1RmSfF2VJoloQM/AhQ2dGtBWv7MRw60=; b=EmizTt3okcLBOOFFHjDIFzhG2MpGRNZzF6yQoWKVU9/xoI0T3sYUujlsJbA1GYJGSf TI43hDH5Ptv7DkZ7yUwzEn7kmo7whuDblmP+sey7MkPImlc63DQU8EB+OHoCriDmCbh/ 6Vudh+2VCF8pomWpjjGwTHMyGaHNigYIxJ+lyPLZiQ/ku3X/04fRoui+HF43okgk5+BG dZN8JlznxT07WOnoGOpV4y2rgNoovjfS37JEWML5y8NnP4tawgJhTetJdx+gTsRvUl3+ ClVU9v5XiNCDGpr3Jyz/Pa7HO+kS0J0/z0k9rx7X8EDLeYVlNiTTS1gF0RDLnr/512mw 69Cw==
X-Gm-Message-State: AKGB3mJFfip+ZYNXy5IuX2zEWn48KKRp7Xdy5eV0os0+qlT1u86ZFzKV twmZKDe6hOzE5cjGD/SyC1E+lnLz
X-Google-Smtp-Source: ACJfBov5HONcpqxbRYGLWIDM/2UHfepnzkhjx6/hU5nJ5hJ3qPZUsKUtJSs9PkvxcKaIn+OUWr6SnA==
X-Received: by 10.98.29.216 with SMTP id d207mr165514pfd.221.1515085236435; Thu, 04 Jan 2018 09:00:36 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id r1sm10272697pfe.99.2018.01.04.09.00.34 for <lisp@ietf.org> (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Thu, 04 Jan 2018 09:00:35 -0800 (PST)
From: Dino Farinacci <farinacci@gmail.com>
Content-Type: multipart/mixed; boundary="Apple-Mail=_E476F244-D6BA-4A81-BC6E-81D7E56CFBEE"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Message-Id: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com>
Date: Thu, 4 Jan 2018 09:00:30 -0800
To: "lisp@ietf.org list" <lisp@ietf.org>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/7oIKE6-9B-tHbFx4fmbO6k_cGLI>
Subject: [lisp] Current changes for draft-ietf-lisp-rfc6830bis-08
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 04 Jan 2018 17:00:47 -0000

--Apple-Mail=_E476F244-D6BA-4A81-BC6E-81D7E56CFBEE
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=us-ascii

Is the working group okay with me submitting these changes? This was the =
latest update from email before the year ended. I have made most of the =
changes that Luigi suggested or requested.

Dino


--Apple-Mail=_E476F244-D6BA-4A81-BC6E-81D7E56CFBEE
Content-Disposition: attachment;
	filename=rfcdiff-rfc6830bis.html
Content-Type: text/html;
	x-unix-mode=0644;
	name="rfcdiff-rfc6830bis.html"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" =
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- saved from url=3D(0030)https://tools.ietf.org/rfcdiff -->
<html xmlns=3D"http://www.w3.org/1999/xhtml"><head><meta =
http-equiv=3D"Content-Type" content=3D"text/html; charset=3DUTF-8">=20
  =20
  <meta http-equiv=3D"Content-Style-Type" content=3D"text/css">=20
  <title>Diff: draft-ietf-lisp-rfc6830bis-07.txt - =
draft-ietf-lisp-rfc6830bis-08.txt</title>=20
  <style type=3D"text/css">=20
    body    { margin: 0.4ex; margin-right: auto; }=20
    tr      { }=20
    td      { white-space: pre; font-family: monospace; vertical-align: =
top; font-size: 0.86em;}=20
    th      { font-size: 0.86em; }=20
    .small  { font-size: 0.6em; font-style: italic; font-family: =
Verdana, Helvetica, sans-serif; }=20
    .left   { background-color: #EEE; }=20
    .right  { background-color: #FFF; }=20
    .diff   { background-color: #CCF; }=20
    .lblock { background-color: #BFB; }=20
    .rblock { background-color: #FF8; }=20
    .insert { background-color: #8FF; }=20
    .delete { background-color: #ACF; }=20
    .void   { background-color: #FFB; }=20
    .cont   { background-color: #EEE; }=20
    .linebr { background-color: #AAA; }=20
    .lineno { color: red; background-color: #FFF; font-size: 0.7em; =
text-align: right; padding: 0 2px; }=20
    .elipsis{ background-color: #AAA; }=20
    .left .cont { background-color: #DDD; }=20
    .right .cont { background-color: #EEE; }=20
    .lblock .cont { background-color: #9D9; }=20
    .rblock .cont { background-color: #DD6; }=20
    .insert .cont { background-color: #0DD; }=20
    .delete .cont { background-color: #8AD; }=20
    .stats, .stats td, .stats th { background-color: #EEE; padding: 2px =
0; }=20
    span.hide { display: none; color: #aaa;}    a:hover span { display: =
inline; }    tr.change { background-color: gray; }=20
    tr.change a { text-decoration: none; color: black }=20
  </style>=20
     <script>
var chunk_index =3D 0;
var old_chunk =3D null;

function format_chunk(index) {
    var prefix =3D "diff";
    var str =3D index.toString();
    for (x=3D0; x<(4-str.length); ++x) {
        prefix+=3D'0';
    }
    return prefix + str;
}

function find_chunk(n){
    return document.querySelector('tr[id$=3D"' + n + '"]');
}

function change_chunk(offset) {
    var index =3D chunk_index + offset;
    var new_str;
    var new_chunk;

    new_str =3D format_chunk(index);
    new_chunk =3D find_chunk(new_str);
    if (!new_chunk) {
        return;
    }
    if (old_chunk) {
        old_chunk.style.outline =3D "";
    }
    old_chunk =3D new_chunk;
    old_chunk.style.outline =3D "1px solid red";
    window.location.replace("#" + new_str)
    window.scrollBy(0,-100);
    chunk_index =3D index;
}

document.onkeydown =3D function(e) {
    switch (e.keyCode) {
    case 78:
        change_chunk(1);
        break;
    case 80:
        change_chunk(-1);
        break;
    }
};
   </script>=20
</head>=20
<body style=3D"">=20
  <table border=3D"0" cellpadding=3D"0" cellspacing=3D"0">=20
  <tbody><tr id=3D"part-1" bgcolor=3D"orange"><th></th><th><a =
href=3D"https://tools.ietf.org/rfcdiff?url2=3Ddraft-ietf-lisp-rfc6830bis-0=
7.txt" style=3D"color:#008; text-decoration:none;">&lt;</a>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-07.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-07.txt</a>&nbsp;</th><th> =
</th><th>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-08.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-08.txt</a>&nbsp;<a =
href=3D"https://tools.ietf.org/rfcdiff?url1=3Ddraft-ietf-lisp-rfc6830bis-0=
8.txt" style=3D"color:#008; =
text-decoration:none;">&gt;</a></th><th></th></tr>=20
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Network Working =
Group                                       D. Farinacci</td><td> =
</td><td class=3D"right">Network Working Group                           =
            D. Farinacci</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Internet-Draft    =
                                             V. Fuller</td><td> </td><td =
class=3D"right">Internet-Draft                                           =
      V. Fuller</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Intended status: =
Standards Track                                D. Meyer</td><td> =
</td><td class=3D"right">Intended status: Standards Track                =
                D. Meyer</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0001"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">Expires: <span =
class=3D"delete">May 15</span>, 2018                                     =
      D. Lewis</td><td> </td><td class=3D"rblock">Expires: <span =
class=3D"insert">July 8</span>, 2018                                     =
      D. Lewis</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                         Cisco Systems</td><td> </td><td =
class=3D"right">                                                         =
  Cisco Systems</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     A. Cabellos (Ed.)</td><td> </td><td =
class=3D"right">                                                       =
A. Cabellos (Ed.)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     UPC/BarcelonaTech</td><td> </td><td =
class=3D"right">                                                       =
UPC/BarcelonaTech</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0002"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                       <span class=3D"delete">November =
11, 2017</span></td><td> </td><td class=3D"rblock">                      =
                                 <span class=3D"insert">  January 4, =
2018</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">               =
The Locator/ID Separation Protocol (LISP)</td><td> </td><td =
class=3D"right">               The Locator/ID Separation Protocol =
(LISP)</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0003"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
     draft-ietf-lisp-rfc6830bis-0<span class=3D"delete">7</span></td><td> =
</td><td class=3D"rblock">                     =
draft-ietf-lisp-rfc6830bis-0<span class=3D"insert">8</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Abstract</td><td> =
</td><td class=3D"right">Abstract</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the data-plane protocol for the Locator/ID</td><td> </td><td =
class=3D"right">   This document describes the data-plane protocol for =
the Locator/ID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Separation =
Protocol (LISP).  LISP defines two namespaces, End-point</td><td> =
</td><td class=3D"right">   Separation Protocol (LISP).  LISP defines =
two namespaces, End-point</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs) that identify end-hosts and Routing Locators</td><td> </td><td =
class=3D"right">   Identifiers (EIDs) that identify end-hosts and =
Routing Locators</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (RLOCs) that =
identify network attachment points.  With this, LISP</td><td> </td><td =
class=3D"right">   (RLOCs) that identify network attachment points.  =
With this, LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   effectively =
separates control from data, and allows routers to create</td><td> =
</td><td class=3D"right">   effectively separates control from data, and =
allows routers to create</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   overlay =
networks.  LISP-capable routers exchange encapsulated packets</td><td> =
</td><td class=3D"right">   overlay networks.  LISP-capable routers =
exchange encapsulated packets</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0004"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   according to =
EID-to-RLOC mappings stored in a local map-cache.  <span =
class=3D"delete">The</span></td><td> </td><td class=3D"rblock">   =
according to EID-to-RLOC mappings stored in a local map-cache.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   map-cache is populated by the LISP Control-Plane =
protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [I-D.ietf-lisp-rfc6833bis].</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP requires =
no change to either host protocol stacks or to underlay</td><td> =
</td><td class=3D"right">   LISP requires no change to either host =
protocol stacks or to underlay</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   routers and =
offers Traffic Engineering, multihoming and mobility,</td><td> </td><td =
class=3D"right">   routers and offers Traffic Engineering, multihoming =
and mobility,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   among other =
features.</td><td> </td><td class=3D"right">   among other =
features.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Status of This =
Memo</td><td> </td><td class=3D"right">Status of This Memo</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This =
Internet-Draft is submitted in full conformance with the</td><td> =
</td><td class=3D"right">   This Internet-Draft is submitted in full =
conformance with the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   provisions of =
BCP 78 and BCP 79.</td><td> </td><td class=3D"right">   provisions of =
BCP 78 and BCP 79.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are working documents of the Internet =
Engineering</td><td> </td><td class=3D"right">   Internet-Drafts are =
working documents of the Internet Engineering</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Task Force =
(IETF).  Note that other groups may also distribute</td><td> </td><td =
class=3D"right">   Task Force (IETF).  Note that other groups may also =
distribute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   working =
documents as Internet-Drafts.  The list of current Internet-</td><td> =
</td><td class=3D"right">   working documents as Internet-Drafts.  The =
list of current Internet-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td> </td><td =
class=3D"right">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are draft documents valid for a maximum of six =
months</td><td> </td><td class=3D"right">   Internet-Drafts are draft =
documents valid for a maximum of six months</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and may be =
updated, replaced, or obsoleted by other documents at any</td><td> =
</td><td class=3D"right">   and may be updated, replaced, or obsoleted =
by other documents at any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   time.  It is =
inappropriate to use Internet-Drafts as reference</td><td> </td><td =
class=3D"right">   time.  It is inappropriate to use Internet-Drafts as =
reference</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   material or to =
cite them other than as "work in progress."</td><td> </td><td =
class=3D"right">   material or to cite them other than as "work in =
progress."</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0005"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   This =
Internet-Draft will expire on <span class=3D"delete">May 15</span>, =
2018.</td><td> </td><td class=3D"rblock">   This Internet-Draft will =
expire on <span class=3D"insert">July 8</span>, 2018.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Copyright =
Notice</td><td> </td><td class=3D"right">Copyright Notice</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0006"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Copyright =
(c) 201<span class=3D"delete">7</span> IETF Trust and the persons =
identified as the</td><td> </td><td class=3D"rblock">   Copyright (c) =
201<span class=3D"insert">8</span> IETF Trust and the persons identified =
as the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document =
authors.  All rights reserved.</td><td> </td><td class=3D"right">   =
document authors.  All rights reserved.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
is subject to BCP 78 and the IETF Trust's Legal</td><td> </td><td =
class=3D"right">   This document is subject to BCP 78 and the IETF =
Trust's Legal</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Provisions =
Relating to IETF Documents</td><td> </td><td class=3D"right">   =
Provisions Relating to IETF Documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
(https://trustee.ietf.org/license-info) in effect on the date =
of</td><td> </td><td class=3D"right">   =
(https://trustee.ietf.org/license-info) in effect on the date of</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   publication of =
this document.  Please review these documents</td><td> </td><td =
class=3D"right">   publication of this document.  Please review these =
documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   carefully, as =
they describe your rights and restrictions with respect</td><td> =
</td><td class=3D"right">   carefully, as they describe your rights and =
restrictions with respect</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to this =
document.  Code Components extracted from this document must</td><td> =
</td><td class=3D"right">   to this document.  Code Components extracted =
from this document must</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   include =
Simplified BSD License text as described in Section 4.e of</td><td> =
</td><td class=3D"right">   include Simplified BSD License text as =
described in Section 4.e of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the Trust =
Legal Provisions and are provided without warranty as</td><td> </td><td =
class=3D"right">   the Trust Legal Provisions and are provided without =
warranty as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   described in =
the Simplified BSD License.</td><td> </td><td class=3D"right">   =
described in the Simplified BSD License.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Table of =
Contents</td><td> </td><td class=3D"right">Table of Contents</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   =
3</td><td> </td><td class=3D"right">   1.  Introduction  . . . . . . . . =
. . . . . . . . . . . . . . . .   3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  =
Requirements Notation . . . . . . . . . . . . . . . . . . . .   =
4</td><td> </td><td class=3D"right">   2.  Requirements Notation . . . . =
. . . . . . . . . . . . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Definition =
of Terms . . . . . . . . . . . . . . . . . . . . .   4</td><td> </td><td =
class=3D"right">   3.  Definition of Terms . . . . . . . . . . . . . . . =
. . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   4.  Basic =
Overview  . . . . . . . . . . . . . . . . . . . . . . .   9</td><td> =
</td><td class=3D"right">   4.  Basic Overview  . . . . . . . . . . . . =
. . . . . . . . . . .   9</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     4.1.  Packet =
Flow Sequence  . . . . . . . . . . . . . . . . . .  11</td><td> </td><td =
class=3D"right">     4.1.  Packet Flow Sequence  . . . . . . . . . . . . =
. . . . . .  11</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   5.  LISP =
Encapsulation Details  . . . . . . . . . . . . . . . . .  13</td><td> =
</td><td class=3D"right">   5.  LISP Encapsulation Details  . . . . . . =
. . . . . . . . . . .  13</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0007"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.1.  LISP =
IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  <span =
class=3D"delete">14</span></td><td> </td><td class=3D"rblock">     5.1.  =
LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  <span =
class=3D"insert">13</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.2.  LISP =
IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  <span =
class=3D"delete">15</span></td><td> </td><td class=3D"rblock">     5.2.  =
LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  <span =
class=3D"insert">14</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.3.  =
Tunnel Header Field Descriptions  . . . . . . . . . . . .  <span =
class=3D"delete">16</span></td><td> </td><td class=3D"rblock">     5.3.  =
Tunnel Header Field Descriptions  . . . . . . . . . . . .  <span =
class=3D"insert">15</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   6.  LISP =
EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">20</span></td><td> </td><td class=3D"rblock">   6.  =
LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">19</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  Dealing =
with Large Encapsulated Packets . . . . . . . . . . .  20</td><td> =
</td><td class=3D"right">   7.  Dealing with Large Encapsulated Packets =
. . . . . . . . . . .  20</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0008"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.1.  A =
Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"delete">21</span></td><td> </td><td class=3D"rblock">     7.1.  =
A Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"insert">20</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.2.  A =
Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"delete">22</span></td><td> </td><td class=3D"rblock">     7.2.  =
A Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"insert">21</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   8.  Using =
Virtualization and Segmentation with LISP . . . . . . .  22</td><td> =
</td><td class=3D"right">   8.  Using Virtualization and Segmentation =
with LISP . . . . . . .  22</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  Routing =
Locator Selection . . . . . . . . . . . . . . . . . .  23</td><td> =
</td><td class=3D"right">   9.  Routing Locator Selection . . . . . . . =
. . . . . . . . . . .  23</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   10. Routing =
Locator Reachability  . . . . . . . . . . . . . . . .  24</td><td> =
</td><td class=3D"right">   10. Routing Locator Reachability  . . . . . =
. . . . . . . . . . .  24</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.1.  Echo =
Nonce Algorithm . . . . . . . . . . . . . . . . . .  27</td><td> =
</td><td class=3D"right">     10.1.  Echo Nonce Algorithm . . . . . . . =
. . . . . . . . . . .  27</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.2.  =
RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28</td><td> =
</td><td class=3D"right">     10.2.  RLOC-Probing Algorithm . . . . . . =
. . . . . . . . . . .  28</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   11. EID =
Reachability within a LISP Site . . . . . . . . . . . . .  29</td><td> =
</td><td class=3D"right">   11. EID Reachability within a LISP Site . . =
. . . . . . . . . . .  29</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0009"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   12. Routing =
Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">30</span></td><td> </td><td class=3D"rblock">   12. =
Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">29</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   13. Changing =
the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"delete">31</span></td><td> </td><td class=3D"rblock">   13. =
Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"insert">30</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.1.  =
Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">32</span></td><td> </td><td class=3D"rblock">     13.1. =
 Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">31</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     13.2.  =
Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  32</td><td> =
</td><td class=3D"right">     13.2.  Solicit-Map-Request (SMR)  . . . . =
. . . . . . . . . . .  32</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0010"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.3.  =
Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">34</span></td><td> </td><td class=3D"rblock">     13.3. =
 Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">33</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">35</span></td><td> </td><td class=3D"rblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">34</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   15. Router =
Performance Considerations . . . . . . . . . . . . . .  35</td><td> =
</td><td class=3D"right">   15. Router Performance Considerations . . . =
. . . . . . . . . . .  35</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0011"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   16. Mobility =
Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"delete">6</span></td><td> </td><td class=3D"rblock">   16. =
Mobility Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"insert">5</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.1.  Slow =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.1.  Slow Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.2.  Fast =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.2.  Fast Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.3.  LISP =
Mobile Node Mobility  . . . . . . . . . . . . . . .  37</td><td> =
</td><td class=3D"right">     16.3.  LISP Mobile Node Mobility  . . . . =
. . . . . . . . . . .  37</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0012"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   17. LISP xTR =
Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"delete">38</span></td><td> </td><td class=3D"rblock">   17. =
LISP xTR Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"insert">37</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.1.  =
First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">39</span></td><td> </td><td class=3D"rblock">     17.1. =
 First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">38</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.2.  =
Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  39</td><td> =
</td><td class=3D"right">     17.2.  Border/Edge xTRs . . . . . . . . . =
. . . . . . . . . . .  39</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0013"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.3.  ISP =
Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"delete">40</span></td><td> </td><td class=3D"rblock">     17.3. =
 ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"insert">39</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.4.  LISP =
Functionality with Conventional NATs  . . . . . . .  40</td><td> =
</td><td class=3D"right">     17.4.  LISP Functionality with =
Conventional NATs  . . . . . . .  40</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0014"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.5.  =
Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"delete">41</span></td><td> </td><td class=3D"rblock">     17.5. =
 Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"insert">40</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">41</span></td><td> </td><td class=3D"rblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">40</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.1.  =
IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">42</span></td><td> </td><td class=3D"rblock">     18.1. =
 IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">41</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     18.2.  IPv4 =
Traceroute  . . . . . . . . . . . . . . . . . . . .  42</td><td> =
</td><td class=3D"right">     18.2.  IPv4 Traceroute  . . . . . . . . . =
. . . . . . . . . . .  42</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0015"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"delete">3</span></td><td> </td><td class=3D"rblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"insert">2</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   19. Security =
Considerations . . . . . . . . . . . . . . . . . . .  43</td><td> =
</td><td class=3D"right">   19. Security Considerations . . . . . . . . =
. . . . . . . . . . .  43</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0016"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   20. Network =
Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"delete">4</span></td><td> </td><td class=3D"rblock">   20. =
Network Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"insert">3</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   21. IANA =
Considerations . . . . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">   21. IANA Considerations . . . . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     21.1.  LISP =
UDP Port Numbers  . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     21.1.  LISP UDP Port Numbers  . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   22. References =
 . . . . . . . . . . . . . . . . . . . . . . . . .  44</td><td> </td><td =
class=3D"right">   22. References  . . . . . . . . . . . . . . . . . . . =
. . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     22.1.  =
Normative References . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     22.1.  Normative References . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0017"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     22.2.  =
Informative References . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">47</span></td><td> </td><td class=3D"rblock">     22.2. =
 Informative References . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">45</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix A.  =
Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">51</span></td><td> </td><td class=3D"rblock">   =
Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix B.  =
Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">51</span></td><td> </td><td class=3D"rblock">   =
Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.1.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.1.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.2.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.2.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-07</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.3.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-05</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.3.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-06</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.4.  =
Changes to draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  52</td><td> =
</td><td class=3D"rblock">     B.4.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  =
51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     <span =
class=3D"delete">B.5.</span>  Changes to draft-ietf-lisp-rfc6830bis-03  =
. . . . . . . .  <span class=3D"delete">53</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">     B.5.  Changes to</span> =
draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  52</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.6.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock">     <span =
class=3D"insert">B.6.</span>  Changes to draft-ietf-lisp-rfc6830bis-03  =
. . . . . . . .  <span class=3D"insert">52</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Authors' =
Addresses  . . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.9.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   Authors' Addresses  . . . . . . . . . . . . =
. . . . . . . . . . .  <span class=3D"insert">52</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">1.  =
Introduction</td><td> </td><td class=3D"right">1.  Introduction</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the Locator/Identifier Separation Protocol</td><td> </td><td =
class=3D"right">   This document describes the Locator/Identifier =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (LISP).  LISP =
is an encapsulation protocol built around the</td><td> </td><td =
class=3D"right">   (LISP).  LISP is an encapsulation protocol built =
around the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fundamental =
idea of separating the topological location of a network</td><td> =
</td><td class=3D"right">   fundamental idea of separating the =
topological location of a network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
point from the node's identity [CHIAPPA].  As a result</td><td> </td><td =
class=3D"right">   attachment point from the node's identity [CHIAPPA].  =
As a result</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP creates =
two namespaces: Endpoint Identifiers (EIDs), that are</td><td> </td><td =
class=3D"right">   LISP creates two namespaces: Endpoint Identifiers =
(EIDs), that are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   used to =
identify end-hosts (e.g., nodes or Virtual Machines) and</td><td> =
</td><td class=3D"right">   used to identify end-hosts (e.g., nodes or =
Virtual Machines) and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   routable =
Routing Locators (RLOCs), used to identify network</td><td> </td><td =
class=3D"right">   routable Routing Locators (RLOCs), used to identify =
network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
points.  LISP then defines functions for mapping between</td><td> =
</td><td class=3D"right">   attachment points.  LISP then defines =
functions for mapping between</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the two =
namespaces and for encapsulating traffic originated by</td><td> </td><td =
class=3D"right">   the two namespaces and for encapsulating traffic =
originated by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   devices using =
non-routable EIDs for transport across a network</td><td> </td><td =
class=3D"right">   devices using non-routable EIDs for transport across =
a network</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0018"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
infrastructure that routes and forwards using RLOCs.</td><td> </td><td =
class=3D"rblock">   infrastructure that routes and forwards using RLOCs. =
 <span class=3D"insert">LISP</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   encapsulation uses a =
dynamic form of tunneling where no static</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   provisioning is =
required or necessary.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP is an =
overlay protocol that separates control from data-plane,</td><td> =
</td><td class=3D"right">   LISP is an overlay protocol that separates =
control from data-plane,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   this document =
specifies the data-plane, how LISP-capable routers</td><td> </td><td =
class=3D"right">   this document specifies the data-plane, how =
LISP-capable routers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (Tunnel =
Routers) exchange packets by encapsulating them to the</td><td> </td><td =
class=3D"right">   (Tunnel Routers) exchange packets by encapsulating =
them to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   appropriate =
location.  Tunnel routers are equipped with a cache,</td><td> </td><td =
class=3D"right">   appropriate location.  Tunnel routers are equipped =
with a cache,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   called =
map-cache, that contains EID-to-RLOC mappings.  The map-cache</td><td> =
</td><td class=3D"right">   called map-cache, that contains EID-to-RLOC =
mappings.  The map-cache</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is populated =
using the LISP Control-Plane protocol</td><td> </td><td class=3D"right"> =
  is populated using the LISP Control-Plane protocol</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis].</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP does not =
require changes to either host protocol stack or to</td><td> </td><td =
class=3D"right">   LISP does not require changes to either host protocol =
stack or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-2" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> =
page 4, line 31<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> page 4, line 33<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   describes the =
LISP architecture.</td><td> </td><td class=3D"right">   describes the =
LISP architecture.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">2.  Requirements =
Notation</td><td> </td><td class=3D"right">2.  Requirements =
Notation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The key words =
"MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",</td><td> </td><td =
class=3D"right">   The key words "MUST", "MUST NOT", "REQUIRED", =
"SHALL", "SHALL NOT",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   "SHOULD", =
"SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this</td><td> =
</td><td class=3D"right">   "SHOULD", "SHOULD NOT", "RECOMMENDED", =
"MAY", and "OPTIONAL" in this</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document are =
to be interpreted as described in [RFC2119].</td><td> </td><td =
class=3D"right">   document are to be interpreted as described in =
[RFC2119].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">3.  Definition of =
Terms</td><td> </td><td class=3D"right">3.  Definition of Terms</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0019"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Provider-Independent (PI) Addresses:   PI addresses =
are</span> an address</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Address Family Identifier (AFI):   AFI is a term used =
to describe</span> an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">block assigned from a pool where blocks are not =
associated with</span></td><td> </td><td class=3D"rblock">      address =
<span class=3D"insert">encoding</span> in a <span class=3D"insert">packet.=
  An address family that pertains to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      any particular location</span> in <span =
class=3D"delete">the network (e.g., from</span> a <span =
class=3D"delete">particular</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      the data-plane.  See =
[AFN]</span> and <span class=3D"insert">[RFC3232] for details.  An =
AFI</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      service provider)</span> and <span =
class=3D"delete">are therefore not topologically =
aggregatable</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      value of 0 used</span> in <span =
class=3D"insert">this specification indicates an =
unspecified</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      in the =
<span class=3D"delete">routing system.</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      encoded address where the =
length of the address is 0 octets</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      following</span> =
the <span class=3D"insert">16-bit AFI value of 0.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0020"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Provider-Assigned (PA) Addresses:   PA addresses are an =
address block</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Anycast Address:  Anycast Address</span> is a <span =
class=3D"insert">term used in this document to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      assigned to a site by each service provider to =
which a site</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      refer to</span> the <span class=3D"insert">same =
IPv4 or IPv6 address configured and used on</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      connects.  Typically, each block</span> is a =
<span class=3D"delete">sub-block of a service</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      multiple systems at</span> =
the <span class=3D"insert">same time.  An EID or RLOC can be =
an</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      provider Classless Inter-Domain Routing (CIDR) =
[RFC4632] block and</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      anycast address in</span> each <span =
class=3D"insert">of their</span> own address <span =
class=3D"insert">spaces.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      is aggregated into</span> the <span =
class=3D"delete">larger block before being advertised =
into</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the <span =
class=3D"delete">global Internet.  Traditionally, IP multihoming has =
been</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      implemented by</span> each <span =
class=3D"delete">multihomed site acquiring its</span> own <span =
class=3D"delete">globally</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      visible prefix.  LISP uses only topologically =
assigned and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      aggregatable</span> address <span =
class=3D"delete">blocks for RLOCs, eliminating this</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      demonstrably non-scalable =
practice.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0021"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Routing Locator (RLOC):   An RLOC</span> is an <span =
class=3D"delete">IPv4 [RFC0791] or IPv6</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Client-side:  =
Client-side</span> is <span class=3D"insert">a term used in this =
document to indicate</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      [RFC8200]</span> address of an Egress Tunnel =
Router <span class=3D"delete">(ETR).</span>  An <span =
class=3D"delete">RLOC</span> is</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      a connection initiation attempt by</span> an =
<span class=3D"insert">EID.  The ITR(s) at the LISP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">the output of</span> an <span =
class=3D"delete">EID-to-RLOC mapping lookup.  An EID maps to</span> =
one</td><td> </td><td class=3D"rblock"><span class=3D"insert">      site =
are the first to get involved in forwarding a packet from =
the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">or more</span> RLOCs.  <span class=3D"delete">Typically, =
RLOCs are numbered</span> from <span =
class=3D"delete">topologically</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      source EID.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      aggregatable blocks that are assigned</span> to =
<span class=3D"delete">a</span> site <span class=3D"delete">at each =
point</span> to</td><td> </td><td class=3D"rblock"><span =
class=3D"insert"></span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">which it attaches</span> to the global <span =
class=3D"delete">Internet; where</span> the <span =
class=3D"delete">topology is</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">   Data-Probe:   A Data-Probe is =
a LISP-encapsulated data packet where</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      defined by</span> the <span =
class=3D"delete">connectivity</span> of <span class=3D"delete">provider =
networks, RLOCs</span> can be</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      the inner-header destination address equals the =
outer-header</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">thought</span> of <span class=3D"delete">as PA</span> =
addresses.  <span class=3D"delete">Multiple RLOCs</span> can be <span =
class=3D"delete">assigned</span> to the</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      destination</span> address =
<span class=3D"insert">used to trigger a Map-Reply by a =
decapsulating</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">same ETR</span> device or <span class=3D"delete">to =
multiple ETR devices at</span> a <span =
class=3D"delete">site.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      ETR.  In addition, the original packet is =
decapsulated and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      delivered to the =
destination host if the destination EID is in the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      EID-Prefix range =
configured on the ETR.  Otherwise, the packet is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      discarded.  A =
Data-Probe is used in some</span> of <span class=3D"insert">the mapping =
database</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      designs to =
"probe" or request a Map-Reply from</span> an <span class=3D"insert">ETR; =
in other</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      cases, =
Map-Requests are used.  See each mapping database design</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      for details.  =
When using Data-Probes, by sending Map-Requests on</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the underlying =
routing system, EID-Prefixes must be advertised.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   Egress Tunnel Router <span =
class=3D"insert">(ETR):</span>   An <span class=3D"insert">ETR</span> is =
<span class=3D"insert">a router that accepts</span> an <span =
class=3D"insert">IP</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      packet where the =
destination address in the "outer" IP header is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      one <span class=3D"insert">of its =
own</span> RLOCs.  <span class=3D"insert">The router strips the "outer" =
header and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      forwards the =
packet based on the next IP header found.  In</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      general, an ETR =
receives LISP-encapsulated IP packets</span> from <span =
class=3D"insert">the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      Internet on one =
side and sends decapsulated IP packets</span> to site</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">end-systems on =
the other side.  ETR functionality does not have</span> to</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">be limited</span> =
to <span class=3D"insert">a router device.  A server host can be</span> =
the <span class=3D"insert">endpoint</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of a LISP tunnel =
as well.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-to-RLOC =
Database:   The EID-to-RLOC Database is a</span> global</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">distributed =
database that contains all known EID-Prefix-to-RLOC</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      mappings.  Each =
potential ETR typically contains a small piece of</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      the <span class=3D"insert">database: the =
EID-to-RLOC mappings for the EID-Prefixes</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      "behind" the =
router.  These map to one of the router's own</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      globally visible =
IP addresses.  Note that there MAY be transient</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      conditions when =
the EID-Prefix for the site and Locator-Set for</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      each EID-Prefix =
may not be</span> the <span class=3D"insert">same on all ETRs.  This has =
no</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      negative =
implications, since a partial set</span> of <span =
class=3D"insert">Locators</span> can be</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span =
class=3D"insert">used.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-to-RLOC =
Map-Cache:   The EID-to-RLOC map-cache is generally</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      short-lived, =
on-demand table in an ITR that stores, tracks, and is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      responsible for =
timing out and otherwise validating EID-to-RLOC</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      mappings.  This =
cache is distinct from the full "database"</span> of <span =
class=3D"insert">EID-</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      to-RLOC mappings; =
it is dynamic, local to the ITR(s), and</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      relatively small, =
while the database is distributed, relatively</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      static, and much =
more global in scope.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-Prefix:   An =
EID-Prefix is a power-of-two block of EIDs that are</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      allocated to a =
site by an address allocation authority.  EID-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      Prefixes are =
associated with a set of RLOC</span> addresses.  <span =
class=3D"insert">EID-Prefix</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
allocations</span> can be <span class=3D"insert">broken up into smaller =
blocks when an RLOC set</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      is</span> to =
<span class=3D"insert">be associated with</span> the <span =
class=3D"insert">larger EID-Prefix block.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   End-System:   An =
end-system is an IPv4 or IPv6</span> device <span class=3D"insert">that =
originates</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      packets with a =
single IPv4</span> or <span class=3D"insert">IPv6 header.  The =
end-system</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      supplies an EID =
value for the destination address field of the IP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header when =
communicating globally (i.e., outside of its routing</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      domain).  An =
end-system can be</span> a <span class=3D"insert">host computer, a =
switch or router</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      device, or any =
network appliance.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Endpoint ID =
(EID):   An EID is a 32-bit (for IPv4) or 128-bit (for</td><td> </td><td =
class=3D"right">   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or =
128-bit (for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      IPv6) value =
used in the source and destination address fields of</td><td> </td><td =
class=3D"right">      IPv6) value used in the source and destination =
address fields of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the first =
(most inner) LISP header of a packet.  The host obtains</td><td> =
</td><td class=3D"right">      the first (most inner) LISP header of a =
packet.  The host obtains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a =
destination EID the same way it obtains a destination address</td><td> =
</td><td class=3D"right">      a destination EID the same way it obtains =
a destination address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      today, for =
example, through a Domain Name System (DNS) [RFC1034]</td><td> </td><td =
class=3D"right">      today, for example, through a Domain Name System =
(DNS) [RFC1034]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      lookup or =
Session Initiation Protocol (SIP) [RFC3261] exchange.</td><td> </td><td =
class=3D"right">      lookup or Session Initiation Protocol (SIP) =
[RFC3261] exchange.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      The source =
EID is obtained via existing mechanisms used to set a</td><td> </td><td =
class=3D"right">      The source EID is obtained via existing mechanisms =
used to set a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      host's =
"local" IP address.  An EID used on the public Internet</td><td> =
</td><td class=3D"right">      host's "local" IP address.  An EID used =
on the public Internet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      must have =
the same properties as any other IP address used in that</td><td> =
</td><td class=3D"right">      must have the same properties as any =
other IP address used in that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      manner; =
this means, among other things, that it must be globally</td><td> =
</td><td class=3D"right">      manner; this means, among other things, =
that it must be globally</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      unique.  An =
EID is allocated to a host from an EID-Prefix block</td><td> </td><td =
class=3D"right">      unique.  An EID is allocated to a host from an =
EID-Prefix block</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      associated =
with the site where the host is located.  An EID can be</td><td> =
</td><td class=3D"right">      associated with the site where the host =
is located.  An EID can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      used by a =
host to refer to other hosts.  Note that EID blocks MAY</td><td> =
</td><td class=3D"right">      used by a host to refer to other hosts.  =
Note that EID blocks MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      be assigned =
in a hierarchical manner, independent of the network</td><td> </td><td =
class=3D"right">      be assigned in a hierarchical manner, independent =
of the network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      topology, =
to facilitate scaling of the mapping database.  In</td><td> </td><td =
class=3D"right">      topology, to facilitate scaling of the mapping =
database.  In</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0022"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      addition, =
an EID block assigned to a site <span class=3D"delete">may</span> have =
site-local</td><td> </td><td class=3D"rblock">      addition, an EID =
block assigned to a site <span class=3D"insert">MAY</span> have =
site-local</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      structure =
(subnetting) for routing within the site; this structure</td><td> =
</td><td class=3D"right">      structure (subnetting) for routing within =
the site; this structure</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is not =
visible to the global routing system.  In theory, the bit</td><td> =
</td><td class=3D"right">      is not visible to the global routing =
system.  In theory, the bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      string that =
represents an EID for one device can represent an RLOC</td><td> </td><td =
class=3D"right">      string that represents an EID for one device can =
represent an RLOC</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0023"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      for a =
different device.  <span class=3D"delete">As the architecture is =
realized, if a</span></td><td> </td><td class=3D"rblock">      for a =
different device.  When used in discussions with other</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      given bit string is both an RLOC and an EID, it =
must refer to the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      same entity in both cases.</span>  When used in =
discussions with other</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Locator/ID =
separation proposals, a LISP EID will be called an</td><td> </td><td =
class=3D"right">      Locator/ID separation proposals, a LISP EID will =
be called an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      "LEID".  =
Throughout this document, any references to "EID" refer</td><td> =
</td><td class=3D"right">      "LEID".  Throughout this document, any =
references to "EID" refer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to an =
LEID.</td><td> </td><td class=3D"right">      to an LEID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0024"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">EID-Prefix:   An EID-Prefix is a power-of-two block of =
EIDs that are</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      allocated to a site by an address allocation =
authority.  EID-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Prefixes are associated with a set of RLOC =
addresses that make up</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      a "database mapping".  EID-Prefix allocations can =
be broken up</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      into smaller blocks when an RLOC set is to be =
associated with the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      larger EID-Prefix block.  A globally routed =
address block (whether</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      PI or PA) is not inherently an EID-Prefix.  A =
globally routed</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      address block MAY be used by its assignee as an =
EID block.  The</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      converse is not supported.  That is, a site that =
receives an</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      explicitly allocated EID-Prefix may not use that =
EID-Prefix as a</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally routed prefix.  This would require =
coordination and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      cooperation with the entities managing the =
mapping infrastructure.</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Once this has been done, that block could be =
removed from the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally routed IP system, if other suitable =
transition and access</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mechanisms are in place.  Discussion of such =
transition and access</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mechanisms can be found in [RFC6832] and =
[RFC7215].</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   End-system:   An end-system is an IPv4 or IPv6 =
device that originates</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      packets with a single IPv4 or IPv6 header.  The =
end-system</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      supplies an EID value for the destination address =
field of the IP</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      header when communicating globally (i.e., outside =
of its routing</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      domain).  An end-system can be a host computer, a =
switch or router</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      device, or any network appliance.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Ingress Tunnel =
Router (ITR):   An ITR is a router that resides in a</td><td> </td><td =
class=3D"right">   Ingress Tunnel Router (ITR):   An ITR is a router =
that resides in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      LISP site.  =
Packets sent by sources inside of the LISP site to</td><td> </td><td =
class=3D"right">      LISP site.  Packets sent by sources inside of the =
LISP site to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
destinations outside of the site are candidates for =
encapsulation</td><td> </td><td class=3D"right">      destinations =
outside of the site are candidates for encapsulation</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      by the ITR. =
 The ITR treats the IP destination address as an EID</td><td> </td><td =
class=3D"right">      by the ITR.  The ITR treats the IP destination =
address as an EID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      and =
performs an EID-to-RLOC mapping lookup.  The router then</td><td> =
</td><td class=3D"right">      and performs an EID-to-RLOC mapping =
lookup.  The router then</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      prepends an =
"outer" IP header with one of its routable RLOCs (in</td><td> </td><td =
class=3D"right">      prepends an "outer" IP header with one of its =
routable RLOCs (in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the RLOC =
space) in the source address field and the result of the</td><td> =
</td><td class=3D"right">      the RLOC space) in the source address =
field and the result of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      mapping =
lookup in the destination address field.  Note that this</td><td> =
</td><td class=3D"right">      mapping lookup in the destination address =
field.  Note that this</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
RLOC MAY be an intermediate, proxy device that has</td><td> </td><td =
class=3D"right">      destination RLOC MAY be an intermediate, proxy =
device that has</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      better =
knowledge of the EID-to-RLOC mapping closer to the</td><td> </td><td =
class=3D"right">      better knowledge of the EID-to-RLOC mapping closer =
to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-3" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> =
page 6, line 33<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> page 7, line 5<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      end-systems =
on one side and sends LISP-encapsulated IP packets</td><td> </td><td =
class=3D"right">      end-systems on one side and sends =
LISP-encapsulated IP packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      toward the =
Internet on the other side.</td><td> </td><td class=3D"right">      =
toward the Internet on the other side.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Specifically, when a service provider prepends a LISP header =
for</td><td> </td><td class=3D"right">      Specifically, when a service =
provider prepends a LISP header for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Traffic =
Engineering purposes, the router that does this is also</td><td> =
</td><td class=3D"right">      Traffic Engineering purposes, the router =
that does this is also</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      regarded as =
an ITR.  The outer RLOC the ISP ITR uses can be based</td><td> </td><td =
class=3D"right">      regarded as an ITR.  The outer RLOC the ISP ITR =
uses can be based</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      on the =
outer destination address (the originating ITR's supplied</td><td> =
</td><td class=3D"right">      on the outer destination address (the =
originating ITR's supplied</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      RLOC) or =
the inner destination address (the originating host's</td><td> </td><td =
class=3D"right">      RLOC) or the inner destination address (the =
originating host's</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      supplied =
EID).</td><td> </td><td class=3D"right">      supplied EID).</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0025"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">TE-ITR:   A TE-ITR is an ITR that is deployed in a =
service provider</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">LISP Header:</span>   LISP header is a <span =
class=3D"insert">term used</span> in <span class=3D"insert">this =
document</span> to <span class=3D"insert">refer</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      network that prepends an additional</span> LISP =
header <span class=3D"delete">for Traffic</span></td><td> </td><td =
class=3D"rblock">      to the <span class=3D"insert">outer IPv4 or IPv6 =
header,</span> a <span class=3D"insert">UDP header, and</span> a <span =
class=3D"insert">LISP-</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Engineering purposes.</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      specific 8-octet</span> =
header that <span class=3D"insert">follow</span> the <span =
class=3D"insert">UDP header</span> and <span class=3D"insert">that</span> =
an <span class=3D"insert">ITR</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      prepends or</span> an ETR <span =
class=3D"insert">strips.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Egress Tunnel Router (ETR):   An ETR</span> is a =
<span class=3D"delete">router that accepts an IP</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      packet where the destination address</span> in =
<span class=3D"delete">the "outer" IP header is</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      one of its own RLOCs.  The router strips the =
"outer" header and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      forwards the packet based on the next IP header =
found.  In</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      general, an ETR receives LISP-encapsulated IP =
packets from the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Internet on one side and sends decapsulated IP =
packets to site</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      end-systems on the other side.  ETR functionality =
does not have</span> to</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">be limited</span> to <span class=3D"delete">a router =
device.  A server host can be</span> the <span =
class=3D"delete">endpoint</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      of</span> a <span class=3D"delete">LISP tunnel as =
well.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   TE-ETR:   A TE-ETR is an ETR that is deployed =
in</span> a <span class=3D"delete">service provider</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      network that strips an outer LISP</span> header =
<span class=3D"delete">for Traffic Engineering</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      purposes.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   xTR:   An xTR is a reference to an ITR or ETR when =
direction of data</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      flow is not part of the context description.  =
"xTR" refers to the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      router</span> that <span class=3D"delete">is the =
tunnel endpoint and is used synonymously with</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the term "Tunnel Router".  For example, "An xTR =
can be located at</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the <span =
class=3D"delete">Customer Edge (CE) router" indicates both ITR</span> =
and <span class=3D"delete">ETR</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      functionality at the CE router.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Re-encapsulating Tunneling in RTRs:   =
Re-encapsulating Tunneling</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      occurs when</span> an <span class=3D"delete">RTR =
(Re-encapsulating Tunnel Router) acts like</span> an</td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      ETR <span =
class=3D"delete">to remove a LISP header, then acts as an ITR to prepend =
a new</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP header.  Doing this allows a packet to be =
re-routed by the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      RTR without adding the overhead of additional =
tunnel headers.  Any</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      references to tunnels in this specification refer =
to dynamic</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      encapsulating tunnels; they are never statically =
configured.  When</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      using multiple mapping database systems, care =
must be taken to not</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      create re-encapsulation loops through =
misconfiguration.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP Router:   =
A LISP router is a router that performs the functions</td><td> </td><td =
class=3D"right">   LISP Router:   A LISP router is a router that =
performs the functions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of any or =
all of the following: ITR, ETR, RTR, Proxy-ITR (PITR),</td><td> </td><td =
class=3D"right">      of any or all of the following: ITR, ETR, RTR, =
Proxy-ITR (PITR),</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      or =
Proxy-ETR (PETR).</td><td> </td><td class=3D"right">      or Proxy-ETR =
(PETR).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0026"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">EID-to-RLOC Map-Cache:   The EID-to-RLOC map-cache is =
generally</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">LISP Site:  LISP</span> site <span =
class=3D"insert">is</span> a set of <span class=3D"insert">routers =
in</span> an <span class=3D"insert">edge network that</span> are</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      short-lived, on-demand table in an ITR that =
stores, tracks, and is</span></td><td> </td><td class=3D"rblock">      =
<span class=3D"insert">under a single technical administration.  LISP =
routers that reside</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      responsible for timing out and otherwise =
validating EID-to-RLOC</span></td><td> </td><td class=3D"rblock">      =
in the <span class=3D"insert">edge network</span> are <span =
class=3D"insert">the demarcation points</span> to <span =
class=3D"insert">separate</span> the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings.  This cache is distinct from the full =
"database" of EID-</span></td><td> </td><td class=3D"rblock">      <span =
class=3D"insert">edge network from</span> the <span class=3D"insert">core =
network.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      to-RLOC mappings; it is dynamic, local to the =
ITR(s), and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      relatively small, while the database is =
distributed, relatively</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      static, and much more global in =
scope.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   EID-to-RLOC Database:   The EID-to-RLOC Database is =
a global</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      distributed database that contains all known =
EID-Prefix-to-RLOC</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings.  Each potential ETR typically contains =
a small piece of</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the database: the EID-to-RLOC mappings for the =
EID-Prefixes</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      "behind" the router.  These map to one of the =
router's own</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally visible IP addresses.  Note that there =
MAY be transient</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      conditions when the EID-Prefix for the</span> =
site <span class=3D"delete">and Locator-Set for</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      each EID-Prefix may not be the same on all ETRs.  =
This has no</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      negative implications, since</span> a <span =
class=3D"delete">partial</span> set of <span class=3D"delete">Locators =
can be</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      used.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Recursive Tunneling:   Recursive Tunneling occurs =
when a packet has</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      more than one LISP IP header.  Additional layers =
of tunneling MAY</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      be employed to implement Traffic Engineering or =
other re-routing</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      as needed.  When this is done,</span> an <span =
class=3D"delete">additional "outer" LISP header</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      is added, and the original RLOCs</span> are <span =
class=3D"delete">preserved</span> in the <span =
class=3D"delete">"inner"</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      header.  Any references to tunnels in this =
specification refer to</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      dynamic encapsulating tunnels; they</span> are =
<span class=3D"delete">never statically</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      configured.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   LISP Header:   LISP header is a term used in this =
document to refer</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      to the =
<span class=3D"delete">outer IPv4 or IPv6 header, a UDP header, and a =
LISP-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      specific 8-octet header that follow</span> the =
<span class=3D"delete">UDP header and that an ITR</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      prepends or an ETR strips.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0027"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Address Family Identifier (AFI):   AFI is a term</span> =
used to <span class=3D"delete">describe an</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Locator-Status-Bits (LSBs):  =
Locator-Status-Bits are present in the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      address encoding in</span> a <span =
class=3D"delete">packet.  An address family that pertains</span> =
to</td><td> </td><td class=3D"rblock"><span class=3D"insert">      LISP =
header.  They are</span> used <span class=3D"insert">by ITRs</span> to =
<span class=3D"insert">inform ETRs about the up/</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">the data-plane.  See [AFN]</span> and <span =
class=3D"delete">[RFC3232] for details.  An AFI</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      down status of all ETRs at =
the local site.  These bits are used as</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      value</span> of <span class=3D"delete">0 used in =
this specification indicates an unspecified</span></td><td> </td><td =
class=3D"rblock">      a <span class=3D"insert">hint</span> to <span =
class=3D"insert">convey up/down router status</span> and <span =
class=3D"insert">not path reachability</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      encoded address where the length</span> of the =
<span class=3D"delete">address is 0 octets</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      status.  The LSBs can be =
verified by use</span> of <span class=3D"insert">one</span> of the <span =
class=3D"insert">Locator</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      following the 16-bit AFI value of =
0.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">     =
 reachability algorithms described in Section 10.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Negative =
Mapping Entry:   A negative mapping entry, also known as a</td><td> =
</td><td class=3D"right">   Negative Mapping Entry:   A negative mapping =
entry, also known as a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      negative =
cache entry, is an EID-to-RLOC entry where an EID-Prefix</td><td> =
</td><td class=3D"right">      negative cache entry, is an EID-to-RLOC =
entry where an EID-Prefix</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is =
advertised or stored with no RLOCs.  That is, the Locator-Set</td><td> =
</td><td class=3D"right">      is advertised or stored with no RLOCs.  =
That is, the Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      for the =
EID-to-RLOC entry is empty or has an encoded Locator count</td><td> =
</td><td class=3D"right">      for the EID-to-RLOC entry is empty or has =
an encoded Locator count</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of 0.  This =
type of entry could be used to describe a prefix from</td><td> </td><td =
class=3D"right">      of 0.  This type of entry could be used to =
describe a prefix from</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a non-LISP =
site, which is explicitly not in the mapping database.</td><td> </td><td =
class=3D"right">      a non-LISP site, which is explicitly not in the =
mapping database.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      There are a =
set of well-defined actions that are encoded in a</td><td> </td><td =
class=3D"right">      There are a set of well-defined actions that are =
encoded in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Negative =
Map-Reply.</td><td> </td><td class=3D"right">      Negative =
Map-Reply.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0028"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Data-Probe:   A Data-Probe is a LISP-encapsulated data =
packet where</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Provider-Assigned (PA) Addresses:   PA addresses are =
an</span> address <span class=3D"insert">block</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the inner-header destination address equals the =
outer-header</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      assigned</span> to a <span =
class=3D"insert">site</span> by <span class=3D"insert">each service =
provider</span> to <span class=3D"insert">which a site</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      destination</span> address <span =
class=3D"delete">used</span> to <span class=3D"delete">trigger</span> a =
<span class=3D"delete">Map-Reply</span> by <span class=3D"delete">a =
decapsulating</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      connects.  Typically, each block</span> is <span =
class=3D"insert">a sub-block</span> of a <span =
class=3D"insert">service</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      ETR.  In addition, the original packet is =
decapsulated and</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      provider Classless Inter-Domain Routing (CIDR) =
[RFC4632] block and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      delivered</span> to <span class=3D"delete">the =
destination host if the destination EID is in the</span></td><td> =
</td><td class=3D"rblock">      is <span class=3D"insert">aggregated =
into</span> the <span class=3D"insert">larger block before being =
advertised into</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      EID-Prefix range configured on the ETR.  =
Otherwise, the packet is</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      the underlay network.  Traditionally, IP =
multihoming has been</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      discarded.  A Data-Probe</span> is <span =
class=3D"delete">used in some</span> of <span class=3D"delete">the =
mapping database</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      implemented</span> by <span class=3D"insert">each =
multihomed site acquiring its own globally</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      designs to "probe" or request</span> a <span =
class=3D"delete">Map-Reply from an ETR; in other</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      visible =
prefix.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      cases, Map-Requests are used.  See each mapping =
database design</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      for details.  When using Data-Probes, by sending =
Map-Requests on</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the underlying routing system, EID-Prefixes must =
be advertised.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      However, this</span> is <span =
class=3D"delete">discouraged if</span> the <span class=3D"delete">core =
is to scale</span> by <span class=3D"delete">having</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      less EID-Prefixes stored in the core router's =
routing tables.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0029"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Proxy-ITR (PITR):   A PITR is defined</span> and <span =
class=3D"delete">described</span> in <span class=3D"delete">[RFC6832].  =
A</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Provider-Independent (PI) Addresses:   PI addresses are =
an address</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      PITR acts like an ITR but does so on behalf of =
non-LISP sites that</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      block assigned from a pool where blocks are not =
associated with</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      send packets to destinations at LISP =
sites.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert"> =
     any particular location in the network (e.g., from a =
particular</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      service =
provider)</span> and <span class=3D"insert">are therefore not =
topologically aggregatable</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      in <span class=3D"insert">the routing =
system.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Proxy-ETR =
(PETR):   A PETR is defined and described in [RFC6832].  A</td><td> =
</td><td class=3D"right">   Proxy-ETR (PETR):   A PETR is defined and =
described in [RFC6832].  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      PETR acts =
like an ETR but does so on behalf of LISP sites that</td><td> </td><td =
class=3D"right">      PETR acts like an ETR but does so on behalf of =
LISP sites that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      send =
packets to destinations at non-LISP sites.</td><td> </td><td =
class=3D"right">      send packets to destinations at non-LISP =
sites.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0030"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Route-returnability:</span>  Route-returnability is an =
assumption that the</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Proxy-ITR (PITR):   A PITR is defined and described in =
[RFC6832].  A</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      PITR acts like an =
ITR but does so on behalf of non-LISP sites that</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      send packets to =
destinations at LISP sites.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   Recursive Tunneling: =
  Recursive Tunneling occurs when a packet has</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      more than one =
LISP IP header.  Additional layers of tunneling MAY</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      be employed to =
implement Traffic Engineering or other re-routing</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      as needed.  When =
this is done, an additional "outer" LISP header</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      is added, and the =
original RLOCs are preserved in the "inner"</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
header.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   Re-Encapsulating =
Tunneling Router (RTR):   An RTR acts like an ETR to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      remove a LISP =
header, then acts as an ITR to prepend a new LISP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header.  This is =
known as Re-encapsulating Tunneling.  Doing this</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      allows a packet =
to be re-routed by the RTR without adding the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      overhead of =
additional tunnel headers.  Any references to tunnels</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      in this =
specification refer to dynamic encapsulating tunnels; =
they</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      are never =
statically configured.  When using multiple mapping</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      database systems, =
care must be taken to not create re-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      encapsulation =
loops through misconfiguration.</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   =
Route-Returnability:</span>  Route-returnability is an assumption that =
the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      underlying =
routing system will deliver packets to the destination.</td><td> =
</td><td class=3D"right">      underlying routing system will deliver =
packets to the destination.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      When =
combined with a nonce that is provided by a sender and</td><td> </td><td =
class=3D"right">      When combined with a nonce that is provided by a =
sender and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned by =
a receiver, this limits off-path data insertion.  A</td><td> </td><td =
class=3D"right">      returned by a receiver, this limits off-path data =
insertion.  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
route-returnability check is verified when a message is sent =
with</td><td> </td><td class=3D"right">      route-returnability check =
is verified when a message is sent with</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a nonce, =
another message is returned with the same nonce, and the</td><td> =
</td><td class=3D"right">      a nonce, another message is returned with =
the same nonce, and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
of the original message appears as the source of the</td><td> </td><td =
class=3D"right">      destination of the original message appears as the =
source of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned =
message.</td><td> </td><td class=3D"right">      returned =
message.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0031"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">LISP site:  LISP site</span> is <span class=3D"delete">a =
set</span> of <span class=3D"delete">routers in</span> an <span =
class=3D"delete">edge network that</span> are</td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Routing Locator (RLOC):   An =
RLOC</span> is <span class=3D"insert">an IPv4 [RFC0791] or =
IPv6</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">under a single technical administration.  LISP =
routers</span> that <span class=3D"delete">reside</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      [RFC8200] =
address</span> of an <span class=3D"insert">Egress Tunnel Router (ETR).  =
An RLOC is</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      in the edge network</span> are <span =
class=3D"delete">the demarcation points</span> to <span =
class=3D"delete">separate</span> the</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      the output of an =
EID-to-RLOC mapping lookup.  An EID maps to one</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">edge network from</span> the <span class=3D"delete">core =
network.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">=
      or more RLOCs.  Typically, RLOCs</span> are <span =
class=3D"insert">numbered from aggregatable</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      blocks</span> that are <span =
class=3D"insert">assigned to a site at each point to which =
it</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Client-side:  Client-side</span> is <span =
class=3D"delete">a term used in this document to =
indicate</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">=
      attaches</span> to the <span class=3D"insert">underlay network; =
where</span> the <span class=3D"insert">topology</span> is <span =
class=3D"insert">defined</span> by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      a connection initiation attempt</span> by <span =
class=3D"delete">an EID.  The ITR(s) at</span> the <span =
class=3D"delete">LISP</span></td><td> </td><td class=3D"rblock">      =
the <span class=3D"insert">connectivity of provider networks.  Multiple =
RLOCs can be</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      site are</span> the <span =
class=3D"delete">first</span> to <span class=3D"delete">get involved in =
obtaining database Map-Cache</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      assigned to</span> the =
<span class=3D"insert">same ETR device or</span> to <span =
class=3D"insert">multiple ETR devices at a</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      entries by sending Map-Request =
messages.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      site.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Server-side:  =
Server-side is a term used in this document to indicate</td><td> =
</td><td class=3D"right">   Server-side:  Server-side is a term used in =
this document to indicate</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that a =
connection initiation attempt is being accepted for a</td><td> </td><td =
class=3D"right">      that a connection initiation attempt is being =
accepted for a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0032"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
destination EID.  <span class=3D"delete">The ETR(s) at the destination =
LISP site may be</span></td><td> </td><td class=3D"rblock">      =
destination EID.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the first to send Map-Replies to the source site =
initiating the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      connection.  The ETR(s) at this destination site =
can obtain</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings by gleaning information from =
Map-Requests, Data-Probes,</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      or encapsulated packets.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0033"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Locator-Status-Bits (LSBs):  Locator-Status-Bits are =
present</span> in <span class=3D"delete">the</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">TE-ETR:   A TE-ETR is an ETR =
that is deployed</span> in a <span class=3D"insert">service =
provider</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP header.  They are used by ITRs to inform =
ETRs about the up/</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      network that strips an outer LISP header for =
Traffic Engineering</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      down status of all ETRs at the local site.  These =
bits are used as</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      purposes.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      a <span =
class=3D"delete">hint to convey up/down router status and not path =
reachability</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      status.  The LSBs can be verified by use of one =
of the Locator</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      reachability algorithms described in Section =
10.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0034"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Anycast Address:  Anycast Address</span> is <span =
class=3D"delete">a term used</span> in <span class=3D"delete">this =
document</span> to</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">TE-ITR:   A TE-ITR</span> is <span class=3D"insert">an =
ITR that is deployed</span> in <span class=3D"insert">a service =
provider</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">refer</span> to the <span class=3D"delete">same IPv4 or =
IPv6 address configured</span> and used <span =
class=3D"delete">on</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      network that prepends an additional LISP header =
for Traffic</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      multiple systems at</span> the <span =
class=3D"delete">same time.  An EID or RLOC</span> can be <span =
class=3D"delete">an</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      Engineering purposes.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      anycast address in each of their own address =
spaces.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert"></span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   xTR:   An xTR is a =
reference</span> to <span class=3D"insert">an ITR or ETR when direction =
of data</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      flow is not part =
of the context description.  "xTR" refers</span> to the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">router that is =
the tunnel endpoint</span> and <span class=3D"insert">is</span> used =
<span class=3D"insert">synonymously with</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      the <span class=3D"insert">term "Tunnel =
Router".  For example, "An xTR</span> can be <span =
class=3D"insert">located at</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the Customer Edge =
(CE) router" indicates both ITR and ETR</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      functionality at =
the CE router.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">4.  Basic =
Overview</td><td> </td><td class=3D"right">4.  Basic Overview</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   One key =
concept of LISP is that end-systems operate the same way they</td><td> =
</td><td class=3D"right">   One key concept of LISP is that end-systems =
operate the same way they</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   do today.  The =
IP addresses that hosts use for tracking sockets and</td><td> </td><td =
class=3D"right">   do today.  The IP addresses that hosts use for =
tracking sockets and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   connections, =
and for sending and receiving packets, do not change.</td><td> </td><td =
class=3D"right">   connections, and for sending and receiving packets, =
do not change.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   In LISP =
terminology, these IP addresses are called Endpoint</td><td> </td><td =
class=3D"right">   In LISP terminology, these IP addresses are called =
Endpoint</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs).</td><td> </td><td class=3D"right">   Identifiers (EIDs).</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Routers =
continue to forward packets based on IP destination</td><td> </td><td =
class=3D"right">   Routers continue to forward packets based on IP =
destination</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-4" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> =
page 10, line 38<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> page 10, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Other types =
of EID are supported by LISP, see [RFC8060] for</td><td> </td><td =
class=3D"right">   o  Other types of EID are supported by LISP, see =
[RFC8060] for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      further =
information.</td><td> </td><td class=3D"right">      further =
information.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  LISP =
routers mostly deal with Routing Locator addresses.  See</td><td> =
</td><td class=3D"right">   o  LISP routers mostly deal with Routing =
Locator addresses.  See</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      details in =
Section 4.1 to clarify what is meant by "mostly".</td><td> </td><td =
class=3D"right">      details in Section 4.1 to clarify what is meant by =
"mostly".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  RLOCs are =
always IP addresses assigned to routers, preferably</td><td> </td><td =
class=3D"right">   o  RLOCs are always IP addresses assigned to routers, =
preferably</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
topologically oriented addresses from provider CIDR (Classless</td><td> =
</td><td class=3D"right">      topologically oriented addresses from =
provider CIDR (Classless</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Inter-Domain Routing) blocks.</td><td> </td><td class=3D"right">      =
Inter-Domain Routing) blocks.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0035"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  When a =
router originates packets, it <span class=3D"delete">may</span> use as a =
source address</td><td> </td><td class=3D"rblock">   o  When a router =
originates packets, it <span class=3D"insert">MAY</span> use as a source =
address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      either an =
EID or RLOC.  When acting as a host (e.g., when</td><td> </td><td =
class=3D"right">      either an EID or RLOC.  When acting as a host =
(e.g., when</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      terminating =
a transport session such as Secure SHell (SSH),</td><td> </td><td =
class=3D"right">      terminating a transport session such as Secure =
SHell (SSH),</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0036"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      TELNET, =
or the Simple Network Management Protocol (SNMP)), it <span =
class=3D"delete">may</span></td><td> </td><td class=3D"rblock">      =
TELNET, or the Simple Network Management Protocol (SNMP)), it <span =
class=3D"insert">MAY</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      use an EID =
that is explicitly assigned for that purpose.  An EID</td><td> </td><td =
class=3D"right">      use an EID that is explicitly assigned for that =
purpose.  An EID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that =
identifies the router as a host MUST NOT be used as an RLOC;</td><td> =
</td><td class=3D"right">      that identifies the router as a host MUST =
NOT be used as an RLOC;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      an EID is =
only routable within the scope of a site.  A typical BGP</td><td> =
</td><td class=3D"right">      an EID is only routable within the scope =
of a site.  A typical BGP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
configuration might demonstrate this "hybrid" EID/RLOC usage =
where</td><td> </td><td class=3D"right">      configuration might =
demonstrate this "hybrid" EID/RLOC usage where</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a router =
could use its "host-like" EID to terminate iBGP sessions</td><td> =
</td><td class=3D"right">      a router could use its "host-like" EID to =
terminate iBGP sessions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to other =
routers in a site while at the same time using RLOCs to</td><td> =
</td><td class=3D"right">      to other routers in a site while at the =
same time using RLOCs to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      terminate =
eBGP sessions to routers outside the site.</td><td> </td><td =
class=3D"right">      terminate eBGP sessions to routers outside the =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Packets =
with EIDs in them are not expected to be delivered end-to-</td><td> =
</td><td class=3D"right">   o  Packets with EIDs in them are not =
expected to be delivered end-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      end in the =
absence of an EID-to-RLOC mapping operation.  They are</td><td> </td><td =
class=3D"right">      end in the absence of an EID-to-RLOC mapping =
operation.  They are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      expected to =
be used locally for intra-site communication or to be</td><td> </td><td =
class=3D"right">      expected to be used locally for intra-site =
communication or to be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulated for inter-site communication.</td><td> </td><td =
class=3D"right">      encapsulated for inter-site communication.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  =
EID-Prefixes are likely to be hierarchically assigned in a =
manner</td><td> </td><td class=3D"right">   o  EID-Prefixes are likely =
to be hierarchically assigned in a manner</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that is =
optimized for administrative convenience and to facilitate</td><td> =
</td><td class=3D"right">      that is optimized for administrative =
convenience and to facilitate</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0037"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      scaling =
of the EID-to-RLOC mapping database.  <span class=3D"delete">The =
hierarchy is</span></td><td> </td><td class=3D"rblock">      scaling of =
the EID-to-RLOC mapping database.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      based on an address allocation hierarchy that is =
independent of</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the network topology.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0038"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  EIDs =
<span class=3D"delete">may</span> also be structured (subnetted) in a =
manner suitable for</td><td> </td><td class=3D"rblock">   o  EIDs <span =
class=3D"insert">MAY</span> also be structured (subnetted) in a manner =
suitable for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      local =
routing within an Autonomous System (AS).</td><td> </td><td =
class=3D"right">      local routing within an Autonomous System =
(AS).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An additional =
LISP header MAY be prepended to packets by a TE-ITR</td><td> </td><td =
class=3D"right">   An additional LISP header MAY be prepended to packets =
by a TE-ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   when =
re-routing of the path for a packet is desired.  A potential</td><td> =
</td><td class=3D"right">   when re-routing of the path for a packet is =
desired.  A potential</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   use-case for =
this would be an ISP router that needs to perform</td><td> </td><td =
class=3D"right">   use-case for this would be an ISP router that needs =
to perform</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Traffic =
Engineering for packets flowing through its network.  In such</td><td> =
</td><td class=3D"right">   Traffic Engineering for packets flowing =
through its network.  In such</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   a situation, =
termed "Recursive Tunneling", an ISP transit acts as an</td><td> =
</td><td class=3D"right">   a situation, termed "Recursive Tunneling", =
an ISP transit acts as an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   additional =
ITR, and the RLOC it uses for the new prepended header</td><td> </td><td =
class=3D"right">   additional ITR, and the RLOC it uses for the new =
prepended header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   would be =
either a TE-ETR within the ISP (along an intra-ISP traffic</td><td> =
</td><td class=3D"right">   would be either a TE-ETR within the ISP =
(along an intra-ISP traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   engineered =
path) or a TE-ETR within another ISP (an inter-ISP traffic</td><td> =
</td><td class=3D"right">   engineered path) or a TE-ETR within another =
ISP (an inter-ISP traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-5" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> =
page 12, line 17<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> page 11, line =
37<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      was not =
using LISP.</td><td> </td><td class=3D"right">      was not using =
LISP.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Each site =
is multihomed, so each Tunnel Router has an address</td><td> </td><td =
class=3D"right">   o  Each site is multihomed, so each Tunnel Router has =
an address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      (RLOC) =
assigned from the service provider address block for each</td><td> =
</td><td class=3D"right">      (RLOC) assigned from the service provider =
address block for each</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      provider to =
which that particular Tunnel Router is attached.</td><td> </td><td =
class=3D"right">      provider to which that particular Tunnel Router is =
attached.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The ITR(s) =
and ETR(s) are directly connected to the source and</td><td> </td><td =
class=3D"right">   o  The ITR(s) and ETR(s) are directly connected to =
the source and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
destination, respectively, but the source and destination can =
be</td><td> </td><td class=3D"right">      destination, respectively, =
but the source and destination can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      located =
anywhere in the LISP site.</td><td> </td><td class=3D"right">      =
located anywhere in the LISP site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0039"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  <span =
class=3D"delete">Map-Requests are sent to the mapping database system by =
using the</span></td><td> </td><td class=3D"rblock">   o  A Map-Request =
is sent for an external destination when the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP control-plane protocol documented =
in</span></td><td> </td><td class=3D"rblock">      destination is not =
found in the forwarding table or matches a</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      [I-D.ietf-lisp-rfc6833bis].</span>  A Map-Request =
is sent for an external</td><td> </td><td class=3D"rblock">      default =
route.  <span class=3D"insert">Map-Requests are sent to the mapping =
database</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
destination when the destination is not found in the forwarding</td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      system by using =
the LISP control-plane protocol documented in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      table or =
matches a default route.</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      [I-D.ietf-lisp-rfc6833bis].</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Map-Replies =
are sent on the underlying routing system topology</td><td> </td><td =
class=3D"right">   o  Map-Replies are sent on the underlying routing =
system topology</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      using the =
[I-D.ietf-lisp-rfc6833bis] control-plane protocol.</td><td> </td><td =
class=3D"right">      using the [I-D.ietf-lisp-rfc6833bis] control-plane =
protocol.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Client =
host1.abc.example.com wants to communicate with server</td><td> </td><td =
class=3D"right">   Client host1.abc.example.com wants to communicate =
with server</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
host2.xyz.example.com:</td><td> </td><td class=3D"right">   =
host2.xyz.example.com:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
host1.abc.example.com wants to open a TCP connection to</td><td> =
</td><td class=3D"right">   1.  host1.abc.example.com wants to open a =
TCP connection to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
host2.xyz.example.com.  It does a DNS lookup on</td><td> </td><td =
class=3D"right">       host2.xyz.example.com.  It does a DNS lookup =
on</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
host2.xyz.example.com.  An A/AAAA record is returned.  This</td><td> =
</td><td class=3D"right">       host2.xyz.example.com.  An A/AAAA record =
is returned.  This</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-6" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> =
page 13, line 35<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> page 13, line 8<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       of the =
addresses, strips the LISP header, and forwards packets to</td><td> =
</td><td class=3D"right">       of the addresses, strips the LISP =
header, and forwards packets to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the =
attached destination host.</td><td> </td><td class=3D"right">       the =
attached destination host.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  In order =
to defer the need for a mapping lookup in the reverse</td><td> </td><td =
class=3D"right">   9.  In order to defer the need for a mapping lookup =
in the reverse</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       direction, =
an ETR can OPTIONALLY create a cache entry that maps</td><td> </td><td =
class=3D"right">       direction, an ETR can OPTIONALLY create a cache =
entry that maps</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the source =
EID (inner-header source IP address) to the source</td><td> </td><td =
class=3D"right">       the source EID (inner-header source IP address) =
to the source</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       RLOC =
(outer-header source IP address) in a received LISP packet.</td><td> =
</td><td class=3D"right">       RLOC (outer-header source IP address) in =
a received LISP packet.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       Such a =
cache entry is termed a "gleaned" mapping and only</td><td> </td><td =
class=3D"right">       Such a cache entry is termed a "gleaned" mapping =
and only</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       contains a =
single RLOC for the EID in question.  More complete</td><td> </td><td =
class=3D"right">       contains a single RLOC for the EID in question.  =
More complete</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
information about additional RLOCs SHOULD be verified by =
sending</td><td> </td><td class=3D"right">       information about =
additional RLOCs SHOULD be verified by sending</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0040"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       a LISP =
Map-Request for that EID.  Both the ITR and the ETR <span =
class=3D"delete">may</span></td><td> </td><td class=3D"rblock">       a =
LISP Map-Request for that EID.  Both the ITR and the ETR <span =
class=3D"insert">MAY</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       also =
influence the decision the other makes in selecting an RLOC.</td><td> =
</td><td class=3D"right">       also influence the decision the other =
makes in selecting an RLOC.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.  LISP =
Encapsulation Details</td><td> </td><td class=3D"right">5.  LISP =
Encapsulation Details</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Since =
additional tunnel headers are prepended, the packet becomes</td><td> =
</td><td class=3D"right">   Since additional tunnel headers are =
prepended, the packet becomes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   larger and can =
exceed the MTU of any link traversed from the ITR to</td><td> </td><td =
class=3D"right">   larger and can exceed the MTU of any link traversed =
from the ITR to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the ETR.  It =
is RECOMMENDED in IPv4 that packets do not get</td><td> </td><td =
class=3D"right">   the ETR.  It is RECOMMENDED in IPv4 that packets do =
not get</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fragmented as =
they are encapsulated by the ITR.  Instead, the packet</td><td> </td><td =
class=3D"right">   fragmented as they are encapsulated by the ITR.  =
Instead, the packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is dropped and =
an ICMP Unreachable/Fragmentation-Needed message is</td><td> </td><td =
class=3D"right">   is dropped and an ICMP =
Unreachable/Fragmentation-Needed message is</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   returned to =
the source.</td><td> </td><td class=3D"right">   returned to the =
source.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0041"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">This</span> specification RECOMMENDS that =
implementations provide support</td><td> </td><td class=3D"rblock">   =
<span class=3D"insert">In the case when fragmentation is needed, =
this</span> specification</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   for one of =
the proposed fragmentation and reassembly schemes.  Two</td><td> =
</td><td class=3D"rblock">   RECOMMENDS that implementations provide =
support for one of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   existing =
schemes are detailed in Section 7.</td><td> </td><td class=3D"rblock">   =
proposed fragmentation and reassembly schemes.  Two existing =
schemes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   are detailed in Section 7.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Since IPv4 or =
IPv6 addresses can be either EIDs or RLOCs, the LISP</td><td> </td><td =
class=3D"right">   Since IPv4 or IPv6 addresses can be either EIDs or =
RLOCs, the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
supports IPv4 EIDs with IPv6 RLOCs (where the inner</td><td> </td><td =
class=3D"right">   architecture supports IPv4 EIDs with IPv6 RLOCs =
(where the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is in =
IPv4 packet format and the outer header is in IPv6</td><td> </td><td =
class=3D"right">   header is in IPv4 packet format and the outer header =
is in IPv6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packet format) =
or IPv6 EIDs with IPv4 RLOCs (where the inner header</td><td> </td><td =
class=3D"right">   packet format) or IPv6 EIDs with IPv4 RLOCs (where =
the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is in IPv6 =
packet format and the outer header is in IPv4 packet</td><td> </td><td =
class=3D"right">   is in IPv6 packet format and the outer header is in =
IPv4 packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   format).  The =
next sub-sections illustrate packet formats for the</td><td> </td><td =
class=3D"right">   format).  The next sub-sections illustrate packet =
formats for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   homogeneous =
case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4</td><td> </td><td =
class=3D"right">   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but =
all 4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   combinations =
MUST be supported.  Additional types of EIDs are defined</td><td> =
</td><td class=3D"right">   combinations MUST be supported.  Additional =
types of EIDs are defined</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in =
[RFC8060].</td><td> </td><td class=3D"right">   in [RFC8060].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-7" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> =
page 14, line 16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> page 14, line 4<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
supports IPv4 EIDs with IPv6 RLOCs (where the inner</td><td> </td><td =
class=3D"right">   architecture supports IPv4 EIDs with IPv6 RLOCs =
(where the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is in =
IPv4 packet format and the outer header is in IPv6</td><td> </td><td =
class=3D"right">   header is in IPv4 packet format and the outer header =
is in IPv6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packet format) =
or IPv6 EIDs with IPv4 RLOCs (where the inner header</td><td> </td><td =
class=3D"right">   packet format) or IPv6 EIDs with IPv4 RLOCs (where =
the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is in IPv6 =
packet format and the outer header is in IPv4 packet</td><td> </td><td =
class=3D"right">   is in IPv6 packet format and the outer header is in =
IPv4 packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   format).  The =
next sub-sections illustrate packet formats for the</td><td> </td><td =
class=3D"right">   format).  The next sub-sections illustrate packet =
formats for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   homogeneous =
case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4</td><td> </td><td =
class=3D"right">   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but =
all 4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   combinations =
MUST be supported.  Additional types of EIDs are defined</td><td> =
</td><td class=3D"right">   combinations MUST be supported.  Additional =
types of EIDs are defined</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in =
[RFC8060].</td><td> </td><td class=3D"right">   in [RFC8060].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.1.  LISP =
IPv4-in-IPv4 Header Format</td><td> </td><td class=3D"right">5.1.  LISP =
IPv4-in-IPv4 Header Format</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0042"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        0         =
          1                   2                   3</td><td> </td><td =
class=3D"right">        0                   1                   2        =
           3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        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</td><td> </td><td =
class=3D"right">        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</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0043"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version|  IHL  |<span class=3D"delete">Type of Service</span>|          =
Total Length         |</td><td> </td><td class=3D"rblock">     / =
|Version|  IHL  |<span class=3D"insert">    DSCP   |ECN</span>|          =
Total Length         |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Identification        |Flags|      Fragment Offset    |</td><td> =
</td><td class=3D"right">   |   |         Identification        |Flags|  =
    Fragment Offset    |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   OH  |  Time to =
Live | Protocol =3D 17 |         Header Checksum       |</td><td> =
</td><td class=3D"right">   OH  |  Time to Live | Protocol =3D 17 |      =
   Header Checksum       |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |          =
          Source Routing Locator                     |</td><td> </td><td =
class=3D"right">   |   |                    Source Routing Locator       =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
       Destination Routing Locator                   |</td><td> </td><td =
class=3D"right">     \ |                 Destination Routing Locator     =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     / |       =
Source Port =3D xxxx      |       Dest Port =3D 4341        |</td><td> =
</td><td class=3D"right">     / |       Source Port =3D xxxx      |      =
 Dest Port =3D 4341        |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
 UDP Length          |        UDP Checksum           |</td><td> </td><td =
class=3D"right">     \ |           UDP Length          |        UDP =
Checksum           |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   L   =
|N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|</td><td> </td><td class=3D"right">   L   |N|L|E|V|I|R|K|K|            =
Nonce/Map-Version                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   S / |          =
       Instance ID/Locator-Status-Bits               |</td><td> </td><td =
class=3D"right">   S / |                 Instance ID/Locator-Status-Bits =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0044"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version|  IHL  |<span class=3D"delete">Type of Service</span>|          =
Total Length         |</td><td> </td><td class=3D"rblock">     / =
|Version|  IHL  |<span class=3D"insert">    DSCP   |ECN</span>|          =
Total Length         |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Identification        |Flags|      Fragment Offset    |</td><td> =
</td><td class=3D"right">   |   |         Identification        |Flags|  =
    Fragment Offset    |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   IH  |  Time to =
Live |    Protocol   |         Header Checksum       |</td><td> </td><td =
class=3D"right">   IH  |  Time to Live |    Protocol   |         Header =
Checksum       |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |          =
                 Source EID                          |</td><td> </td><td =
class=3D"right">   |   |                           Source EID            =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
               Destination EID                       |</td><td> </td><td =
class=3D"right">     \ |                         Destination EID         =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       IHL =3D =
IP-Header-Length</td><td> </td><td class=3D"right">       IHL =3D =
IP-Header-Length</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.2.  LISP =
IPv6-in-IPv6 Header Format</td><td> </td><td class=3D"right">5.2.  LISP =
IPv6-in-IPv6 Header Format</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        0         =
          1                   2                   3</td><td> </td><td =
class=3D"right">        0                   1                   2        =
           3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        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</td><td> </td><td =
class=3D"right">        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</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0045"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version| <span class=3D"delete">Traffic Class </span>|           Flow =
Label                  |</td><td> </td><td class=3D"rblock">     / =
|Version| <span class=3D"insert">   DSCP   |ECN</span>|           Flow =
Label                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Payload Length        | Next Header=3D17|   Hop Limit   |</td><td> =
</td><td class=3D"right">   |   |         Payload Length        | Next =
Header=3D17|   Hop Limit   |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   O   +          =
                                                     +</td><td> </td><td =
class=3D"right">   O   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   u   |          =
                                                     |</td><td> </td><td =
class=3D"right">   u   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   t   +          =
           Source Routing Locator                    +</td><td> </td><td =
class=3D"right">   t   +                     Source Routing Locator      =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-8" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> =
page 15, line 38<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> page 15, line =
23<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
                                                     |</td><td> </td><td =
class=3D"right">     \ |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     / |       =
Source Port =3D xxxx      |       Dest Port =3D 4341        |</td><td> =
</td><td class=3D"right">     / |       Source Port =3D xxxx      |      =
 Dest Port =3D 4341        |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
 UDP Length          |        UDP Checksum           |</td><td> </td><td =
class=3D"right">     \ |           UDP Length          |        UDP =
Checksum           |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   L   =
|N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|</td><td> </td><td class=3D"right">   L   |N|L|E|V|I|R|K|K|            =
Nonce/Map-Version                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   S / |          =
       Instance ID/Locator-Status-Bits               |</td><td> </td><td =
class=3D"right">   S / |                 Instance ID/Locator-Status-Bits =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0046"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version| <span class=3D"delete">Traffic Class </span>|           Flow =
Label                  |</td><td> </td><td class=3D"rblock">     / =
|Version| <span class=3D"insert">   DSCP   |ECN</span>|           Flow =
Label                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   /   |         =
Payload Length        |  Next Header  |   Hop Limit   |</td><td> =
</td><td class=3D"right">   /   |         Payload Length        |  Next =
Header  |   Hop Limit   |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I   +          =
                                                     +</td><td> </td><td =
class=3D"right">   I   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   |          =
                                                     |</td><td> </td><td =
class=3D"right">   n   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   +          =
                Source EID                           +</td><td> </td><td =
class=3D"right">   n   +                          Source EID             =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-9" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> =
page 16, line 4<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> page 15, line =
38<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I   +          =
                                                     +</td><td> </td><td =
class=3D"right">   I   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   |          =
                                                     |</td><td> </td><td =
class=3D"right">   n   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   +          =
                Source EID                           +</td><td> </td><td =
class=3D"right">   n   +                          Source EID             =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   d   |          =
                                                     |</td><td> </td><td =
class=3D"right">   d   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0047"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ^   +          =
              Destination EID                        +</td><td> </td><td =
class=3D"right">   ^   +                        Destination EID          =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   \   |          =
                                                     |</td><td> </td><td =
class=3D"right">   \   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  +          =
                                                     +</td><td> </td><td =
class=3D"right">    \  +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
                                                     |</td><td> </td><td =
class=3D"right">     \ |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.3.  Tunnel =
Header Field Descriptions</td><td> </td><td class=3D"right">5.3.  Tunnel =
Header Field Descriptions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0048"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Inner Header =
(IH):  The inner header is the header on the datagram</td><td> </td><td =
class=3D"rblock">   Inner Header           (IH):  The inner header is =
the header on the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      received =
from the originating <span class=3D"delete">host.</span>  The source and =
destination IP</td><td> </td><td class=3D"rblock">      datagram =
received from the originating <span class=3D"insert">host [RFC0791] =
[RFC8200]</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      addresses =
are <span class=3D"delete">EIDs [RFC0791] [RFC8200].</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      [RFC2474].</span> =
 The source and destination IP addresses are <span =
class=3D"insert">EIDs.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Outer Header: =
(OH)  The outer header is a new header prepended by an</td><td> </td><td =
class=3D"right">   Outer Header: (OH)  The outer header is a new header =
prepended by an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      ITR.  The =
address fields contain RLOCs obtained from the ingress</td><td> </td><td =
class=3D"right">      ITR.  The address fields contain RLOCs obtained =
from the ingress</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      router's =
EID-to-RLOC Cache.  The IP protocol number is "UDP (17)"</td><td> =
</td><td class=3D"right">      router's EID-to-RLOC Cache.  The IP =
protocol number is "UDP (17)"</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      from =
[RFC0768].  The setting of the Don't Fragment (DF) bit</td><td> </td><td =
class=3D"right">      from [RFC0768].  The setting of the Don't Fragment =
(DF) bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      'Flags' =
field is according to rules listed in Sections 7.1 and</td><td> </td><td =
class=3D"right">      'Flags' field is according to rules listed in =
Sections 7.1 and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
7.2.</td><td> </td><td class=3D"right">      7.2.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP Header:  =
The UDP header contains an ITR selected source port when</td><td> =
</td><td class=3D"right">   UDP Header:  The UDP header contains an ITR =
selected source port when</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulating a packet.  See Section 12 for details on the hash</td><td> =
</td><td class=3D"right">      encapsulating a packet.  See Section 12 =
for details on the hash</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      algorithm =
used to select a source port based on the 5-tuple of the</td><td> =
</td><td class=3D"right">      algorithm used to select a source port =
based on the 5-tuple of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      inner =
header.  The destination port MUST be set to the well-known</td><td> =
</td><td class=3D"right">      inner header.  The destination port MUST =
be set to the well-known</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
IANA-assigned port value 4341.</td><td> </td><td class=3D"right">      =
IANA-assigned port value 4341.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP Checksum:  =
The 'UDP Checksum' field SHOULD be transmitted as zero</td><td> </td><td =
class=3D"right">   UDP Checksum:  The 'UDP Checksum' field SHOULD be =
transmitted as zero</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0049"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      by an ITR =
for either IPv4 [RFC0768] <span class=3D"delete">or</span> IPv6 =
encapsulation</td><td> </td><td class=3D"rblock">      by an ITR for =
either IPv4 [RFC0768] <span class=3D"insert">and</span> IPv6 =
encapsulation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      [RFC6935] =
[RFC6936].  When a packet with a zero UDP checksum is</td><td> </td><td =
class=3D"right">      [RFC6935] [RFC6936].  When a packet with a zero =
UDP checksum is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      received by =
an ETR, the ETR MUST accept the packet for</td><td> </td><td =
class=3D"right">      received by an ETR, the ETR MUST accept the packet =
for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
decapsulation.  When an ITR transmits a non-zero value for the =
UDP</td><td> </td><td class=3D"right">      decapsulation.  When an ITR =
transmits a non-zero value for the UDP</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">      checksum, =
it MUST send a correctly computed value in this field.</td><td> </td><td =
class=3D"right">      checksum, it MUST send a correctly computed value =
in this field.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      When an ETR =
receives a packet with a non-zero UDP checksum, it MAY</td><td> </td><td =
class=3D"right">      When an ETR receives a packet with a non-zero UDP =
checksum, it MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      choose to =
verify the checksum value.  If it chooses to perform</td><td> </td><td =
class=3D"right">      choose to verify the checksum value.  If it =
chooses to perform</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      such =
verification, and the verification fails, the packet MUST be</td><td> =
</td><td class=3D"right">      such verification, and the verification =
fails, the packet MUST be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      silently =
dropped.  If the ETR chooses not to perform the</td><td> </td><td =
class=3D"right">      silently dropped.  If the ETR chooses not to =
perform the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
verification, or performs the verification successfully, the</td><td> =
</td><td class=3D"right">      verification, or performs the =
verification successfully, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      packet MUST =
be accepted for decapsulation.  The handling of UDP</td><td> </td><td =
class=3D"right">      packet MUST be accepted for decapsulation.  The =
handling of UDP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-10" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 19, line =
43<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 19, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copying the =
Time to Live (TTL) serves two purposes: first, it</td><td> </td><td =
class=3D"right">   Copying the Time to Live (TTL) serves two purposes: =
first, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   preserves the =
distance the host intended the packet to travel;</td><td> </td><td =
class=3D"right">   preserves the distance the host intended the packet =
to travel;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   second, and =
more importantly, it provides for suppression of looping</td><td> =
</td><td class=3D"right">   second, and more importantly, it provides =
for suppression of looping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets in the =
event there is a loop of concatenated tunnels due to</td><td> </td><td =
class=3D"right">   packets in the event there is a loop of concatenated =
tunnels due to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
misconfiguration.  See Section 18.3 for TTL exception handling =
for</td><td> </td><td class=3D"right">   misconfiguration.  See Section =
18.3 for TTL exception handling for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   traceroute =
packets.</td><td> </td><td class=3D"right">   traceroute =
packets.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The Explicit =
Congestion Notification ('ECN') field occupies bits 6</td><td> </td><td =
class=3D"right">   The Explicit Congestion Notification ('ECN') field =
occupies bits 6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and 7 of both =
the IPv4 'Type of Service' field and the IPv6 'Traffic</td><td> </td><td =
class=3D"right">   and 7 of both the IPv4 'Type of Service' field and =
the IPv6 'Traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Class' field =
[RFC3168].  The 'ECN' field requires special treatment</td><td> </td><td =
class=3D"right">   Class' field [RFC3168].  The 'ECN' field requires =
special treatment</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0050"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   in order to =
avoid discarding indications of congestion [RFC3168].</td><td> </td><td =
class=3D"rblock">   in order to avoid discarding indications of =
congestion [RFC3168].  <span class=3D"insert">An</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">ITR</span> encapsulation MUST copy the 2-bit 'ECN' =
field from the inner</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">   ITR/PITR</span> encapsulation MUST copy the 2-bit =
'ECN' field from the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header to the =
outer header.  Re-encapsulation MUST copy the 2-bit</td><td> </td><td =
class=3D"right">   header to the outer header.  Re-encapsulation MUST =
copy the 2-bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   'ECN' field =
from the stripped outer header to the new outer header.</td><td> =
</td><td class=3D"right">   'ECN' field from the stripped outer header =
to the new outer header.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   If the 'ECN' =
field contains a congestion indication codepoint (the</td><td> </td><td =
class=3D"right">   If the 'ECN' field contains a congestion indication =
codepoint (the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0051"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   value is =
'11', the Congestion Experienced (CE) codepoint), then <span =
class=3D"delete">ETR</span></td><td> </td><td class=3D"rblock">   value =
is '11', the Congestion Experienced (CE) codepoint), then <span =
class=3D"insert">ETR/</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
decapsulation MUST copy the 2-bit 'ECN' field from the stripped =
outer</td><td> </td><td class=3D"rblock"><span class=3D"insert">   =
PETR</span> decapsulation MUST copy the 2-bit 'ECN' field from the =
stripped</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   header to =
the surviving inner header that is used to forward the</td><td> </td><td =
class=3D"rblock">   outer header to the surviving inner header that is =
used to forward</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   packet =
beyond the ETR.  These requirements preserve CE indications</td><td> =
</td><td class=3D"rblock">   the packet beyond the ETR.  These =
requirements preserve CE</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   when a =
packet that uses ECN traverses a LISP tunnel and becomes</td><td> =
</td><td class=3D"rblock">   indications when a packet that uses ECN =
traverses a LISP tunnel and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   marked with =
a CE indication due to congestion between the tunnel</td><td> </td><td =
class=3D"rblock">   becomes marked with a CE indication due to =
congestion between the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
endpoints.</td><td> </td><td class=3D"rblock">   tunnel =
endpoints.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">6.  LISP =
EID-to-RLOC Map-Cache</td><td> </td><td class=3D"right">6.  LISP =
EID-to-RLOC Map-Cache</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITRs and PITRs =
maintain an on-demand cache, referred as LISP EID-to-</td><td> </td><td =
class=3D"right">   ITRs and PITRs maintain an on-demand cache, referred =
as LISP EID-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC =
Map-Cache, that contains mappings from EID-prefixes to locator</td><td> =
</td><td class=3D"right">   RLOC Map-Cache, that contains mappings from =
EID-prefixes to locator</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sets.  The =
cache is used to encapsulate packets from the EID space to</td><td> =
</td><td class=3D"right">   sets.  The cache is used to encapsulate =
packets from the EID space to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
corresponding RLOC network attachment point.</td><td> </td><td =
class=3D"right">   the corresponding RLOC network attachment =
point.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an =
ITR/PITR receives a packet from inside of the LISP site to</td><td> =
</td><td class=3D"right">   When an ITR/PITR receives a packet from =
inside of the LISP site to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destinations =
outside of the site a longest-prefix match lookup of the</td><td> =
</td><td class=3D"right">   destinations outside of the site a =
longest-prefix match lookup of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-11" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 20, line =
40<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 20, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
about EIDs and RLOCs, and uses LISP reachability</td><td> </td><td =
class=3D"right">   information about EIDs and RLOCs, and uses LISP =
reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
mechanisms to determine the reachability of RLOCs, see</td><td> </td><td =
class=3D"right">   information mechanisms to determine the reachability =
of RLOCs, see</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Section 10 for =
the specific mechanisms.</td><td> </td><td class=3D"right">   Section 10 =
for the specific mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">7.  Dealing with =
Large Encapsulated Packets</td><td> </td><td class=3D"right">7.  Dealing =
with Large Encapsulated Packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
proposes two mechanisms to deal with packets that exceed</td><td> =
</td><td class=3D"right">   This section proposes two mechanisms to deal =
with packets that exceed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the path MTU =
between the ITR and ETR.</td><td> </td><td class=3D"right">   the path =
MTU between the ITR and ETR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   It is left to =
the implementor to decide if the stateless or stateful</td><td> </td><td =
class=3D"right">   It is left to the implementor to decide if the =
stateless or stateful</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0052"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   mechanism =
<span class=3D"delete">should</span> be implemented.  Both or neither =
can be used, since</td><td> </td><td class=3D"rblock">   mechanism <span =
class=3D"insert">SHOULD</span> be implemented.  Both or neither can be =
used, since</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   it is a local =
decision in the ITR regarding how to deal with MTU</td><td> </td><td =
class=3D"right">   it is a local decision in the ITR regarding how to =
deal with MTU</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   issues, and =
sites can interoperate with differing mechanisms.</td><td> </td><td =
class=3D"right">   issues, and sites can interoperate with differing =
mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Both stateless =
and stateful mechanisms also apply to Re-encapsulating</td><td> </td><td =
class=3D"right">   Both stateless and stateful mechanisms also apply to =
Re-encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and Recursive =
Tunneling, so any actions below referring to an ITR</td><td> </td><td =
class=3D"right">   and Recursive Tunneling, so any actions below =
referring to an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   also apply to =
a TE-ITR.</td><td> </td><td class=3D"right">   also apply to a =
TE-ITR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">7.1.  A Stateless =
Solution to MTU Handling</td><td> </td><td class=3D"right">7.1.  A =
Stateless Solution to MTU Handling</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An ITR =
stateless solution to handle MTU issues is described as</td><td> =
</td><td class=3D"right">   An ITR stateless solution to handle MTU =
issues is described as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-12" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 21, line =
19<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 20, line =
49<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  Define H =
to be the size, in octets, of the outer header an ITR</td><td> </td><td =
class=3D"right">   1.  Define H to be the size, in octets, of the outer =
header an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       prepends =
to a packet.  This includes the UDP and LISP header</td><td> </td><td =
class=3D"right">       prepends to a packet.  This includes the UDP and =
LISP header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
lengths.</td><td> </td><td class=3D"right">       lengths.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  Define L =
to be the size, in octets, of the maximum-sized packet</td><td> </td><td =
class=3D"right">   2.  Define L to be the size, in octets, of the =
maximum-sized packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       an ITR can =
send to an ETR without the need for the ITR or any</td><td> </td><td =
class=3D"right">       an ITR can send to an ETR without the need for =
the ITR or any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
intermediate routers to fragment the packet.</td><td> </td><td =
class=3D"right">       intermediate routers to fragment the =
packet.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Define an =
architectural constant S for the maximum size of a</td><td> </td><td =
class=3D"right">   3.  Define an architectural constant S for the =
maximum size of a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0053"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       packet, =
in octets, an ITR <span class=3D"delete">must</span> receive from the =
source so the</td><td> </td><td class=3D"rblock">       packet, in =
octets, an ITR <span class=3D"insert">MUST</span> receive from the =
source so the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       effective =
MTU can be met.  That is, L =3D S + H.</td><td> </td><td class=3D"right"> =
      effective MTU can be met.  That is, L =3D S + H.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ITR =
receives a packet from a site-facing interface and adds H</td><td> =
</td><td class=3D"right">   When an ITR receives a packet from a =
site-facing interface and adds H</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   octets worth =
of encapsulation to yield a packet size greater than L</td><td> </td><td =
class=3D"right">   octets worth of encapsulation to yield a packet size =
greater than L</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   octets =
(meaning the received packet size was greater than S octets</td><td> =
</td><td class=3D"right">   octets (meaning the received packet size was =
greater than S octets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from the =
source), it resolves the MTU issue by first splitting the</td><td> =
</td><td class=3D"right">   from the source), it resolves the MTU issue =
by first splitting the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   original =
packet into 2 equal-sized fragments.  A LISP header is then</td><td> =
</td><td class=3D"right">   original packet into 2 equal-sized =
fragments.  A LISP header is then</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   prepended to =
each fragment.  The size of the encapsulated fragments</td><td> </td><td =
class=3D"right">   prepended to each fragment.  The size of the =
encapsulated fragments</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is then (S/2 + =
H), which is less than the ITR's estimate of the path</td><td> </td><td =
class=3D"right">   is then (S/2 + H), which is less than the ITR's =
estimate of the path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   MTU between =
the ITR and its correspondent ETR.</td><td> </td><td class=3D"right">   =
MTU between the ITR and its correspondent ETR.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-13" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 23, line =
14<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 22, line =
43<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
decapsulates a packet, the Instance ID from the LISP</td><td> </td><td =
class=3D"right">   When an ETR decapsulates a packet, the Instance ID =
from the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is used =
as a table identifier to locate the forwarding table</td><td> </td><td =
class=3D"right">   header is used as a table identifier to locate the =
forwarding table</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to use for the =
inner destination EID lookup.</td><td> </td><td class=3D"right">   to =
use for the inner destination EID lookup.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   For example, =
an 802.1Q VLAN tag or VPN identifier could be used as a</td><td> =
</td><td class=3D"right">   For example, an 802.1Q VLAN tag or VPN =
identifier could be used as a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   24-bit =
Instance ID.  See [I-D.ietf-lisp-vpn] for LISP VPN use-case</td><td> =
</td><td class=3D"right">   24-bit Instance ID.  See [I-D.ietf-lisp-vpn] =
for LISP VPN use-case</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
details.</td><td> </td><td class=3D"right">   details.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The Instance =
ID that is stored in the mapping database when LISP-DDT</td><td> =
</td><td class=3D"right">   The Instance ID that is stored in the =
mapping database when LISP-DDT</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0054"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-ddt]</span> is used is 32 bits in =
length.  That means the</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">[RFC8111]</span> is used is 32 bits in length.  That =
means the control-plane</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
control-plane can store more instances than a given data-plane =
can</td><td> </td><td class=3D"rblock">   can store more instances than =
a given data-plane can use.  Multiple</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   use.  =
Multiple data-planes can use the same 32-bit space as long as</td><td> =
</td><td class=3D"rblock">   data-planes can use the same 32-bit space =
as long as the low-order 24</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
low-order 24 bits don't overlap among xTRs.</td><td> </td><td =
class=3D"rblock">   bits don't overlap among xTRs.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">9.  Routing =
Locator Selection</td><td> </td><td class=3D"right">9.  Routing Locator =
Selection</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0055"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Both the =
client-side and server-side <span class=3D"delete">may</span> need =
control over the</td><td> </td><td class=3D"rblock">   Both the =
client-side and server-side <span class=3D"insert">MAY</span> need =
control over the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   selection of =
RLOCs for conversations between them.  This control is</td><td> </td><td =
class=3D"right">   selection of RLOCs for conversations between them.  =
This control is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   achieved by =
manipulating the 'Priority' and 'Weight' fields in EID-</td><td> =
</td><td class=3D"right">   achieved by manipulating the 'Priority' and =
'Weight' fields in EID-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to-RLOC =
Map-Reply messages.  Alternatively, RLOC information MAY be</td><td> =
</td><td class=3D"right">   to-RLOC Map-Reply messages.  Alternatively, =
RLOC information MAY be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   gleaned from =
received tunneled packets or EID-to-RLOC Map-Request</td><td> </td><td =
class=3D"right">   gleaned from received tunneled packets or EID-to-RLOC =
Map-Request</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
messages.</td><td> </td><td class=3D"right">   messages.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The following =
are different scenarios for choosing RLOCs and the</td><td> </td><td =
class=3D"right">   The following are different scenarios for choosing =
RLOCs and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   controls that =
are available:</td><td> </td><td class=3D"right">   controls that are =
available:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
server-side returns one RLOC.  The client-side can only use</td><td> =
</td><td class=3D"right">   o  The server-side returns one RLOC.  The =
client-side can only use</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-14" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 24, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 24, line =
34<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   stored in the =
mapping database system provides reachability</td><td> </td><td =
class=3D"right">   stored in the mapping database system provides =
reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
for RLOCs.  Note that reachability is not part of the</td><td> </td><td =
class=3D"right">   information for RLOCs.  Note that reachability is not =
part of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping system =
and is determined using one or more of the Routing</td><td> </td><td =
class=3D"right">   mapping system and is determined using one or more of =
the Routing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator =
reachability algorithms described in the next section.</td><td> </td><td =
class=3D"right">   Locator reachability algorithms described in the next =
section.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">10.  Routing =
Locator Reachability</td><td> </td><td class=3D"right">10.  Routing =
Locator Reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Several =
mechanisms for determining RLOC reachability are currently</td><td> =
</td><td class=3D"right">   Several mechanisms for determining RLOC =
reachability are currently</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
defined:</td><td> </td><td class=3D"right">   defined:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0056"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   1.  An ETR =
<span class=3D"delete">may</span> examine the Locator-Status-Bits in the =
LISP header of</td><td> </td><td class=3D"rblock">   1.  An ETR <span =
class=3D"insert">MAY</span> examine the Locator-Status-Bits in the LISP =
header of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       an =
encapsulated data packet received from an ITR.  If the ETR is</td><td> =
</td><td class=3D"right">       an encapsulated data packet received =
from an ITR.  If the ETR is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       also =
acting as an ITR and has traffic to return to the original</td><td> =
</td><td class=3D"right">       also acting as an ITR and has traffic to =
return to the original</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       ITR site, =
it can use this status information to help select an</td><td> </td><td =
class=3D"right">       ITR site, it can use this status information to =
help select an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
RLOC.</td><td> </td><td class=3D"right">       RLOC.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0057"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   2.  An ITR =
<span class=3D"delete">may</span> receive an ICMP Network Unreachable or =
Host</td><td> </td><td class=3D"rblock">   2.  An ITR <span =
class=3D"insert">MAY</span> receive an ICMP Network Unreachable or =
Host</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Unreachable message for an RLOC it is using.  This indicates =
that</td><td> </td><td class=3D"right">       Unreachable message for an =
RLOC it is using.  This indicates that</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">       the RLOC =
is likely down.  Note that trusting ICMP messages may</td><td> </td><td =
class=3D"right">       the RLOC is likely down.  Note that trusting ICMP =
messages may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       not be =
desirable, but neither is ignoring them completely.</td><td> </td><td =
class=3D"right">       not be desirable, but neither is ignoring them =
completely.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Implementations are encouraged to follow current best practices</td><td> =
</td><td class=3D"right">       Implementations are encouraged to follow =
current best practices</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       in =
treating these conditions.</td><td> </td><td class=3D"right">       in =
treating these conditions.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  An ITR =
that participates in the global routing system can</td><td> </td><td =
class=3D"right">   3.  An ITR that participates in the global routing =
system can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       determine =
that an RLOC is down if no BGP Routing Information Base</td><td> =
</td><td class=3D"right">       determine that an RLOC is down if no BGP =
Routing Information Base</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       (RIB) =
route exists that matches the RLOC IP address.</td><td> </td><td =
class=3D"right">       (RIB) route exists that matches the RLOC IP =
address.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0058"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   4.  An ITR =
<span class=3D"delete">may</span> receive an ICMP Port Unreachable =
message from a</td><td> </td><td class=3D"rblock">   4.  An ITR <span =
class=3D"insert">MAY</span> receive an ICMP Port Unreachable message =
from a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
destination host.  This occurs if an ITR attempts to use</td><td> =
</td><td class=3D"right">       destination host.  This occurs if an ITR =
attempts to use</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
interworking [RFC6832] and LISP-encapsulated data is sent to a</td><td> =
</td><td class=3D"right">       interworking [RFC6832] and =
LISP-encapsulated data is sent to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
non-LISP-capable site.</td><td> </td><td class=3D"right">       =
non-LISP-capable site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0059"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   5.  An ITR =
<span class=3D"delete">may</span> receive a Map-Reply from an ETR in =
response to a</td><td> </td><td class=3D"rblock">   5.  An ITR <span =
class=3D"insert">MAY</span> receive a Map-Reply from an ETR in response =
to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       previously =
sent Map-Request.  The RLOC source of the Map-Reply is</td><td> </td><td =
class=3D"right">       previously sent Map-Request.  The RLOC source of =
the Map-Reply is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       likely up, =
since the ETR was able to send the Map-Reply to the</td><td> </td><td =
class=3D"right">       likely up, since the ETR was able to send the =
Map-Reply to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
ITR.</td><td> </td><td class=3D"right">       ITR.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   6.  When an =
ETR receives an encapsulated packet from an ITR, the</td><td> </td><td =
class=3D"right">   6.  When an ETR receives an encapsulated packet from =
an ITR, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       source =
RLOC from the outer header of the packet is likely up.</td><td> </td><td =
class=3D"right">       source RLOC from the outer header of the packet =
is likely up.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  An ITR/ETR =
pair can use the Locator reachability algorithms</td><td> </td><td =
class=3D"right">   7.  An ITR/ETR pair can use the Locator reachability =
algorithms</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       described =
in this section, namely Echo-Noncing or RLOC-Probing.</td><td> </td><td =
class=3D"right">       described in this section, namely Echo-Noncing or =
RLOC-Probing.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-15" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 26, line =
17<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 26, line =
6<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
decapsulates a packet, it will check for any change in</td><td> </td><td =
class=3D"right">   When an ETR decapsulates a packet, it will check for =
any change in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
'Locator-Status-Bits' field.  When a bit goes from 1 to 0, the</td><td> =
</td><td class=3D"right">   the 'Locator-Status-Bits' field.  When a bit =
goes from 1 to 0, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ETR, if acting =
also as an ITR, will refrain from encapsulating</td><td> </td><td =
class=3D"right">   ETR, if acting also as an ITR, will refrain from =
encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets to an =
RLOC that is indicated as down.  It will only resume</td><td> </td><td =
class=3D"right">   packets to an RLOC that is indicated as down.  It =
will only resume</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   using that =
RLOC if the corresponding Locator-Status-Bit returns to a</td><td> =
</td><td class=3D"right">   using that RLOC if the corresponding =
Locator-Status-Bit returns to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   value of 1.  =
Locator-Status-Bits are associated with a Locator-Set</td><td> </td><td =
class=3D"right">   value of 1.  Locator-Status-Bits are associated with =
a Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   per =
EID-Prefix.  Therefore, when a Locator becomes unreachable, the</td><td> =
</td><td class=3D"right">   per EID-Prefix.  Therefore, when a Locator =
becomes unreachable, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Locator-Status-Bit that corresponds to that Locator's position in =
the</td><td> </td><td class=3D"right">   Locator-Status-Bit that =
corresponds to that Locator's position in the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   list returned =
by the last Map-Reply will be set to zero for that</td><td> </td><td =
class=3D"right">   list returned by the last Map-Reply will be set to =
zero for that</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0060"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   particular =
EID-Prefix.</td><td> </td><td class=3D"rblock">   particular EID-Prefix. =
 <span class=3D"insert">Refer to Section 19 for security =
related</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   issues regarding =
Locator-Status-Bits.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When ITRs at =
the site are not deployed in CE routers, the IGP can</td><td> </td><td =
class=3D"right">   When ITRs at the site are not deployed in CE routers, =
the IGP can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   still be used =
to determine the reachability of Locators, provided</td><td> </td><td =
class=3D"right">   still be used to determine the reachability of =
Locators, provided</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   they are =
injected into the IGP.  This is typically done when a /32</td><td> =
</td><td class=3D"right">   they are injected into the IGP.  This is =
typically done when a /32</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   address is =
configured on a loopback interface.</td><td> </td><td class=3D"right">   =
address is configured on a loopback interface.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When ITRs =
receive ICMP Network Unreachable or Host Unreachable</td><td> </td><td =
class=3D"right">   When ITRs receive ICMP Network Unreachable or Host =
Unreachable</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages as a =
method to determine unreachability, they will refrain</td><td> </td><td =
class=3D"right">   messages as a method to determine unreachability, =
they will refrain</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from using =
Locators that are described in Locator lists of Map-</td><td> </td><td =
class=3D"right">   from using Locators that are described in Locator =
lists of Map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Replies.  =
However, using this approach is unreliable because many</td><td> =
</td><td class=3D"right">   Replies.  However, using this approach is =
unreliable because many</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-16" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 27, line =
45<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 27, line =
36<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   E-bit cleared. =
 The ITR sees this "echoed nonce" and knows that the</td><td> </td><td =
class=3D"right">   E-bit cleared.  The ITR sees this "echoed nonce" and =
knows that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   path to and =
from the ETR is up.</td><td> </td><td class=3D"right">   path to and =
from the ETR is up.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The ITR will =
set the E-bit and N-bit for every packet it sends while</td><td> =
</td><td class=3D"right">   The ITR will set the E-bit and N-bit for =
every packet it sends while</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in the =
echo-nonce-request state.  The time the ITR waits to process</td><td> =
</td><td class=3D"right">   in the echo-nonce-request state.  The time =
the ITR waits to process</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the echoed =
nonce before it determines the path is unreachable is</td><td> </td><td =
class=3D"right">   the echoed nonce before it determines the path is =
unreachable is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   variable and =
is a choice left for the implementation.</td><td> </td><td =
class=3D"right">   variable and is a choice left for the =
implementation.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   If the ITR is =
receiving packets from the ETR but does not see the</td><td> </td><td =
class=3D"right">   If the ITR is receiving packets from the ETR but does =
not see the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   nonce echoed =
while being in the echo-nonce-request state, then the</td><td> </td><td =
class=3D"right">   nonce echoed while being in the echo-nonce-request =
state, then the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0061"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   path to the =
ETR is unreachable.  This decision <span class=3D"delete">may</span> be =
overridden by</td><td> </td><td class=3D"rblock">   path to the ETR is =
unreachable.  This decision <span class=3D"insert">MAY</span> be =
overridden by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   other Locator =
reachability algorithms.  Once the ITR determines that</td><td> </td><td =
class=3D"right">   other Locator reachability algorithms.  Once the ITR =
determines that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the path to =
the ETR is down, it can switch to another Locator for</td><td> </td><td =
class=3D"right">   the path to the ETR is down, it can switch to another =
Locator for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that =
EID-Prefix.</td><td> </td><td class=3D"right">   that =
EID-Prefix.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Note that =
"ITR" and "ETR" are relative terms here.  Both devices MUST</td><td> =
</td><td class=3D"right">   Note that "ITR" and "ETR" are relative terms =
here.  Both devices MUST</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   be =
implementing both ITR and ETR functionality for the echo nonce</td><td> =
</td><td class=3D"right">   be implementing both ITR and ETR =
functionality for the echo nonce</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mechanism to =
operate.</td><td> </td><td class=3D"right">   mechanism to =
operate.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0062"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   The ITR and =
ETR <span class=3D"delete">may</span> both go into the =
echo-nonce-request state at the</td><td> </td><td class=3D"rblock">   =
The ITR and ETR <span class=3D"insert">MAY</span> both go into the =
echo-nonce-request state at the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   same time.  =
The number of packets sent or the time during which echo</td><td> =
</td><td class=3D"right">   same time.  The number of packets sent or =
the time during which echo</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   nonce requests =
are sent is an implementation-specific setting.</td><td> </td><td =
class=3D"right">   nonce requests are sent is an implementation-specific =
setting.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   However, when =
an ITR is in the echo-nonce-request state, it can echo</td><td> </td><td =
class=3D"right">   However, when an ITR is in the echo-nonce-request =
state, it can echo</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the ETR's =
nonce in the next set of packets that it encapsulates and</td><td> =
</td><td class=3D"right">   the ETR's nonce in the next set of packets =
that it encapsulates and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   subsequently =
continue sending echo-nonce-request packets.</td><td> </td><td =
class=3D"right">   subsequently continue sending echo-nonce-request =
packets.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This mechanism =
does not completely solve the forward path</td><td> </td><td =
class=3D"right">   This mechanism does not completely solve the forward =
path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
problem, as traffic may be unidirectional.  That is, the</td><td> =
</td><td class=3D"right">   reachability problem, as traffic may be =
unidirectional.  That is, the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0063"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ETR =
receiving traffic at a site <span class=3D"delete">may</span> not be the =
same device as an ITR</td><td> </td><td class=3D"rblock">   ETR =
receiving traffic at a site <span class=3D"insert">MAY</span> not be the =
same device as an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that transmits =
traffic from that site, or the site-to-site traffic is</td><td> </td><td =
class=3D"right">   that transmits traffic from that site, or the =
site-to-site traffic is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   unidirectional =
so there is no ITR returning traffic.</td><td> </td><td class=3D"right"> =
  unidirectional so there is no ITR returning traffic.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The echo-nonce =
algorithm is bilateral.  That is, if one side sets the</td><td> </td><td =
class=3D"right">   The echo-nonce algorithm is bilateral.  That is, if =
one side sets the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   E-bit and the =
other side is not enabled for echo-noncing, then the</td><td> </td><td =
class=3D"right">   E-bit and the other side is not enabled for =
echo-noncing, then the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   echoing of the =
nonce does not occur and the requesting side may</td><td> </td><td =
class=3D"right">   echoing of the nonce does not occur and the =
requesting side may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   erroneously =
consider the Locator unreachable.  An ITR SHOULD only set</td><td> =
</td><td class=3D"right">   erroneously consider the Locator =
unreachable.  An ITR SHOULD only set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the E-bit in =
an encapsulated data packet when it knows the ETR is</td><td> </td><td =
class=3D"right">   the E-bit in an encapsulated data packet when it =
knows the ETR is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   enabled for =
echo-noncing.  This is conveyed by the E-bit in the RLOC-</td><td> =
</td><td class=3D"right">   enabled for echo-noncing.  This is conveyed =
by the E-bit in the RLOC-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   probe =
Map-Reply message.</td><td> </td><td class=3D"right">   probe Map-Reply =
message.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0064"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Note <span =
class=3D"delete">that</span> other Locator <span =
class=3D"delete">reachability</span> mechanisms <span class=3D"delete">are=
 being researched</span></td><td> </td><td class=3D"rblock">   Note =
other Locator <span class=3D"insert">Reachability</span> mechanisms can =
be used to compliment</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   and</span> can be used to compliment or even =
override the echo nonce</td><td> </td><td class=3D"rblock">   or even =
override the echo nonce algorithm.  See the next section for</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   algorithm.  =
See the next section for an example of control-plane</td><td> </td><td =
class=3D"rblock">   an example of control-plane probing.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
probing.</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">10.2.  =
RLOC-Probing Algorithm</td><td> </td><td class=3D"right">10.2.  =
RLOC-Probing Algorithm</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC-Probing =
is a method that an ITR or PITR can use to determine the</td><td> =
</td><td class=3D"right">   RLOC-Probing is a method that an ITR or PITR =
can use to determine the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
status of one or more Locators that it has cached in a</td><td> </td><td =
class=3D"right">   reachability status of one or more Locators that it =
has cached in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Map-Cache =
entry.  The probe-bit of the Map-Request and Map-Reply</td><td> </td><td =
class=3D"right">   Map-Cache entry.  The probe-bit of the Map-Request =
and Map-Reply</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages is =
used for RLOC-Probing.</td><td> </td><td class=3D"right">   messages is =
used for RLOC-Probing.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC-Probing =
is done in the control plane on a timer basis, where an</td><td> =
</td><td class=3D"right">   RLOC-Probing is done in the control plane on =
a timer basis, where an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR or PITR =
will originate a Map-Request destined to a locator</td><td> </td><td =
class=3D"right">   ITR or PITR will originate a Map-Request destined to =
a locator</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   address from =
one of its own locator addresses.  A Map-Request used as</td><td> =
</td><td class=3D"right">   address from one of its own locator =
addresses.  A Map-Request used as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   an RLOC-probe =
is NOT encapsulated and NOT sent to a Map-Server or to</td><td> </td><td =
class=3D"right">   an RLOC-probe is NOT encapsulated and NOT sent to a =
Map-Server or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the mapping =
database system as one would when soliciting mapping</td><td> </td><td =
class=3D"right">   the mapping database system as one would when =
soliciting mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   data.  The EID =
record encoded in the Map-Request is the EID-Prefix of</td><td> </td><td =
class=3D"right">   data.  The EID record encoded in the Map-Request is =
the EID-Prefix of</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0065"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
Map-Cache entry cached by the ITR or PITR.  The ITR <span =
class=3D"delete">may</span> include a</td><td> </td><td class=3D"rblock"> =
  the Map-Cache entry cached by the ITR or PITR.  The ITR <span =
class=3D"insert">MAY</span> include a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping data =
record for its own database mapping information that</td><td> </td><td =
class=3D"right">   mapping data record for its own database mapping =
information that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   contains the =
local EID-Prefixes and RLOCs for its site.  RLOC-probes</td><td> =
</td><td class=3D"right">   contains the local EID-Prefixes and RLOCs =
for its site.  RLOC-probes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   are sent =
periodically using a jittered timer interval.</td><td> </td><td =
class=3D"right">   are sent periodically using a jittered timer =
interval.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
receives a Map-Request message with the probe-bit set, it</td><td> =
</td><td class=3D"right">   When an ETR receives a Map-Request message =
with the probe-bit set, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   returns a =
Map-Reply with the probe-bit set.  The source address of</td><td> =
</td><td class=3D"right">   returns a Map-Reply with the probe-bit set.  =
The source address of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the Map-Reply =
is set according to the procedure described in</td><td> </td><td =
class=3D"right">   the Map-Reply is set according to the procedure =
described in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis].  The Map-Reply SHOULD contain =
mapping</td><td> </td><td class=3D"right">   [I-D.ietf-lisp-rfc6833bis]. =
 The Map-Reply SHOULD contain mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   data for the =
EID-Prefix contained in the Map-Request.  This provides</td><td> =
</td><td class=3D"right">   data for the EID-Prefix contained in the =
Map-Request.  This provides</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
opportunity for the ITR or PITR that sent the RLOC-probe to get</td><td> =
</td><td class=3D"right">   the opportunity for the ITR or PITR that =
sent the RLOC-probe to get</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-17" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 29, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 29, line =
14<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachable or =
has become unreachable, thus providing a robust</td><td> </td><td =
class=3D"right">   reachable or has become unreachable, thus providing a =
robust</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mechanism for =
switching to using another Locator from the cached</td><td> </td><td =
class=3D"right">   mechanism for switching to using another Locator from =
the cached</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator.  =
RLOC-Probing can also provide rough Round-Trip Time (RTT)</td><td> =
</td><td class=3D"right">   Locator.  RLOC-Probing can also provide =
rough Round-Trip Time (RTT)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   estimates =
between a pair of Locators, which can be useful for network</td><td> =
</td><td class=3D"right">   estimates between a pair of Locators, which =
can be useful for network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   management =
purposes as well as for selecting low delay paths.  The</td><td> =
</td><td class=3D"right">   management purposes as well as for selecting =
low delay paths.  The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   major =
disadvantage of RLOC-Probing is in the number of control</td><td> =
</td><td class=3D"right">   major disadvantage of RLOC-Probing is in the =
number of control</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages =
required and the amount of bandwidth used to obtain those</td><td> =
</td><td class=3D"right">   messages required and the amount of =
bandwidth used to obtain those</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   benefits, =
especially if the requirement for failure detection times</td><td> =
</td><td class=3D"right">   benefits, especially if the requirement for =
failure detection times</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is very =
small.</td><td> </td><td class=3D"right">   is very small.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0066"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Continued research and testing will attempt to =
characterize the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   tradeoffs of failure detection times versus message =
overhead.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">11.  EID =
Reachability within a LISP Site</td><td> </td><td class=3D"right">11.  =
EID Reachability within a LISP Site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0067"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   A site <span =
class=3D"delete">may</span> be multihomed using two or more ETRs.  The =
hosts and</td><td> </td><td class=3D"rblock">   A site <span =
class=3D"insert">MAY</span> be multihomed using two or more ETRs.  The =
hosts and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   infrastructure =
within a site will be addressed using one or more EID-</td><td> </td><td =
class=3D"right">   infrastructure within a site will be addressed using =
one or more EID-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Prefixes that =
are mapped to the RLOCs of the relevant ETRs in the</td><td> </td><td =
class=3D"right">   Prefixes that are mapped to the RLOCs of the relevant =
ETRs in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping =
system.  One possible failure mode is for an ETR to lose</td><td> =
</td><td class=3D"right">   mapping system.  One possible failure mode =
is for an ETR to lose</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
to one or more of the EID-Prefixes within its own site.</td><td> =
</td><td class=3D"right">   reachability to one or more of the =
EID-Prefixes within its own site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When this =
occurs when the ETR sends Map-Replies, it can clear the</td><td> =
</td><td class=3D"right">   When this occurs when the ETR sends =
Map-Replies, it can clear the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   R-bit =
associated with its own Locator.  And when the ETR is also an</td><td> =
</td><td class=3D"right">   R-bit associated with its own Locator.  And =
when the ETR is also an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR, it can =
clear its Locator-Status-Bit in the encapsulation data</td><td> </td><td =
class=3D"right">   ITR, it can clear its Locator-Status-Bit in the =
encapsulation data</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
header.</td><td> </td><td class=3D"right">   header.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   It is =
recognized that there are no simple solutions to the site</td><td> =
</td><td class=3D"right">   It is recognized that there are no simple =
solutions to the site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   partitioning =
problem because it is hard to know which part of the</td><td> </td><td =
class=3D"right">   partitioning problem because it is hard to know which =
part of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EID-Prefix =
range is partitioned and which Locators can reach any sub-</td><td> =
</td><td class=3D"right">   EID-Prefix range is partitioned and which =
Locators can reach any sub-</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0068"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ranges of =
the EID-Prefixes.  <span class=3D"delete">This problem is under =
investigation with</span></td><td> </td><td class=3D"rblock">   ranges =
of the EID-Prefixes.  Note that this is not a new problem</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   the expectation that experiments will tell us =
more.</span>  Note that this</td><td> </td><td class=3D"rblock">   =
introduced by the LISP architecture.  The problem exists today when =
a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   is not a new =
problem introduced by the LISP architecture.  The</td><td> </td><td =
class=3D"rblock">   multihomed site uses BGP to advertise its =
reachability upstream.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   problem =
exists today when a multihomed site uses BGP to advertise its</td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   reachability =
upstream.</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">12.  Routing =
Locator Hashing</td><td> </td><td class=3D"right">12.  Routing Locator =
Hashing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0069"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   When an ETR =
provides an EID-to-RLOC mapping in a Map-Reply message <span =
class=3D"delete">to</span></td><td> </td><td class=3D"rblock">   When an =
ETR provides an EID-to-RLOC mapping in a Map-Reply message</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   a requesting =
ITR, the Locator-Set for the EID-Prefix <span class=3D"delete">may</span> =
contain</td><td> </td><td class=3D"rblock">   <span class=3D"insert">that =
is stored in the map-cache of</span> a requesting ITR, the =
Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   different =
Priority values for each locator address.  When more than</td><td> =
</td><td class=3D"rblock">   for the EID-Prefix <span =
class=3D"insert">MAY</span> contain different Priority <span =
class=3D"insert">and Weight</span> values</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   one best =
Priority Locator exists, the ITR can decide how to <span =
class=3D"delete">load-</span></td><td> </td><td class=3D"rblock">   for =
each locator address.  When more than one best Priority Locator</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   share</span> traffic against the corresponding =
Locators.</td><td> </td><td class=3D"rblock">   exists, the ITR can =
decide how to <span class=3D"insert">load-share</span> traffic against =
the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   corresponding Locators.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0070"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   The =
following hash algorithm <span class=3D"delete">may</span> be used by an =
ITR to select a</td><td> </td><td class=3D"rblock">   The following hash =
algorithm <span class=3D"insert">MAY</span> be used by an ITR to select =
a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator for a =
packet destined to an EID for the EID-to-RLOC mapping:</td><td> </td><td =
class=3D"right">   Locator for a packet destined to an EID for the =
EID-to-RLOC mapping:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  Either a =
source and destination address hash or the traditional</td><td> </td><td =
class=3D"right">   1.  Either a source and destination address hash or =
the traditional</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       5-tuple =
hash can be used.  The traditional 5-tuple hash includes</td><td> =
</td><td class=3D"right">       5-tuple hash can be used.  The =
traditional 5-tuple hash includes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the source =
and destination addresses; source and destination TCP,</td><td> </td><td =
class=3D"right">       the source and destination addresses; source and =
destination TCP,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       UDP, or =
Stream Control Transmission Protocol (SCTP) port numbers;</td><td> =
</td><td class=3D"right">       UDP, or Stream Control Transmission =
Protocol (SCTP) port numbers;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       and the IP =
protocol number field or IPv6 next-protocol fields of</td><td> </td><td =
class=3D"right">       and the IP protocol number field or IPv6 =
next-protocol fields of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       a packet =
that a host originates from within a LISP site.  When a</td><td> =
</td><td class=3D"right">       a packet that a host originates from =
within a LISP site.  When a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       packet is =
not a TCP, UDP, or SCTP packet, the source and</td><td> </td><td =
class=3D"right">       packet is not a TCP, UDP, or SCTP packet, the =
source and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
destination addresses only from the header are used to compute</td><td> =
</td><td class=3D"right">       destination addresses only from the =
header are used to compute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-18" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 34, line =
6<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 33, line =
30<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Replies.  To =
avoid Map-Cache entry corruption by a third party, a</td><td> </td><td =
class=3D"right">   Replies.  To avoid Map-Cache entry corruption by a =
third party, a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sender of an =
SMR-based Map-Request MUST be verified.  If an ITR</td><td> </td><td =
class=3D"right">   sender of an SMR-based Map-Request MUST be verified.  =
If an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   receives an =
SMR-based Map-Request and the source is not in the</td><td> </td><td =
class=3D"right">   receives an SMR-based Map-Request and the source is =
not in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator-Set =
for the stored Map-Cache entry, then the responding Map-</td><td> =
</td><td class=3D"right">   Locator-Set for the stored Map-Cache entry, =
then the responding Map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Request MUST =
be sent with an EID destination to the mapping database</td><td> =
</td><td class=3D"right">   Request MUST be sent with an EID destination =
to the mapping database</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   system.  Since =
the mapping database system is a more secure way to</td><td> </td><td =
class=3D"right">   system.  Since the mapping database system is a more =
secure way to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reach an =
authoritative ETR, it will deliver the Map-Request to the</td><td> =
</td><td class=3D"right">   reach an authoritative ETR, it will deliver =
the Map-Request to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   authoritative =
source of the mapping data.</td><td> </td><td class=3D"right">   =
authoritative source of the mapping data.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ITR =
receives an SMR-based Map-Request for which it does not</td><td> =
</td><td class=3D"right">   When an ITR receives an SMR-based =
Map-Request for which it does not</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0071"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   have a =
cached mapping for the EID in the SMR message, it <span =
class=3D"delete">MAY</span> not send</td><td> </td><td class=3D"rblock"> =
  have a cached mapping for the EID in the SMR message, it <span =
class=3D"insert">may</span> not send</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   an SMR-invoked =
Map-Request.  This scenario can occur when an ETR</td><td> </td><td =
class=3D"right">   an SMR-invoked Map-Request.  This scenario can occur =
when an ETR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sends SMR =
messages to all Locators in the Locator-Set it has stored</td><td> =
</td><td class=3D"right">   sends SMR messages to all Locators in the =
Locator-Set it has stored</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in its =
map-cache but the remote ITRs that receive the SMR may not be</td><td> =
</td><td class=3D"right">   in its map-cache but the remote ITRs that =
receive the SMR may not be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sending =
packets to the site.  There is no point in updating the ITRs</td><td> =
</td><td class=3D"right">   sending packets to the site.  There is no =
point in updating the ITRs</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   until they =
need to send, in which case they will send Map-Requests to</td><td> =
</td><td class=3D"right">   until they need to send, in which case they =
will send Map-Requests to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   obtain a =
Map-Cache entry.</td><td> </td><td class=3D"right">   obtain a Map-Cache =
entry.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">13.3.  Database =
Map-Versioning</td><td> </td><td class=3D"right">13.3.  Database =
Map-Versioning</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When there is =
unidirectional packet flow between an ITR and ETR, and</td><td> </td><td =
class=3D"right">   When there is unidirectional packet flow between an =
ITR and ETR, and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-19" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 35, line =
52<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 35, line =
26<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   few =
implementation techniques can be used to incrementally =
implement</td><td> </td><td class=3D"right">   few implementation =
techniques can be used to incrementally implement</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP:</td><td> =
</td><td class=3D"right">   LISP:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  When a =
tunnel-encapsulated packet is received by an ETR, the outer</td><td> =
</td><td class=3D"right">   o  When a tunnel-encapsulated packet is =
received by an ETR, the outer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
address may not be the address of the router.  This</td><td> </td><td =
class=3D"right">      destination address may not be the address of the =
router.  This</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      makes it =
challenging for the control plane to get packets from the</td><td> =
</td><td class=3D"right">      makes it challenging for the control =
plane to get packets from the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hardware.  =
This may be mitigated by creating special Forwarding</td><td> </td><td =
class=3D"right">      hardware.  This may be mitigated by creating =
special Forwarding</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Information =
Base (FIB) entries for the EID-Prefixes of EIDs served</td><td> </td><td =
class=3D"right">      Information Base (FIB) entries for the =
EID-Prefixes of EIDs served</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      by the ETR =
(those for which the router provides an RLOC</td><td> </td><td =
class=3D"right">      by the ETR (those for which the router provides an =
RLOC</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
translation).  These FIB entries are marked with a flag =
indicating</td><td> </td><td class=3D"right">      translation).  These =
FIB entries are marked with a flag indicating</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0072"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      that =
control-plane processing <span class=3D"delete">should</span> be =
performed.  The forwarding</td><td> </td><td class=3D"rblock">      that =
control-plane processing <span class=3D"insert">SHOULD</span> be =
performed.  The forwarding</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      logic of =
testing for particular IP protocol number values is not</td><td> =
</td><td class=3D"right">      logic of testing for particular IP =
protocol number values is not</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      necessary.  =
There are a few proven cases where no changes to</td><td> </td><td =
class=3D"right">      necessary.  There are a few proven cases where no =
changes to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      existing =
deployed hardware were needed to support the LISP data-</td><td> =
</td><td class=3D"right">      existing deployed hardware were needed to =
support the LISP data-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
plane.</td><td> </td><td class=3D"right">      plane.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  On an ITR, =
prepending a new IP header consists of adding more</td><td> </td><td =
class=3D"right">   o  On an ITR, prepending a new IP header consists of =
adding more</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      octets to a =
MAC rewrite string and prepending the string as part</td><td> </td><td =
class=3D"right">      octets to a MAC rewrite string and prepending the =
string as part</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of the =
outgoing encapsulation procedure.  Routers that support</td><td> =
</td><td class=3D"right">      of the outgoing encapsulation procedure.  =
Routers that support</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Generic =
Routing Encapsulation (GRE) tunneling [RFC2784] or 6to4</td><td> =
</td><td class=3D"right">      Generic Routing Encapsulation (GRE) =
tunneling [RFC2784] or 6to4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      tunneling =
[RFC3056] may already support this action.</td><td> </td><td =
class=3D"right">      tunneling [RFC3056] may already support this =
action.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-20" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 38, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 37, line =
40<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">17.  LISP xTR =
Placement and Encapsulation Methods</td><td> </td><td class=3D"right">17. =
 LISP xTR Placement and Encapsulation Methods</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
will explore how and where ITRs and ETRs can be placed</td><td> </td><td =
class=3D"right">   This section will explore how and where ITRs and ETRs =
can be placed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in the network =
and will discuss the pros and cons of each scenario.</td><td> </td><td =
class=3D"right">   in the network and will discuss the pros and cons of =
each scenario.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   For a more =
detailed networkd design deployment recommendation, refer</td><td> =
</td><td class=3D"right">   For a more detailed networkd design =
deployment recommendation, refer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to =
[RFC7215].</td><td> </td><td class=3D"right">   to [RFC7215].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   There are two =
basic deployment tradeoffs to consider: centralized</td><td> </td><td =
class=3D"right">   There are two basic deployment tradeoffs to consider: =
centralized</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   versus =
distributed caches; and flat, Recursive, or Re-encapsulating</td><td> =
</td><td class=3D"right">   versus distributed caches; and flat, =
Recursive, or Re-encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tunneling.  =
When deciding on centralized versus distributed caching,</td><td> =
</td><td class=3D"right">   Tunneling.  When deciding on centralized =
versus distributed caching,</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0073"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
following issues <span class=3D"delete">should</span> be =
considered:</td><td> </td><td class=3D"rblock">   the following issues =
<span class=3D"insert">SHOULD</span> be considered:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Are the =
xTRs spread out so that the caches are spread across all</td><td> =
</td><td class=3D"right">   o  Are the xTRs spread out so that the =
caches are spread across all</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the =
memories of each router?  A centralized cache is when an ITR</td><td> =
</td><td class=3D"right">      the memories of each router?  A =
centralized cache is when an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      keeps a =
cache for all the EIDs it is encapsulating to.  The packet</td><td> =
</td><td class=3D"right">      keeps a cache for all the EIDs it is =
encapsulating to.  The packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      takes a =
direct path to the destination Locator.  A distributed</td><td> </td><td =
class=3D"right">      takes a direct path to the destination Locator.  A =
distributed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      cache is =
when an ITR needs help from other Re-Encapsulating Tunnel</td><td> =
</td><td class=3D"right">      cache is when an ITR needs help from =
other Re-Encapsulating Tunnel</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Routers =
(RTRs) because it does not store all the cache entries for</td><td> =
</td><td class=3D"right">      Routers (RTRs) because it does not store =
all the cache entries for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the EIDs it =
is encapsulating to.  So, the packet takes a path</td><td> </td><td =
class=3D"right">      the EIDs it is encapsulating to.  So, the packet =
takes a path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      through =
RTRs that have a different set of cache entries.</td><td> </td><td =
class=3D"right">      through RTRs that have a different set of cache =
entries.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Should =
management "touch points" be minimized by only choosing a</td><td> =
</td><td class=3D"right">   o  Should management "touch points" be =
minimized by only choosing a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      few xTRs, =
just enough for redundancy?</td><td> </td><td class=3D"right">      few =
xTRs, just enough for redundancy?</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  In general, =
using more ITRs doesn't increase management load,</td><td> </td><td =
class=3D"right">   o  In general, using more ITRs doesn't increase =
management load,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      since =
caches are built and stored dynamically.  On the other hand,</td><td> =
</td><td class=3D"right">      since caches are built and stored =
dynamically.  On the other hand,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      using more =
ETRs does require more management, since EID-Prefix-to-</td><td> =
</td><td class=3D"right">      using more ETRs does require more =
management, since EID-Prefix-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      RLOC =
mappings need to be explicitly configured.</td><td> </td><td =
class=3D"right">      RLOC mappings need to be explicitly =
configured.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When deciding =
on flat, Recursive, or Re-Encapsulating Tunneling, the</td><td> </td><td =
class=3D"right">   When deciding on flat, Recursive, or Re-Encapsulating =
Tunneling, the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0074"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   following =
issues <span class=3D"delete">should</span> be considered:</td><td> =
</td><td class=3D"rblock">   following issues <span =
class=3D"insert">SHOULD</span> be considered:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Flat =
tunneling implements a single encapsulation path between the</td><td> =
</td><td class=3D"right">   o  Flat tunneling implements a single =
encapsulation path between the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      source site =
and destination site.  This generally offers better</td><td> </td><td =
class=3D"right">      source site and destination site.  This generally =
offers better</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      paths =
between sources and destinations with a single encapsulation</td><td> =
</td><td class=3D"right">      paths between sources and destinations =
with a single encapsulation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
path.</td><td> </td><td class=3D"right">      path.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recursive =
Tunneling is when encapsulated traffic is again further</td><td> =
</td><td class=3D"right">   o  Recursive Tunneling is when encapsulated =
traffic is again further</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulated in another tunnel, either to implement VPNs or to</td><td> =
</td><td class=3D"right">      encapsulated in another tunnel, either to =
implement VPNs or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      perform =
Traffic Engineering.  When doing VPN-based tunneling, the</td><td> =
</td><td class=3D"right">      perform Traffic Engineering.  When doing =
VPN-based tunneling, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      site has =
some control, since the site is prepending a new</td><td> </td><td =
class=3D"right">      site has some control, since the site is =
prepending a new</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulation header.  In the case of TE-based tunneling, the =
site</td><td> </td><td class=3D"right">      encapsulation header.  In =
the case of TE-based tunneling, the site</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0075"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">may</span> have control if it is prepending a new =
tunnel header, but if</td><td> </td><td class=3D"rblock">      <span =
class=3D"insert">MAY</span> have control if it is prepending a new =
tunnel header, but if</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the site's =
ISP is doing the TE, then the site has no control.</td><td> </td><td =
class=3D"right">      the site's ISP is doing the TE, then the site has =
no control.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Recursive =
Tunneling generally will result in suboptimal paths but</td><td> =
</td><td class=3D"right">      Recursive Tunneling generally will result =
in suboptimal paths but</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      with the =
benefit of steering traffic to parts of the network that</td><td> =
</td><td class=3D"right">      with the benefit of steering traffic to =
parts of the network that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      have more =
resources available.</td><td> </td><td class=3D"right">      have more =
resources available.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
technique of Re-Encapsulation ensures that packets only</td><td> =
</td><td class=3D"right">   o  The technique of Re-Encapsulation ensures =
that packets only</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      require one =
encapsulation header.  So, if a packet needs to be re-</td><td> </td><td =
class=3D"right">      require one encapsulation header.  So, if a packet =
needs to be re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      routed, it =
is first decapsulated by the RTR and then Re-</td><td> </td><td =
class=3D"right">      routed, it is first decapsulated by the RTR and =
then Re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Encapsulated with a new encapsulation header using a new RLOC.</td><td> =
</td><td class=3D"right">      Encapsulated with a new encapsulation =
header using a new RLOC.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-21" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 41, line =
12<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 40, line =
36<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   addresses MUST =
be used only in the outer IP header so the NAT device</td><td> </td><td =
class=3D"right">   addresses MUST be used only in the outer IP header so =
the NAT device</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   can translate =
properly.  Otherwise, EID addresses MUST be translated</td><td> </td><td =
class=3D"right">   can translate properly.  Otherwise, EID addresses =
MUST be translated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   before =
encapsulation is performed when LISP VPNs are not in use.</td><td> =
</td><td class=3D"right">   before encapsulation is performed when LISP =
VPNs are not in use.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Both NAT =
translation and LISP encapsulation functions could be co-</td><td> =
</td><td class=3D"right">   Both NAT translation and LISP encapsulation =
functions could be co-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   located in the =
same device.</td><td> </td><td class=3D"right">   located in the same =
device.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">17.5.  Packets =
Egressing a LISP Site</td><td> </td><td class=3D"right">17.5.  Packets =
Egressing a LISP Site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When a LISP =
site is using two ITRs for redundancy, the failure of one</td><td> =
</td><td class=3D"right">   When a LISP site is using two ITRs for =
redundancy, the failure of one</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR will =
likely shift outbound traffic to the second.  This second</td><td> =
</td><td class=3D"right">   ITR will likely shift outbound traffic to =
the second.  This second</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0076"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ITR's cache =
<span class=3D"delete">may</span> not be populated with the same =
EID-to-RLOC mapping</td><td> </td><td class=3D"rblock">   ITR's cache =
<span class=3D"insert">MAY</span> not be populated with the same =
EID-to-RLOC mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   entries as the =
first.  If this second ITR does not have these</td><td> </td><td =
class=3D"right">   entries as the first.  If this second ITR does not =
have these</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mappings, =
traffic will be dropped while the mappings are retrieved</td><td> =
</td><td class=3D"right">   mappings, traffic will be dropped while the =
mappings are retrieved</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from the =
mapping system.  The retrieval of these messages may</td><td> </td><td =
class=3D"right">   from the mapping system.  The retrieval of these =
messages may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   increase the =
load of requests being sent into the mapping system.</td><td> </td><td =
class=3D"right">   increase the load of requests being sent into the =
mapping system.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">18.  Traceroute =
Considerations</td><td> </td><td class=3D"right">18.  Traceroute =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When a source =
host in a LISP site initiates a traceroute to a</td><td> </td><td =
class=3D"right">   When a source host in a LISP site initiates a =
traceroute to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destination =
host in another LISP site, it is highly desirable for it</td><td> =
</td><td class=3D"right">   destination host in another LISP site, it is =
highly desirable for it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to see the =
entire path.  Since packets are encapsulated from the ITR</td><td> =
</td><td class=3D"right">   to see the entire path.  Since packets are =
encapsulated from the ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-22" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 44, line =
16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 43, line =
42<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Map-Versioning =
is a data-plane mechanism used to signal a peering xTR</td><td> </td><td =
class=3D"right">   Map-Versioning is a data-plane mechanism used to =
signal a peering xTR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that a local =
EID-to-RLOC mapping has been updated, so that the</td><td> </td><td =
class=3D"right">   that a local EID-to-RLOC mapping has been updated, so =
that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   peering xTR =
uses LISP Control-Plane signaling message to retrieve a</td><td> =
</td><td class=3D"right">   peering xTR uses LISP Control-Plane =
signaling message to retrieve a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fresh mapping. =
 This can be used by an attacker to forge the map-</td><td> </td><td =
class=3D"right">   fresh mapping.  This can be used by an attacker to =
forge the map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   versioning =
field of a LISP encapsulated header and force an excessive</td><td> =
</td><td class=3D"right">   versioning field of a LISP encapsulated =
header and force an excessive</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   amount of =
signaling between xTRs that may overload them.</td><td> </td><td =
class=3D"right">   amount of signaling between xTRs that may overload =
them.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Most of the =
attack vectors can be mitigated with careful deployment</td><td> =
</td><td class=3D"right">   Most of the attack vectors can be mitigated =
with careful deployment</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and =
configuration, information learned opportunistically (such as =
LSB</td><td> </td><td class=3D"right">   and configuration, information =
learned opportunistically (such as LSB</td><td class=3D"lineno"></td></tr>=

      <tr id=3D"diff0077"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   or gleaning) =
<span class=3D"delete">should</span> be verified with other reachability =
mechanisms.</td><td> </td><td class=3D"rblock">   or gleaning) <span =
class=3D"insert">SHOULD</span> be verified with other reachability =
mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   In addition, =
systematic rate-limitation and filtering is an effective</td><td> =
</td><td class=3D"right">   In addition, systematic rate-limitation and =
filtering is an effective</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   technique to =
mitigate attacks that aim to overload the control-plane.</td><td> =
</td><td class=3D"right">   technique to mitigate attacks that aim to =
overload the control-plane.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">20.  Network =
Management Considerations</td><td> </td><td class=3D"right">20.  Network =
Management Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Considerations =
for network management tools exist so the LISP</td><td> </td><td =
class=3D"right">   Considerations for network management tools exist so =
the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   protocol suite =
can be operationally managed.  These mechanisms can be</td><td> </td><td =
class=3D"right">   protocol suite can be operationally managed.  These =
mechanisms can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   found in =
[RFC7052] and [RFC6835].</td><td> </td><td class=3D"right">   found in =
[RFC7052] and [RFC6835].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.  IANA =
Considerations</td><td> </td><td class=3D"right">21.  IANA =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
provides guidance to the Internet Assigned Numbers</td><td> </td><td =
class=3D"right">   This section provides guidance to the Internet =
Assigned Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Authority =
(IANA) regarding registration of values related to this</td><td> =
</td><td class=3D"right">   Authority (IANA) regarding registration of =
values related to this</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0078"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   data-plane =
LISP specification, in accordance with BCP 26 [RFC<span =
class=3D"delete">52</span>26].</td><td> </td><td class=3D"rblock">   =
data-plane LISP specification, in accordance with BCP 26 [RFC<span =
class=3D"insert">81</span>26].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.1.  LISP UDP =
Port Numbers</td><td> </td><td class=3D"right">21.1.  LISP UDP Port =
Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The IANA =
registry has allocated UDP port numbers 4341 and 4342 for</td><td> =
</td><td class=3D"right">   The IANA registry has allocated UDP port =
numbers 4341 and 4342 for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   lisp-data and =
lisp-control operation, respectively.  IANA has updated</td><td> =
</td><td class=3D"right">   lisp-data and lisp-control operation, =
respectively.  IANA has updated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
description for UDP ports 4341 and 4342 as follows:</td><td> </td><td =
class=3D"right">   the description for UDP ports 4341 and 4342 as =
follows:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       lisp-data  =
    4341 udp    LISP Data Packets</td><td> </td><td class=3D"right">     =
  lisp-data      4341 udp    LISP Data Packets</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
lisp-control   4342 udp    LISP Control Packets</td><td> </td><td =
class=3D"right">       lisp-control   4342 udp    LISP Control =
Packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.  =
References</td><td> </td><td class=3D"right">22.  References</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.1.  Normative =
References</td><td> </td><td class=3D"right">22.1.  Normative =
References</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0079"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-ddt]</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Fuller, V., Lewis, D., Ermagan, V., Jain, =
A., and A.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Smirnov, "LISP Delegated Database Tree", =
draft-ietf-lisp-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              ddt-09 (work in progress), January =
2017.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [I-D.ietf-lisp-introduction]</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Cabellos-Aparicio, A. and D. Saucez, "An =
Architectural</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Introduction to the Locator/ID Separation =
Protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (LISP)", draft-ietf-lisp-introduction-13 =
(work in</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              progress), April 2015.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,</td><td> </td><td =
class=3D"right">              Fuller, V., Farinacci, D., and A. =
Cabellos-Aparicio,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Locator/ID Separation Protocol (LISP) Control-Plane",</td><td> </td><td =
class=3D"right">              "Locator/ID Separation Protocol (LISP) =
Control-Plane",</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0080"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
draft-ietf-lisp-rfc6833bis-0<span class=3D"delete">6 (work in progress), =
Octo</span>ber</td><td> </td><td class=3D"rblock">              =
draft-ietf-lisp-rfc6833bis-0<span class=3D"insert">7 (work in progress), =
Decem</span>ber</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2017.</td><td> </td><td class=3D"right">              2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0081"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-sec]</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Maino, F., Ermagan, V., =
Cabellos-Aparicio, A., and D.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Saucez, "LISP-Security (LISP-SEC)", =
draft-ietf-lisp-sec-14</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (work in progress), October =
2017.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC0768]  =
Postel, J., "User Datagram Protocol", STD 6, RFC 768,</td><td> </td><td =
class=3D"right">   [RFC0768]  Postel, J., "User Datagram Protocol", STD =
6, RFC 768,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC0768, August 1980,</td><td> </td><td class=3D"right">        =
      DOI 10.17487/RFC0768, August 1980,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc768&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc768&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC0791]  =
Postel, J., "Internet Protocol", STD 5, RFC 791,</td><td> </td><td =
class=3D"right">   [RFC0791]  Postel, J., "Internet Protocol", STD 5, =
RFC 791,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC0791, September 1981,</td><td> </td><td class=3D"right">     =
         DOI 10.17487/RFC0791, September 1981,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc791&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc791&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC1918]  =
Rekhter, Y., Moskowitz, B., Karrenberg, D., de Groot, G.,</td><td> =
</td><td class=3D"right">   [RFC1918]  Rekhter, Y., Moskowitz, B., =
Karrenberg, D., de Groot, G.,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              and =
E. Lear, "Address Allocation for Private Internets",</td><td> </td><td =
class=3D"right">              and E. Lear, "Address Allocation for =
Private Internets",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              BCP =
5, RFC 1918, DOI 10.17487/RFC1918, February 1996,</td><td> </td><td =
class=3D"right">              BCP 5, RFC 1918, DOI 10.17487/RFC1918, =
February 1996,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc1918&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc1918&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC2119]  =
Bradner, S., "Key words for use in RFCs to Indicate</td><td> </td><td =
class=3D"right">   [RFC2119]  Bradner, S., "Key words for use in RFCs to =
Indicate</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Requirement Levels", BCP 14, RFC 2119,</td><td> </td><td class=3D"right"> =
             Requirement Levels", BCP 14, RFC 2119,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC2119, March 1997,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC2119, March 1997,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc2119&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc2119&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0082"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC2404]  Madson, C.</span> and <span =
class=3D"delete">R. Glenn, "The Use</span> of <span =
class=3D"delete">HMAC-SHA-1-96 within</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">[RFC2474]  Nichols, K., =
Blake, S., Baker, F.,</span> and <span class=3D"insert">D. =
Black,</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              ESP</span> and <span =
class=3D"delete">AH",</span> RFC <span class=3D"delete">2404,</span> DOI =
<span class=3D"delete">10.17487/RFC2404, November</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
"Definition</span> of <span class=3D"insert">the Differentiated Services =
Field (DS</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
1998, <span =
class=3D"delete">&lt;https://www.rfc-editor.org/info/rfc2404&gt;.</span></=
td><td> </td><td class=3D"rblock"><span class=3D"insert">              =
Field) in the IPv4</span> and <span class=3D"insert">IPv6 =
Headers",</span> RFC <span class=3D"insert">2474,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">              DOI <span =
class=3D"insert">10.17487/RFC2474, December</span> 1998,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">              <span =
class=3D"insert">&lt;https://www.rfc-editor.org/info/rfc2474&gt;.</span></=
td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3168]  =
Ramakrishnan, K., Floyd, S., and D. Black, "The Addition</td><td> =
</td><td class=3D"right">   [RFC3168]  Ramakrishnan, K., Floyd, S., and =
D. Black, "The Addition</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              of =
Explicit Congestion Notification (ECN) to IP",</td><td> </td><td =
class=3D"right">              of Explicit Congestion Notification (ECN) =
to IP",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
3168, DOI 10.17487/RFC3168, September 2001,</td><td> </td><td =
class=3D"right">              RFC 3168, DOI 10.17487/RFC3168, September =
2001,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc3168&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc3168&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0083"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC3232]  Reynolds, J., Ed., "Assigned Numbers: RFC =
1700 is Replaced</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              by an On-line Database", RFC 3232, DOI =
10.17487/RFC3232,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              January 2002, =
&lt;https://www.rfc-editor.org/info/rfc3232&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4086]  =
Eastlake 3rd, D., Schiller, J., and S. Crocker,</td><td> </td><td =
class=3D"right">   [RFC4086]  Eastlake 3rd, D., Schiller, J., and S. =
Crocker,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Randomness Requirements for Security", BCP 106, RFC 4086,</td><td> =
</td><td class=3D"right">              "Randomness Requirements for =
Security", BCP 106, RFC 4086,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4086, June 2005,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC4086, June 2005,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4086&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4086&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4632]  =
Fuller, V. and T. Li, "Classless Inter-domain Routing</td><td> </td><td =
class=3D"right">   [RFC4632]  Fuller, V. and T. Li, "Classless =
Inter-domain Routing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(CIDR): The Internet Address Assignment and Aggregation</td><td> =
</td><td class=3D"right">              (CIDR): The Internet Address =
Assignment and Aggregation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Plan", BCP 122, RFC 4632, DOI 10.17487/RFC4632, August</td><td> </td><td =
class=3D"right">              Plan", BCP 122, RFC 4632, DOI =
10.17487/RFC4632, August</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2006, &lt;https://www.rfc-editor.org/info/rfc4632&gt;.</td><td> </td><td =
class=3D"right">              2006, =
&lt;https://www.rfc-editor.org/info/rfc4632&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0084"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC4868]  Kelly, S. and S. Frankel, "Using =
HMAC-SHA-256, HMAC-SHA-</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              384, and HMAC-SHA-512 with IPsec", RFC =
4868,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC4868, May =
2007,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc4868&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC5226]  Narten, T. and H. Alvestrand, "Guidelines =
for Writing an</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              IANA Considerations Section in RFCs", RFC =
5226,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC5226, May =
2008,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc5226&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC5496]  Wijnands, IJ., Boers, A., and E. Rosen, =
"The Reverse Path</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Forwarding (RPF) Vector TLV", RFC =
5496,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC5496, March =
2009,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc5496&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC5944]  =
Perkins, C., Ed., "IP Mobility Support for IPv4, Revised",</td><td> =
</td><td class=3D"right">   [RFC5944]  Perkins, C., Ed., "IP Mobility =
Support for IPv4, Revised",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
5944, DOI 10.17487/RFC5944, November 2010,</td><td> </td><td =
class=3D"right">              RFC 5944, DOI 10.17487/RFC5944, November =
2010,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc5944&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc5944&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0085"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6115]  Li, T., Ed., "Recommendation for a Routing =
Architecture",</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              RFC 6115, DOI 10.17487/RFC6115, February =
2011,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6115&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6275]  =
Perkins, C., Ed., Johnson, D., and J. Arkko, "Mobility</td><td> </td><td =
class=3D"right">   [RFC6275]  Perkins, C., Ed., Johnson, D., and J. =
Arkko, "Mobility</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Support in IPv6", RFC 6275, DOI 10.17487/RFC6275, July</td><td> </td><td =
class=3D"right">              Support in IPv6", RFC 6275, DOI =
10.17487/RFC6275, July</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2011, &lt;https://www.rfc-editor.org/info/rfc6275&gt;.</td><td> </td><td =
class=3D"right">              2011, =
&lt;https://www.rfc-editor.org/info/rfc6275&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0086"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6834]  Iannone, L., Saucez, D., and O. Bonaventure, =
"Locator/ID</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) =
Map-Versioning", RFC 6834,</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6834, January =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6834&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC6836]  Fuller, V., Farinacci, D., Meyer, D., and =
D. Lewis,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              "Locator/ID Separation Protocol =
Alternative Logical</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Topology (LISP+ALT)", RFC 6836, DOI =
10.17487/RFC6836,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              January 2013, =
&lt;https://www.rfc-editor.org/info/rfc6836&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7052]  Schudel, G., Jain, A., and V. Moreno, =
"Locator/ID</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) MIB", RFC =
7052,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC7052, October =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7052&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7214]  Andersson, L. and C. Pignataro, "Moving =
Generic Associated</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Channel (G-ACh) IANA Registries to a New =
Registry",</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              RFC 7214, DOI 10.17487/RFC7214, May =
2014,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7214&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7215]  Jakab, L., Cabellos-Aparicio, A., Coras, =
F., Domingo-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Pascual, J., and D. Lewis, =
"Locator/Identifier Separation</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Protocol (LISP) Network Element =
Deployment</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Considerations", RFC 7215, DOI =
10.17487/RFC7215, April</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              2014, =
&lt;https://www.rfc-editor.org/info/rfc7215&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC7833]  =
Howlett, J., Hartman, S., and A. Perez-Mendez, Ed., "A</td><td> </td><td =
class=3D"right">   [RFC7833]  Howlett, J., Hartman, S., and A. =
Perez-Mendez, Ed., "A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
RADIUS Attribute, Binding, Profiles, Name Identifier</td><td> </td><td =
class=3D"right">              RADIUS Attribute, Binding, Profiles, Name =
Identifier</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Format, and Confirmation Methods for the Security</td><td> </td><td =
class=3D"right">              Format, and Confirmation Methods for the =
Security</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Assertion Markup Language (SAML)", RFC 7833,</td><td> </td><td =
class=3D"right">              Assertion Markup Language (SAML)", RFC =
7833,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC7833, May 2016,</td><td> </td><td class=3D"right">           =
   DOI 10.17487/RFC7833, May 2016,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc7833&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc7833&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0087"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC7835]  Saucez, D., Iannone, L.,</span> and <span =
class=3D"delete">O. Bonaventure, "Locator/ID</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">[RFC8126]  Cotton, M., Leiba, =
B.,</span> and <span class=3D"insert">T. Narten, "Guidelines =
for</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) Threat =
Analysis",</span> RFC <span class=3D"delete">7835,</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Writing =
an IANA Considerations Section in RFCs", BCP 26,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
DOI <span class=3D"delete">10.17487/RFC7835, April 2016,</span></td><td> =
</td><td class=3D"rblock">              RFC <span =
class=3D"insert">8126,</span> DOI <span class=3D"insert">10.17487/RFC8126,=
 June</span> 2017,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7835&gt;.</span></td><td> =
</td><td class=3D"rblock">              <span =
class=3D"insert">&lt;https://www.rfc-editor.org/info/rfc8126&gt;.</span></=
td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC8061]  Farinacci, D. and B. Weis, "Locator/ID =
Separation Protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (LISP) Data-Plane Confidentiality", RFC =
8061,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC8061, February</span> =
2017,</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
<span =
class=3D"delete">&lt;https://www.rfc-editor.org/info/rfc8061&gt;.</span></=
td><td> </td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC8200]  =
Deering, S. and R. Hinden, "Internet Protocol, Version 6</td><td> =
</td><td class=3D"right">   [RFC8200]  Deering, S. and R. Hinden, =
"Internet Protocol, Version 6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(IPv6) Specification", STD 86, RFC 8200,</td><td> </td><td =
class=3D"right">              (IPv6) Specification", STD 86, RFC =
8200,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC8200, July 2017,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC8200, July 2017,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc8200&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc8200&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.2.  =
Informative References</td><td> </td><td class=3D"right">22.2.  =
Informative References</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [AFN]      =
IANA, "Address Family Numbers", August 2016,</td><td> </td><td =
class=3D"right">   [AFN]      IANA, "Address Family Numbers", August =
2016,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;http://www.iana.org/assignments/address-family-numbers&gt;.</td><td> =
</td><td class=3D"right">              =
&lt;http://www.iana.org/assignments/address-family-numbers&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [CHIAPPA]  =
Chiappa, J., "Endpoints and Endpoint names: A Proposed",</td><td> =
</td><td class=3D"right">   [CHIAPPA]  Chiappa, J., "Endpoints and =
Endpoint names: A Proposed",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
1999,</td><td> </td><td class=3D"right">              1999,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt&gt;.</td><td> =
</td><td class=3D"right">              =
&lt;http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-eid-mobility]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-eid-mobility]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,</td><td> =
</td><td class=3D"right">              Portoles-Comeras, M., Ashtaputre, =
V., Moreno, V., Maino,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              F., =
and D. Farinacci, "LISP L2/L3 EID Mobility Using a</td><td> </td><td =
class=3D"right">              F., and D. Farinacci, "LISP L2/L3 EID =
Mobility Using a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0088"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
Unified Control Plane", <span =
class=3D"delete">draft-ietf-lisp-eid-mobility-00</span></td><td> =
</td><td class=3D"rblock">              Unified Control Plane", <span =
class=3D"insert">draft-ietf-lisp-eid-mobility-01</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
(work in progress), <span class=3D"delete">May</span> 2017.</td><td> =
</td><td class=3D"rblock">              (work in progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span =
class=3D"insert">[I-D.ietf-lisp-introduction]</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Cabellos-Aparicio, A. and D. Saucez, "An Architectural</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Introduction to the Locator/ID Separation Protocol</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (LISP)", =
draft-ietf-lisp-introduction-13 (work in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
progress), April 2015.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-mn]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-mn]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Farinacci, D., Lewis, D., Meyer, D., and C. White, "LISP</td><td> =
</td><td class=3D"right">              Farinacci, D., Lewis, D., Meyer, =
D., and C. White, "LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Mobile Node", draft-ietf-lisp-mn-01 (work in progress),</td><td> =
</td><td class=3D"right">              Mobile Node", =
draft-ietf-lisp-mn-01 (work in progress),</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
October 2017.</td><td> </td><td class=3D"right">              October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-predictive-rlocs]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-predictive-rlocs]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Farinacci, D. and P. Pillay-Esnault, "LISP Predictive</td><td> </td><td =
class=3D"right">              Farinacci, D. and P. Pillay-Esnault, "LISP =
Predictive</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0089"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
RLOCs", <span class=3D"delete">draft-ietf-lisp-predictive-rlocs-00</span> =
(work in</td><td> </td><td class=3D"rblock">              RLOCs", <span =
class=3D"insert">draft-ietf-lisp-predictive-rlocs-01</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">June</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span class=3D"insert">November =
2017.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   =
[I-D.ietf-lisp-sec]</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Maino, =
F., Ermagan, V., Cabellos-Aparicio, A., and D.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Saucez, =
"LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-14</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (work in =
progress), October</span> 2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-signal-free-multicast]</td><td> </td><td class=3D"right"> =
  [I-D.ietf-lisp-signal-free-multicast]</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",</td><td> =
</td><td class=3D"right">              Moreno, V. and D. Farinacci, =
"Signal-Free LISP Multicast",</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0090"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
<span class=3D"delete">draft-ietf-lisp-signal-free-multicast-06</span> =
(work in</td><td> </td><td class=3D"rblock">              <span =
class=3D"insert">draft-ietf-lisp-signal-free-multicast-07</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">August</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-vpn]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-vpn]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "LISP Virtual Private</td><td> </td><td =
class=3D"right">              Moreno, V. and D. Farinacci, "LISP Virtual =
Private</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0091"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
Networks (VPNs)", <span class=3D"delete">draft-ietf-lisp-vpn-00</span> =
(work in</td><td> </td><td class=3D"rblock">              Networks =
(VPNs)", <span class=3D"insert">draft-ietf-lisp-vpn-01</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">May</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.meyer-loc-id-implications]</td><td> </td><td class=3D"right">   =
[I-D.meyer-loc-id-implications]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Meyer, D. and D. Lewis, "Architectural Implications of</td><td> </td><td =
class=3D"right">              Meyer, D. and D. Lewis, "Architectural =
Implications of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Locator/ID Separation", draft-meyer-loc-id-implications-01</td><td> =
</td><td class=3D"right">              Locator/ID Separation", =
draft-meyer-loc-id-implications-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(work in progress), January 2009.</td><td> </td><td class=3D"right">     =
         (work in progress), January 2009.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [LISA96]   =
Lear, E., Tharp, D., Katinsky, J., and J. Coffin,</td><td> </td><td =
class=3D"right">   [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. =
Coffin,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Renumbering: Threat or Menace?", Usenix Tenth System</td><td> </td><td =
class=3D"right">              "Renumbering: Threat or Menace?", Usenix =
Tenth System</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Administration Conference (LISA 96), October 1996.</td><td> </td><td =
class=3D"right">              Administration Conference (LISA 96), =
October 1996.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-23" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-23"><em> page 49, line =
9<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-23"><em> page 47, line =
22<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC2784]  =
Farinacci, D., Li, T., Hanks, S., Meyer, D., and P.</td><td> </td><td =
class=3D"right">   [RFC2784]  Farinacci, D., Li, T., Hanks, S., Meyer, =
D., and P.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Traina, "Generic Routing Encapsulation (GRE)", RFC 2784,</td><td> =
</td><td class=3D"right">              Traina, "Generic Routing =
Encapsulation (GRE)", RFC 2784,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC2784, March 2000,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC2784, March 2000,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc2784&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc2784&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3056]  =
Carpenter, B. and K. Moore, "Connection of IPv6 Domains</td><td> =
</td><td class=3D"right">   [RFC3056]  Carpenter, B. and K. Moore, =
"Connection of IPv6 Domains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              via =
IPv4 Clouds", RFC 3056, DOI 10.17487/RFC3056, February</td><td> </td><td =
class=3D"right">              via IPv4 Clouds", RFC 3056, DOI =
10.17487/RFC3056, February</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2001, &lt;https://www.rfc-editor.org/info/rfc3056&gt;.</td><td> </td><td =
class=3D"right">              2001, =
&lt;https://www.rfc-editor.org/info/rfc3056&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0092"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC3232]  Reynolds, =
J., Ed., "Assigned Numbers: RFC 1700 is Replaced</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              by an =
On-line Database", RFC 3232, DOI 10.17487/RFC3232,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              January =
2002, &lt;https://www.rfc-editor.org/info/rfc3232&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3261]  =
Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston,</td><td> =
</td><td class=3D"right">   [RFC3261]  Rosenberg, J., Schulzrinne, H., =
Camarillo, G., Johnston,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              A., =
Peterson, J., Sparks, R., Handley, M., and E.</td><td> </td><td =
class=3D"right">              A., Peterson, J., Sparks, R., Handley, M., =
and E.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Schooler, "SIP: Session Initiation Protocol", RFC 3261,</td><td> =
</td><td class=3D"right">              Schooler, "SIP: Session =
Initiation Protocol", RFC 3261,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC3261, June 2002,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC3261, June 2002,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc3261&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc3261&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0093"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC4107]  Bellovin, S. and R. Housley, "Guidelines for =
Cryptographic</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Key Management", BCP 107, RFC 4107, DOI =
10.17487/RFC4107,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              June 2005, =
&lt;https://www.rfc-editor.org/info/rfc4107&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4192]  =
Baker, F., Lear, E., and R. Droms, "Procedures for</td><td> </td><td =
class=3D"right">   [RFC4192]  Baker, F., Lear, E., and R. Droms, =
"Procedures for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Renumbering an IPv6 Network without a Flag Day", RFC 4192,</td><td> =
</td><td class=3D"right">              Renumbering an IPv6 Network =
without a Flag Day", RFC 4192,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4192, September 2005,</td><td> </td><td class=3D"right">     =
         DOI 10.17487/RFC4192, September 2005,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4192&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4192&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4866]  =
Arkko, J., Vogt, C., and W. Haddad, "Enhanced Route</td><td> </td><td =
class=3D"right">   [RFC4866]  Arkko, J., Vogt, C., and W. Haddad, =
"Enhanced Route</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Optimization for Mobile IPv6", RFC 4866,</td><td> </td><td =
class=3D"right">              Optimization for Mobile IPv6", RFC =
4866,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4866, May 2007,</td><td> </td><td class=3D"right">           =
   DOI 10.17487/RFC4866, May 2007,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4866&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4866&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4984]  =
Meyer, D., Ed., Zhang, L., Ed., and K. Fall, Ed., "Report</td><td> =
</td><td class=3D"right">   [RFC4984]  Meyer, D., Ed., Zhang, L., Ed., =
and K. Fall, Ed., "Report</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
from the IAB Workshop on Routing and Addressing",</td><td> </td><td =
class=3D"right">              from the IAB Workshop on Routing and =
Addressing",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
4984, DOI 10.17487/RFC4984, September 2007,</td><td> </td><td =
class=3D"right">              RFC 4984, DOI 10.17487/RFC4984, September =
2007,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4984&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4984&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0094"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6480]  Lepinski, M. and S. Kent, "An Infrastructure =
to Support</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Secure Internet Routing", RFC 6480, DOI =
10.17487/RFC6480,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              February 2012, =
&lt;https://www.rfc-editor.org/info/rfc6480&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC6518]  Lebovitz, G. and M. Bhatia, "Keying and =
Authentication for</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Routing Protocols (KARP) Design =
Guidelines", RFC 6518,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6518, February =
2012,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6518&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6831]  =
Farinacci, D., Meyer, D., Zwiebel, J., and S. Venaas, "The</td><td> =
</td><td class=3D"right">   [RFC6831]  Farinacci, D., Meyer, D., =
Zwiebel, J., and S. Venaas, "The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Locator/ID Separation Protocol (LISP) for Multicast</td><td> </td><td =
class=3D"right">              Locator/ID Separation Protocol (LISP) for =
Multicast</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Environments", RFC 6831, DOI 10.17487/RFC6831, January</td><td> </td><td =
class=3D"right">              Environments", RFC 6831, DOI =
10.17487/RFC6831, January</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2013, &lt;https://www.rfc-editor.org/info/rfc6831&gt;.</td><td> </td><td =
class=3D"right">              2013, =
&lt;https://www.rfc-editor.org/info/rfc6831&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6832]  =
Lewis, D., Meyer, D., Farinacci, D., and V. Fuller,</td><td> </td><td =
class=3D"right">   [RFC6832]  Lewis, D., Meyer, D., Farinacci, D., and =
V. Fuller,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Interworking between Locator/ID Separation Protocol</td><td> </td><td =
class=3D"right">              "Interworking between Locator/ID =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(LISP) and Non-LISP Sites", RFC 6832,</td><td> </td><td class=3D"right"> =
             (LISP) and Non-LISP Sites", RFC 6832,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6832, January 2013,</td><td> </td><td class=3D"right">       =
       DOI 10.17487/RFC6832, January 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6832&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6832&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0095"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC6834]  Iannone, =
L., Saucez, D., and O. Bonaventure, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) Map-Versioning", RFC 6834,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC6834, January 2013,</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc6834&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6835]  =
Farinacci, D. and D. Meyer, "The Locator/ID Separation</td><td> </td><td =
class=3D"right">   [RFC6835]  Farinacci, D. and D. Meyer, "The =
Locator/ID Separation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Protocol Internet Groper (LIG)", RFC 6835,</td><td> </td><td =
class=3D"right">              Protocol Internet Groper (LIG)", RFC =
6835,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6835, January 2013,</td><td> </td><td class=3D"right">       =
       DOI 10.17487/RFC6835, January 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6835&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6835&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0096"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6837]  Lear, E., "NERD: A Not-so-novel Endpoint ID =
(EID) to</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Routing Locator (RLOC) Database", RFC =
6837,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6837, January =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6837&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6935]  =
Eubanks, M., Chimento, P., and M. Westerlund, "IPv6 and</td><td> =
</td><td class=3D"right">   [RFC6935]  Eubanks, M., Chimento, P., and M. =
Westerlund, "IPv6 and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              UDP =
Checksums for Tunneled Packets", RFC 6935,</td><td> </td><td =
class=3D"right">              UDP Checksums for Tunneled Packets", RFC =
6935,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6935, April 2013,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC6935, April 2013,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6935&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6935&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6936]  =
Fairhurst, G. and M. Westerlund, "Applicability Statement</td><td> =
</td><td class=3D"right">   [RFC6936]  Fairhurst, G. and M. Westerlund, =
"Applicability Statement</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              for =
the Use of IPv6 UDP Datagrams with Zero Checksums",</td><td> </td><td =
class=3D"right">              for the Use of IPv6 UDP Datagrams with =
Zero Checksums",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
6936, DOI 10.17487/RFC6936, April 2013,</td><td> </td><td class=3D"right">=
              RFC 6936, DOI 10.17487/RFC6936, April 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6936&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6936&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0097"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC7052]  Schudel, =
G., Jain, A., and V. Moreno, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) MIB", RFC 7052,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC7052, October 2013,</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc7052&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC7215]  Jakab, =
L., Cabellos-Aparicio, A., Coras, F., Domingo-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Pascual, =
J., and D. Lewis, "Locator/Identifier Separation</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Protocol =
(LISP) Network Element Deployment</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Considerations", RFC 7215, DOI 10.17487/RFC7215, April</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              2014, =
&lt;https://www.rfc-editor.org/info/rfc7215&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC7835]  Saucez, =
D., Iannone, L., and O. Bonaventure, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) Threat Analysis", RFC 7835,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC7835, April 2016,</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc7835&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC8060]  =
Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical</td><td> =
</td><td class=3D"right">   [RFC8060]  Farinacci, D., Meyer, D., and J. =
Snijders, "LISP Canonical</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,</td><td> =
</td><td class=3D"right">              Address Format (LCAF)", RFC 8060, =
DOI 10.17487/RFC8060,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
February 2017, &lt;https://www.rfc-editor.org/info/rfc8060&gt;.</td><td> =
</td><td class=3D"right">              February 2017, =
&lt;https://www.rfc-editor.org/info/rfc8060&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0098"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC8061]  =
Farinacci, D. and B. Weis, "Locator/ID Separation =
Protocol</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (LISP) =
Data-Plane Confidentiality", RFC 8061,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC8061, February 2017,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc8061&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC8111]  Fuller, =
V., Lewis, D., Ermagan, V., Jain, A., and A.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Smirnov, =
"Locator/ID Separation Protocol Delegated</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Database =
Tree (LISP-DDT)", RFC 8111, DOI 10.17487/RFC8111,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              May 2017, =
&lt;https://www.rfc-editor.org/info/rfc8111&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix A.  =
Acknowledgments</td><td> </td><td class=3D"right">Appendix A.  =
Acknowledgments</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An initial =
thank you goes to Dave Oran for planting the seeds for the</td><td> =
</td><td class=3D"right">   An initial thank you goes to Dave Oran for =
planting the seeds for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   initial ideas =
for LISP.  His consultation continues to provide value</td><td> </td><td =
class=3D"right">   initial ideas for LISP.  His consultation continues =
to provide value</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to the LISP =
authors.</td><td> </td><td class=3D"right">   to the LISP =
authors.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   A special and =
appreciative thank you goes to Noel Chiappa for</td><td> </td><td =
class=3D"right">   A special and appreciative thank you goes to Noel =
Chiappa for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   providing =
architectural impetus over the past decades on separation</td><td> =
</td><td class=3D"right">   providing architectural impetus over the =
past decades on separation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   of location =
and identity, as well as detailed reviews of the LISP</td><td> </td><td =
class=3D"right">   of location and identity, as well as detailed reviews =
of the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
and documents, coupled with enthusiasm for making LISP a</td><td> =
</td><td class=3D"right">   architecture and documents, coupled with =
enthusiasm for making LISP a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-24" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-24"><em> page 52, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-24"><em> page 51, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The LISP =
working group would like to give a special thanks to Jari</td><td> =
</td><td class=3D"right">   The LISP working group would like to give a =
special thanks to Jari</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Arkko, the =
Internet Area AD at the time that the set of LISP</td><td> </td><td =
class=3D"right">   Arkko, the Internet Area AD at the time that the set =
of LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   documents were =
being prepared for IESG last call, and for his</td><td> </td><td =
class=3D"right">   documents were being prepared for IESG last call, and =
for his</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   meticulous =
reviews and detailed commentaries on the 7 working group</td><td> =
</td><td class=3D"right">   meticulous reviews and detailed commentaries =
on the 7 working group</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   last call =
documents progressing toward standards-track RFCs.</td><td> </td><td =
class=3D"right">   last call documents progressing toward =
standards-track RFCs.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix B.  =
Document Change Log</td><td> </td><td class=3D"right">Appendix B.  =
Document Change Log</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC Editor: =
Please delete this section on publication as RFC.]</td><td> </td><td =
class=3D"right">   [RFC Editor: Please delete this section on =
publication as RFC.]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0099"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.1.  Changes =
to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span></td><td> =
</td><td class=3D"rblock">B.1.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Posted January =
2018.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Remove references =
to research work for any protocol mechanisms.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Document scanned =
to make sure it is RFC 2119 compliant.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Made changes to =
reflect comments from document WG shepherd Luigi</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
Iannone.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Ran IDNITs on the =
document.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">B.2.  Changes to =
draft-ietf-lisp-rfc6830bis-07</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
November 2017.</td><td> </td><td class=3D"right">   o  Posted November =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rephrase =
how Instance-IDs are used and don't refer to [RFC1918]</td><td> </td><td =
class=3D"right">   o  Rephrase how Instance-IDs are used and don't refer =
to [RFC1918]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
addresses.</td><td> </td><td class=3D"right">      addresses.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0100"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">2</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
October 2017.</td><td> </td><td class=3D"right">   o  Posted October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Put RTR =
definition before it is used.</td><td> </td><td class=3D"right">   o  =
Put RTR definition before it is used.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rename =
references that are now working group drafts.</td><td> </td><td =
class=3D"right">   o  Rename references that are now working group =
drafts.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
"EIDs MUST NOT be used as used by a host to refer to other</td><td> =
</td><td class=3D"right">   o  Remove "EIDs MUST NOT be used as used by =
a host to refer to other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hosts.  =
Note that EID blocks MAY LISP RLOCs".</td><td> </td><td class=3D"right"> =
     hosts.  Note that EID blocks MAY LISP RLOCs".</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-25" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-25"><em> page 52, line =
35<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-25"><em> page 51, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  ETRs may, =
rather than will, be the ones to send Map-Replies.</td><td> </td><td =
class=3D"right">   o  ETRs may, rather than will, be the ones to send =
Map-Replies.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recommend, =
rather than mandate, max encapsulation headers to 2.</td><td> </td><td =
class=3D"right">   o  Recommend, rather than mandate, max encapsulation =
headers to 2.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reference =
VPN draft when introducing Instance-ID.</td><td> </td><td class=3D"right">=
   o  Reference VPN draft when introducing Instance-ID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that SMRs can be sent when ITR/ETR are in the same node.</td><td> =
</td><td class=3D"right">   o  Indicate that SMRs can be sent when =
ITR/ETR are in the same node.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarify =
when private addreses can be used.</td><td> </td><td class=3D"right">   =
o  Clarify when private addreses can be used.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0101"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
August 2017.</td><td> </td><td class=3D"right">   o  Posted August =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Make it =
clear that a Reencapsulating Tunnel Router is an RTR.</td><td> </td><td =
class=3D"right">   o  Make it clear that a Reencapsulating Tunnel Router =
is an RTR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0102"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted July =
2017.</td><td> </td><td class=3D"right">   o  Posted July 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Changed =
reference of IPv6 RFC2460 to RFC8200.</td><td> </td><td class=3D"right"> =
  o  Changed reference of IPv6 RFC2460 to RFC8200.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that the applicability statement for UDP zero checksums</td><td> =
</td><td class=3D"right">   o  Indicate that the applicability statement =
for UDP zero checksums</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      over IPv6 =
adheres to RFC6936.</td><td> </td><td class=3D"right">      over IPv6 =
adheres to RFC6936.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0103"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted May =
2017.</td><td> </td><td class=3D"right">   o  Posted May 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Move the =
control-plane related codepoints in the IANA</td><td> </td><td =
class=3D"right">   o  Move the control-plane related codepoints in the =
IANA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Considerations section to RFC6833bis.</td><td> </td><td class=3D"right"> =
     Considerations section to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0104"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
April 2017.</td><td> </td><td class=3D"right">   o  Posted April =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reflect =
some editorial comments from Damien Sausez.</td><td> </td><td =
class=3D"right">   o  Reflect some editorial comments from Damien =
Sausez.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0105"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
March 2017.</td><td> </td><td class=3D"right">   o  Posted March =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Include =
references to new RFCs published.</td><td> </td><td class=3D"right">   o =
 Include references to new RFCs published.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Change =
references from RFC6833 to RFC6833bis.</td><td> </td><td class=3D"right"> =
  o  Change references from RFC6833 to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarified =
LCAF text in the IANA section.</td><td> </td><td class=3D"right">   o  =
Clarified LCAF text in the IANA section.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to "experimental".</td><td> </td><td class=3D"right">   o  =
Remove references to "experimental".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0106"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
December 2016.</td><td> </td><td class=3D"right">   o  Posted December =
2016.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Created =
working group document from draft-farinacci-lisp</td><td> </td><td =
class=3D"right">   o  Created working group document from =
draft-farinacci-lisp</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      -rfc6830-00 =
individual submission.  No other changes made.</td><td> </td><td =
class=3D"right">      -rfc6830-00 individual submission.  No other =
changes made.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Authors' =
Addresses</td><td> </td><td class=3D"right">Authors' Addresses</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0107"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dino =
Farinacci</td><td> </td><td class=3D"right">   Dino Farinacci</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
farinacci@gmail.com</td><td> </td><td class=3D"right">   EMail: =
farinacci@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0108"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">                        =
                                                 </span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Vince =
Fuller</td><td> </td><td class=3D"right">   Vince Fuller</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
vince.fuller@gmail.com</td><td> </td><td class=3D"right">   EMail: =
vince.fuller@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dave =
Meyer</td><td> </td><td class=3D"right">   Dave Meyer</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>

     <tr><td></td><td class=3D"left"></td><td> </td><td =
class=3D"right"></td><td></td></tr>
     <tr id=3D"end" bgcolor=3D"gray"><th colspan=3D"5" =
align=3D"center">&nbsp;End of changes. 108 change =
blocks.&nbsp;</th></tr>
     <tr class=3D"stats"><td></td><th><i>396 lines changed or =
deleted</i></th><th><i> </i></th><th><i>340 lines changed or =
added</i></th><td></td></tr>
     <tr><td colspan=3D"5" align=3D"center" class=3D"small"><br>This =
html diff was produced by rfcdiff 1.46. The latest version is available =
from <a =
href=3D"http://www.tools.ietf.org/tools/rfcdiff/">http://tools.ietf.org/to=
ols/rfcdiff/</a> </td></tr>
   </tbody></table>
  =20
  =20
</body></html>=

--Apple-Mail=_E476F244-D6BA-4A81-BC6E-81D7E56CFBEE--


From nobody Fri Jan  5 04:22:06 2018
Return-Path: <session-request@ietf.org>
X-Original-To: lisp@ietf.org
Delivered-To: lisp@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id DF56D12422F; Fri,  5 Jan 2018 04:22:03 -0800 (PST)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: IETF Meeting Session Request Tool <session-request@ietf.org>
To: <session-request@ietf.org>
Cc: lisp-chairs@ietf.org, lisp@ietf.org, db3546@att.com, luigi.iannone@telecom-paristech.fr
X-Test-IDTracker: no
X-IETF-IDTracker: 6.68.2
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <151515492386.14779.9888299447170399416.idtracker@ietfa.amsl.com>
Date: Fri, 05 Jan 2018 04:22:03 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/Dggz3DunEaXm7OzcHG5qnBQbMwM>
Subject: [lisp] lisp - New Meeting Session Request for IETF 101
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 05 Jan 2018 12:22:04 -0000

A new meeting session request has just been submitted by Luigi Iannone, a Chair of the lisp working group.


---------------------------------------------------------
Working Group Name: Locator/ID Separation Protocol
Area Name: Routing Area
Session Requester: Luigi Iannone

Number of Sessions: 1
Length of Session(s):  2 Hours
Number of Attendees: 50
Conflicts to Avoid: 
 First Priority: rtgwg nvo3 i2rs sidr grow sfc nfvrg pim intarea ospf
 Second Priority: mboned icnrg irtfopen idr spring bier maprg
 Third Priority: l2tpext bess


People who must be present:
  Joel M. Halpern
  Wassim Haddad
  Deborah Brungard
  Luigi Iannone
  Padma Pillay-Esnault

Resources Requested:

Special Requests:
  
---------------------------------------------------------


From nobody Mon Jan  8 09:16:15 2018
Return-Path: <damien.saucez@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id B8D8312420B for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 09:16:14 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 9smzGK-g8sRK for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 09:16:13 -0800 (PST)
Received: from mail-wr0-x22b.google.com (mail-wr0-x22b.google.com [IPv6:2a00:1450:400c:c0c::22b]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 9CBDE1241F5 for <lisp@ietf.org>; Mon,  8 Jan 2018 09:16:12 -0800 (PST)
Received: by mail-wr0-x22b.google.com with SMTP id n9so1645335wrg.2 for <lisp@ietf.org>; Mon, 08 Jan 2018 09:16:12 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=QdIz6xliUoTc+dXb9l3Vr0OATYgXEZ5WkGmbggEUg9s=; b=ntK9b16/y+w8baoiejtHuD5j4Dzd3g1YynJ4HDz+RCwwBf5r65fpE91x+qkNo3M+aZ bWANaWt83OxcUGlhyQHrt3vXFOZnphqrGJ4p0vcshsAmzAhqSnvXlE52ALIp+ZJmDuFw SwwFTCcEeVX/fEtXBqA2lJ9rz3eK6ZmNzPvLQpxJrX/xAE7+KHT3faUUdB1uiGhNbV+v HRd0AlKmi76RvvP5hjGTdlnGVa8LIv5J0U6Hw+eqro7srR1+XssXrkIlAcYx/tzAkp/q sCCPd0ejfLg6SNi7P7/aZsdOWxcTsONhVvv+3nyf5Iexhnl6eRxoJBX044lBFf5F8aSy DlIQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=QdIz6xliUoTc+dXb9l3Vr0OATYgXEZ5WkGmbggEUg9s=; b=REIYMyPbcUVzIYZhmNrFDeI4i4lAXGp63NoO2VvBEjPgw4nYGzADQ9YeUoZdhPYikH NWwylv9f9YnltRGImvZ+gaE/XI3DGFschEj5K4mc9oJtRtNbZEPBrZFm5ou/e0WO46OA GT2WQf2LTaaPLoXg1Au91qYljKDqhKDVa/V6g5C0Z36JJ8s3ARCAsYnhcT9dbFI1EBg3 8XsKjC+PmNQ8dKhL8uWCvmCGUP95nouuXv56Wj1NA55cDM1EF1FYsbV/UglDoVk6torM wF1ovj9EERRLtrtpv5qkg38eTxw2GRqxrQ07fo9YsPrh9vYdzQvVhvNAe7X0RzkJXZal +dNg==
X-Gm-Message-State: AKGB3mIu6znKVkmNw+bzHcjcSkruEiK22K39y7k+iAggQ0Z4j3+ZKzpm H7+kAoCJzJB4zRgxMVJRTQU68zfp
X-Google-Smtp-Source: ACJfBovL52XxcXLW3CNe1No9jcRWVfyRVTAb6az7AoN0jOPtXFrkNLih759iJnSL90Q3TYaFEi67nA==
X-Received: by 10.223.192.65 with SMTP id c1mr11344608wrf.58.1515431770881; Mon, 08 Jan 2018 09:16:10 -0800 (PST)
Received: from gullinbursti.inria.fr (gullinbursti.inria.fr. [138.96.193.255]) by smtp.gmail.com with ESMTPSA id e4sm14242770wmi.14.2018.01.08.09.16.09 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 08 Jan 2018 09:16:09 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 10.3 \(3273\))
From: Damien Saucez <damien.saucez@gmail.com>
In-Reply-To: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com>
Date: Mon, 8 Jan 2018 18:16:08 +0100
Cc: LISP mailing list list <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <52854B15-A8D8-47CA-8680-B2D673191EBA@gmail.com>
References: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3273)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/X9ajgoUN1ooQ6LIWZNLvIWIZeow>
Subject: Re: [lisp] Current changes for draft-ietf-lisp-rfc6830bis-08
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 08 Jan 2018 17:16:14 -0000

Hello Dino, The List,

That=E2=80=99s pretty cool to see activity around the document however I =
am not sure the proposed
changes are really addressing the structural problem of the document.

The current document is a mix between data-plane, control-plane, and =
operation questions.

The chairs proposition of re-balancing the text between 30bis, 33bis and =
an OAM documents
is great. It would allow people to go directly to the point they are =
interested in.=20

1. What goes on the wire: 30bis
2. Signalling procedures: 33bis
3. Implementation details, management, and troubleshooting: OAM.

So it would mean that in 30bis it would just be all what is strictly =
needed to allow
inter-operability between xTRs, so at the end only packet format and how =
to understand
fields should be there. In this case, we can abstract the xTR as just a =
database that
stores mapping, how mapping are managed in this database is an =
implementation
question that is independent of the protocol itself.

For 33bis, it would just be the format of signalling messages and how to =
interpret
them, when a signal is expected to be triggered.

Finally, in OAM it would be how to implement and manage a LISP system =
that is
constituted of the LISP control-plane proposed in 33bis and the LISP =
data-plane in
30bis.

To say it clearly: remove from 30bis and 33bis all what is just the =
reflect of one
implementation. Normally these two document should have only what is =
strictly
necessary for people to implement (the way THEY want) a system that =
would
Inter-operate with the others.=20

If we look at OpenLISP and its control-plane and the deployment of =
LISP-Lab
that we use in production daily, we can see that the data plane and =
control plane
have been implemented independently (and by different teams and even
companies) and what we can say is that a large fraction of the text in =
60bis
has not been used at all for implementing the data-plane, while, on the =
contrary
we had to massively read/use text from 30bis to be able to implement the
control-plane. Finally, people that deployed LISP-Lab had to take =
content
from both 30bis and 33bis to be able to have a working environment. That
demonstrates that the separation is not done properly as normally people=20=

in charge of deploying a network should not have to read the data-plane
specs, or people implementing a control-plane should not have to read=20
data-plane specifications.

I think the proposition of moving text that the chairs proposed is very
reasonable and greatly improve the quality of the specifications and =
therefore
reduce the risk of misinterpretation and bugs while implementing the =
protocolS


Cheers,

Damien Saucez=20

> On 4 Jan 2018, at 18:00, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Is the working group okay with me submitting these changes? This was =
the latest update from email before the year ended. I have made most of =
the changes that Luigi suggested or requested.
>=20
> Dino
>=20
> =
<rfcdiff-rfc6830bis.html>_______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


From nobody Mon Jan  8 10:23:15 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 68BDE127876 for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 10:23:02 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id MYjimhGkMQoj for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 10:22:59 -0800 (PST)
Received: from mail-pf0-x22c.google.com (mail-pf0-x22c.google.com [IPv6:2607:f8b0:400e:c00::22c]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id CCA6312D7F7 for <lisp@ietf.org>; Mon,  8 Jan 2018 10:22:59 -0800 (PST)
Received: by mail-pf0-x22c.google.com with SMTP id e3so6534958pfi.10 for <lisp@ietf.org>; Mon, 08 Jan 2018 10:22:59 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=kzQ2dlilJsTvoPgZYQ+oFvepud48/umKQG1wE3bPprE=; b=Ng7/gb36g2Ss2feyVB8yBqV3pVUdaWT+59YmtZpznQA7gJLd0aYBTpwHEzOIfe++fV PIjKIT7+zSG3yVAgqcv0AIZvYgPioHtJsWJb+YPZIQWrnmk9CWF27vONxP2WCkYgCUwn dqEqg3+jgSDCigAx3Vl7RBk8ZR5Rr/jxYgwIsH14hb2ijiUvqf0AgFMp4ivJhPEwfpRp RnuZzmo04tB0ipdu4eUVJXcveS3wcXoBvEXE4rvv+Bt/Tn1t3cX16K31FNYUFbluxpK8 KB+8/xR/Hy3NRmjbZmZnMtPOMONJw1leSw7OTMUnyaW3PkmwWI6mIIxjcrizsoKQvke2 yHGQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=kzQ2dlilJsTvoPgZYQ+oFvepud48/umKQG1wE3bPprE=; b=YXe0Ym/TkH3tM1i80qBnsgvaJuHDRGlb8z16GcVsaV7Lr0HD6EeFOVplBIs5g+U2pd AxaSy1wk1KJjsNbuY5zqhNJLBpBh2/E3EulZB4Hb5H7ipYle6kwMWx+Qe96DA4vS7bfT zJZ3lRyDcHs5sxDf3v8lLyALCKmmP0xuBrXK7xdX9X/jLhXBJhAAIDAWkG3EvxTy1yNJ +tFUsL4GXCBZ6n3zFV5+e0JpNgMrc/YlRphyNSm/PscjDvIocWBphKA/60NcQlw43+zC KzIjuFKxJ9bsMYki1PncWUDKwsDWxG5gKLq4R3pPQo5wFX6aZpfRkdmG0/GcaMJP/0Am 9T7g==
X-Gm-Message-State: AKGB3mLBFD3POXyfC60e0JtQYR13sQ0R5cDZLju9AylvOsWpNGjUbGEN nayV/g/Ofimh1pqa23gv+mE=
X-Google-Smtp-Source: ACJfBou1BgqmfWgc7XcTIN1RncZ+6DBCt+w0FWbTmKLop+6bT8+OTk7Z1wXiFlUNDWqD8Y/IrIu16A==
X-Received: by 10.101.66.12 with SMTP id c12mr10471677pgq.105.1515435779378; Mon, 08 Jan 2018 10:22:59 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id e8sm28949902pfk.6.2018.01.08.10.22.58 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 08 Jan 2018 10:22:58 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <52854B15-A8D8-47CA-8680-B2D673191EBA@gmail.com>
Date: Mon, 8 Jan 2018 10:22:57 -0800
Cc: LISP mailing list list <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <DD4AAA1D-779C-444F-9C23-50CCA9935693@gmail.com>
References: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com> <52854B15-A8D8-47CA-8680-B2D673191EBA@gmail.com>
To: Damien Saucez <damien.saucez@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/2WOBQdi1c-V7k_lqCs6qcqAqpXg>
Subject: Re: [lisp] Current changes for draft-ietf-lisp-rfc6830bis-08
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 08 Jan 2018 18:23:02 -0000

Do you think it is okay to capture the changes we have made and agreed =
upon so far so we can submit -08 and wait for other WG members to =
comment on this issue?

What you are suggesting is a lot change that what was previously agreed =
upon. No one was really in favor of having a third document (your OAM =
reference below (3)).=20

Also the chairs didn=E2=80=99t suggest any changes, it was Luigi (acting =
as a document shepherd). I am not sure the same comment came from Joel, =
either publicly or privately.

Dino

> On Jan 8, 2018, at 9:16 AM, Damien Saucez <damien.saucez@gmail.com> =
wrote:
>=20
> Hello Dino, The List,
>=20
> That=E2=80=99s pretty cool to see activity around the document however =
I am not sure the proposed
> changes are really addressing the structural problem of the document.
>=20
> The current document is a mix between data-plane, control-plane, and =
operation questions.
>=20
> The chairs proposition of re-balancing the text between 30bis, 33bis =
and an OAM documents
> is great. It would allow people to go directly to the point they are =
interested in.=20
>=20
> 1. What goes on the wire: 30bis
> 2. Signalling procedures: 33bis
> 3. Implementation details, management, and troubleshooting: OAM.
>=20
> So it would mean that in 30bis it would just be all what is strictly =
needed to allow
> inter-operability between xTRs, so at the end only packet format and =
how to understand
> fields should be there. In this case, we can abstract the xTR as just =
a database that
> stores mapping, how mapping are managed in this database is an =
implementation
> question that is independent of the protocol itself.
>=20
> For 33bis, it would just be the format of signalling messages and how =
to interpret
> them, when a signal is expected to be triggered.
>=20
> Finally, in OAM it would be how to implement and manage a LISP system =
that is
> constituted of the LISP control-plane proposed in 33bis and the LISP =
data-plane in
> 30bis.
>=20
> To say it clearly: remove from 30bis and 33bis all what is just the =
reflect of one
> implementation. Normally these two document should have only what is =
strictly
> necessary for people to implement (the way THEY want) a system that =
would
> Inter-operate with the others.=20
>=20
> If we look at OpenLISP and its control-plane and the deployment of =
LISP-Lab
> that we use in production daily, we can see that the data plane and =
control plane
> have been implemented independently (and by different teams and even
> companies) and what we can say is that a large fraction of the text in =
60bis
> has not been used at all for implementing the data-plane, while, on =
the contrary
> we had to massively read/use text from 30bis to be able to implement =
the
> control-plane. Finally, people that deployed LISP-Lab had to take =
content
> from both 30bis and 33bis to be able to have a working environment. =
That
> demonstrates that the separation is not done properly as normally =
people=20
> in charge of deploying a network should not have to read the =
data-plane
> specs, or people implementing a control-plane should not have to read=20=

> data-plane specifications.
>=20
> I think the proposition of moving text that the chairs proposed is =
very
> reasonable and greatly improve the quality of the specifications and =
therefore
> reduce the risk of misinterpretation and bugs while implementing the =
protocolS
>=20
>=20
> Cheers,
>=20
> Damien Saucez=20
>=20
>> On 4 Jan 2018, at 18:00, Dino Farinacci <farinacci@gmail.com> wrote:
>>=20
>> Is the working group okay with me submitting these changes? This was =
the latest update from email before the year ended. I have made most of =
the changes that Luigi suggested or requested.
>>=20
>> Dino
>>=20
>> =
<rfcdiff-rfc6830bis.html>_______________________________________________
>> lisp mailing list
>> lisp@ietf.org
>> https://www.ietf.org/mailman/listinfo/lisp
>=20


From nobody Mon Jan  8 15:27:48 2018
Return-Path: <albert.cabellos@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 0420D126CE8 for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 15:27:47 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id PsRvSNp29hbO for <lisp@ietfa.amsl.com>; Mon,  8 Jan 2018 15:27:44 -0800 (PST)
Received: from mail-yb0-x22a.google.com (mail-yb0-x22a.google.com [IPv6:2607:f8b0:4002:c09::22a]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 05A78126D05 for <lisp@ietf.org>; Mon,  8 Jan 2018 15:27:44 -0800 (PST)
Received: by mail-yb0-x22a.google.com with SMTP id v17so3790639ybl.10 for <lisp@ietf.org>; Mon, 08 Jan 2018 15:27:43 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=C/JI+koUVAqaWotff8ESq3fupD5dikw+u1Y6alfGa7g=; b=YT5WfP41UrCWLCfUntUTqPGQATkpAxnTGKkPMWevEvxm2VFwNnsSydgRFPSGobp6cR etYLjJJQYoFlagg505R3PEavyt0hR9iGziE8cOOeFkcyg8NJ1Lv+C5FZocuzkjz/O8/7 BnsVwLVftMwT9+i3wMMVA5II5Zu1bS+DRofZr4aYIJDXekSxDaV3jsTIT4Alxwn0NqUU NFAmMOOZOyxqZsVpmQbsKFAByG6eWNci6QmjsDCCjl8UAxtUthLKOr0ASBi7xwC9N71p oagxJkXM2qc9Kp4RCgeJv+dwhprFseC7eHQ/AY/5TWf08SZmMSQlDG7LVMF7ynozzmKz qb9g==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=C/JI+koUVAqaWotff8ESq3fupD5dikw+u1Y6alfGa7g=; b=EC9f0ifdE2AM586/DMN4B6ZlOrDQpnx2nYtwqUNU4qnvX72ycYEnUGFE2/imYzDH9U jSii+zrKQfbflOK30y6dIie6Dtk6YOul7OTTIg0fISGpU5LBKSOxzWqIjoP9FtVdyWVi GJex7UvQ4t/YYZeVQLgjgk3JTNCKdQI42DO+5xUVIGdrFABZ6wVgZJL25JCo6stLLuh9 Rc+UqOeeyzzYusmxEpbzW9OQQpb97OZfRmVNjexWqLJYlfJtyOIOP4MyLclIURFv7czC IwyGKRZq9DhVONeYTX922Ai3FX55yqOthMFbEn8s+JoXmKOBccXn4tJD1x1rgqu+0sl1 MCvg==
X-Gm-Message-State: AKGB3mLGX+VJd+fGPTrcnEVutj3Bvu3EJbqmB/uzX3ARI9d5PzyR5+ya VxP2lLoRGprymOCJdPFTmIwzPn5ssX4CilViePA=
X-Google-Smtp-Source: ACJfBosAnN6URDRqDi/qRSoivAEZX7b933SVoHabe85W6B8NIIw0Gkjq1TbggCidGyjfHDTfWRryff9rgV5ZOKQtOJ4=
X-Received: by 10.37.220.148 with SMTP id y142mr12572363ybe.468.1515454063148;  Mon, 08 Jan 2018 15:27:43 -0800 (PST)
MIME-Version: 1.0
Received: by 10.37.164.38 with HTTP; Mon, 8 Jan 2018 15:27:42 -0800 (PST)
In-Reply-To: <DD4AAA1D-779C-444F-9C23-50CCA9935693@gmail.com>
References: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com> <52854B15-A8D8-47CA-8680-B2D673191EBA@gmail.com> <DD4AAA1D-779C-444F-9C23-50CCA9935693@gmail.com>
From: Albert Cabellos <albert.cabellos@gmail.com>
Date: Tue, 9 Jan 2018 00:27:42 +0100
Message-ID: <CAGE_Qeww-bFo122rc+XZQnQyzza0nC=BO2H+sg_FHz_Z+4dXEA@mail.gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
Cc: Damien Saucez <damien.saucez@gmail.com>, LISP mailing list list <lisp@ietf.org>
Content-Type: multipart/alternative; boundary="94eb2c19181e1b84ef05624c253d"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/tSj9gtHnt1BCzJv50K94NgX4gt4>
Subject: Re: [lisp] Current changes for draft-ietf-lisp-rfc6830bis-08
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 08 Jan 2018 23:27:47 -0000

--94eb2c19181e1b84ef05624c253d
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi


As far as I remember we didn=C2=B4t agree on 3 documents, this does not
necessarily mean that it is a bad idea.


I still think that SMR should be on 6833bis, it is important to standardize
a control-plane that includes the capability of updating EID-to-RLOC
mappings.


Regarding sections Multicast, Mobility and Traceroute considerations they
could be easily moved to an OAM document, but it is quite complex to
properly contextualize such sections in a single standalone document. Do
they have value without the context of 6830bis? In my view they are better
in 6830bis.


I would like to hear other opinions from the list


Albert

On Mon, Jan 8, 2018 at 7:22 PM, Dino Farinacci <farinacci@gmail.com> wrote:

> Do you think it is okay to capture the changes we have made and agreed
> upon so far so we can submit -08 and wait for other WG members to comment
> on this issue?
>
> What you are suggesting is a lot change that what was previously agreed
> upon. No one was really in favor of having a third document (your OAM
> reference below (3)).
>
> Also the chairs didn=E2=80=99t suggest any changes, it was Luigi (acting =
as a
> document shepherd). I am not sure the same comment came from Joel, either
> publicly or privately.
>
> Dino
>
> > On Jan 8, 2018, at 9:16 AM, Damien Saucez <damien.saucez@gmail.com>
> wrote:
> >
> > Hello Dino, The List,
> >
> > That=E2=80=99s pretty cool to see activity around the document however =
I am not
> sure the proposed
> > changes are really addressing the structural problem of the document.
> >
> > The current document is a mix between data-plane, control-plane, and
> operation questions.
> >
> > The chairs proposition of re-balancing the text between 30bis, 33bis an=
d
> an OAM documents
> > is great. It would allow people to go directly to the point they are
> interested in.
> >
> > 1. What goes on the wire: 30bis
> > 2. Signalling procedures: 33bis
> > 3. Implementation details, management, and troubleshooting: OAM.
> >
> > So it would mean that in 30bis it would just be all what is strictly
> needed to allow
> > inter-operability between xTRs, so at the end only packet format and ho=
w
> to understand
> > fields should be there. In this case, we can abstract the xTR as just a
> database that
> > stores mapping, how mapping are managed in this database is an
> implementation
> > question that is independent of the protocol itself.
> >
> > For 33bis, it would just be the format of signalling messages and how t=
o
> interpret
> > them, when a signal is expected to be triggered.
> >
> > Finally, in OAM it would be how to implement and manage a LISP system
> that is
> > constituted of the LISP control-plane proposed in 33bis and the LISP
> data-plane in
> > 30bis.
> >
> > To say it clearly: remove from 30bis and 33bis all what is just the
> reflect of one
> > implementation. Normally these two document should have only what is
> strictly
> > necessary for people to implement (the way THEY want) a system that wou=
ld
> > Inter-operate with the others.
> >
> > If we look at OpenLISP and its control-plane and the deployment of
> LISP-Lab
> > that we use in production daily, we can see that the data plane and
> control plane
> > have been implemented independently (and by different teams and even
> > companies) and what we can say is that a large fraction of the text in
> 60bis
> > has not been used at all for implementing the data-plane, while, on the
> contrary
> > we had to massively read/use text from 30bis to be able to implement th=
e
> > control-plane. Finally, people that deployed LISP-Lab had to take conte=
nt
> > from both 30bis and 33bis to be able to have a working environment. Tha=
t
> > demonstrates that the separation is not done properly as normally peopl=
e
> > in charge of deploying a network should not have to read the data-plane
> > specs, or people implementing a control-plane should not have to read
> > data-plane specifications.
> >
> > I think the proposition of moving text that the chairs proposed is very
> > reasonable and greatly improve the quality of the specifications and
> therefore
> > reduce the risk of misinterpretation and bugs while implementing the
> protocolS
> >
> >
> > Cheers,
> >
> > Damien Saucez
> >
> >> On 4 Jan 2018, at 18:00, Dino Farinacci <farinacci@gmail.com> wrote:
> >>
> >> Is the working group okay with me submitting these changes? This was
> the latest update from email before the year ended. I have made most of t=
he
> changes that Luigi suggested or requested.
> >>
> >> Dino
> >>
> >> <rfcdiff-rfc6830bis.html>___________________________________
> ____________
> >> lisp mailing list
> >> lisp@ietf.org
> >> https://www.ietf.org/mailman/listinfo/lisp
> >
>
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
>

--94eb2c19181e1b84ef05624c253d
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">







<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">Hi<span class=3D"gmail-Apple-converted-space">=C2=
=A0</span></p>
<p class=3D"gmail-p2" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica;min-height:14px"><br></p>
<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">As far as I remember we didn=C2=B4t agree on 3 do=
cuments, this does not necessarily mean that it is a bad idea.</p>
<p class=3D"gmail-p2" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica;min-height:14px"><br></p>
<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">I still think that SMR should be on 6833bis, it i=
s important to standardize a control-plane that includes the capability of =
updating EID-to-RLOC mappings.</p>
<p class=3D"gmail-p2" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica;min-height:14px"><br></p>
<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">Regarding sections Multicast, Mobility and Tracer=
oute considerations they could be easily moved to an OAM document, but it i=
s quite complex to properly contextualize such sections in a single standal=
one document. Do they have value without the context of 6830bis? In my view=
 they are better in 6830bis.</p>
<p class=3D"gmail-p2" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica;min-height:14px"><br></p>
<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">I would like to hear other opinions from the list=
</p>
<p class=3D"gmail-p2" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica;min-height:14px"><br></p>
<p class=3D"gmail-p1" style=3D"margin:0px;font-style:normal;font-variant:no=
rmal;font-weight:normal;font-stretch:normal;font-size:12px;line-height:norm=
al;font-family:Helvetica">Albert</p></div><div class=3D"gmail_extra"><br><d=
iv class=3D"gmail_quote">On Mon, Jan 8, 2018 at 7:22 PM, Dino Farinacci <sp=
an dir=3D"ltr">&lt;<a href=3D"mailto:farinacci@gmail.com" target=3D"_blank"=
>farinacci@gmail.com</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_qu=
ote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex=
">Do you think it is okay to capture the changes we have made and agreed up=
on so far so we can submit -08 and wait for other WG members to comment on =
this issue?<br>
<br>
What you are suggesting is a lot change that what was previously agreed upo=
n. No one was really in favor of having a third document (your OAM referenc=
e below (3)).<br>
<br>
Also the chairs didn=E2=80=99t suggest any changes, it was Luigi (acting as=
 a document shepherd). I am not sure the same comment came from Joel, eithe=
r publicly or privately.<br>
<span class=3D"HOEnZb"><font color=3D"#888888"><br>
Dino<br>
</font></span><div class=3D"HOEnZb"><div class=3D"h5"><br>
&gt; On Jan 8, 2018, at 9:16 AM, Damien Saucez &lt;<a href=3D"mailto:damien=
.saucez@gmail.com">damien.saucez@gmail.com</a>&gt; wrote:<br>
&gt;<br>
&gt; Hello Dino, The List,<br>
&gt;<br>
&gt; That=E2=80=99s pretty cool to see activity around the document however=
 I am not sure the proposed<br>
&gt; changes are really addressing the structural problem of the document.<=
br>
&gt;<br>
&gt; The current document is a mix between data-plane, control-plane, and o=
peration questions.<br>
&gt;<br>
&gt; The chairs proposition of re-balancing the text between 30bis, 33bis a=
nd an OAM documents<br>
&gt; is great. It would allow people to go directly to the point they are i=
nterested in.<br>
&gt;<br>
&gt; 1. What goes on the wire: 30bis<br>
&gt; 2. Signalling procedures: 33bis<br>
&gt; 3. Implementation details, management, and troubleshooting: OAM.<br>
&gt;<br>
&gt; So it would mean that in 30bis it would just be all what is strictly n=
eeded to allow<br>
&gt; inter-operability between xTRs, so at the end only packet format and h=
ow to understand<br>
&gt; fields should be there. In this case, we can abstract the xTR as just =
a database that<br>
&gt; stores mapping, how mapping are managed in this database is an impleme=
ntation<br>
&gt; question that is independent of the protocol itself.<br>
&gt;<br>
&gt; For 33bis, it would just be the format of signalling messages and how =
to interpret<br>
&gt; them, when a signal is expected to be triggered.<br>
&gt;<br>
&gt; Finally, in OAM it would be how to implement and manage a LISP system =
that is<br>
&gt; constituted of the LISP control-plane proposed in 33bis and the LISP d=
ata-plane in<br>
&gt; 30bis.<br>
&gt;<br>
&gt; To say it clearly: remove from 30bis and 33bis all what is just the re=
flect of one<br>
&gt; implementation. Normally these two document should have only what is s=
trictly<br>
&gt; necessary for people to implement (the way THEY want) a system that wo=
uld<br>
&gt; Inter-operate with the others.<br>
&gt;<br>
&gt; If we look at OpenLISP and its control-plane and the deployment of LIS=
P-Lab<br>
&gt; that we use in production daily, we can see that the data plane and co=
ntrol plane<br>
&gt; have been implemented independently (and by different teams and even<b=
r>
&gt; companies) and what we can say is that a large fraction of the text in=
 60bis<br>
&gt; has not been used at all for implementing the data-plane, while, on th=
e contrary<br>
&gt; we had to massively read/use text from 30bis to be able to implement t=
he<br>
&gt; control-plane. Finally, people that deployed LISP-Lab had to take cont=
ent<br>
&gt; from both 30bis and 33bis to be able to have a working environment. Th=
at<br>
&gt; demonstrates that the separation is not done properly as normally peop=
le<br>
&gt; in charge of deploying a network should not have to read the data-plan=
e<br>
&gt; specs, or people implementing a control-plane should not have to read<=
br>
&gt; data-plane specifications.<br>
&gt;<br>
&gt; I think the proposition of moving text that the chairs proposed is ver=
y<br>
&gt; reasonable and greatly improve the quality of the specifications and t=
herefore<br>
&gt; reduce the risk of misinterpretation and bugs while implementing the p=
rotocolS<br>
&gt;<br>
&gt;<br>
&gt; Cheers,<br>
&gt;<br>
&gt; Damien Saucez<br>
&gt;<br>
&gt;&gt; On 4 Jan 2018, at 18:00, Dino Farinacci &lt;<a href=3D"mailto:fari=
nacci@gmail.com">farinacci@gmail.com</a>&gt; wrote:<br>
&gt;&gt;<br>
&gt;&gt; Is the working group okay with me submitting these changes? This w=
as the latest update from email before the year ended. I have made most of =
the changes that Luigi suggested or requested.<br>
&gt;&gt;<br>
&gt;&gt; Dino<br>
&gt;&gt;<br>
&gt;&gt; &lt;rfcdiff-rfc6830bis.html&gt;_____<wbr>_________________________=
_____<wbr>____________<br>
&gt;&gt; lisp mailing list<br>
&gt;&gt; <a href=3D"mailto:lisp@ietf.org">lisp@ietf.org</a><br>
&gt;&gt; <a href=3D"https://www.ietf.org/mailman/listinfo/lisp" rel=3D"nore=
ferrer" target=3D"_blank">https://www.ietf.org/mailman/<wbr>listinfo/lisp</=
a><br>
&gt;<br>
<br>
______________________________<wbr>_________________<br>
lisp mailing list<br>
<a href=3D"mailto:lisp@ietf.org">lisp@ietf.org</a><br>
<a href=3D"https://www.ietf.org/mailman/listinfo/lisp" rel=3D"noreferrer" t=
arget=3D"_blank">https://www.ietf.org/mailman/<wbr>listinfo/lisp</a><br>
</div></div></blockquote></div><br></div>

--94eb2c19181e1b84ef05624c253d--


From nobody Tue Jan  9 07:03:36 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 9EEBB128959 for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:03:35 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.6
X-Spam-Level: 
X-Spam-Status: No, score=-2.6 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id CMJ7jqaA3WdJ for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:03:28 -0800 (PST)
Received: from mail-wm0-x22b.google.com (mail-wm0-x22b.google.com [IPv6:2a00:1450:400c:c09::22b]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 17C7F126C0F for <lisp@ietf.org>; Tue,  9 Jan 2018 07:03:28 -0800 (PST)
Received: by mail-wm0-x22b.google.com with SMTP id i11so21179743wmf.4 for <lisp@ietf.org>; Tue, 09 Jan 2018 07:03:27 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=MrD0NXWNYSCvFOqduHHKrbIm4b+xXPOUI9s8YY5yiIQ=; b=LQeAuxFUzL8gvsgnLyBMjV+L2iM3bP4Znfqfb9n9h28ARzcJDw5DVApXQnrCzNGp+F V0PcAOLT6JAgylToXDHyDYAeEzJvlzU3MZ2jfG1Nmws8+48yCM+RjcEQ8uDONtmLyJyW CwB6EzBsWN6P7e5jm2bp7kNm0Okx+T0zUbIs42GpnOUrdYv8gqVlTxLZmN3x6NQ+xSa6 pmPfFcbc8j/TELrkH9UJk5sPhjtgx4TgWfbH5DGooqkp+lj+wIGl0V5B5FSknTEPf3DD NThut9sByXGN3nf18kWNqN46wo7KzcD95FU2Zrc91R9nqp8TA01xDiIxBv/YsC5wFYOx yGjw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=MrD0NXWNYSCvFOqduHHKrbIm4b+xXPOUI9s8YY5yiIQ=; b=QUGT5Q94NQNxKlk9pPLiwL5015HgM1KYjssFPg6EfVjVnYIoz5xSXZHvr24Cl6XMWz kG9DNtG2ABl6liEIYwIeMlnrnSX14kXAl7aJdvNUiNKR6jwSOvbb61SW5vrzXFp8OaT+ i2x/kWHFw6uhn9EUuKYrXVW03WemmZ9T4sxwZQjvFmN7H3rZ03y4herdmcUPMyZvmFlN R7mRtf9zWSI7OCjalF+5x58Lyn/fCDPfUjf0GD4mQB5mzcH6/lVXHi1xXpgvRGzLiAwA DI2TmWz05tc0CEmeHeJNniX+aqDmxeARCfTc43mQCUXKeNMm5yzmE0nBZf52JkKrJWez YEbQ==
X-Gm-Message-State: AKGB3mIbFO+X/3tyl+9Fn5D+QWVvQwGwy0gmAOjpmg20B7T6vavNSIW+ 6/C+/tDv5i7qrvmtV0wAnwi2dxjg4WA=
X-Google-Smtp-Source: ACJfBosj/g72HBw3G/oNjpbieHeJEqZmuTY22EEXQby41OEJXOnMHen/TpcJRIS8vaJWmviVdxM0UA==
X-Received: by 10.28.234.10 with SMTP id i10mr11871865wmh.14.1515510206360; Tue, 09 Jan 2018 07:03:26 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:c4aa:2fae:3f8:10d4? ([2001:660:330f:a4:c4aa:2fae:3f8:10d4]) by smtp.gmail.com with ESMTPSA id w195sm13600173wmw.46.2018.01.09.07.03.24 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 07:03:24 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Message-Id: <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_A7E7F0CE-63A9-4095-A0BA-50E081433178"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Tue, 9 Jan 2018 16:04:04 +0100
In-Reply-To: <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net>
Cc: "lisp@ietf.org list" <lisp@ietf.org>
To: Albert Cabellos <albert.cabellos@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/LftulvVtai2zEtqiy0ObMZMzKL4>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 15:03:35 -0000

--Apple-Mail=_A7E7F0CE-63A9-4095-A0BA-50E081433178
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8


HI Albert,

thanks for your reply.=20

My comments inline. (trimming what is OK for me)

Luigi

> On 27 Dec 2017, at 02:48, Albert Cabellos <albert.cabellos@gmail.com =
<mailto:albert.cabellos@gmail.com>> wrote:
>=20

[snip]
> >
> >
> >   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
> >      IPv6) value used in the source and destination address fields =
of
> >      the first (most inner) LISP header of a packet.  The host =
obtains
> >      a destination EID the same way it obtains a destination address
> >      today, for example, through a Domain Name System (DNS) =
[RFC1034]
> >      lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
> >      The source EID is obtained via existing mechanisms used to set =
a
> >      host's "local" IP address.  An EID used on the public Internet
> >      must have the same properties as any other IP address used in =
that
> >      manner; this means, among other things, that it must be =
globally
> >      unique.  An EID is allocated to a host from an EID-Prefix block
> >      associated with the site where the host is located.  An EID can =
be
> >      used by a host to refer to other hosts.  Note that EID blocks =
MAY
> >      be assigned in a hierarchical manner, independent of the =
network
> >      topology, to facilitate scaling of the mapping database.  In
> >      addition, an EID block assigned to a site may have site-local
> >      structure (subnetting) for routing within the site; this =
structure
> >      is not visible to the global routing system.  In theory, the =
bit
> >      string that represents an EID for one device can represent an =
RLOC
> >      for a different device.  As the architecture is realized, if a
> >      given bit string is both an RLOC and an EID, it must refer to =
the
> >      same entity in both cases.
> >
> >
> > Is the above sentence really necessary?
> >
>=20
> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID =
is an address of the overlay and an RLOC an address of the overlay. This =
change may require further changes on the document so I am not 100% sure =
if this is a good idea.

For clarification I was just referring to the sentence:

 " As the architecture is realized, if a given bit string is both an =
RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=20=


I am wondering if such constrain is really necessary. If namespaces are =
well scoped there is no need for this.=20

[snip]

About the following:

>=20
> >
> >   o  EIDs are typically IP addresses assigned to hosts.
> >
> >   o  Other types of EID are supported by LISP, see [RFC8060] for
> >      further information.
> >
> > I would put the last two bullets in the definition of EID. It =
simplifies the story here.
> >
> >
>=20
> I suggest to leave them here, I don=C2=B4t think that readers start =
from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.

Good point about de definition of terms. What really bothers me is the =
bullet organisation. What can be done is to merge these two bullets with =
the previous one.=20

>=20
> >
> > The description of the encap/decap operation lacks of clarity =
concerning how to deal with
> > ECN bits and DSCP .
> >
> > 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
> >
> > 2. How to deal with ECN should be part of the description of the  =
encap/decap not a paragraph apart.
> >    This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
> >    and the other half  in the ETR/PETR operation.
>=20
>=20
> Agreed, what about this (please comment):
>=20
>    When doing ITR/PITR encapsulation:
>=20
>     o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' =
field.
>     o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>    o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>=20
> When doing ETR/PETR decapsulation:
>=20
>    o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>    o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>    o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>=20
> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>=20
> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>=20

Text looks very good to me.


>=20
> >
> > Large part of this section is about control plane issues and as such =
should be put in 6833bis.
> >
> > What this section should state is that priority and weight are used =
to select the RLOC to use.
> > Only exception is gleaning where we have one single RLOC and we do =
not know neither priority nor weight.
> >
> > All the other operational discussion goes elsewhere, but not in this =
document.
> >
>=20
> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is =
less obvious, maybe something like (not final, just a couple of ideas):
>=20
> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>=20

Yes, this is what I meant.


> Actually we should merge this section with 'Routing Locator Hashing'
>=20
>=20

I think is a good idea.

[snip]
> > 13.  Changing the Contents of EID-to-RLOC Mappings
> >
> >
> > This is a control plane issue, as such it has to go in 6833bis, with =
two exception:
> > The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
> >
> > All of the rest 6833bis
> >
> > Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
> >
> >
>=20
> So you are suggesting that the LISP control-plane does not define any =
mechanism to update EID-to-RLOC mappings?=20
>=20

Not exactly. Control-plane should discuss how to change the mappings, =
but things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense  to put =
it elsewhere.

Thanks

Luigi










--Apple-Mail=_A7E7F0CE-63A9-4095-A0BA-50E081433178
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" =
class=3D""><div><div class=3D""><br class=3D""></div><div class=3D""><div =
style=3D"word-wrap: break-word; -webkit-nbsp-mode: space; line-break: =
after-white-space;" class=3D"">HI Albert,<div class=3D""><br =
class=3D""></div><div class=3D"">thanks for your reply.&nbsp;</div><div =
class=3D""><br class=3D""></div><div class=3D"">My comments inline. =
(trimming what is OK for me)</div><div class=3D""><br =
class=3D""></div><div class=3D"">Luigi<br class=3D""><div class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D"">On 27 =
Dec 2017, at 02:48, Albert Cabellos &lt;<a =
href=3D"mailto:albert.cabellos@gmail.com" =
class=3D"">albert.cabellos@gmail.com</a>&gt; wrote:</div><br =
class=3D"Apple-interchange-newline"></blockquote><div class=3D""><br =
class=3D""></div><div class=3D"">[snip]</div><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D"">&gt;<br class=3D"">&gt;<br class=3D"">&gt; &nbsp; Endpoint ID =
(EID): &nbsp; An EID is a 32-bit (for IPv4) or 128-bit (for<br =
class=3D"">&gt; &nbsp; &nbsp; &nbsp;IPv6) value used in the source and =
destination address fields of<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;the =
first (most inner) LISP header of a packet.&nbsp; The host obtains<br =
class=3D"">&gt; &nbsp; &nbsp; &nbsp;a destination EID the same way it =
obtains a destination address<br class=3D"">&gt; &nbsp; &nbsp; =
&nbsp;today, for example, through a Domain Name System (DNS) =
[RFC1034]<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;lookup or Session =
Initiation Protocol (SIP) [RFC3261] exchange.<br class=3D"">&gt; &nbsp; =
&nbsp; &nbsp;The source EID is obtained via existing mechanisms used to =
set a<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;host's "local" IP =
address.&nbsp; An EID used on the public Internet<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;must have the same properties as any other IP =
address used in that<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;manner; this =
means, among other things, that it must be globally<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;unique.&nbsp; An EID is allocated to a host from an =
EID-Prefix block<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;associated with =
the site where the host is located.&nbsp; An EID can be<br class=3D"">&gt;=
 &nbsp; &nbsp; &nbsp;used by a host to refer to other hosts.&nbsp; Note =
that EID blocks MAY<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;be assigned =
in a hierarchical manner, independent of the network<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;topology, to facilitate scaling of the mapping =
database.&nbsp; In<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;addition, an =
EID block assigned to a site may have site-local<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;structure (subnetting) for routing within the site; =
this structure<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;is not visible to =
the global routing system.&nbsp; In theory, the bit<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;string that represents an EID for one device can =
represent an RLOC<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;for a different =
device.&nbsp; As the architecture is realized, if a<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;given bit string is both an RLOC and an EID, it must =
refer to the<br class=3D"">&gt; &nbsp; &nbsp; &nbsp;same entity in both =
cases.<br class=3D"">&gt;<br class=3D"">&gt;<br class=3D"">&gt; Is the =
above sentence really necessary?<br class=3D"">&gt;<br class=3D""><br =
class=3D"">Agreed, why not simplify the definitions. They are written =
from the =E2=80=98Internet scalability mindset=E2=80=99, why not say =
that an EID is an address of the overlay and an RLOC an address of the =
overlay. This change may require further changes on the document so I am =
not 100% sure if this is a good idea.<br =
class=3D""></div></div></div></blockquote><div class=3D""><br =
class=3D""></div><div class=3D"">For clarification I was just referring =
to the sentence:</div><div class=3D""><br class=3D""></div><div =
class=3D"">&nbsp;" As the architecture is realized, if a given bit =
string is both an RLOC and an EID, it must refer to the same entity in =
both cases.=E2=80=9D&nbsp;</div><div class=3D""><br class=3D""></div><div =
class=3D"">I am wondering if such constrain is really necessary. If =
namespaces are well scoped there is no need for this.&nbsp;</div><div =
class=3D""><br class=3D""></div>[snip]</div><div class=3D""><br =
class=3D""></div><div class=3D"">About the following:</div><div =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D""><div dir=3D"ltr" class=3D""><div class=3D""><div class=3D""><br=
 class=3D"">&gt;<br class=3D"">&gt; &nbsp; o &nbsp;EIDs are typically IP =
addresses assigned to hosts.<br =
class=3D""></div></div></div></div></blockquote><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D"">&gt;<br class=3D"">&gt; &nbsp; o &nbsp;Other =
types of EID are supported by LISP, see [RFC8060] for<br class=3D"">&gt; =
&nbsp; &nbsp; &nbsp;further information.<br class=3D"">&gt;<br =
class=3D"">&gt; I would put the last two bullets in the definition of =
EID. It simplifies the story here.<br class=3D"">&gt;<br =
class=3D"">&gt;<br class=3D""><br class=3D"">I suggest to leave them =
here, I don=C2=B4t think that readers start from the =E2=80=98Definition =
of terms=E2=80=99, these are relevant concepts to understand =
LISP.</div></div></div></div></blockquote><div class=3D""><br =
class=3D""></div><div class=3D"">Good point about de definition of =
terms. What really bothers me is the bullet organisation. What can be =
done is to merge these two bullets with the previous =
one.&nbsp;</div><div class=3D""><br class=3D""></div><blockquote =
type=3D"cite" class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D"">&gt;<br class=3D"">&gt; The =
description of the encap/decap operation lacks of clarity concerning how =
to deal with<br class=3D"">&gt; ECN bits and DSCP .<br class=3D"">&gt;<br =
class=3D"">&gt; 1. I think that the text should make explicitly the =
difference between DSCP and ECN fields.<br class=3D"">&gt;<br =
class=3D"">&gt; 2. How to deal with ECN should be part of the =
description of the &nbsp;encap/decap not a paragraph apart.<br =
class=3D"">&gt; &nbsp; &nbsp;This basically means that half of the last =
paragraph should be a bullet of the ITR/PITR encapsulation<br =
class=3D"">&gt; &nbsp; &nbsp;and the other half &nbsp;in the ETR/PETR =
operation.<br class=3D""><br class=3D""><br class=3D"">Agreed, what =
about this (please comment):<br class=3D""><br =
class=3D""></div><blockquote style=3D"margin:0 0 0 =
40px;border:none;padding:0px" class=3D""><div class=3D"">&nbsp; =
&nbsp;When doing ITR/PITR encapsulation:</div><div class=3D""><br =
class=3D""></div><div class=3D"">&nbsp; &nbsp; o &nbsp;The outer-header =
'Time to Live' field (or 'Hop Limit' field, in the case of IPv6) SHOULD =
be copied from the inner-header 'Time to Live' field.</div><div =
class=3D"">&nbsp; &nbsp; o &nbsp;The outer-header 'Differentiated =
Services Code Point' (DSCP) field (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be copied from the inner-header DSCP field =
('Traffic Class' field, in the case of IPv6) considering the exception =
listed below.</div><div class=3D"">&nbsp; &nbsp;o &nbsp;The 'Explicit =
Congestion Notification' (ECN) field (bits 6 and 7 of the IPv6 'Traffic =
Class' field) requires special treatment in order to avoid discarding =
indications of congestion [RFC3168]. ITR encapsulation MUST copy the =
2-bit 'ECN' field from the inner header to the outer header. =
Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer =
header to the new outer header.</div><div class=3D""><br =
class=3D""></div><div class=3D"">When doing ETR/PETR =
decapsulation:</div><div class=3D""><br class=3D""></div><div =
class=3D"">&nbsp; &nbsp;o &nbsp;The inner-header 'Time to Live' field =
(or 'Hop Limit' field, in the case of IPv6) SHOULD be copied from the =
outer-header 'Time to Live' field, when the Time to Live value of the =
outer header is less than the Time to Live value of the inner =
header.&nbsp; Failing to perform this check can cause the Time to Live =
of the inner header to increment across encapsulation/decapsulation =
cycles.&nbsp; This check is also performed when doing initial =
encapsulation, when a packet comes to an ITR or PITR destined for a LISP =
site.</div><div class=3D"">&nbsp; &nbsp;o &nbsp;The inner-header =
'Differentiated Services Code Point' (DSCP) field (or the 'Traffic =
Class' field, in the case of IPv6) SHOULD be copied from the =
outer-header DSCP field ('Traffic Class' field, in the case of IPv6) =
considering the exception listed below.</div><div class=3D"">&nbsp; =
&nbsp;o &nbsp;The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. If the =
'ECN' field contains a congestion indication codepoint (the value is =
'11', the Congestion Experienced (CE) codepoint), then ETR decapsulation =
MUST copy the 2-bit 'ECN' field from the stripped outer header to the =
surviving inner header that is used to forward the packet beyond the =
ETR.&nbsp; These requirements preserve CE indications when a packet that =
uses ECN traverses a LISP tunnel and becomes marked with a CE indication =
due to congestion between the tunnel endpoints.</div><div class=3D""><br =
class=3D""></div><div class=3D"">Note that if an ETR/PETR is also an =
ITR/PITR and chooses to re-encapsulate after decapsulating, the net =
effect of this is that the new outer header will carry the same Time to =
Live as the old outer header minus 1.</div><div class=3D""><br =
class=3D""></div><div class=3D"">Copying the Time to Live (TTL) serves =
two purposes: first, it preserves the distance the host intended the =
packet to travel; second, and more importantly, it provides for =
suppression of looping packets in the event there is a loop of =
concatenated tunnels due to misconfiguration.&nbsp; See Section 18.3 for =
TTL exception handling for traceroute packets.</div></blockquote><div =
class=3D""><br class=3D""></div></div></div></div></blockquote><div =
class=3D""><br class=3D""></div><div class=3D"">Text looks very good to =
me.</div><div class=3D""><br class=3D""></div><br class=3D""><blockquote =
type=3D"cite" class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D"">&gt;<br class=3D"">&gt; Large =
part of this section is about control plane issues and as such should be =
put in 6833bis.<br class=3D"">&gt;<br class=3D"">&gt; What this section =
should state is that priority and weight are used to select the RLOC to =
use.<br class=3D"">&gt; Only exception is gleaning where we have one =
single RLOC and we do not know neither priority nor weight.<br =
class=3D"">&gt;<br class=3D"">&gt; All the other operational discussion =
goes elsewhere, but not in this document.<br class=3D"">&gt;<br =
class=3D""><br class=3D"">Agree, I suggest moving it to 6833bis. What to =
leave in 6830bis is less obvious, maybe something like (not final, just =
a couple of ideas):<br class=3D""><br class=3D""></div><blockquote =
style=3D"margin:0 0 0 40px;border:none;padding:0px" class=3D""><div =
class=3D"">The data-plane must follow the state stored in the map-cache =
to encapsulate and decapsulate packets. The map-cache is populated using =
a control-plane, such as [6833bis]. ETRs encapsulate packets following =
the Priorities and Weights stored in the map-cache.</div><div =
class=3D""><br =
class=3D""></div></blockquote></div></div></div></blockquote><div =
class=3D""><br class=3D""></div><div class=3D"">Yes, this is what I =
meant.</div><div class=3D""><br class=3D""></div><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><div =
dir=3D"ltr" class=3D""><div class=3D""><blockquote style=3D"margin:0 0 0 =
40px;border:none;padding:0px" class=3D"">Actually we should merge this =
section with 'Routing Locator Hashing'</blockquote><div class=3D""><br =
class=3D""><br class=3D""></div></div></div></div></blockquote><div =
class=3D""><br class=3D""></div><div class=3D"">I think is a good =
idea.</div><div class=3D""><br class=3D""></div>[snip]</div><div =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><div =
dir=3D"ltr" class=3D""><div class=3D""><div class=3D"">&gt; 13.&nbsp; =
Changing the Contents of EID-to-RLOC Mappings<br class=3D"">&gt;<br =
class=3D"">&gt;<br class=3D"">&gt; This is a control plane issue, as =
such it has to go in 6833bis, with two exception:<br class=3D"">&gt; The =
very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.<br class=3D"">&gt;<br =
class=3D"">&gt; All of the rest 6833bis<br class=3D"">&gt;<br =
class=3D"">&gt; Actually I remember a suggestion about putting =
operations issues like this in an OAM document which would be a good =
idea.<br class=3D"">&gt;<br class=3D"">&gt;<br class=3D""><br =
class=3D"">So you are suggesting that the LISP control-plane does not =
define any mechanism to update EID-to-RLOC mappings? <br class=3D""><br =
class=3D""></div></div></div>
</div></blockquote></div><br class=3D""></div><div class=3D"">Not =
exactly. Control-plane should discuss how to change the mappings, but =
things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense =
&nbsp;to put it elsewhere.</div><div class=3D""><br class=3D""></div><div =
class=3D"">Thanks</div><div class=3D""><br class=3D""></div><div =
class=3D"">Luigi</div><div class=3D""><br class=3D""></div><div =
class=3D""><br class=3D""></div><div class=3D""><br class=3D""></div><div =
class=3D""><br class=3D""></div><div class=3D""><br class=3D""></div><div =
class=3D""><br class=3D""></div><div class=3D""><br class=3D""></div><div =
class=3D""><br class=3D""></div></div></div></div><br =
class=3D""></body></html>=

--Apple-Mail=_A7E7F0CE-63A9-4095-A0BA-50E081433178--


From nobody Tue Jan  9 07:04:28 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id C5B86126C0F for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:04:26 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.899
X-Spam-Level: 
X-Spam-Status: No, score=-1.899 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id Il025v8KYKyE for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:04:24 -0800 (PST)
Received: from mail-wr0-x22e.google.com (mail-wr0-x22e.google.com [IPv6:2a00:1450:400c:c0c::22e]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 63F5F128959 for <lisp@ietf.org>; Tue,  9 Jan 2018 07:04:23 -0800 (PST)
Received: by mail-wr0-x22e.google.com with SMTP id 36so14430000wrh.1 for <lisp@ietf.org>; Tue, 09 Jan 2018 07:04:23 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=9Bu3STVexHFOlAzCyFWvAKCiTit+HrprQnknRhHuqDk=; b=WGVfMKioALk8udi7WW8Buh2IR3MQg9fIz7MlLP4mmHZANO10PhXtHKuCnCQirQ+fR1 2EdacGsN2SbrSXEeC2FBd0KgFQtoIgWsnZxMY8IDvYkqbGC9wRNdrWuVdzQ2pwXDedbD i7ryplq1H1GfCOJ4eFHsXCU9A+S5/vOtzOIG17svsuO41ysPJg4LWKt4vTLIs0ktVucs UQznudFNBjCinRTjll1kv8ym2OUW8a5DNAZEGBJjNWIo6V3TaKRid3C1hzGPJFU0eRGh plFennwihGAgPwWtS3or5SNDM3J9ElWgqE8/aJewMRNUZperIDc3s9bryWlLa3OCFoFc sxIw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=9Bu3STVexHFOlAzCyFWvAKCiTit+HrprQnknRhHuqDk=; b=ghRKh9yT69yIEET1RIX4dVjG5lwexmHzzBbgGM8MVc5X2Wla6Akfcu1yKRqI5Gfxdl lsA5cgwSG4obMRv5iWvKzOhWtBW4XqskWz+8mOPEHm7EeHG4JL2We7s2DsLOP0SnmqlF XFrskZYaGDrRfUlkAMnhQ0f5r62176xSgKAmyZ46UQngcryZ5/4NidX6eYTYa170iiq8 hfgdbDhIE4fBNrYOXFdzr6ItZW8N1Nb89l1mM6eugJMBUvSil3gtk8bMRYNo2OScBWv1 NozqRvmYZ/plGMPOYXVJzLqJzS/Dd/MOFc/0VdmQpHJ6oMXJnkyUEtTwuRnSyisulhIv PFPg==
X-Gm-Message-State: AKGB3mIbEi3FuImmtnifQ1b8lS2AocBR0Tdb5HWaWrbizEL+U2rlt8/0 3/zv/6dktjOLnTXYU09fxD45+3HS4FQ=
X-Google-Smtp-Source: ACJfBosScCbkk2zyTwlpZ0LKgmjnBN/lqeYluJya+PsyxSdTZ4UYafxWMd6sSn/mr1BNTUUn60x50g==
X-Received: by 10.223.176.17 with SMTP id f17mr6769937wra.178.1515510261666; Tue, 09 Jan 2018 07:04:21 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:c4aa:2fae:3f8:10d4? ([2001:660:330f:a4:c4aa:2fae:3f8:10d4]) by smtp.gmail.com with ESMTPSA id w195sm13600173wmw.46.2018.01.09.07.04.19 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 07:04:19 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Message-Id: <E808D20D-368A-45E5-8672-5ED36A69E0EB@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_D2E84D05-09F2-4BA0-A11D-CC305720646D"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Tue, 9 Jan 2018 16:04:59 +0100
In-Reply-To: <DD3BF978-9197-45FD-B448-0AFF45E31251@gigix.net>
Cc: "lisp@ietf.org list" <lisp@ietf.org>
To: Dino Farinacci <farinacci@gmail.com>
References: <599A8A3E-E291-4F8A-9461-CBE87C1A2C6F@gigix.net> <DD3BF978-9197-45FD-B448-0AFF45E31251@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/lD9TKJLVFlvq6ftUga4rtxk4kDA>
Subject: Re: [lisp] 6830bis Review (PLEASE COMMENTS)
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 15:04:27 -0000

--Apple-Mail=_D2E84D05-09F2-4BA0-A11D-CC305720646D
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Hi Dino,

my detailed comments are inline as usual, but I was wondering if is =
there a strong valid reason not to move text around?

The objective of this documentation is to be accessible easily by anyone =
that is willing to work or implement LISP, not only to specialist. The =
decomposition of functionality is thus essential so people don=E2=80=99t =
have to make important effort to understand what is strictly LISP =
encapsulation data-plane (specific to this encapsulation method), what =
is operation of the system, and what is control-plane (general to any =
encapsulation below).
>=20



> On 27 Dec 2017, at 05:54, Dino Farinacci <farinacci@gmail.com =
<mailto:farinacci@gmail.com>> wrote:
>=20
> New update included. I have made a lot of your requested changes but =
still disagree with many of your points. More justification below.
>=20
>>> It is about not losing important information we decided 10 years ago =
to keep
>>> in because otherwise, we=E2=80=99d have to sprinkle it across =
documents. And WE DID decide to NOT create a third document.
>>=20
>> AFAIR there was only consensus in having two documents.
>> I can live with two documents, but the content has to be clear. At =
this stage I do not consider its content clear enough.
>=20
> Well you have to be specific where you think it is not clear.
>=20
>>=20
>>>> The document can be shorter and to the point. There are a lot of =
OAM information that does not belong to the data-plane.
>>>=20
>>> The OAM information is necessary for the data-plane. And if =
LISP-GPE, VXLAN, or any other data plane wants to use their own OAM or =
use the LISP control-plane differently, it needs to be documented in =
their data-planes. Hence, why this information is there.
>>=20
>> Doesn=E2=80=99t make sense to me. That is not a reason.=20
>=20
> It is a reason, maybe one you don=E2=80=99t like, but it is a reason.
>=20

The point is that in the current document there is a lot of OAM text =
that does not belong to the data-plane.=20


>> That information can be available in another document and still be =
used by LISP-GPE, VxLAN, or any other data plane.
>=20
> But we decided on only 2 documents. And if we put data-plane usage in =
a control-plane document, then we are making 6833bis like 6830.
>=20

We are better organising the specifications so that they are clearer and =
easier to read.


[snip]
>=20
>>>> You break the operational flow by opening a different point =
describing what is what. It makes the overall procedure unclear.
>>>=20
>>> It was put there because someone commented on it. You have to tell =
me why you think it breaks flow. We discuss how end-systems send to =
EIDs. We say what EIDs are and how they are assigned to hosts. And then =
we move to RLOCs. It is pretty plan, simple, and straight-forward.
>>>=20
>>=20
>> Those two point would have more emphasis somewhere else.=20
>> Where they are now they break the flow and do not provide details.
>=20
> Unless you provide clear text where they should go, I=E2=80=99m not =
going to change it.
>=20

Suggested to merge with previous bullet in the reply to Albert.

>> You can actually put them at the end of section 1 as normal =
sentences. We then add a reference to LCAF and state that this document =
describes procedures only for EID that are IPv4 or IPv6 addresses.
>=20
> The intro section is taking about broad concepts. Describing EIDs and =
RLOC encodings is too early for it.

Is not encoding is the concept that and EID can be anything.
But if you do my previous suggestion it will work for me.


[snip]
>> In the ITR part we put as last bullet the first part of the original =
paragraph:
>>=20
>> 	- =16=16The Explicit Congestion Notification ('ECN=E2=80=99), =
namely bits  6 and 7 of both the IPv4 and  IPv6 headers, requires =
special treatment
>> 	  in order to avoid discarding indications of congestion =
[RFC3168].  An ITR/PITR encapsulation MUST copy the 2-bit 'ECN' field =
from the inner
>> 	  header to the outer header.  Re-encapsulation MUST copy the =
2-bit 'ECN' field from the stripped outer header to the new outer =
header.
>>=20
>>=20
>> In the ETR part we put as last bullet the second part of the original =
paragraph:
>>=20
>> 	- =16=16The Explicit Congestion Notification ('ECN=E2=80=99), =
namely bits  6 and 7 of both the IPv4 and  IPv6 headers, requires =
special treatment
>> 	  in order to avoid discarding indications of congestion =
[RFC3168].  If the 'ECN' field contains a congestion indication =
codepoint (the
>> 	  value is '11', the Congestion Experienced (CE) codepoint), =
then ETR/PETR  decapsulation MUST copy the 2-bit 'ECN' field from
>>      the stripped outer header to the surviving inner header that is =
used to forward the  packet beyond the ETR. =20
>>=20
>> that=E2=80=99s it=20
>=20
> I made some minor comments but do not want to undo what David Black =
spent effort on and got approval for. And I certainly don=E2=80=99t want =
to repeat text as you suggested above.
>=20

The text provided by Albert is very good, I will ask David to review the =
text again to make sure nothing has been lost.


>>=20
>>>=20
>>>>>=20
>>>>>>> 9.  Routing Locator Selection
>>>>>>>=20
>>>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>>>=20
>>>>>> What this section should state is that priority and weight are =
used to select the RLOC to use.
>>>>>> Only exception is gleaning where we have one single RLOC and we =
do not know neither priority nor weight.
>>>>>>=20
>>>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>>=20
>>>>> We have already decided (a year ago) not to move this because its =
the data-plane that needs to know about locator reachability so it knows =
which locators to use.
>>>>=20
>>>> Please check the minutes of past meetings (as I did), the only =
unclear point was SMR, everything else was agreed to be moved out.=20
>>>=20
>>> Please point it out. We have taken every input from the WG.
>>=20
>> https://www.ietf.org/proceedings/96/minutes/minutes-96-lisp =
<https://www.ietf.org/proceedings/96/minutes/minutes-96-lisp>
>=20
> All I see in the notes about RLOC-probing is this:
>=20
> 	- Luigi Iannone says for him RLOC probing/Clock Sweep should be =
in Control
> 	Plane.
> 	- Dino Farinacci says that if people want to use LISP control =
plane,
> 	seeing RLOC probing in control plane document may look awkward =
for
> 	people not willing to use the lisp data encapsulation.
>=20
> And we already know this.  ;-)

Please listen to the recording.=20

>=20
> That doesn=E2=80=99t tell me there was a decision or concensus.
>=20
>>>> Exactly, it has been decided, hence control plane things go in the =
control plane document. (or OAM)
>>>=20
>>> You are trying to draw a hard wall between the data-plane and =
control-plane. In the real world that is not how protocols are deployed.
>>=20
>> I am trying to make this  a high quality document. I really don=E2=80=99=
t want that the document comes back from the IESG because this would =
delay publication a lot.
>> Besides, this is a specification document, independent from the =
implementationS. If anybody wants to tighten somehow control and data =
planes, they are free to go that way.
>>=20
>> What we need here is to put some text in 6833bis, and replace it here =
with the sentence =E2=80=9COther control plane based reachability =
mechanism can be found in [6833bis]=E2=80=9D
>>=20
>> In 6833bis we do the opposite, we add the text cut from 6830bis and =
add =E2=80=9COther data plane based reachability mechanism can be found =
in [6830bis]=E2=80=9D
>=20
> Is this a new comment. Sounds like you are suggesting something new.

No. Is the same suggestion.=20

Remove the text and put the sentence: =E2=80=9COther control plane based =
reachability mechanisms can be found in [6833bis]=E2=80=9D

In 6833bis you add the ext remove from 6830bis and at the end you add =
=E2=80=9COther data plane based reachability mechanisms can be found in =
[6830bis]=E2=80=9D=20


>=20
>>>=20
>>>>>>=20
>>>>>> Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.=20
>>>>>=20
>>>>> I don=E2=80=99t agree. We had already mentioned there is a =
control-plane protocol that is described in RFC6833bis and a data-plane =
protocol that USEs the control-plane protocol. And the usage should be =
here.
>>>>=20
>>>> Not following here. Why should the data-plane control the control =
plane?
>>>=20
>>> It is not controlling the control-plane, it is using it. Did my =
example of an API not make that clear?
>>>=20
>>=20
>> To me was not clear, let me try to reword.
>> The link between control and data planes is the LISP cache and some =
events that may trigger specific operations.
>> If those operations are data-plane they stay here.=20
>> It those operations are control-plane they go in 6833bis.
>=20
> The data-plane does echo-noncing. So that should remain in the =
data-plane based on your premise above. I think you=E2=80=99d agree with =
that. But RLOC-probes may be suppressed due to echo-noncing showing =
reachability. Do you want to put echo-noncing logic in 6833bis if you =
move RLOC-probing there.
>=20
> That would not be a good thing.
>=20
> Also, if a map-cache entry doesn=E2=80=99t exist, no RLOC-probes are =
sent. So how to do you say that in a control-plane document when there =
are a lot of reasons to send RLOC-probes. RLOC-probes are sent to do =
lisp-crypto key-exchange, that is a data-plane feature.
>=20
> Please, let=E2=80=99s just keep it where it is and let=E2=80=99s move =
on.


As I suggested in first mail:=20

We need to keep: 1, 6, Echo-Nonce,=20

We need to move: 2, 3, 4, 5,  RLOC-Probing


>=20
>>=20
>>=20
>> [snip]
>>=20
>>=20
>>>>> Making changes like this to RFC6833 will be huge.
>>>>=20
>>>> You do not have to. see my comment above.
>>>>=20
>>>>> We have the documents separated in the current state right now =
that seems to work and seems to be clear.
>>>>=20
>>>> I did not have time to go over 6833bis, but concerning 6830bis the =
document is not clear and it is a patchwork of data-plane, =
control-plane, and deployment issues.
>>>>=20
>>>> This is not what was agreed upon when we started this effort.
>>>=20
>>> The effort was continuing. And we created options with further =
study.
>>=20
>> Not sure I am following here. The initial intent was two have two =
documents.
>>=20
>>> Both Albert and I did that further study and the drafts reflect the =
decisions. There were no WG objections other than from you which we had =
thought we convinced.
>>=20
>> Again, IETF 96th. Yes, I proposed at the mic to move the text in =
6833bis, only objection to this was you on the SMR mechanism.
>> Other then the SMR point we draw a clear line.
>>=20
>>>=20
>>>>>>>=20
>>>>>>> 19.  Security Considerations
>>>>>>>=20
>>>>>>> Security considerations for LISP are discussed in [RFC7833], in
>>>>>>> addition [I-D.ietf-lisp-sec] provides authentication and =
integrity to
>>>>>>> LISP mappings.
>>>>>>>=20
>>>>>> lisp-sec is control-plane has to be referenced in 6833bis.
>>>>>=20
>>>>> Yes, but if an ITR caches a coarse EID-prefix, then there is a =
data-plane redirection attack.
>>>>>=20
>>>>=20
>>>> My point is that lisp-sec provides control plane features, so the =
sentence does not bring anything to the discussion.
>>>> Please delete.
>>=20
>> Any comment here?
>=20
> No comment. I think we should reference it.

Can you share your reasoning?


>=20
>>=20
>>>>>>> 21.1.  LISP UDP Port Numbers
>>>>>>>=20
>>>>>>> The IANA registry has allocated UDP port numbers 4341 and 4342 =
for
>>>>>>> lisp-data and lisp-control operation, respectively.  IANA has =
updated
>>>>>>> the description for UDP ports 4341 and 4342 as follows:
>>>>>>>=20
>>>>>>> lisp-data      4341 udp    LISP Data Packets
>>>>>>> lisp-control   4342 udp    LISP Control Packets
>>>>>>>=20
>>>>>> 4342 is control-plane and MUST be requested to IANA in the =
6833bis document.
>>>>>=20
>>>>> We didn=E2=80=99t want to change the registry so we are keeping =
this here. Its really no big deal.
>>>>=20
>>>>> Note the data-plane implementation will have to send to the 4342 =
socket so its not out of place at all for this to be in this document.
>>>>>=20
>>>>=20
>>>> 4342  is control plane not data plane, any further review beyond =
the WG will point out this inconsistency.
>>>=20
>>> Sorry a data-plane component uses it
>>=20
>>> . Why split it up when we can have this in one place.
>>=20
>> Can you elaborate better your rationale?=20
>=20
> The registry already refers to RFC6830. What=E2=80=99s the point of =
changing this when it really is a very minor point.

Because this is a data-plane document and there is no point in defining =
control plane codepoints here.

thanks

Luigi


>=20
> Dino
>=20
> <rfcdiff-rfc6830bis.html><draft-ietf-lisp-rfc6830bis-08.txt>
>=20
>=20




--Apple-Mail=_D2E84D05-09F2-4BA0-A11D-CC305720646D
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D"">Hi =
Dino,<br class=3D""><div><div style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D""><div =
class=3D""><div class=3D""><div class=3D""><div class=3D""><br =
class=3D"">my detailed comments are inline as usual, but I was wondering =
if is there a strong valid reason not to move text around?</div><div =
class=3D""><br class=3D""></div><div class=3D"">The objective of this =
documentation is to be accessible easily by anyone that is willing to =
work or implement LISP, not only to specialist. The decomposition of =
functionality is thus essential so people don=E2=80=99t have to make =
important effort to understand what is strictly LISP encapsulation =
data-plane (specific to this encapsulation method), what is operation of =
the system, and what is control-plane (general to any encapsulation =
below).</div><div class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D""></blockquote><br class=3D""><br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D"">On 27 Dec 2017, at =
05:54, Dino Farinacci &lt;<a href=3D"mailto:farinacci@gmail.com" =
class=3D"">farinacci@gmail.com</a>&gt; wrote:<br class=3D""><br =
class=3D"">New update included. I have made a lot of your requested =
changes but still disagree with many of your points. More justification =
below.<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D"">It is about not losing =
important information we decided 10 years ago to keep<br class=3D"">in =
because otherwise, we=E2=80=99d have to sprinkle it across documents. =
And WE DID decide to NOT create a third document.<br =
class=3D""></blockquote><br class=3D"">AFAIR there was only consensus in =
having two documents.<br class=3D"">I can live with two documents, but =
the content has to be clear. At this stage I do not consider its content =
clear enough.<br class=3D""></blockquote><br class=3D"">Well you have to =
be specific where you think it is not clear.<br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><br class=3D""><blockquote=
 type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D"">The =
document can be shorter and to the point. There are a lot of OAM =
information that does not belong to the data-plane.<br =
class=3D""></blockquote><br class=3D"">The OAM information is necessary =
for the data-plane. And if LISP-GPE, VXLAN, or any other data plane =
wants to use their own OAM or use the LISP control-plane differently, it =
needs to be documented in their data-planes. Hence, why this information =
is there.<br class=3D""></blockquote><br class=3D"">Doesn=E2=80=99t make =
sense to me. That is not a reason. <br class=3D""></blockquote><br =
class=3D"">It is a reason, maybe one you don=E2=80=99t like, but it is a =
reason.<br class=3D""><br class=3D""></blockquote><br class=3D"">The =
point is that in the current document there is a lot of OAM text that =
does not belong to the data-plane. <br class=3D""><br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D"">That information can be available in another document and =
still be used by LISP-GPE, VxLAN, or any other data plane.<br =
class=3D""></blockquote><br class=3D"">But we decided on only 2 =
documents. And if we put data-plane usage in a control-plane document, =
then we are making 6833bis like 6830.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">We are better organising the =
specifications so that they are clearer and easier to read.<br =
class=3D""><br class=3D""><br class=3D"">[snip]<br class=3D""><blockquote =
type=3D"cite" class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D"">You break the operational flow by opening a different point =
describing what is what. It makes the overall procedure unclear.<br =
class=3D""></blockquote><br class=3D"">It was put there because someone =
commented on it. You have to tell me why you think it breaks flow. We =
discuss how end-systems send to EIDs. We say what EIDs are and how they =
are assigned to hosts. And then we move to RLOCs. It is pretty plan, =
simple, and straight-forward.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">Those two point would have more =
emphasis somewhere else. <br class=3D"">Where they are now they break =
the flow and do not provide details.<br class=3D""></blockquote><br =
class=3D"">Unless you provide clear text where they should go, I=E2=80=99m=
 not going to change it.<br class=3D""><br class=3D""></blockquote><br =
class=3D"">Suggested to merge with previous bullet in the reply to =
Albert.<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D"">You can actually put =
them at the end of section 1 as normal sentences. We then add a =
reference to LCAF and state that this document describes procedures only =
for EID that are IPv4 or IPv6 addresses.<br class=3D""></blockquote><br =
class=3D"">The intro section is taking about broad concepts. Describing =
EIDs and RLOC encodings is too early for it.<br =
class=3D""></blockquote><br class=3D"">Is not encoding is the concept =
that and EID can be anything.<br class=3D"">But if you do my previous =
suggestion it will work for me.<br class=3D""><br class=3D""><br =
class=3D"">[snip]<br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D"">In the ITR part we put =
as last bullet the first part of the original paragraph:<br class=3D""><br=
 class=3D""><span class=3D"Apple-tab-span" style=3D"white-space:pre">	=
</span>- =16=16The Explicit Congestion Notification ('ECN=E2=80=99), =
namely bits &nbsp;6 and 7 of both the IPv4 and &nbsp;IPv6 headers, =
requires special treatment<br class=3D""><span class=3D"Apple-tab-span" =
style=3D"white-space:pre">	</span> &nbsp;in order to avoid =
discarding indications of congestion [RFC3168]. &nbsp;An ITR/PITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner<br =
class=3D""><span class=3D"Apple-tab-span" style=3D"white-space:pre">	=
</span> &nbsp;header to the outer header. &nbsp;Re-encapsulation MUST =
copy the 2-bit 'ECN' field from the stripped outer header to the new =
outer header.<br class=3D""><br class=3D""><br class=3D"">In the ETR =
part we put as last bullet the second part of the original paragraph:<br =
class=3D""><br class=3D""><span class=3D"Apple-tab-span" =
style=3D"white-space:pre">	</span>- =16=16The Explicit Congestion =
Notification ('ECN=E2=80=99), namely bits &nbsp;6 and 7 of both the IPv4 =
and &nbsp;IPv6 headers, requires special treatment<br class=3D""><span =
class=3D"Apple-tab-span" style=3D"white-space:pre">	</span> &nbsp;in =
order to avoid discarding indications of congestion [RFC3168]. &nbsp;If =
the 'ECN' field contains a congestion indication codepoint (the<br =
class=3D""><span class=3D"Apple-tab-span" style=3D"white-space:pre">	=
</span> &nbsp;value is '11', the Congestion Experienced (CE) codepoint), =
then ETR/PETR &nbsp;decapsulation MUST copy the 2-bit 'ECN' field =
from<br class=3D""> &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;the stripped outer =
header to the surviving inner header that is used to forward the =
&nbsp;packet beyond the ETR. &nbsp;<br class=3D""><br class=3D"">that=E2=80=
=99s it <br class=3D""></blockquote><br class=3D"">I made some minor =
comments but do not want to undo what David Black spent effort on and =
got approval for. And I certainly don=E2=80=99t want to repeat text as =
you suggested above.<br class=3D""><br class=3D""></blockquote><br =
class=3D"">The text provided by Albert is very good, I will ask David to =
review the text again to make sure nothing has been lost.<br =
class=3D""><br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><br class=3D""><blockquote=
 type=3D"cite" class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><br class=3D""><blockquote=
 type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D"">9. =
&nbsp;Routing Locator Selection<br class=3D""><br =
class=3D""></blockquote>Large part of this section is about control =
plane issues and as such should be put in 6833bis.<br class=3D""><br =
class=3D"">What this section should state is that priority and weight =
are used to select the RLOC to use.<br class=3D"">Only exception is =
gleaning where we have one single RLOC and we do not know neither =
priority nor weight.<br class=3D""><br class=3D"">All the other =
operational discussion goes elsewhere, but not in this document.<br =
class=3D""></blockquote><br class=3D"">We have already decided (a year =
ago) not to move this because its the data-plane that needs to know =
about locator reachability so it knows which locators to use.<br =
class=3D""></blockquote><br class=3D"">Please check the minutes of past =
meetings (as I did), the only unclear point was SMR, everything else was =
agreed to be moved out. <br class=3D""></blockquote><br class=3D"">Please =
point it out. We have taken every input from the WG.<br =
class=3D""></blockquote><br class=3D""><a =
href=3D"https://www.ietf.org/proceedings/96/minutes/minutes-96-lisp" =
class=3D"">https://www.ietf.org/proceedings/96/minutes/minutes-96-lisp</a>=
<br class=3D""></blockquote><br class=3D"">All I see in the notes about =
RLOC-probing is this:<br class=3D""><br class=3D""><span =
class=3D"Apple-tab-span" style=3D"white-space:pre">	</span>- Luigi =
Iannone says for him RLOC probing/Clock Sweep should be in Control<br =
class=3D""><span class=3D"Apple-tab-span" style=3D"white-space:pre">	=
</span>Plane.<br class=3D""><span class=3D"Apple-tab-span" =
style=3D"white-space:pre">	</span>- Dino Farinacci says that if =
people want to use LISP control plane,<br class=3D""><span =
class=3D"Apple-tab-span" style=3D"white-space:pre">	</span>seeing =
RLOC probing in control plane document may look awkward for<br =
class=3D""><span class=3D"Apple-tab-span" style=3D"white-space:pre">	=
</span>people not willing to use the lisp data encapsulation.<br =
class=3D""><br class=3D"">And we already know this. &nbsp;;-)<br =
class=3D""></blockquote><br class=3D"">Please listen to the recording. =
<br class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D"">That doesn=E2=80=99t tell me there was a decision or =
concensus.<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D"">Exactly, it has been decided, hence control plane things go =
in the control plane document. (or OAM)<br class=3D""></blockquote><br =
class=3D"">You are trying to draw a hard wall between the data-plane and =
control-plane. In the real world that is not how protocols are =
deployed.<br class=3D""></blockquote><br class=3D"">I am trying to make =
this &nbsp;a high quality document. I really don=E2=80=99t want that the =
document comes back from the IESG because this would delay publication a =
lot.<br class=3D"">Besides, this is a specification document, =
independent from the implementationS. If anybody wants to tighten =
somehow control and data planes, they are free to go that way.<br =
class=3D""><br class=3D"">What we need here is to put some text in =
6833bis, and replace it here with the sentence =E2=80=9COther control =
plane based reachability mechanism can be found in [6833bis]=E2=80=9D<br =
class=3D""><br class=3D"">In 6833bis we do the opposite, we add the text =
cut from 6830bis and add =E2=80=9COther data plane based reachability =
mechanism can be found in [6830bis]=E2=80=9D<br =
class=3D""></blockquote><br class=3D"">Is this a new comment. Sounds =
like you are suggesting something new.<br class=3D""></blockquote><br =
class=3D"">No. Is the same suggestion. <br class=3D""><br =
class=3D"">Remove the text and put the sentence: =E2=80=9COther control =
plane based reachability mechanisms can be found in [6833bis]=E2=80=9D<br =
class=3D""><br class=3D"">In 6833bis you add the ext remove from 6830bis =
and at the end you add =E2=80=9COther data plane based reachability =
mechanisms can be found in [6830bis]=E2=80=9D <br class=3D""><br =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><blockquote=
 type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D"">Actually I remember a suggestion about putting operations =
issues like this in an OAM document which would be a good idea. <br =
class=3D""></blockquote><br class=3D"">I don=E2=80=99t agree. We had =
already mentioned there is a control-plane protocol that is described in =
RFC6833bis and a data-plane protocol that USEs the control-plane =
protocol. And the usage should be here.<br class=3D""></blockquote><br =
class=3D"">Not following here. Why should the data-plane control the =
control plane?<br class=3D""></blockquote><br class=3D"">It is not =
controlling the control-plane, it is using it. Did my example of an API =
not make that clear?<br class=3D""><br class=3D""></blockquote><br =
class=3D"">To me was not clear, let me try to reword.<br class=3D"">The =
link between control and data planes is the LISP cache and some events =
that may trigger specific operations.<br class=3D"">If those operations =
are data-plane they stay here. <br class=3D"">It those operations are =
control-plane they go in 6833bis.<br class=3D""></blockquote><br =
class=3D"">The data-plane does echo-noncing. So that should remain in =
the data-plane based on your premise above. I think you=E2=80=99d agree =
with that. But RLOC-probes may be suppressed due to echo-noncing showing =
reachability. Do you want to put echo-noncing logic in 6833bis if you =
move RLOC-probing there.<br class=3D""><br class=3D"">That would not be =
a good thing.<br class=3D""><br class=3D"">Also, if a map-cache entry =
doesn=E2=80=99t exist, no RLOC-probes are sent. So how to do you say =
that in a control-plane document when there are a lot of reasons to send =
RLOC-probes. RLOC-probes are sent to do lisp-crypto key-exchange, that =
is a data-plane feature.<br class=3D""><br class=3D"">Please, let=E2=80=99=
s just keep it where it is and let=E2=80=99s move on.<br =
class=3D""></blockquote><br class=3D""><br class=3D"">As I suggested in =
first mail: <br class=3D""><br class=3D"">We need to keep: 1, 6, =
Echo-Nonce, <br class=3D""><br class=3D"">We need to move: 2, 3, 4, 5, =
&nbsp;RLOC-Probing<br class=3D""><br class=3D""><br class=3D""><blockquote=
 type=3D"cite" class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><br class=3D""><br class=3D"">[snip]<br class=3D""><br =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><blockquote=
 type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D"">Making =
changes like this to RFC6833 will be huge.<br class=3D""></blockquote><br =
class=3D"">You do not have to. see my comment above.<br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D"">We have the documents =
separated in the current state right now that seems to work and seems to =
be clear.<br class=3D""></blockquote><br class=3D"">I did not have time =
to go over 6833bis, but concerning 6830bis the document is not clear and =
it is a patchwork of data-plane, control-plane, and deployment =
issues.<br class=3D""><br class=3D"">This is not what was agreed upon =
when we started this effort.<br class=3D""></blockquote><br class=3D"">The=
 effort was continuing. And we created options with further study.<br =
class=3D""></blockquote><br class=3D"">Not sure I am following here. The =
initial intent was two have two documents.<br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D"">Both Albert and I did =
that further study and the drafts reflect the decisions. There were no =
WG objections other than from you which we had thought we convinced.<br =
class=3D""></blockquote><br class=3D"">Again, IETF 96th. Yes, I proposed =
at the mic to move the text in 6833bis, only objection to this was you =
on the SMR mechanism.<br class=3D"">Other then the SMR point we draw a =
clear line.<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><blockquote=
 type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D""><blockquote=
 type=3D"cite" class=3D""><br class=3D"">19. &nbsp;Security =
Considerations<br class=3D""><br class=3D"">Security considerations for =
LISP are discussed in [RFC7833], in<br class=3D"">addition =
[I-D.ietf-lisp-sec] provides authentication and integrity to<br =
class=3D"">LISP mappings.<br class=3D""><br =
class=3D""></blockquote>lisp-sec is control-plane has to be referenced =
in 6833bis.<br class=3D""></blockquote><br class=3D"">Yes, but if an ITR =
caches a coarse EID-prefix, then there is a data-plane redirection =
attack.<br class=3D""><br class=3D""></blockquote><br class=3D"">My =
point is that lisp-sec provides control plane features, so the sentence =
does not bring anything to the discussion.<br class=3D"">Please =
delete.<br class=3D""></blockquote></blockquote><br class=3D"">Any =
comment here?<br class=3D""></blockquote><br class=3D"">No comment. I =
think we should reference it.<br class=3D""></blockquote><br =
class=3D"">Can you share your reasoning?<br class=3D""><br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><br class=3D""><blockquote=
 type=3D"cite" class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D"">21.1. &nbsp;LISP UDP Port Numbers<br class=3D""><br =
class=3D"">The IANA registry has allocated UDP port numbers 4341 and =
4342 for<br class=3D"">lisp-data and lisp-control operation, =
respectively. &nbsp;IANA has updated<br class=3D"">the description for =
UDP ports 4341 and 4342 as follows:<br class=3D""><br class=3D""> =
lisp-data &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;4341 udp &nbsp;&nbsp;&nbsp;LISP =
Data Packets<br class=3D""> lisp-control &nbsp;&nbsp;4342 udp =
&nbsp;&nbsp;&nbsp;LISP Control Packets<br class=3D""><br =
class=3D""></blockquote>4342 is control-plane and MUST be requested to =
IANA in the 6833bis document.<br class=3D""></blockquote><br class=3D"">We=
 didn=E2=80=99t want to change the registry so we are keeping this here. =
Its really no big deal.<br class=3D""></blockquote><br =
class=3D""><blockquote type=3D"cite" class=3D"">Note the data-plane =
implementation will have to send to the 4342 socket so its not out of =
place at all for this to be in this document.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">4342 &nbsp;is control plane not =
data plane, any further review beyond the WG will point out this =
inconsistency.<br class=3D""></blockquote><br class=3D"">Sorry a =
data-plane component uses it<br class=3D""></blockquote><br =
class=3D""><blockquote type=3D"cite" class=3D"">. Why split it up when =
we can have this in one place.<br class=3D""></blockquote><br =
class=3D"">Can you elaborate better your rationale? <br =
class=3D""></blockquote><br class=3D"">The registry already refers to =
RFC6830. What=E2=80=99s the point of changing this when it really is a =
very minor point.<br class=3D""></blockquote><br class=3D"">Because this =
is a data-plane document and there is no point in defining control plane =
codepoints here.<br class=3D""><br class=3D"">thanks<br class=3D""><br =
class=3D"">Luigi<br class=3D""><br class=3D""><br class=3D""><blockquote =
type=3D"cite" class=3D""><br class=3D"">Dino<br class=3D""><br =
class=3D"">&lt;rfcdiff-rfc6830bis.html&gt;&lt;draft-ietf-lisp-rfc6830bis-0=
8.txt&gt;<br class=3D""><br class=3D""><br class=3D""></blockquote><br =
class=3D""></div></div></div><br class=3D""></div></div></div><br =
class=3D""></body></html>=

--Apple-Mail=_D2E84D05-09F2-4BA0-A11D-CC305720646D--


From nobody Tue Jan  9 07:04:33 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 59AEE12D879 for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:04:30 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id lPr-FTQuggoJ for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:04:27 -0800 (PST)
Received: from mail-wm0-x22a.google.com (mail-wm0-x22a.google.com [IPv6:2a00:1450:400c:c09::22a]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 4FE9A126C0F for <lisp@ietf.org>; Tue,  9 Jan 2018 07:04:27 -0800 (PST)
Received: by mail-wm0-x22a.google.com with SMTP id 141so4408690wme.3 for <lisp@ietf.org>; Tue, 09 Jan 2018 07:04:27 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=per9rrlkj+AzFZwGIpgGENmM/VURoT9GtoOXN2nl6mg=; b=02i/x1mBAM2D0Fvz1uUUstYxegpsHCh+9H7CVqbieu55wus702kxGaZxDBSc3yhAwy lqSNkDyaKFxipZdGrdJCVFpIFSjirZCJKX5B6mm1D43VMNHcPPeq9xcHdA/7AdogTXy4 uElCEUCuH81j/+DvM1CKsS70KLQMLZ8a33UPf6AiaKtXXtRXyy9J21womVo6UnW2WXHI FeGYrLeVUXPb79B9VfkpxH6Oo09pQu0N/9mLyXVCHfKUXNKj2qt2ewRr2ZuTeVwXKGfQ hxUeYeyEvq74+ygNctcmjT4j1ft/tGVsLW+f4Aq5snAIlhcNlozCeb3l0SCG5mVQCYCa MSNA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=per9rrlkj+AzFZwGIpgGENmM/VURoT9GtoOXN2nl6mg=; b=oNrwHrKBEYott3+ROlHtticm/GfiKgj6Lc37QBhRfhlM+drK2l6AmB2rFVGjaTbRdv K76D6RqghSS3r+GRfgco5fT088GSy5dEfKwLFRHfHShB4N5ELwT2viSp1b8gGyhNV5dz Q/z6kuOaS854jctyBil8N1Daw3jkHxJpLxsG9BAV4EXYsH2zEKBOJi2rvIF0hBC2E/BE fL8ah08OYsAFHpE89VCDCo2lSMHDWsXp1wPnTrY4EqqzzsbLgeqXj5KcwUtRz9LsKRym 4mlvNa18mL9tUStsK/99qeOi0fYsux8UKfVcMKnCsiTjHVVjU3Sgy00QCs+QTr84fdnM aVTw==
X-Gm-Message-State: AKwxytdC+pGMSitw6t4ZY0SVY/03/+RLrjdVbi3AbdBTsCJjbruYoRsC Zikx2rAROufgHiBLW7kVypV9kgEjf6Q=
X-Google-Smtp-Source: ACJfBot2i5owEzaAcFI1axPd50SCDW51wcV6D/ilWXNYfffZYetMtlHrAeCOkGnF8nF70LJedaalsw==
X-Received: by 10.28.105.214 with SMTP id z83mr1790779wmh.77.1515510265665; Tue, 09 Jan 2018 07:04:25 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:c4aa:2fae:3f8:10d4? ([2001:660:330f:a4:c4aa:2fae:3f8:10d4]) by smtp.gmail.com with ESMTPSA id w195sm13600173wmw.46.2018.01.09.07.04.24 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 07:04:24 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <6924BBEB-5680-48E5-8460-F88E5F3F990B@gigix.net>
Date: Tue, 9 Jan 2018 16:05:03 +0100
Cc: "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <F2870CB5-86B1-41EF-9F94-3970CA181A7E@gigix.net>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <6FEB1404-FA34-432A-8441-3F6B394A8217@gmail.com> <6924BBEB-5680-48E5-8460-F88E5F3F990B@gigix.net>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/rWuDWXhny2x1ECWUqnSL7EQSyaM>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 15:04:30 -0000

Hi,

On 27 Dec 2017, at 05:13, Dino Farinacci <farinacci@gmail.com> wrote:
>=20


[snip]
>> Agreed, what about this (please comment):
>>=20
>>  When doing ITR/PITR encapsulation:
>>=20
>>   o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' =
field.
>>   o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>=20
>> When doing ETR/PETR decapsulation:
>>=20
>>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>  o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>=20
>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>=20
>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>=20
> I had planned to take Luigi=E2=80=99s suggestion. I did not want to =
rewrite this section. It was carefully written by David Black with =
consolation from the ECN experts. I do not want to lose this technical =
text.

The text proposed by Albert is very close to the original and has =
exactly the same content, just expressed in an clearer way. No loss =
here.
I will ask David to review the text again.

The current text in section 5.3 is still not correct because it talks =
about =E2=80=9Ctype of service=E2=80=9D and =E2=80=9CECN=E2=80=9D.=20

Luigi




From nobody Tue Jan  9 07:06:25 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id DF78C12D86A for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:06:23 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.599
X-Spam-Level: 
X-Spam-Status: No, score=-2.599 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id NW7brxxQP_3I for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 07:06:21 -0800 (PST)
Received: from mail-wm0-x22c.google.com (mail-wm0-x22c.google.com [IPv6:2a00:1450:400c:c09::22c]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 67FA912D868 for <lisp@ietf.org>; Tue,  9 Jan 2018 07:06:21 -0800 (PST)
Received: by mail-wm0-x22c.google.com with SMTP id f206so21213129wmf.5 for <lisp@ietf.org>; Tue, 09 Jan 2018 07:06:21 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=BMlJ//Pv1ckpdMwKZh1zxi1YOsrbP0dYCgS7MpcDsNo=; b=DAG+h4YBmzOOAoef8wLI/lW4XPsVhF+leX5CcC4mI6ZA273xFBEOuIhkwVbKFdUbwG yKwpF8rGWB0x6jmafeGnMKuvOZexwgbKyzO0N0Wx28h0flFHHi9yuop3iuqtdPoGUlO3 VWXsROfXh0xFWWCIg+7mroaA3oR5W3Q9GErxROGlfY7MDKxPU4BPnop4A5OF0Nj/rWAm +0ZEc2k5BKCkF9BVTNDY+RGjEBYTlflljFcem4GODkyiatho8s73o7q5p2iPoK7fOA+U LiaGPHQ/3QotULGqB2mUkpugMH3Tkw2QC3HwubrFEfuKHx3yGpzuElT5B02mKJsElUyU g64g==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=BMlJ//Pv1ckpdMwKZh1zxi1YOsrbP0dYCgS7MpcDsNo=; b=mhhUliS6HNzTDW6fMlBkqKToGtQRYifshcOmkF2/hOr8mTqHk+NMeRexN4BpnZVQOn obJrTlBDF8MXteNnY/9n9Ag9XVjkkxLlIF26sM4x7YxehR3rOGW1VAVooJbcu/0rNMJ3 xvKWsda7kbK6msGDCY7lRnxFI87Pdm3bkgfZZRqViTh2xI3O4M76eUuANF5CMFqFr/jT AXAGb+LtA3GGd/psRfTwuA1CytNfU40uMnIo415l4S4qCMIZXTz5PtzPrxjNYFAabW6Z lAFTo21eogO3VK+PhO9O2K3nnJiyHP8/y+WYhbjJuHjJkpERvNUJ1zMvQKzGMRIm7vRM Trlg==
X-Gm-Message-State: AKGB3mIpcMR8cUJWdlb2o0ZVXw+Obm5XzBzsnUnBajtQOdiJSSqsSAcX zBAi2wM6/eIgz7NyTMwNqmwLzA==
X-Google-Smtp-Source: ACJfBovDf97yJMFMLWSJGgeqhBT/19W5SVjXdy92lz+q+c9UHHjp9lgSAf6gA7wUmqGS5E6I9E/1VA==
X-Received: by 10.80.225.8 with SMTP id h8mr21418063edl.194.1515510379805; Tue, 09 Jan 2018 07:06:19 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:c4aa:2fae:3f8:10d4? ([2001:660:330f:a4:c4aa:2fae:3f8:10d4]) by smtp.gmail.com with ESMTPSA id e12sm1053849edm.42.2018.01.09.07.06.18 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 07:06:18 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Message-Id: <A07F68A8-A701-4E53-87C9-65FB0FFFF508@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_54A26568-0E9E-48F8-86B3-B3046D68992B"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Tue, 9 Jan 2018 16:06:58 +0100
In-Reply-To: <CAGE_Qeww-bFo122rc+XZQnQyzza0nC=BO2H+sg_FHz_Z+4dXEA@mail.gmail.com>
Cc: LISP mailing list list <lisp@ietf.org>
To: Albert Cabellos <albert.cabellos@gmail.com>
References: <D5733FCE-0F37-45AE-BD5B-AA17953DD8EC@gmail.com> <52854B15-A8D8-47CA-8680-B2D673191EBA@gmail.com> <DD4AAA1D-779C-444F-9C23-50CCA9935693@gmail.com> <CAGE_Qeww-bFo122rc+XZQnQyzza0nC=BO2H+sg_FHz_Z+4dXEA@mail.gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/4RrcdYvlZhWOewlUIsDYle2-yYU>
Subject: Re: [lisp] Current changes for draft-ietf-lisp-rfc6830bis-08
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 15:06:24 -0000

--Apple-Mail=_54A26568-0E9E-48F8-86B3-B3046D68992B
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Hi Albert,


> On 9 Jan 2018, at 00:27, Albert Cabellos <albert.cabellos@gmail.com> =
wrote:
>=20
> Hi=20
>=20
> As far as I remember we didn=C2=B4t agree on 3 documents, this does =
not necessarily mean that it is a bad idea.

:-)

>=20
> I still think that SMR should be on 6833bis, it is important to =
standardize a control-plane that includes the capability of updating =
EID-to-RLOC mappings.
>=20
> Regarding sections Multicast, Mobility and Traceroute considerations =
they could be easily moved to an OAM document, but it is quite complex =
to properly contextualize such sections in a single standalone document. =
Do they have value without the context of 6830bis?

Probably not, but the point is that if you implement 6830bis you do need =
to read OAM stuff.=20

Obviously the other way around is not true. If you want to understand =
LISP OAM you need to have a good knowledge of both 30bis _AND_ 33bis, =
_YET_ this does _NOT_ mean we need one single document for everything.

Romans used to say "dividi et impera=E2=80=9D=E2=80=A6.=20

Ciao

Luigi


> In my view they are better in 6830bis.
>=20
> I would like to hear other opinions from the list
>=20
> Albert
>=20
> On Mon, Jan 8, 2018 at 7:22 PM, Dino Farinacci <farinacci@gmail.com =
<mailto:farinacci@gmail.com>> wrote:
> Do you think it is okay to capture the changes we have made and agreed =
upon so far so we can submit -08 and wait for other WG members to =
comment on this issue?
>=20
> What you are suggesting is a lot change that what was previously =
agreed upon. No one was really in favor of having a third document (your =
OAM reference below (3)).
>=20
> Also the chairs didn=E2=80=99t suggest any changes, it was Luigi =
(acting as a document shepherd). I am not sure the same comment came =
from Joel, either publicly or privately.
>=20
> Dino
>=20
> > On Jan 8, 2018, at 9:16 AM, Damien Saucez <damien.saucez@gmail.com =
<mailto:damien.saucez@gmail.com>> wrote:
> >
> > Hello Dino, The List,
> >
> > That=E2=80=99s pretty cool to see activity around the document =
however I am not sure the proposed
> > changes are really addressing the structural problem of the =
document.
> >
> > The current document is a mix between data-plane, control-plane, and =
operation questions.
> >
> > The chairs proposition of re-balancing the text between 30bis, 33bis =
and an OAM documents
> > is great. It would allow people to go directly to the point they are =
interested in.
> >
> > 1. What goes on the wire: 30bis
> > 2. Signalling procedures: 33bis
> > 3. Implementation details, management, and troubleshooting: OAM.
> >
> > So it would mean that in 30bis it would just be all what is strictly =
needed to allow
> > inter-operability between xTRs, so at the end only packet format and =
how to understand
> > fields should be there. In this case, we can abstract the xTR as =
just a database that
> > stores mapping, how mapping are managed in this database is an =
implementation
> > question that is independent of the protocol itself.
> >
> > For 33bis, it would just be the format of signalling messages and =
how to interpret
> > them, when a signal is expected to be triggered.
> >
> > Finally, in OAM it would be how to implement and manage a LISP =
system that is
> > constituted of the LISP control-plane proposed in 33bis and the LISP =
data-plane in
> > 30bis.
> >
> > To say it clearly: remove from 30bis and 33bis all what is just the =
reflect of one
> > implementation. Normally these two document should have only what is =
strictly
> > necessary for people to implement (the way THEY want) a system that =
would
> > Inter-operate with the others.
> >
> > If we look at OpenLISP and its control-plane and the deployment of =
LISP-Lab
> > that we use in production daily, we can see that the data plane and =
control plane
> > have been implemented independently (and by different teams and even
> > companies) and what we can say is that a large fraction of the text =
in 60bis
> > has not been used at all for implementing the data-plane, while, on =
the contrary
> > we had to massively read/use text from 30bis to be able to implement =
the
> > control-plane. Finally, people that deployed LISP-Lab had to take =
content
> > from both 30bis and 33bis to be able to have a working environment. =
That
> > demonstrates that the separation is not done properly as normally =
people
> > in charge of deploying a network should not have to read the =
data-plane
> > specs, or people implementing a control-plane should not have to =
read
> > data-plane specifications.
> >
> > I think the proposition of moving text that the chairs proposed is =
very
> > reasonable and greatly improve the quality of the specifications and =
therefore
> > reduce the risk of misinterpretation and bugs while implementing the =
protocolS
> >
> >
> > Cheers,
> >
> > Damien Saucez
> >
> >> On 4 Jan 2018, at 18:00, Dino Farinacci <farinacci@gmail.com =
<mailto:farinacci@gmail.com>> wrote:
> >>
> >> Is the working group okay with me submitting these changes? This =
was the latest update from email before the year ended. I have made most =
of the changes that Luigi suggested or requested.
> >>
> >> Dino
> >>
> >> =
<rfcdiff-rfc6830bis.html>_______________________________________________
> >> lisp mailing list
> >> lisp@ietf.org <mailto:lisp@ietf.org>
> >> https://www.ietf.org/mailman/listinfo/lisp =
<https://www.ietf.org/mailman/listinfo/lisp>
> >
>=20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org <mailto:lisp@ietf.org>
> https://www.ietf.org/mailman/listinfo/lisp =
<https://www.ietf.org/mailman/listinfo/lisp>
>=20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


--Apple-Mail=_54A26568-0E9E-48F8-86B3-B3046D68992B
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D"">Hi =
Albert,<div class=3D""><br class=3D""><div><br class=3D""><blockquote =
type=3D"cite" class=3D""><div class=3D"">On 9 Jan 2018, at 00:27, Albert =
Cabellos &lt;<a href=3D"mailto:albert.cabellos@gmail.com" =
class=3D"">albert.cabellos@gmail.com</a>&gt; wrote:</div><br =
class=3D"Apple-interchange-newline"><div class=3D""><div dir=3D"ltr" =
class=3D""><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica;" class=3D"">Hi<span =
class=3D"gmail-Apple-converted-space">&nbsp;</span></div><div =
style=3D"margin: 0px; font-style: normal; font-variant-ligatures: =
normal; font-variant-caps: normal; font-variant-east-asian: normal; =
font-variant-position: normal; font-weight: normal; font-stretch: =
normal; font-size: 12px; line-height: normal; font-family: Helvetica; =
min-height: 14px;" class=3D""><br class=3D""></div><div style=3D"margin: =
0px; font-style: normal; font-variant-ligatures: normal; =
font-variant-caps: normal; font-variant-east-asian: normal; =
font-variant-position: normal; font-weight: normal; font-stretch: =
normal; font-size: 12px; line-height: normal; font-family: Helvetica;" =
class=3D"">As far as I remember we didn=C2=B4t agree on 3 documents, =
this does not necessarily mean that it is a bad =
idea.</div></div></div></blockquote><div><br =
class=3D""></div><div>:-)</div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
style=3D"margin: 0px; font-style: normal; font-variant-ligatures: =
normal; font-variant-caps: normal; font-variant-east-asian: normal; =
font-variant-position: normal; font-weight: normal; font-stretch: =
normal; font-size: 12px; line-height: normal; font-family: Helvetica; =
min-height: 14px;" class=3D""><br class=3D""></div><div style=3D"margin: =
0px; font-style: normal; font-variant-ligatures: normal; =
font-variant-caps: normal; font-variant-east-asian: normal; =
font-variant-position: normal; font-weight: normal; font-stretch: =
normal; font-size: 12px; line-height: normal; font-family: Helvetica;" =
class=3D"">I still think that SMR should be on 6833bis, it is important =
to standardize a control-plane that includes the capability of updating =
EID-to-RLOC mappings.</div><div style=3D"margin: 0px; font-style: =
normal; font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica; min-height: 14px;" class=3D""><br =
class=3D""></div><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica;" class=3D"">Regarding sections =
Multicast, Mobility and Traceroute considerations they could be easily =
moved to an OAM document, but it is quite complex to properly =
contextualize such sections in a single standalone document. Do they =
have value without the context of =
6830bis?</div></div></div></blockquote><div><br =
class=3D""></div><div>Probably not, but the point is that if you =
implement 6830bis you do need to read OAM stuff.&nbsp;</div><div><br =
class=3D""></div><div>Obviously the other way around is not true. If you =
want to understand LISP OAM you need to have a good knowledge of both =
30bis _AND_ 33bis, _YET_ this does _NOT_ mean we need one single =
document for everything.</div><div><br class=3D""></div><div>Romans used =
to say "dividi et impera=E2=80=9D=E2=80=A6.&nbsp;</div><div><br =
class=3D""></div><div>Ciao</div><div><br =
class=3D""></div><div>Luigi</div><div><br class=3D""></div><div><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><div=
 dir=3D"ltr" class=3D""><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica;" class=3D""> In my view they are better =
in 6830bis.</div><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica; min-height: 14px;" class=3D""><br =
class=3D""></div><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica;" class=3D"">I would like to hear other =
opinions from the list</div><div style=3D"margin: 0px; font-style: =
normal; font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica; min-height: 14px;" class=3D""><br =
class=3D""></div><div style=3D"margin: 0px; font-style: normal; =
font-variant-ligatures: normal; font-variant-caps: normal; =
font-variant-east-asian: normal; font-variant-position: normal; =
font-weight: normal; font-stretch: normal; font-size: 12px; line-height: =
normal; font-family: Helvetica;" class=3D"">Albert</div></div><div =
class=3D"gmail_extra"><br class=3D""><div class=3D"gmail_quote">On Mon, =
Jan 8, 2018 at 7:22 PM, Dino Farinacci <span dir=3D"ltr" class=3D"">&lt;<a=
 href=3D"mailto:farinacci@gmail.com" target=3D"_blank" =
class=3D"">farinacci@gmail.com</a>&gt;</span> wrote:<br =
class=3D""><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 =
.8ex;border-left:1px #ccc solid;padding-left:1ex">Do you think it is =
okay to capture the changes we have made and agreed upon so far so we =
can submit -08 and wait for other WG members to comment on this =
issue?<br class=3D"">
<br class=3D"">
What you are suggesting is a lot change that what was previously agreed =
upon. No one was really in favor of having a third document (your OAM =
reference below (3)).<br class=3D"">
<br class=3D"">
Also the chairs didn=E2=80=99t suggest any changes, it was Luigi (acting =
as a document shepherd). I am not sure the same comment came from Joel, =
either publicly or privately.<br class=3D"">
<span class=3D"HOEnZb"><font color=3D"#888888" class=3D""><br class=3D"">
Dino<br class=3D"">
</font></span><div class=3D"HOEnZb"><div class=3D"h5"><br class=3D"">
&gt; On Jan 8, 2018, at 9:16 AM, Damien Saucez &lt;<a =
href=3D"mailto:damien.saucez@gmail.com" =
class=3D"">damien.saucez@gmail.com</a>&gt; wrote:<br class=3D"">
&gt;<br class=3D"">
&gt; Hello Dino, The List,<br class=3D"">
&gt;<br class=3D"">
&gt; That=E2=80=99s pretty cool to see activity around the document =
however I am not sure the proposed<br class=3D"">
&gt; changes are really addressing the structural problem of the =
document.<br class=3D"">
&gt;<br class=3D"">
&gt; The current document is a mix between data-plane, control-plane, =
and operation questions.<br class=3D"">
&gt;<br class=3D"">
&gt; The chairs proposition of re-balancing the text between 30bis, =
33bis and an OAM documents<br class=3D"">
&gt; is great. It would allow people to go directly to the point they =
are interested in.<br class=3D"">
&gt;<br class=3D"">
&gt; 1. What goes on the wire: 30bis<br class=3D"">
&gt; 2. Signalling procedures: 33bis<br class=3D"">
&gt; 3. Implementation details, management, and troubleshooting: OAM.<br =
class=3D"">
&gt;<br class=3D"">
&gt; So it would mean that in 30bis it would just be all what is =
strictly needed to allow<br class=3D"">
&gt; inter-operability between xTRs, so at the end only packet format =
and how to understand<br class=3D"">
&gt; fields should be there. In this case, we can abstract the xTR as =
just a database that<br class=3D"">
&gt; stores mapping, how mapping are managed in this database is an =
implementation<br class=3D"">
&gt; question that is independent of the protocol itself.<br class=3D"">
&gt;<br class=3D"">
&gt; For 33bis, it would just be the format of signalling messages and =
how to interpret<br class=3D"">
&gt; them, when a signal is expected to be triggered.<br class=3D"">
&gt;<br class=3D"">
&gt; Finally, in OAM it would be how to implement and manage a LISP =
system that is<br class=3D"">
&gt; constituted of the LISP control-plane proposed in 33bis and the =
LISP data-plane in<br class=3D"">
&gt; 30bis.<br class=3D"">
&gt;<br class=3D"">
&gt; To say it clearly: remove from 30bis and 33bis all what is just the =
reflect of one<br class=3D"">
&gt; implementation. Normally these two document should have only what =
is strictly<br class=3D"">
&gt; necessary for people to implement (the way THEY want) a system that =
would<br class=3D"">
&gt; Inter-operate with the others.<br class=3D"">
&gt;<br class=3D"">
&gt; If we look at OpenLISP and its control-plane and the deployment of =
LISP-Lab<br class=3D"">
&gt; that we use in production daily, we can see that the data plane and =
control plane<br class=3D"">
&gt; have been implemented independently (and by different teams and =
even<br class=3D"">
&gt; companies) and what we can say is that a large fraction of the text =
in 60bis<br class=3D"">
&gt; has not been used at all for implementing the data-plane, while, on =
the contrary<br class=3D"">
&gt; we had to massively read/use text from 30bis to be able to =
implement the<br class=3D"">
&gt; control-plane. Finally, people that deployed LISP-Lab had to take =
content<br class=3D"">
&gt; from both 30bis and 33bis to be able to have a working environment. =
That<br class=3D"">
&gt; demonstrates that the separation is not done properly as normally =
people<br class=3D"">
&gt; in charge of deploying a network should not have to read the =
data-plane<br class=3D"">
&gt; specs, or people implementing a control-plane should not have to =
read<br class=3D"">
&gt; data-plane specifications.<br class=3D"">
&gt;<br class=3D"">
&gt; I think the proposition of moving text that the chairs proposed is =
very<br class=3D"">
&gt; reasonable and greatly improve the quality of the specifications =
and therefore<br class=3D"">
&gt; reduce the risk of misinterpretation and bugs while implementing =
the protocolS<br class=3D"">
&gt;<br class=3D"">
&gt;<br class=3D"">
&gt; Cheers,<br class=3D"">
&gt;<br class=3D"">
&gt; Damien Saucez<br class=3D"">
&gt;<br class=3D"">
&gt;&gt; On 4 Jan 2018, at 18:00, Dino Farinacci &lt;<a =
href=3D"mailto:farinacci@gmail.com" class=3D"">farinacci@gmail.com</a>&gt;=
 wrote:<br class=3D"">
&gt;&gt;<br class=3D"">
&gt;&gt; Is the working group okay with me submitting these changes? =
This was the latest update from email before the year ended. I have made =
most of the changes that Luigi suggested or requested.<br class=3D"">
&gt;&gt;<br class=3D"">
&gt;&gt; Dino<br class=3D"">
&gt;&gt;<br class=3D"">
&gt;&gt; &lt;rfcdiff-rfc6830bis.html&gt;_____<wbr =
class=3D"">______________________________<wbr class=3D"">____________<br =
class=3D"">
&gt;&gt; lisp mailing list<br class=3D"">
&gt;&gt; <a href=3D"mailto:lisp@ietf.org" class=3D"">lisp@ietf.org</a><br =
class=3D"">
&gt;&gt; <a href=3D"https://www.ietf.org/mailman/listinfo/lisp" =
rel=3D"noreferrer" target=3D"_blank" =
class=3D"">https://www.ietf.org/mailman/<wbr =
class=3D"">listinfo/lisp</a><br class=3D"">
&gt;<br class=3D"">
<br class=3D"">
______________________________<wbr class=3D"">_________________<br =
class=3D"">
lisp mailing list<br class=3D"">
<a href=3D"mailto:lisp@ietf.org" class=3D"">lisp@ietf.org</a><br =
class=3D"">
<a href=3D"https://www.ietf.org/mailman/listinfo/lisp" rel=3D"noreferrer" =
target=3D"_blank" class=3D"">https://www.ietf.org/mailman/<wbr =
class=3D"">listinfo/lisp</a><br class=3D"">
</div></div></blockquote></div><br class=3D""></div>
_______________________________________________<br class=3D"">lisp =
mailing list<br class=3D""><a href=3D"mailto:lisp@ietf.org" =
class=3D"">lisp@ietf.org</a><br =
class=3D"">https://www.ietf.org/mailman/listinfo/lisp<br =
class=3D""></div></blockquote></div><br class=3D""></div></body></html>=

--Apple-Mail=_54A26568-0E9E-48F8-86B3-B3046D68992B--


From nobody Tue Jan  9 09:55:32 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 331C5129966 for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 09:55:30 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 1.56
X-Spam-Level: *
X-Spam-Status: No, score=1.56 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, FREEMAIL_REPLY=1, HTML_COMMENT_SAVED_URL=1.391, HTML_MESSAGE=0.001, HTML_TAG_BALANCE_BODY=1.157, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, T_HTML_ATTACH=0.01, URIBL_BLOCKED=0.001] autolearn=no autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 4IiyOx7Li7Gl for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 09:55:16 -0800 (PST)
Received: from mail-pg0-x230.google.com (mail-pg0-x230.google.com [IPv6:2607:f8b0:400e:c05::230]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id C96B9127735 for <lisp@ietf.org>; Tue,  9 Jan 2018 09:55:15 -0800 (PST)
Received: by mail-pg0-x230.google.com with SMTP id r2so8477364pgq.13 for <lisp@ietf.org>; Tue, 09 Jan 2018 09:55:15 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=RfAr6BA4q0O+O+C4zL/ozI8rptdrQbNU7eEkfn4YuYE=; b=RNM1ZCWYYtgvd685A1aUWsNjb46/72lXnoGNK8wOzk+pA1VC9jLfDKpzo/Hvw3sscq rYVs4IF8Ro7s+iUWVI4tEiRZJ+nmdH6uX2RzSoLhgXIdylFXsY+QTtzNxHKFt0IdC6ZY Rb8MwGmzq5/OSjMNrZK4Hj70nz4+WHCo8gduyoyWNHjXXsal/LxRsUSoQcywvzEjM0wg jEYn9VlRpDqAZbNzVD1XFH7Szm5sta260b/FBXsAdF6D2Eu4sJYl4Bha8IPKn83FJXs3 NShshTWbZzJhOCKwHeXBrBT1n9wBmMRc+D84lUo5KTc7f3rFK2n3wqHbYI6LhU8flSUs hyGw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=RfAr6BA4q0O+O+C4zL/ozI8rptdrQbNU7eEkfn4YuYE=; b=J8zSlIruF3MM/16R90mKMoi7KK8al0losJVI3ldPoZ43sgiiM6XkiCSERGpS8eCmRK +dtQLjPPepzedh3c//8jZ95i4kejBftbVKhCu8w7T29E6Yf7rdD77Ifwl/vaRJ0jlZ0x WOQkHxzmlrJz/i6DlIs178Cz0EjEY1vwAdFutVfhlhZau7osXm48yHsetMeD3DxxHd2Z O+/py2MqytX+TpCA7bKMBBT17tpTIg7Nv6y5ZdfMB6gEYWC1QwZhsZC7WsmbIrDzkQzJ q8rNaQPV6coBl574uhEc79jPfHYmmrJycrJVaWQSN9dtxd4z1Gclp4s8iiIO4TPfZOuk itqw==
X-Gm-Message-State: AKGB3mLXbV7RNOdBJiSHyNpepusZRuCxRSdWsSeChPi1l+LHBMg9emRM q3SfgimR9cNNses5f2ph4dI=
X-Google-Smtp-Source: ACJfBotigkAPqHT0tBYqtN+nQhfSMfl22ZtfW8JF/aCdbgmsFR492gljyUPm5L1n2J4QYC9OeRNdzQ==
X-Received: by 10.84.128.74 with SMTP id 68mr6563834pla.228.1515520515137; Tue, 09 Jan 2018 09:55:15 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id 77sm32412091pfh.43.2018.01.09.09.55.12 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 09:55:14 -0800 (PST)
From: Dino Farinacci <farinacci@gmail.com>
Message-Id: <829870A2-2D90-4967-983A-56F62E765796@gmail.com>
Content-Type: multipart/mixed; boundary="Apple-Mail=_9947AF75-7CFD-4DA1-B244-66A2B4196060"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Tue, 9 Jan 2018 09:54:59 -0800
In-Reply-To: <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net>
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
To: Luigi Iannone <ggx@gigix.net>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/GM84UhMbBV_d2vug4hNcW5JEjtM>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 17:55:30 -0000

--Apple-Mail=_9947AF75-7CFD-4DA1-B244-66A2B4196060
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=us-ascii

Guys, please look at the latest changes instead of hashing the same =
arguments.=20

This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.

The diff of the changes are included yet again.

Dino


--Apple-Mail=_9947AF75-7CFD-4DA1-B244-66A2B4196060
Content-Disposition: attachment;
	filename=rfcdiff-rfc6830bis.html
Content-Type: text/html;
	x-unix-mode=0644;
	name="rfcdiff-rfc6830bis.html"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" =
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- saved from url=3D(0030)https://tools.ietf.org/rfcdiff -->
<html xmlns=3D"http://www.w3.org/1999/xhtml"><head><meta =
http-equiv=3D"Content-Type" content=3D"text/html; charset=3DUTF-8">=20
  =20
  <meta http-equiv=3D"Content-Style-Type" content=3D"text/css">=20
  <title>Diff: draft-ietf-lisp-rfc6830bis-07.txt - =
draft-ietf-lisp-rfc6830bis-08.txt</title>=20
  <style type=3D"text/css">=20
    body    { margin: 0.4ex; margin-right: auto; }=20
    tr      { }=20
    td      { white-space: pre; font-family: monospace; vertical-align: =
top; font-size: 0.86em;}=20
    th      { font-size: 0.86em; }=20
    .small  { font-size: 0.6em; font-style: italic; font-family: =
Verdana, Helvetica, sans-serif; }=20
    .left   { background-color: #EEE; }=20
    .right  { background-color: #FFF; }=20
    .diff   { background-color: #CCF; }=20
    .lblock { background-color: #BFB; }=20
    .rblock { background-color: #FF8; }=20
    .insert { background-color: #8FF; }=20
    .delete { background-color: #ACF; }=20
    .void   { background-color: #FFB; }=20
    .cont   { background-color: #EEE; }=20
    .linebr { background-color: #AAA; }=20
    .lineno { color: red; background-color: #FFF; font-size: 0.7em; =
text-align: right; padding: 0 2px; }=20
    .elipsis{ background-color: #AAA; }=20
    .left .cont { background-color: #DDD; }=20
    .right .cont { background-color: #EEE; }=20
    .lblock .cont { background-color: #9D9; }=20
    .rblock .cont { background-color: #DD6; }=20
    .insert .cont { background-color: #0DD; }=20
    .delete .cont { background-color: #8AD; }=20
    .stats, .stats td, .stats th { background-color: #EEE; padding: 2px =
0; }=20
    span.hide { display: none; color: #aaa;}    a:hover span { display: =
inline; }    tr.change { background-color: gray; }=20
    tr.change a { text-decoration: none; color: black }=20
  </style>=20
     <script>
var chunk_index =3D 0;
var old_chunk =3D null;

function format_chunk(index) {
    var prefix =3D "diff";
    var str =3D index.toString();
    for (x=3D0; x<(4-str.length); ++x) {
        prefix+=3D'0';
    }
    return prefix + str;
}

function find_chunk(n){
    return document.querySelector('tr[id$=3D"' + n + '"]');
}

function change_chunk(offset) {
    var index =3D chunk_index + offset;
    var new_str;
    var new_chunk;

    new_str =3D format_chunk(index);
    new_chunk =3D find_chunk(new_str);
    if (!new_chunk) {
        return;
    }
    if (old_chunk) {
        old_chunk.style.outline =3D "";
    }
    old_chunk =3D new_chunk;
    old_chunk.style.outline =3D "1px solid red";
    window.location.replace("#" + new_str)
    window.scrollBy(0,-100);
    chunk_index =3D index;
}

document.onkeydown =3D function(e) {
    switch (e.keyCode) {
    case 78:
        change_chunk(1);
        break;
    case 80:
        change_chunk(-1);
        break;
    }
};
   </script>=20
</head>=20
<body style=3D"">=20
  <table border=3D"0" cellpadding=3D"0" cellspacing=3D"0">=20
  <tbody><tr id=3D"part-1" bgcolor=3D"orange"><th></th><th><a =
href=3D"https://tools.ietf.org/rfcdiff?url2=3Ddraft-ietf-lisp-rfc6830bis-0=
7.txt" style=3D"color:#008; text-decoration:none;">&lt;</a>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-07.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-07.txt</a>&nbsp;</th><th> =
</th><th>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-08.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-08.txt</a>&nbsp;<a =
href=3D"https://tools.ietf.org/rfcdiff?url1=3Ddraft-ietf-lisp-rfc6830bis-0=
8.txt" style=3D"color:#008; =
text-decoration:none;">&gt;</a></th><th></th></tr>=20
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Network Working =
Group                                       D. Farinacci</td><td> =
</td><td class=3D"right">Network Working Group                           =
            D. Farinacci</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Internet-Draft    =
                                             V. Fuller</td><td> </td><td =
class=3D"right">Internet-Draft                                           =
      V. Fuller</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Intended status: =
Standards Track                                D. Meyer</td><td> =
</td><td class=3D"right">Intended status: Standards Track                =
                D. Meyer</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0001"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">Expires: <span =
class=3D"delete">May 15</span>, 2018                                     =
      D. Lewis</td><td> </td><td class=3D"rblock">Expires: <span =
class=3D"insert">July 8</span>, 2018                                     =
      D. Lewis</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                         Cisco Systems</td><td> </td><td =
class=3D"right">                                                         =
  Cisco Systems</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     A. Cabellos (Ed.)</td><td> </td><td =
class=3D"right">                                                       =
A. Cabellos (Ed.)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     UPC/BarcelonaTech</td><td> </td><td =
class=3D"right">                                                       =
UPC/BarcelonaTech</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0002"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                       <span class=3D"delete">November =
11, 2017</span></td><td> </td><td class=3D"rblock">                      =
                                 <span class=3D"insert">  January 4, =
2018</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">               =
The Locator/ID Separation Protocol (LISP)</td><td> </td><td =
class=3D"right">               The Locator/ID Separation Protocol =
(LISP)</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0003"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
     draft-ietf-lisp-rfc6830bis-0<span class=3D"delete">7</span></td><td> =
</td><td class=3D"rblock">                     =
draft-ietf-lisp-rfc6830bis-0<span class=3D"insert">8</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Abstract</td><td> =
</td><td class=3D"right">Abstract</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the data-plane protocol for the Locator/ID</td><td> </td><td =
class=3D"right">   This document describes the data-plane protocol for =
the Locator/ID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Separation =
Protocol (LISP).  LISP defines two namespaces, End-point</td><td> =
</td><td class=3D"right">   Separation Protocol (LISP).  LISP defines =
two namespaces, End-point</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs) that identify end-hosts and Routing Locators</td><td> </td><td =
class=3D"right">   Identifiers (EIDs) that identify end-hosts and =
Routing Locators</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (RLOCs) that =
identify network attachment points.  With this, LISP</td><td> </td><td =
class=3D"right">   (RLOCs) that identify network attachment points.  =
With this, LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   effectively =
separates control from data, and allows routers to create</td><td> =
</td><td class=3D"right">   effectively separates control from data, and =
allows routers to create</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   overlay =
networks.  LISP-capable routers exchange encapsulated packets</td><td> =
</td><td class=3D"right">   overlay networks.  LISP-capable routers =
exchange encapsulated packets</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0004"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   according to =
EID-to-RLOC mappings stored in a local map-cache.  <span =
class=3D"delete">The</span></td><td> </td><td class=3D"rblock">   =
according to EID-to-RLOC mappings stored in a local map-cache.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   map-cache is populated by the LISP Control-Plane =
protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [I-D.ietf-lisp-rfc6833bis].</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP requires =
no change to either host protocol stacks or to underlay</td><td> =
</td><td class=3D"right">   LISP requires no change to either host =
protocol stacks or to underlay</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   routers and =
offers Traffic Engineering, multihoming and mobility,</td><td> </td><td =
class=3D"right">   routers and offers Traffic Engineering, multihoming =
and mobility,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   among other =
features.</td><td> </td><td class=3D"right">   among other =
features.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Status of This =
Memo</td><td> </td><td class=3D"right">Status of This Memo</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This =
Internet-Draft is submitted in full conformance with the</td><td> =
</td><td class=3D"right">   This Internet-Draft is submitted in full =
conformance with the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   provisions of =
BCP 78 and BCP 79.</td><td> </td><td class=3D"right">   provisions of =
BCP 78 and BCP 79.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are working documents of the Internet =
Engineering</td><td> </td><td class=3D"right">   Internet-Drafts are =
working documents of the Internet Engineering</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Task Force =
(IETF).  Note that other groups may also distribute</td><td> </td><td =
class=3D"right">   Task Force (IETF).  Note that other groups may also =
distribute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   working =
documents as Internet-Drafts.  The list of current Internet-</td><td> =
</td><td class=3D"right">   working documents as Internet-Drafts.  The =
list of current Internet-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td> </td><td =
class=3D"right">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are draft documents valid for a maximum of six =
months</td><td> </td><td class=3D"right">   Internet-Drafts are draft =
documents valid for a maximum of six months</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and may be =
updated, replaced, or obsoleted by other documents at any</td><td> =
</td><td class=3D"right">   and may be updated, replaced, or obsoleted =
by other documents at any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   time.  It is =
inappropriate to use Internet-Drafts as reference</td><td> </td><td =
class=3D"right">   time.  It is inappropriate to use Internet-Drafts as =
reference</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   material or to =
cite them other than as "work in progress."</td><td> </td><td =
class=3D"right">   material or to cite them other than as "work in =
progress."</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0005"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   This =
Internet-Draft will expire on <span class=3D"delete">May 15</span>, =
2018.</td><td> </td><td class=3D"rblock">   This Internet-Draft will =
expire on <span class=3D"insert">July 8</span>, 2018.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Copyright =
Notice</td><td> </td><td class=3D"right">Copyright Notice</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0006"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Copyright =
(c) 201<span class=3D"delete">7</span> IETF Trust and the persons =
identified as the</td><td> </td><td class=3D"rblock">   Copyright (c) =
201<span class=3D"insert">8</span> IETF Trust and the persons identified =
as the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document =
authors.  All rights reserved.</td><td> </td><td class=3D"right">   =
document authors.  All rights reserved.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
is subject to BCP 78 and the IETF Trust's Legal</td><td> </td><td =
class=3D"right">   This document is subject to BCP 78 and the IETF =
Trust's Legal</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Provisions =
Relating to IETF Documents</td><td> </td><td class=3D"right">   =
Provisions Relating to IETF Documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
(https://trustee.ietf.org/license-info) in effect on the date =
of</td><td> </td><td class=3D"right">   =
(https://trustee.ietf.org/license-info) in effect on the date of</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   publication of =
this document.  Please review these documents</td><td> </td><td =
class=3D"right">   publication of this document.  Please review these =
documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   carefully, as =
they describe your rights and restrictions with respect</td><td> =
</td><td class=3D"right">   carefully, as they describe your rights and =
restrictions with respect</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to this =
document.  Code Components extracted from this document must</td><td> =
</td><td class=3D"right">   to this document.  Code Components extracted =
from this document must</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   include =
Simplified BSD License text as described in Section 4.e of</td><td> =
</td><td class=3D"right">   include Simplified BSD License text as =
described in Section 4.e of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the Trust =
Legal Provisions and are provided without warranty as</td><td> </td><td =
class=3D"right">   the Trust Legal Provisions and are provided without =
warranty as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   described in =
the Simplified BSD License.</td><td> </td><td class=3D"right">   =
described in the Simplified BSD License.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Table of =
Contents</td><td> </td><td class=3D"right">Table of Contents</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   =
3</td><td> </td><td class=3D"right">   1.  Introduction  . . . . . . . . =
. . . . . . . . . . . . . . . .   3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  =
Requirements Notation . . . . . . . . . . . . . . . . . . . .   =
4</td><td> </td><td class=3D"right">   2.  Requirements Notation . . . . =
. . . . . . . . . . . . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Definition =
of Terms . . . . . . . . . . . . . . . . . . . . .   4</td><td> </td><td =
class=3D"right">   3.  Definition of Terms . . . . . . . . . . . . . . . =
. . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   4.  Basic =
Overview  . . . . . . . . . . . . . . . . . . . . . . .   9</td><td> =
</td><td class=3D"right">   4.  Basic Overview  . . . . . . . . . . . . =
. . . . . . . . . . .   9</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     4.1.  Packet =
Flow Sequence  . . . . . . . . . . . . . . . . . .  11</td><td> </td><td =
class=3D"right">     4.1.  Packet Flow Sequence  . . . . . . . . . . . . =
. . . . . .  11</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   5.  LISP =
Encapsulation Details  . . . . . . . . . . . . . . . . .  13</td><td> =
</td><td class=3D"right">   5.  LISP Encapsulation Details  . . . . . . =
. . . . . . . . . . .  13</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0007"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.1.  LISP =
IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  <span =
class=3D"delete">14</span></td><td> </td><td class=3D"rblock">     5.1.  =
LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  <span =
class=3D"insert">13</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.2.  LISP =
IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  <span =
class=3D"delete">15</span></td><td> </td><td class=3D"rblock">     5.2.  =
LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  <span =
class=3D"insert">14</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     5.3.  =
Tunnel Header Field Descriptions  . . . . . . . . . . . .  <span =
class=3D"delete">16</span></td><td> </td><td class=3D"rblock">     5.3.  =
Tunnel Header Field Descriptions  . . . . . . . . . . . .  <span =
class=3D"insert">15</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   6.  LISP =
EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">20</span></td><td> </td><td class=3D"rblock">   6.  =
LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">19</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  Dealing =
with Large Encapsulated Packets . . . . . . . . . . .  20</td><td> =
</td><td class=3D"right">   7.  Dealing with Large Encapsulated Packets =
. . . . . . . . . . .  20</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0008"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.1.  A =
Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"delete">21</span></td><td> </td><td class=3D"rblock">     7.1.  =
A Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"insert">20</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.2.  A =
Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"delete">22</span></td><td> </td><td class=3D"rblock">     7.2.  =
A Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"insert">21</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   8.  Using =
Virtualization and Segmentation with LISP . . . . . . .  22</td><td> =
</td><td class=3D"right">   8.  Using Virtualization and Segmentation =
with LISP . . . . . . .  22</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  Routing =
Locator Selection . . . . . . . . . . . . . . . . . .  23</td><td> =
</td><td class=3D"right">   9.  Routing Locator Selection . . . . . . . =
. . . . . . . . . . .  23</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   10. Routing =
Locator Reachability  . . . . . . . . . . . . . . . .  24</td><td> =
</td><td class=3D"right">   10. Routing Locator Reachability  . . . . . =
. . . . . . . . . . .  24</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.1.  Echo =
Nonce Algorithm . . . . . . . . . . . . . . . . . .  27</td><td> =
</td><td class=3D"right">     10.1.  Echo Nonce Algorithm . . . . . . . =
. . . . . . . . . . .  27</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.2.  =
RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28</td><td> =
</td><td class=3D"right">     10.2.  RLOC-Probing Algorithm . . . . . . =
. . . . . . . . . . .  28</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   11. EID =
Reachability within a LISP Site . . . . . . . . . . . . .  29</td><td> =
</td><td class=3D"right">   11. EID Reachability within a LISP Site . . =
. . . . . . . . . . .  29</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0009"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   12. Routing =
Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">30</span></td><td> </td><td class=3D"rblock">   12. =
Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">29</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   13. Changing =
the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"delete">31</span></td><td> </td><td class=3D"rblock">   13. =
Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"insert">30</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.1.  =
Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">32</span></td><td> </td><td class=3D"rblock">     13.1. =
 Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">31</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     13.2.  =
Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  32</td><td> =
</td><td class=3D"right">     13.2.  Solicit-Map-Request (SMR)  . . . . =
. . . . . . . . . . .  32</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0010"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.3.  =
Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">34</span></td><td> </td><td class=3D"rblock">     13.3. =
 Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">33</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">35</span></td><td> </td><td class=3D"rblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">34</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   15. Router =
Performance Considerations . . . . . . . . . . . . . .  35</td><td> =
</td><td class=3D"right">   15. Router Performance Considerations . . . =
. . . . . . . . . . .  35</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0011"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   16. Mobility =
Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"delete">6</span></td><td> </td><td class=3D"rblock">   16. =
Mobility Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"insert">5</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.1.  Slow =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.1.  Slow Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.2.  Fast =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.2.  Fast Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.3.  LISP =
Mobile Node Mobility  . . . . . . . . . . . . . . .  37</td><td> =
</td><td class=3D"right">     16.3.  LISP Mobile Node Mobility  . . . . =
. . . . . . . . . . .  37</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0012"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   17. LISP xTR =
Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"delete">38</span></td><td> </td><td class=3D"rblock">   17. =
LISP xTR Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"insert">37</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.1.  =
First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">39</span></td><td> </td><td class=3D"rblock">     17.1. =
 First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">38</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.2.  =
Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  39</td><td> =
</td><td class=3D"right">     17.2.  Border/Edge xTRs . . . . . . . . . =
. . . . . . . . . . .  39</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0013"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.3.  ISP =
Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"delete">40</span></td><td> </td><td class=3D"rblock">     17.3. =
 ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"insert">39</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.4.  LISP =
Functionality with Conventional NATs  . . . . . . .  40</td><td> =
</td><td class=3D"right">     17.4.  LISP Functionality with =
Conventional NATs  . . . . . . .  40</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0014"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.5.  =
Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"delete">41</span></td><td> </td><td class=3D"rblock">     17.5. =
 Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"insert">40</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">41</span></td><td> </td><td class=3D"rblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">40</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.1.  =
IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">42</span></td><td> </td><td class=3D"rblock">     18.1. =
 IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">41</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     18.2.  IPv4 =
Traceroute  . . . . . . . . . . . . . . . . . . . .  42</td><td> =
</td><td class=3D"right">     18.2.  IPv4 Traceroute  . . . . . . . . . =
. . . . . . . . . . .  42</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0015"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"delete">3</span></td><td> </td><td class=3D"rblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"insert">2</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   19. Security =
Considerations . . . . . . . . . . . . . . . . . . .  43</td><td> =
</td><td class=3D"right">   19. Security Considerations . . . . . . . . =
. . . . . . . . . . .  43</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0016"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   20. Network =
Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"delete">4</span></td><td> </td><td class=3D"rblock">   20. =
Network Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"insert">3</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   21. IANA =
Considerations . . . . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">   21. IANA Considerations . . . . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     21.1.  LISP =
UDP Port Numbers  . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     21.1.  LISP UDP Port Numbers  . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   22. References =
 . . . . . . . . . . . . . . . . . . . . . . . . .  44</td><td> </td><td =
class=3D"right">   22. References  . . . . . . . . . . . . . . . . . . . =
. . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     22.1.  =
Normative References . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     22.1.  Normative References . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0017"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     22.2.  =
Informative References . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">47</span></td><td> </td><td class=3D"rblock">     22.2. =
 Informative References . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">45</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix A.  =
Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">51</span></td><td> </td><td class=3D"rblock">   =
Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix B.  =
Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">51</span></td><td> </td><td class=3D"rblock">   =
Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.1.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.1.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.2.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.2.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-07</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.3.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-05</span>  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock">     B.3.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-06</span>  . . . . . . . .  =
<span class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.4.  =
Changes to draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  52</td><td> =
</td><td class=3D"rblock">     B.4.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  =
51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     <span =
class=3D"delete">B.5.</span>  Changes to draft-ietf-lisp-rfc6830bis-03  =
. . . . . . . .  <span class=3D"delete">53</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">     B.5.  Changes to</span> =
draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  52</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.6.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock">     <span =
class=3D"insert">B.6.</span>  Changes to draft-ietf-lisp-rfc6830bis-03  =
. . . . . . . .  <span class=3D"insert">52</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Authors' =
Addresses  . . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">53</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.9.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  <span =
class=3D"insert">52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   Authors' Addresses  . . . . . . . . . . . . =
. . . . . . . . . . .  <span class=3D"insert">52</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">1.  =
Introduction</td><td> </td><td class=3D"right">1.  Introduction</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the Locator/Identifier Separation Protocol</td><td> </td><td =
class=3D"right">   This document describes the Locator/Identifier =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (LISP).  LISP =
is an encapsulation protocol built around the</td><td> </td><td =
class=3D"right">   (LISP).  LISP is an encapsulation protocol built =
around the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fundamental =
idea of separating the topological location of a network</td><td> =
</td><td class=3D"right">   fundamental idea of separating the =
topological location of a network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
point from the node's identity [CHIAPPA].  As a result</td><td> </td><td =
class=3D"right">   attachment point from the node's identity [CHIAPPA].  =
As a result</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP creates =
two namespaces: Endpoint Identifiers (EIDs), that are</td><td> </td><td =
class=3D"right">   LISP creates two namespaces: Endpoint Identifiers =
(EIDs), that are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   used to =
identify end-hosts (e.g., nodes or Virtual Machines) and</td><td> =
</td><td class=3D"right">   used to identify end-hosts (e.g., nodes or =
Virtual Machines) and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   routable =
Routing Locators (RLOCs), used to identify network</td><td> </td><td =
class=3D"right">   routable Routing Locators (RLOCs), used to identify =
network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
points.  LISP then defines functions for mapping between</td><td> =
</td><td class=3D"right">   attachment points.  LISP then defines =
functions for mapping between</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the two =
namespaces and for encapsulating traffic originated by</td><td> </td><td =
class=3D"right">   the two namespaces and for encapsulating traffic =
originated by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   devices using =
non-routable EIDs for transport across a network</td><td> </td><td =
class=3D"right">   devices using non-routable EIDs for transport across =
a network</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0018"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
infrastructure that routes and forwards using RLOCs.</td><td> </td><td =
class=3D"rblock">   infrastructure that routes and forwards using RLOCs. =
 <span class=3D"insert">LISP</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   encapsulation uses a =
dynamic form of tunneling where no static</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   provisioning is =
required or necessary.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP is an =
overlay protocol that separates control from data-plane,</td><td> =
</td><td class=3D"right">   LISP is an overlay protocol that separates =
control from data-plane,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   this document =
specifies the data-plane, how LISP-capable routers</td><td> </td><td =
class=3D"right">   this document specifies the data-plane, how =
LISP-capable routers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (Tunnel =
Routers) exchange packets by encapsulating them to the</td><td> </td><td =
class=3D"right">   (Tunnel Routers) exchange packets by encapsulating =
them to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   appropriate =
location.  Tunnel routers are equipped with a cache,</td><td> </td><td =
class=3D"right">   appropriate location.  Tunnel routers are equipped =
with a cache,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   called =
map-cache, that contains EID-to-RLOC mappings.  The map-cache</td><td> =
</td><td class=3D"right">   called map-cache, that contains EID-to-RLOC =
mappings.  The map-cache</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is populated =
using the LISP Control-Plane protocol</td><td> </td><td class=3D"right"> =
  is populated using the LISP Control-Plane protocol</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis].</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP does not =
require changes to either host protocol stack or to</td><td> </td><td =
class=3D"right">   LISP does not require changes to either host protocol =
stack or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-2" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> =
page 4, line 31<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> page 4, line 33<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   describes the =
LISP architecture.</td><td> </td><td class=3D"right">   describes the =
LISP architecture.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">2.  Requirements =
Notation</td><td> </td><td class=3D"right">2.  Requirements =
Notation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The key words =
"MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",</td><td> </td><td =
class=3D"right">   The key words "MUST", "MUST NOT", "REQUIRED", =
"SHALL", "SHALL NOT",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   "SHOULD", =
"SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this</td><td> =
</td><td class=3D"right">   "SHOULD", "SHOULD NOT", "RECOMMENDED", =
"MAY", and "OPTIONAL" in this</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document are =
to be interpreted as described in [RFC2119].</td><td> </td><td =
class=3D"right">   document are to be interpreted as described in =
[RFC2119].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">3.  Definition of =
Terms</td><td> </td><td class=3D"right">3.  Definition of Terms</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0019"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Provider-Independent (PI) Addresses:   PI addresses =
are</span> an address</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Address Family Identifier (AFI):   AFI is a term used =
to describe</span> an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">block assigned from a pool where blocks are not =
associated with</span></td><td> </td><td class=3D"rblock">      address =
<span class=3D"insert">encoding</span> in a <span class=3D"insert">packet.=
  An address family that pertains to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      any particular location</span> in <span =
class=3D"delete">the network (e.g., from</span> a <span =
class=3D"delete">particular</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      the data-plane.  See =
[AFN]</span> and <span class=3D"insert">[RFC3232] for details.  An =
AFI</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      service provider)</span> and <span =
class=3D"delete">are therefore not topologically =
aggregatable</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      value of 0 used</span> in <span =
class=3D"insert">this specification indicates an =
unspecified</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      in the =
<span class=3D"delete">routing system.</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      encoded address where the =
length of the address is 0 octets</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      following</span> =
the <span class=3D"insert">16-bit AFI value of 0.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0020"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Provider-Assigned (PA) Addresses:   PA addresses are an =
address block</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Anycast Address:  Anycast Address</span> is a <span =
class=3D"insert">term used in this document to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      assigned to a site by each service provider to =
which a site</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      refer to</span> the <span class=3D"insert">same =
IPv4 or IPv6 address configured and used on</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      connects.  Typically, each block</span> is a =
<span class=3D"delete">sub-block of a service</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      multiple systems at</span> =
the <span class=3D"insert">same time.  An EID or RLOC can be =
an</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      provider Classless Inter-Domain Routing (CIDR) =
[RFC4632] block and</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      anycast address in</span> each <span =
class=3D"insert">of their</span> own address <span =
class=3D"insert">spaces.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      is aggregated into</span> the <span =
class=3D"delete">larger block before being advertised =
into</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the <span =
class=3D"delete">global Internet.  Traditionally, IP multihoming has =
been</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      implemented by</span> each <span =
class=3D"delete">multihomed site acquiring its</span> own <span =
class=3D"delete">globally</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      visible prefix.  LISP uses only topologically =
assigned and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      aggregatable</span> address <span =
class=3D"delete">blocks for RLOCs, eliminating this</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      demonstrably non-scalable =
practice.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0021"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Routing Locator (RLOC):   An RLOC</span> is an <span =
class=3D"delete">IPv4 [RFC0791] or IPv6</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Client-side:  =
Client-side</span> is <span class=3D"insert">a term used in this =
document to indicate</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      [RFC8200]</span> address of an Egress Tunnel =
Router <span class=3D"delete">(ETR).</span>  An <span =
class=3D"delete">RLOC</span> is</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      a connection initiation attempt by</span> an =
<span class=3D"insert">EID.  The ITR(s) at the LISP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">the output of</span> an <span =
class=3D"delete">EID-to-RLOC mapping lookup.  An EID maps to</span> =
one</td><td> </td><td class=3D"rblock"><span class=3D"insert">      site =
are the first to get involved in forwarding a packet from =
the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">or more</span> RLOCs.  <span class=3D"delete">Typically, =
RLOCs are numbered</span> from <span =
class=3D"delete">topologically</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      source EID.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      aggregatable blocks that are assigned</span> to =
<span class=3D"delete">a</span> site <span class=3D"delete">at each =
point</span> to</td><td> </td><td class=3D"rblock"><span =
class=3D"insert"></span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">which it attaches</span> to the global <span =
class=3D"delete">Internet; where</span> the <span =
class=3D"delete">topology is</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">   Data-Probe:   A Data-Probe is =
a LISP-encapsulated data packet where</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      defined by</span> the <span =
class=3D"delete">connectivity</span> of <span class=3D"delete">provider =
networks, RLOCs</span> can be</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      the inner-header destination address equals the =
outer-header</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">thought</span> of <span class=3D"delete">as PA</span> =
addresses.  <span class=3D"delete">Multiple RLOCs</span> can be <span =
class=3D"delete">assigned</span> to the</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      destination</span> address =
<span class=3D"insert">used to trigger a Map-Reply by a =
decapsulating</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">same ETR</span> device or <span class=3D"delete">to =
multiple ETR devices at</span> a <span =
class=3D"delete">site.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      ETR.  In addition, the original packet is =
decapsulated and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      delivered to the =
destination host if the destination EID is in the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      EID-Prefix range =
configured on the ETR.  Otherwise, the packet is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      discarded.  A =
Data-Probe is used in some</span> of <span class=3D"insert">the mapping =
database</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      designs to =
"probe" or request a Map-Reply from</span> an <span class=3D"insert">ETR; =
in other</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      cases, =
Map-Requests are used.  See each mapping database design</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      for details.  =
When using Data-Probes, by sending Map-Requests on</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the underlying =
routing system, EID-Prefixes must be advertised.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   Egress Tunnel Router <span =
class=3D"insert">(ETR):</span>   An <span class=3D"insert">ETR</span> is =
<span class=3D"insert">a router that accepts</span> an <span =
class=3D"insert">IP</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      packet where the =
destination address in the "outer" IP header is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      one <span class=3D"insert">of its =
own</span> RLOCs.  <span class=3D"insert">The router strips the "outer" =
header and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      forwards the =
packet based on the next IP header found.  In</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      general, an ETR =
receives LISP-encapsulated IP packets</span> from <span =
class=3D"insert">the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      Internet on one =
side and sends decapsulated IP packets</span> to site</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">end-systems on =
the other side.  ETR functionality does not have</span> to</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">be limited</span> =
to <span class=3D"insert">a router device.  A server host can be</span> =
the <span class=3D"insert">endpoint</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of a LISP tunnel =
as well.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-to-RLOC =
Database:   The EID-to-RLOC Database is a</span> global</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">distributed =
database that contains all known EID-Prefix-to-RLOC</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      mappings.  Each =
potential ETR typically contains a small piece of</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      the <span class=3D"insert">database: the =
EID-to-RLOC mappings for the EID-Prefixes</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      "behind" the =
router.  These map to one of the router's own</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      globally visible =
IP addresses.  Note that there MAY be transient</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      conditions when =
the EID-Prefix for the site and Locator-Set for</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      each EID-Prefix =
may not be</span> the <span class=3D"insert">same on all ETRs.  This has =
no</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      negative =
implications, since a partial set</span> of <span =
class=3D"insert">Locators</span> can be</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span =
class=3D"insert">used.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-to-RLOC =
Map-Cache:   The EID-to-RLOC map-cache is generally</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      short-lived, =
on-demand table in an ITR that stores, tracks, and is</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      responsible for =
timing out and otherwise validating EID-to-RLOC</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      mappings.  This =
cache is distinct from the full "database"</span> of <span =
class=3D"insert">EID-</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      to-RLOC mappings; =
it is dynamic, local to the ITR(s), and</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      relatively small, =
while the database is distributed, relatively</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      static, and much =
more global in scope.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   EID-Prefix:   An =
EID-Prefix is a power-of-two block of EIDs that are</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      allocated to a =
site by an address allocation authority.  EID-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      Prefixes are =
associated with a set of RLOC</span> addresses.  <span =
class=3D"insert">EID-Prefix</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
allocations</span> can be <span class=3D"insert">broken up into smaller =
blocks when an RLOC set</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      is</span> to =
<span class=3D"insert">be associated with</span> the <span =
class=3D"insert">larger EID-Prefix block.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   End-System:   An =
end-system is an IPv4 or IPv6</span> device <span class=3D"insert">that =
originates</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      packets with a =
single IPv4</span> or <span class=3D"insert">IPv6 header.  The =
end-system</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      supplies an EID =
value for the destination address field of the IP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header when =
communicating globally (i.e., outside of its routing</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      domain).  An =
end-system can be</span> a <span class=3D"insert">host computer, a =
switch or router</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      device, or any =
network appliance.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Endpoint ID =
(EID):   An EID is a 32-bit (for IPv4) or 128-bit (for</td><td> </td><td =
class=3D"right">   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or =
128-bit (for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      IPv6) value =
used in the source and destination address fields of</td><td> </td><td =
class=3D"right">      IPv6) value used in the source and destination =
address fields of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the first =
(most inner) LISP header of a packet.  The host obtains</td><td> =
</td><td class=3D"right">      the first (most inner) LISP header of a =
packet.  The host obtains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a =
destination EID the same way it obtains a destination address</td><td> =
</td><td class=3D"right">      a destination EID the same way it obtains =
a destination address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      today, for =
example, through a Domain Name System (DNS) [RFC1034]</td><td> </td><td =
class=3D"right">      today, for example, through a Domain Name System =
(DNS) [RFC1034]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      lookup or =
Session Initiation Protocol (SIP) [RFC3261] exchange.</td><td> </td><td =
class=3D"right">      lookup or Session Initiation Protocol (SIP) =
[RFC3261] exchange.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      The source =
EID is obtained via existing mechanisms used to set a</td><td> </td><td =
class=3D"right">      The source EID is obtained via existing mechanisms =
used to set a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      host's =
"local" IP address.  An EID used on the public Internet</td><td> =
</td><td class=3D"right">      host's "local" IP address.  An EID used =
on the public Internet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      must have =
the same properties as any other IP address used in that</td><td> =
</td><td class=3D"right">      must have the same properties as any =
other IP address used in that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      manner; =
this means, among other things, that it must be globally</td><td> =
</td><td class=3D"right">      manner; this means, among other things, =
that it must be globally</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      unique.  An =
EID is allocated to a host from an EID-Prefix block</td><td> </td><td =
class=3D"right">      unique.  An EID is allocated to a host from an =
EID-Prefix block</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      associated =
with the site where the host is located.  An EID can be</td><td> =
</td><td class=3D"right">      associated with the site where the host =
is located.  An EID can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      used by a =
host to refer to other hosts.  Note that EID blocks MAY</td><td> =
</td><td class=3D"right">      used by a host to refer to other hosts.  =
Note that EID blocks MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      be assigned =
in a hierarchical manner, independent of the network</td><td> </td><td =
class=3D"right">      be assigned in a hierarchical manner, independent =
of the network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      topology, =
to facilitate scaling of the mapping database.  In</td><td> </td><td =
class=3D"right">      topology, to facilitate scaling of the mapping =
database.  In</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0022"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      addition, =
an EID block assigned to a site <span class=3D"delete">may</span> have =
site-local</td><td> </td><td class=3D"rblock">      addition, an EID =
block assigned to a site <span class=3D"insert">MAY</span> have =
site-local</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      structure =
(subnetting) for routing within the site; this structure</td><td> =
</td><td class=3D"right">      structure (subnetting) for routing within =
the site; this structure</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is not =
visible to the global routing system.  In theory, the bit</td><td> =
</td><td class=3D"right">      is not visible to the global routing =
system.  In theory, the bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      string that =
represents an EID for one device can represent an RLOC</td><td> </td><td =
class=3D"right">      string that represents an EID for one device can =
represent an RLOC</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0023"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      for a =
different device.  <span class=3D"delete">As the architecture is =
realized, if a</span></td><td> </td><td class=3D"rblock">      for a =
different device.  When used in discussions with other</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      given bit string is both an RLOC and an EID, it =
must refer to the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      same entity in both cases.</span>  When used in =
discussions with other</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Locator/ID =
separation proposals, a LISP EID will be called an</td><td> </td><td =
class=3D"right">      Locator/ID separation proposals, a LISP EID will =
be called an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      "LEID".  =
Throughout this document, any references to "EID" refer</td><td> =
</td><td class=3D"right">      "LEID".  Throughout this document, any =
references to "EID" refer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to an =
LEID.</td><td> </td><td class=3D"right">      to an LEID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0024"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">EID-Prefix:   An EID-Prefix is a power-of-two block of =
EIDs that are</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      allocated to a site by an address allocation =
authority.  EID-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Prefixes are associated with a set of RLOC =
addresses that make up</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      a "database mapping".  EID-Prefix allocations can =
be broken up</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      into smaller blocks when an RLOC set is to be =
associated with the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      larger EID-Prefix block.  A globally routed =
address block (whether</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      PI or PA) is not inherently an EID-Prefix.  A =
globally routed</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      address block MAY be used by its assignee as an =
EID block.  The</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      converse is not supported.  That is, a site that =
receives an</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      explicitly allocated EID-Prefix may not use that =
EID-Prefix as a</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally routed prefix.  This would require =
coordination and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      cooperation with the entities managing the =
mapping infrastructure.</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Once this has been done, that block could be =
removed from the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally routed IP system, if other suitable =
transition and access</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mechanisms are in place.  Discussion of such =
transition and access</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mechanisms can be found in [RFC6832] and =
[RFC7215].</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   End-system:   An end-system is an IPv4 or IPv6 =
device that originates</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      packets with a single IPv4 or IPv6 header.  The =
end-system</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      supplies an EID value for the destination address =
field of the IP</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      header when communicating globally (i.e., outside =
of its routing</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      domain).  An end-system can be a host computer, a =
switch or router</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      device, or any network appliance.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Ingress Tunnel =
Router (ITR):   An ITR is a router that resides in a</td><td> </td><td =
class=3D"right">   Ingress Tunnel Router (ITR):   An ITR is a router =
that resides in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      LISP site.  =
Packets sent by sources inside of the LISP site to</td><td> </td><td =
class=3D"right">      LISP site.  Packets sent by sources inside of the =
LISP site to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
destinations outside of the site are candidates for =
encapsulation</td><td> </td><td class=3D"right">      destinations =
outside of the site are candidates for encapsulation</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      by the ITR. =
 The ITR treats the IP destination address as an EID</td><td> </td><td =
class=3D"right">      by the ITR.  The ITR treats the IP destination =
address as an EID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      and =
performs an EID-to-RLOC mapping lookup.  The router then</td><td> =
</td><td class=3D"right">      and performs an EID-to-RLOC mapping =
lookup.  The router then</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      prepends an =
"outer" IP header with one of its routable RLOCs (in</td><td> </td><td =
class=3D"right">      prepends an "outer" IP header with one of its =
routable RLOCs (in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the RLOC =
space) in the source address field and the result of the</td><td> =
</td><td class=3D"right">      the RLOC space) in the source address =
field and the result of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      mapping =
lookup in the destination address field.  Note that this</td><td> =
</td><td class=3D"right">      mapping lookup in the destination address =
field.  Note that this</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
RLOC MAY be an intermediate, proxy device that has</td><td> </td><td =
class=3D"right">      destination RLOC MAY be an intermediate, proxy =
device that has</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      better =
knowledge of the EID-to-RLOC mapping closer to the</td><td> </td><td =
class=3D"right">      better knowledge of the EID-to-RLOC mapping closer =
to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-3" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> =
page 6, line 33<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> page 7, line 5<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      end-systems =
on one side and sends LISP-encapsulated IP packets</td><td> </td><td =
class=3D"right">      end-systems on one side and sends =
LISP-encapsulated IP packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      toward the =
Internet on the other side.</td><td> </td><td class=3D"right">      =
toward the Internet on the other side.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Specifically, when a service provider prepends a LISP header =
for</td><td> </td><td class=3D"right">      Specifically, when a service =
provider prepends a LISP header for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Traffic =
Engineering purposes, the router that does this is also</td><td> =
</td><td class=3D"right">      Traffic Engineering purposes, the router =
that does this is also</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      regarded as =
an ITR.  The outer RLOC the ISP ITR uses can be based</td><td> </td><td =
class=3D"right">      regarded as an ITR.  The outer RLOC the ISP ITR =
uses can be based</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      on the =
outer destination address (the originating ITR's supplied</td><td> =
</td><td class=3D"right">      on the outer destination address (the =
originating ITR's supplied</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      RLOC) or =
the inner destination address (the originating host's</td><td> </td><td =
class=3D"right">      RLOC) or the inner destination address (the =
originating host's</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      supplied =
EID).</td><td> </td><td class=3D"right">      supplied EID).</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0025"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">TE-ITR:   A TE-ITR is an ITR that is deployed in a =
service provider</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">LISP Header:</span>   LISP header is a <span =
class=3D"insert">term used</span> in <span class=3D"insert">this =
document</span> to <span class=3D"insert">refer</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      network that prepends an additional</span> LISP =
header <span class=3D"delete">for Traffic</span></td><td> </td><td =
class=3D"rblock">      to the <span class=3D"insert">outer IPv4 or IPv6 =
header,</span> a <span class=3D"insert">UDP header, and</span> a <span =
class=3D"insert">LISP-</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Engineering purposes.</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      specific 8-octet</span> =
header that <span class=3D"insert">follow</span> the <span =
class=3D"insert">UDP header</span> and <span class=3D"insert">that</span> =
an <span class=3D"insert">ITR</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      prepends or</span> an ETR <span =
class=3D"insert">strips.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Egress Tunnel Router (ETR):   An ETR</span> is a =
<span class=3D"delete">router that accepts an IP</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      packet where the destination address</span> in =
<span class=3D"delete">the "outer" IP header is</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      one of its own RLOCs.  The router strips the =
"outer" header and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      forwards the packet based on the next IP header =
found.  In</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      general, an ETR receives LISP-encapsulated IP =
packets from the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      Internet on one side and sends decapsulated IP =
packets to site</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      end-systems on the other side.  ETR functionality =
does not have</span> to</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">be limited</span> to <span class=3D"delete">a router =
device.  A server host can be</span> the <span =
class=3D"delete">endpoint</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      of</span> a <span class=3D"delete">LISP tunnel as =
well.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   TE-ETR:   A TE-ETR is an ETR that is deployed =
in</span> a <span class=3D"delete">service provider</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      network that strips an outer LISP</span> header =
<span class=3D"delete">for Traffic Engineering</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      purposes.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   xTR:   An xTR is a reference to an ITR or ETR when =
direction of data</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      flow is not part of the context description.  =
"xTR" refers to the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      router</span> that <span class=3D"delete">is the =
tunnel endpoint and is used synonymously with</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the term "Tunnel Router".  For example, "An xTR =
can be located at</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the <span =
class=3D"delete">Customer Edge (CE) router" indicates both ITR</span> =
and <span class=3D"delete">ETR</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      functionality at the CE router.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Re-encapsulating Tunneling in RTRs:   =
Re-encapsulating Tunneling</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      occurs when</span> an <span class=3D"delete">RTR =
(Re-encapsulating Tunnel Router) acts like</span> an</td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      ETR <span =
class=3D"delete">to remove a LISP header, then acts as an ITR to prepend =
a new</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP header.  Doing this allows a packet to be =
re-routed by the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      RTR without adding the overhead of additional =
tunnel headers.  Any</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      references to tunnels in this specification refer =
to dynamic</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      encapsulating tunnels; they are never statically =
configured.  When</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      using multiple mapping database systems, care =
must be taken to not</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      create re-encapsulation loops through =
misconfiguration.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP Router:   =
A LISP router is a router that performs the functions</td><td> </td><td =
class=3D"right">   LISP Router:   A LISP router is a router that =
performs the functions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of any or =
all of the following: ITR, ETR, RTR, Proxy-ITR (PITR),</td><td> </td><td =
class=3D"right">      of any or all of the following: ITR, ETR, RTR, =
Proxy-ITR (PITR),</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      or =
Proxy-ETR (PETR).</td><td> </td><td class=3D"right">      or Proxy-ETR =
(PETR).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0026"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">EID-to-RLOC Map-Cache:   The EID-to-RLOC map-cache is =
generally</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">LISP Site:  LISP</span> site <span =
class=3D"insert">is</span> a set of <span class=3D"insert">routers =
in</span> an <span class=3D"insert">edge network that</span> are</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      short-lived, on-demand table in an ITR that =
stores, tracks, and is</span></td><td> </td><td class=3D"rblock">      =
<span class=3D"insert">under a single technical administration.  LISP =
routers that reside</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      responsible for timing out and otherwise =
validating EID-to-RLOC</span></td><td> </td><td class=3D"rblock">      =
in the <span class=3D"insert">edge network</span> are <span =
class=3D"insert">the demarcation points</span> to <span =
class=3D"insert">separate</span> the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings.  This cache is distinct from the full =
"database" of EID-</span></td><td> </td><td class=3D"rblock">      <span =
class=3D"insert">edge network from</span> the <span class=3D"insert">core =
network.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      to-RLOC mappings; it is dynamic, local to the =
ITR(s), and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      relatively small, while the database is =
distributed, relatively</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      static, and much more global in =
scope.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   EID-to-RLOC Database:   The EID-to-RLOC Database is =
a global</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      distributed database that contains all known =
EID-Prefix-to-RLOC</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings.  Each potential ETR typically contains =
a small piece of</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the database: the EID-to-RLOC mappings for the =
EID-Prefixes</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      "behind" the router.  These map to one of the =
router's own</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      globally visible IP addresses.  Note that there =
MAY be transient</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      conditions when the EID-Prefix for the</span> =
site <span class=3D"delete">and Locator-Set for</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      each EID-Prefix may not be the same on all ETRs.  =
This has no</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      negative implications, since</span> a <span =
class=3D"delete">partial</span> set of <span class=3D"delete">Locators =
can be</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      used.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Recursive Tunneling:   Recursive Tunneling occurs =
when a packet has</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      more than one LISP IP header.  Additional layers =
of tunneling MAY</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      be employed to implement Traffic Engineering or =
other re-routing</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      as needed.  When this is done,</span> an <span =
class=3D"delete">additional "outer" LISP header</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      is added, and the original RLOCs</span> are <span =
class=3D"delete">preserved</span> in the <span =
class=3D"delete">"inner"</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      header.  Any references to tunnels in this =
specification refer to</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      dynamic encapsulating tunnels; they</span> are =
<span class=3D"delete">never statically</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      configured.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   LISP Header:   LISP header is a term used in this =
document to refer</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      to the =
<span class=3D"delete">outer IPv4 or IPv6 header, a UDP header, and a =
LISP-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      specific 8-octet header that follow</span> the =
<span class=3D"delete">UDP header and that an ITR</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      prepends or an ETR strips.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0027"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Address Family Identifier (AFI):   AFI is a term</span> =
used to <span class=3D"delete">describe an</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Locator-Status-Bits (LSBs):  =
Locator-Status-Bits are present in the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      address encoding in</span> a <span =
class=3D"delete">packet.  An address family that pertains</span> =
to</td><td> </td><td class=3D"rblock"><span class=3D"insert">      LISP =
header.  They are</span> used <span class=3D"insert">by ITRs</span> to =
<span class=3D"insert">inform ETRs about the up/</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">the data-plane.  See [AFN]</span> and <span =
class=3D"delete">[RFC3232] for details.  An AFI</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      down status of all ETRs at =
the local site.  These bits are used as</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      value</span> of <span class=3D"delete">0 used in =
this specification indicates an unspecified</span></td><td> </td><td =
class=3D"rblock">      a <span class=3D"insert">hint</span> to <span =
class=3D"insert">convey up/down router status</span> and <span =
class=3D"insert">not path reachability</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      encoded address where the length</span> of the =
<span class=3D"delete">address is 0 octets</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      status.  The LSBs can be =
verified by use</span> of <span class=3D"insert">one</span> of the <span =
class=3D"insert">Locator</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      following the 16-bit AFI value of =
0.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">     =
 reachability algorithms described in Section 10.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Negative =
Mapping Entry:   A negative mapping entry, also known as a</td><td> =
</td><td class=3D"right">   Negative Mapping Entry:   A negative mapping =
entry, also known as a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      negative =
cache entry, is an EID-to-RLOC entry where an EID-Prefix</td><td> =
</td><td class=3D"right">      negative cache entry, is an EID-to-RLOC =
entry where an EID-Prefix</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is =
advertised or stored with no RLOCs.  That is, the Locator-Set</td><td> =
</td><td class=3D"right">      is advertised or stored with no RLOCs.  =
That is, the Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      for the =
EID-to-RLOC entry is empty or has an encoded Locator count</td><td> =
</td><td class=3D"right">      for the EID-to-RLOC entry is empty or has =
an encoded Locator count</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of 0.  This =
type of entry could be used to describe a prefix from</td><td> </td><td =
class=3D"right">      of 0.  This type of entry could be used to =
describe a prefix from</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a non-LISP =
site, which is explicitly not in the mapping database.</td><td> </td><td =
class=3D"right">      a non-LISP site, which is explicitly not in the =
mapping database.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      There are a =
set of well-defined actions that are encoded in a</td><td> </td><td =
class=3D"right">      There are a set of well-defined actions that are =
encoded in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Negative =
Map-Reply.</td><td> </td><td class=3D"right">      Negative =
Map-Reply.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0028"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Data-Probe:   A Data-Probe is a LISP-encapsulated data =
packet where</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Provider-Assigned (PA) Addresses:   PA addresses are =
an</span> address <span class=3D"insert">block</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the inner-header destination address equals the =
outer-header</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      assigned</span> to a <span =
class=3D"insert">site</span> by <span class=3D"insert">each service =
provider</span> to <span class=3D"insert">which a site</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      destination</span> address <span =
class=3D"delete">used</span> to <span class=3D"delete">trigger</span> a =
<span class=3D"delete">Map-Reply</span> by <span class=3D"delete">a =
decapsulating</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      connects.  Typically, each block</span> is <span =
class=3D"insert">a sub-block</span> of a <span =
class=3D"insert">service</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      ETR.  In addition, the original packet is =
decapsulated and</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      provider Classless Inter-Domain Routing (CIDR) =
[RFC4632] block and</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      delivered</span> to <span class=3D"delete">the =
destination host if the destination EID is in the</span></td><td> =
</td><td class=3D"rblock">      is <span class=3D"insert">aggregated =
into</span> the <span class=3D"insert">larger block before being =
advertised into</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      EID-Prefix range configured on the ETR.  =
Otherwise, the packet is</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      the underlay network.  Traditionally, IP =
multihoming has been</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      discarded.  A Data-Probe</span> is <span =
class=3D"delete">used in some</span> of <span class=3D"delete">the =
mapping database</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      implemented</span> by <span class=3D"insert">each =
multihomed site acquiring its own globally</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      designs to "probe" or request</span> a <span =
class=3D"delete">Map-Reply from an ETR; in other</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      visible =
prefix.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      cases, Map-Requests are used.  See each mapping =
database design</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      for details.  When using Data-Probes, by sending =
Map-Requests on</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the underlying routing system, EID-Prefixes must =
be advertised.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      However, this</span> is <span =
class=3D"delete">discouraged if</span> the <span class=3D"delete">core =
is to scale</span> by <span class=3D"delete">having</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      less EID-Prefixes stored in the core router's =
routing tables.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0029"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Proxy-ITR (PITR):   A PITR is defined</span> and <span =
class=3D"delete">described</span> in <span class=3D"delete">[RFC6832].  =
A</span></td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Provider-Independent (PI) Addresses:   PI addresses are =
an address</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      PITR acts like an ITR but does so on behalf of =
non-LISP sites that</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      block assigned from a pool where blocks are not =
associated with</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      send packets to destinations at LISP =
sites.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert"> =
     any particular location in the network (e.g., from a =
particular</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      service =
provider)</span> and <span class=3D"insert">are therefore not =
topologically aggregatable</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      in <span class=3D"insert">the routing =
system.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Proxy-ETR =
(PETR):   A PETR is defined and described in [RFC6832].  A</td><td> =
</td><td class=3D"right">   Proxy-ETR (PETR):   A PETR is defined and =
described in [RFC6832].  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      PETR acts =
like an ETR but does so on behalf of LISP sites that</td><td> </td><td =
class=3D"right">      PETR acts like an ETR but does so on behalf of =
LISP sites that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      send =
packets to destinations at non-LISP sites.</td><td> </td><td =
class=3D"right">      send packets to destinations at non-LISP =
sites.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0030"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Route-returnability:</span>  Route-returnability is an =
assumption that the</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">Proxy-ITR (PITR):   A PITR is defined and described in =
[RFC6832].  A</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      PITR acts like an =
ITR but does so on behalf of non-LISP sites that</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      send packets to =
destinations at LISP sites.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   Recursive Tunneling: =
  Recursive Tunneling occurs when a packet has</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      more than one =
LISP IP header.  Additional layers of tunneling MAY</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      be employed to =
implement Traffic Engineering or other re-routing</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      as needed.  When =
this is done, an additional "outer" LISP header</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      is added, and the =
original RLOCs are preserved in the "inner"</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
header.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   Re-Encapsulating =
Tunneling Router (RTR):   An RTR acts like an ETR to</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      remove a LISP =
header, then acts as an ITR to prepend a new LISP</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header.  This is =
known as Re-encapsulating Tunneling.  Doing this</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      allows a packet =
to be re-routed by the RTR without adding the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      overhead of =
additional tunnel headers.  Any references to tunnels</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      in this =
specification refer to dynamic encapsulating tunnels; =
they</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      are never =
statically configured.  When using multiple mapping</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      database systems, =
care must be taken to not create re-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      encapsulation =
loops through misconfiguration.</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   =
Route-Returnability:</span>  Route-returnability is an assumption that =
the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      underlying =
routing system will deliver packets to the destination.</td><td> =
</td><td class=3D"right">      underlying routing system will deliver =
packets to the destination.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      When =
combined with a nonce that is provided by a sender and</td><td> </td><td =
class=3D"right">      When combined with a nonce that is provided by a =
sender and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned by =
a receiver, this limits off-path data insertion.  A</td><td> </td><td =
class=3D"right">      returned by a receiver, this limits off-path data =
insertion.  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
route-returnability check is verified when a message is sent =
with</td><td> </td><td class=3D"right">      route-returnability check =
is verified when a message is sent with</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a nonce, =
another message is returned with the same nonce, and the</td><td> =
</td><td class=3D"right">      a nonce, another message is returned with =
the same nonce, and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
of the original message appears as the source of the</td><td> </td><td =
class=3D"right">      destination of the original message appears as the =
source of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned =
message.</td><td> </td><td class=3D"right">      returned =
message.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0031"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">LISP site:  LISP site</span> is <span class=3D"delete">a =
set</span> of <span class=3D"delete">routers in</span> an <span =
class=3D"delete">edge network that</span> are</td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">Routing Locator (RLOC):   An =
RLOC</span> is <span class=3D"insert">an IPv4 [RFC0791] or =
IPv6</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">under a single technical administration.  LISP =
routers</span> that <span class=3D"delete">reside</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      [RFC8200] =
address</span> of an <span class=3D"insert">Egress Tunnel Router (ETR).  =
An RLOC is</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      in the edge network</span> are <span =
class=3D"delete">the demarcation points</span> to <span =
class=3D"delete">separate</span> the</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      the output of an =
EID-to-RLOC mapping lookup.  An EID maps to one</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">edge network from</span> the <span class=3D"delete">core =
network.</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">=
      or more RLOCs.  Typically, RLOCs</span> are <span =
class=3D"insert">numbered from aggregatable</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      blocks</span> that are <span =
class=3D"insert">assigned to a site at each point to which =
it</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Client-side:  Client-side</span> is <span =
class=3D"delete">a term used in this document to =
indicate</span></td><td> </td><td class=3D"rblock"><span class=3D"insert">=
      attaches</span> to the <span class=3D"insert">underlay network; =
where</span> the <span class=3D"insert">topology</span> is <span =
class=3D"insert">defined</span> by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      a connection initiation attempt</span> by <span =
class=3D"delete">an EID.  The ITR(s) at</span> the <span =
class=3D"delete">LISP</span></td><td> </td><td class=3D"rblock">      =
the <span class=3D"insert">connectivity of provider networks.  Multiple =
RLOCs can be</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      site are</span> the <span =
class=3D"delete">first</span> to <span class=3D"delete">get involved in =
obtaining database Map-Cache</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      assigned to</span> the =
<span class=3D"insert">same ETR device or</span> to <span =
class=3D"insert">multiple ETR devices at a</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      entries by sending Map-Request =
messages.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      site.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Server-side:  =
Server-side is a term used in this document to indicate</td><td> =
</td><td class=3D"right">   Server-side:  Server-side is a term used in =
this document to indicate</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that a =
connection initiation attempt is being accepted for a</td><td> </td><td =
class=3D"right">      that a connection initiation attempt is being =
accepted for a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0032"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
destination EID.  <span class=3D"delete">The ETR(s) at the destination =
LISP site may be</span></td><td> </td><td class=3D"rblock">      =
destination EID.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the first to send Map-Replies to the source site =
initiating the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      connection.  The ETR(s) at this destination site =
can obtain</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      mappings by gleaning information from =
Map-Requests, Data-Probes,</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      or encapsulated packets.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0033"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Locator-Status-Bits (LSBs):  Locator-Status-Bits are =
present</span> in <span class=3D"delete">the</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">TE-ETR:   A TE-ETR is an ETR =
that is deployed</span> in a <span class=3D"insert">service =
provider</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP header.  They are used by ITRs to inform =
ETRs about the up/</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      network that strips an outer LISP header for =
Traffic Engineering</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      down status of all ETRs at the local site.  These =
bits are used as</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      purposes.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      a <span =
class=3D"delete">hint to convey up/down router status and not path =
reachability</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      status.  The LSBs can be verified by use of one =
of the Locator</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      reachability algorithms described in Section =
10.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0034"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Anycast Address:  Anycast Address</span> is <span =
class=3D"delete">a term used</span> in <span class=3D"delete">this =
document</span> to</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">TE-ITR:   A TE-ITR</span> is <span class=3D"insert">an =
ITR that is deployed</span> in <span class=3D"insert">a service =
provider</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">refer</span> to the <span class=3D"delete">same IPv4 or =
IPv6 address configured</span> and used <span =
class=3D"delete">on</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      network that prepends an additional LISP header =
for Traffic</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      multiple systems at</span> the <span =
class=3D"delete">same time.  An EID or RLOC</span> can be <span =
class=3D"delete">an</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      Engineering purposes.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      anycast address in each of their own address =
spaces.</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert"></span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   xTR:   An xTR is a =
reference</span> to <span class=3D"insert">an ITR or ETR when direction =
of data</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      flow is not part =
of the context description.  "xTR" refers</span> to the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      <span class=3D"insert">router that is =
the tunnel endpoint</span> and <span class=3D"insert">is</span> used =
<span class=3D"insert">synonymously with</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">      the <span class=3D"insert">term "Tunnel =
Router".  For example, "An xTR</span> can be <span =
class=3D"insert">located at</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the Customer Edge =
(CE) router" indicates both ITR and ETR</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      functionality at =
the CE router.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">4.  Basic =
Overview</td><td> </td><td class=3D"right">4.  Basic Overview</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   One key =
concept of LISP is that end-systems operate the same way they</td><td> =
</td><td class=3D"right">   One key concept of LISP is that end-systems =
operate the same way they</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   do today.  The =
IP addresses that hosts use for tracking sockets and</td><td> </td><td =
class=3D"right">   do today.  The IP addresses that hosts use for =
tracking sockets and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   connections, =
and for sending and receiving packets, do not change.</td><td> </td><td =
class=3D"right">   connections, and for sending and receiving packets, =
do not change.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   In LISP =
terminology, these IP addresses are called Endpoint</td><td> </td><td =
class=3D"right">   In LISP terminology, these IP addresses are called =
Endpoint</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs).</td><td> </td><td class=3D"right">   Identifiers (EIDs).</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Routers =
continue to forward packets based on IP destination</td><td> </td><td =
class=3D"right">   Routers continue to forward packets based on IP =
destination</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-4" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> =
page 10, line 38<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> page 10, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Other types =
of EID are supported by LISP, see [RFC8060] for</td><td> </td><td =
class=3D"right">   o  Other types of EID are supported by LISP, see =
[RFC8060] for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      further =
information.</td><td> </td><td class=3D"right">      further =
information.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  LISP =
routers mostly deal with Routing Locator addresses.  See</td><td> =
</td><td class=3D"right">   o  LISP routers mostly deal with Routing =
Locator addresses.  See</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      details in =
Section 4.1 to clarify what is meant by "mostly".</td><td> </td><td =
class=3D"right">      details in Section 4.1 to clarify what is meant by =
"mostly".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  RLOCs are =
always IP addresses assigned to routers, preferably</td><td> </td><td =
class=3D"right">   o  RLOCs are always IP addresses assigned to routers, =
preferably</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
topologically oriented addresses from provider CIDR (Classless</td><td> =
</td><td class=3D"right">      topologically oriented addresses from =
provider CIDR (Classless</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Inter-Domain Routing) blocks.</td><td> </td><td class=3D"right">      =
Inter-Domain Routing) blocks.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0035"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  When a =
router originates packets, it <span class=3D"delete">may</span> use as a =
source address</td><td> </td><td class=3D"rblock">   o  When a router =
originates packets, it <span class=3D"insert">MAY</span> use as a source =
address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      either an =
EID or RLOC.  When acting as a host (e.g., when</td><td> </td><td =
class=3D"right">      either an EID or RLOC.  When acting as a host =
(e.g., when</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      terminating =
a transport session such as Secure SHell (SSH),</td><td> </td><td =
class=3D"right">      terminating a transport session such as Secure =
SHell (SSH),</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0036"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      TELNET, =
or the Simple Network Management Protocol (SNMP)), it <span =
class=3D"delete">may</span></td><td> </td><td class=3D"rblock">      =
TELNET, or the Simple Network Management Protocol (SNMP)), it <span =
class=3D"insert">MAY</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      use an EID =
that is explicitly assigned for that purpose.  An EID</td><td> </td><td =
class=3D"right">      use an EID that is explicitly assigned for that =
purpose.  An EID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that =
identifies the router as a host MUST NOT be used as an RLOC;</td><td> =
</td><td class=3D"right">      that identifies the router as a host MUST =
NOT be used as an RLOC;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      an EID is =
only routable within the scope of a site.  A typical BGP</td><td> =
</td><td class=3D"right">      an EID is only routable within the scope =
of a site.  A typical BGP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
configuration might demonstrate this "hybrid" EID/RLOC usage =
where</td><td> </td><td class=3D"right">      configuration might =
demonstrate this "hybrid" EID/RLOC usage where</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a router =
could use its "host-like" EID to terminate iBGP sessions</td><td> =
</td><td class=3D"right">      a router could use its "host-like" EID to =
terminate iBGP sessions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to other =
routers in a site while at the same time using RLOCs to</td><td> =
</td><td class=3D"right">      to other routers in a site while at the =
same time using RLOCs to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      terminate =
eBGP sessions to routers outside the site.</td><td> </td><td =
class=3D"right">      terminate eBGP sessions to routers outside the =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Packets =
with EIDs in them are not expected to be delivered end-to-</td><td> =
</td><td class=3D"right">   o  Packets with EIDs in them are not =
expected to be delivered end-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      end in the =
absence of an EID-to-RLOC mapping operation.  They are</td><td> </td><td =
class=3D"right">      end in the absence of an EID-to-RLOC mapping =
operation.  They are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      expected to =
be used locally for intra-site communication or to be</td><td> </td><td =
class=3D"right">      expected to be used locally for intra-site =
communication or to be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulated for inter-site communication.</td><td> </td><td =
class=3D"right">      encapsulated for inter-site communication.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  =
EID-Prefixes are likely to be hierarchically assigned in a =
manner</td><td> </td><td class=3D"right">   o  EID-Prefixes are likely =
to be hierarchically assigned in a manner</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that is =
optimized for administrative convenience and to facilitate</td><td> =
</td><td class=3D"right">      that is optimized for administrative =
convenience and to facilitate</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0037"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      scaling =
of the EID-to-RLOC mapping database.  <span class=3D"delete">The =
hierarchy is</span></td><td> </td><td class=3D"rblock">      scaling of =
the EID-to-RLOC mapping database.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      based on an address allocation hierarchy that is =
independent of</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the network topology.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0038"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  EIDs =
<span class=3D"delete">may</span> also be structured (subnetted) in a =
manner suitable for</td><td> </td><td class=3D"rblock">   o  EIDs <span =
class=3D"insert">MAY</span> also be structured (subnetted) in a manner =
suitable for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      local =
routing within an Autonomous System (AS).</td><td> </td><td =
class=3D"right">      local routing within an Autonomous System =
(AS).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An additional =
LISP header MAY be prepended to packets by a TE-ITR</td><td> </td><td =
class=3D"right">   An additional LISP header MAY be prepended to packets =
by a TE-ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   when =
re-routing of the path for a packet is desired.  A potential</td><td> =
</td><td class=3D"right">   when re-routing of the path for a packet is =
desired.  A potential</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   use-case for =
this would be an ISP router that needs to perform</td><td> </td><td =
class=3D"right">   use-case for this would be an ISP router that needs =
to perform</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Traffic =
Engineering for packets flowing through its network.  In such</td><td> =
</td><td class=3D"right">   Traffic Engineering for packets flowing =
through its network.  In such</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   a situation, =
termed "Recursive Tunneling", an ISP transit acts as an</td><td> =
</td><td class=3D"right">   a situation, termed "Recursive Tunneling", =
an ISP transit acts as an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   additional =
ITR, and the RLOC it uses for the new prepended header</td><td> </td><td =
class=3D"right">   additional ITR, and the RLOC it uses for the new =
prepended header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   would be =
either a TE-ETR within the ISP (along an intra-ISP traffic</td><td> =
</td><td class=3D"right">   would be either a TE-ETR within the ISP =
(along an intra-ISP traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   engineered =
path) or a TE-ETR within another ISP (an inter-ISP traffic</td><td> =
</td><td class=3D"right">   engineered path) or a TE-ETR within another =
ISP (an inter-ISP traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-5" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> =
page 12, line 17<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> page 11, line =
37<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      was not =
using LISP.</td><td> </td><td class=3D"right">      was not using =
LISP.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Each site =
is multihomed, so each Tunnel Router has an address</td><td> </td><td =
class=3D"right">   o  Each site is multihomed, so each Tunnel Router has =
an address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      (RLOC) =
assigned from the service provider address block for each</td><td> =
</td><td class=3D"right">      (RLOC) assigned from the service provider =
address block for each</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      provider to =
which that particular Tunnel Router is attached.</td><td> </td><td =
class=3D"right">      provider to which that particular Tunnel Router is =
attached.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The ITR(s) =
and ETR(s) are directly connected to the source and</td><td> </td><td =
class=3D"right">   o  The ITR(s) and ETR(s) are directly connected to =
the source and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
destination, respectively, but the source and destination can =
be</td><td> </td><td class=3D"right">      destination, respectively, =
but the source and destination can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      located =
anywhere in the LISP site.</td><td> </td><td class=3D"right">      =
located anywhere in the LISP site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0039"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  <span =
class=3D"delete">Map-Requests are sent to the mapping database system by =
using the</span></td><td> </td><td class=3D"rblock">   o  A Map-Request =
is sent for an external destination when the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      LISP control-plane protocol documented =
in</span></td><td> </td><td class=3D"rblock">      destination is not =
found in the forwarding table or matches a</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      [I-D.ietf-lisp-rfc6833bis].</span>  A Map-Request =
is sent for an external</td><td> </td><td class=3D"rblock">      default =
route.  <span class=3D"insert">Map-Requests are sent to the mapping =
database</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
destination when the destination is not found in the forwarding</td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      system by using =
the LISP control-plane protocol documented in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      table or =
matches a default route.</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">      [I-D.ietf-lisp-rfc6833bis].</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Map-Replies =
are sent on the underlying routing system topology</td><td> </td><td =
class=3D"right">   o  Map-Replies are sent on the underlying routing =
system topology</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      using the =
[I-D.ietf-lisp-rfc6833bis] control-plane protocol.</td><td> </td><td =
class=3D"right">      using the [I-D.ietf-lisp-rfc6833bis] control-plane =
protocol.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Client =
host1.abc.example.com wants to communicate with server</td><td> </td><td =
class=3D"right">   Client host1.abc.example.com wants to communicate =
with server</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
host2.xyz.example.com:</td><td> </td><td class=3D"right">   =
host2.xyz.example.com:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
host1.abc.example.com wants to open a TCP connection to</td><td> =
</td><td class=3D"right">   1.  host1.abc.example.com wants to open a =
TCP connection to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
host2.xyz.example.com.  It does a DNS lookup on</td><td> </td><td =
class=3D"right">       host2.xyz.example.com.  It does a DNS lookup =
on</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
host2.xyz.example.com.  An A/AAAA record is returned.  This</td><td> =
</td><td class=3D"right">       host2.xyz.example.com.  An A/AAAA record =
is returned.  This</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-6" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> =
page 13, line 35<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> page 13, line 8<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       of the =
addresses, strips the LISP header, and forwards packets to</td><td> =
</td><td class=3D"right">       of the addresses, strips the LISP =
header, and forwards packets to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the =
attached destination host.</td><td> </td><td class=3D"right">       the =
attached destination host.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  In order =
to defer the need for a mapping lookup in the reverse</td><td> </td><td =
class=3D"right">   9.  In order to defer the need for a mapping lookup =
in the reverse</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       direction, =
an ETR can OPTIONALLY create a cache entry that maps</td><td> </td><td =
class=3D"right">       direction, an ETR can OPTIONALLY create a cache =
entry that maps</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the source =
EID (inner-header source IP address) to the source</td><td> </td><td =
class=3D"right">       the source EID (inner-header source IP address) =
to the source</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       RLOC =
(outer-header source IP address) in a received LISP packet.</td><td> =
</td><td class=3D"right">       RLOC (outer-header source IP address) in =
a received LISP packet.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       Such a =
cache entry is termed a "gleaned" mapping and only</td><td> </td><td =
class=3D"right">       Such a cache entry is termed a "gleaned" mapping =
and only</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       contains a =
single RLOC for the EID in question.  More complete</td><td> </td><td =
class=3D"right">       contains a single RLOC for the EID in question.  =
More complete</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
information about additional RLOCs SHOULD be verified by =
sending</td><td> </td><td class=3D"right">       information about =
additional RLOCs SHOULD be verified by sending</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0040"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       a LISP =
Map-Request for that EID.  Both the ITR and the ETR <span =
class=3D"delete">may</span></td><td> </td><td class=3D"rblock">       a =
LISP Map-Request for that EID.  Both the ITR and the ETR <span =
class=3D"insert">MAY</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       also =
influence the decision the other makes in selecting an RLOC.</td><td> =
</td><td class=3D"right">       also influence the decision the other =
makes in selecting an RLOC.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.  LISP =
Encapsulation Details</td><td> </td><td class=3D"right">5.  LISP =
Encapsulation Details</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Since =
additional tunnel headers are prepended, the packet becomes</td><td> =
</td><td class=3D"right">   Since additional tunnel headers are =
prepended, the packet becomes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   larger and can =
exceed the MTU of any link traversed from the ITR to</td><td> </td><td =
class=3D"right">   larger and can exceed the MTU of any link traversed =
from the ITR to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the ETR.  It =
is RECOMMENDED in IPv4 that packets do not get</td><td> </td><td =
class=3D"right">   the ETR.  It is RECOMMENDED in IPv4 that packets do =
not get</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fragmented as =
they are encapsulated by the ITR.  Instead, the packet</td><td> </td><td =
class=3D"right">   fragmented as they are encapsulated by the ITR.  =
Instead, the packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is dropped and =
an ICMP Unreachable/Fragmentation-Needed message is</td><td> </td><td =
class=3D"right">   is dropped and an ICMP =
Unreachable/Fragmentation-Needed message is</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   returned to =
the source.</td><td> </td><td class=3D"right">   returned to the =
source.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0041"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">This</span> specification RECOMMENDS that =
implementations provide support</td><td> </td><td class=3D"rblock">   =
<span class=3D"insert">In the case when fragmentation is needed, =
this</span> specification</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   for one of =
the proposed fragmentation and reassembly schemes.  Two</td><td> =
</td><td class=3D"rblock">   RECOMMENDS that implementations provide =
support for one of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   existing =
schemes are detailed in Section 7.</td><td> </td><td class=3D"rblock">   =
proposed fragmentation and reassembly schemes.  Two existing =
schemes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   are detailed in Section 7.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Since IPv4 or =
IPv6 addresses can be either EIDs or RLOCs, the LISP</td><td> </td><td =
class=3D"right">   Since IPv4 or IPv6 addresses can be either EIDs or =
RLOCs, the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
supports IPv4 EIDs with IPv6 RLOCs (where the inner</td><td> </td><td =
class=3D"right">   architecture supports IPv4 EIDs with IPv6 RLOCs =
(where the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is in =
IPv4 packet format and the outer header is in IPv6</td><td> </td><td =
class=3D"right">   header is in IPv4 packet format and the outer header =
is in IPv6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packet format) =
or IPv6 EIDs with IPv4 RLOCs (where the inner header</td><td> </td><td =
class=3D"right">   packet format) or IPv6 EIDs with IPv4 RLOCs (where =
the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is in IPv6 =
packet format and the outer header is in IPv4 packet</td><td> </td><td =
class=3D"right">   is in IPv6 packet format and the outer header is in =
IPv4 packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   format).  The =
next sub-sections illustrate packet formats for the</td><td> </td><td =
class=3D"right">   format).  The next sub-sections illustrate packet =
formats for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   homogeneous =
case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4</td><td> </td><td =
class=3D"right">   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but =
all 4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   combinations =
MUST be supported.  Additional types of EIDs are defined</td><td> =
</td><td class=3D"right">   combinations MUST be supported.  Additional =
types of EIDs are defined</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in =
[RFC8060].</td><td> </td><td class=3D"right">   in [RFC8060].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-7" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> =
page 14, line 16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> page 14, line 4<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
supports IPv4 EIDs with IPv6 RLOCs (where the inner</td><td> </td><td =
class=3D"right">   architecture supports IPv4 EIDs with IPv6 RLOCs =
(where the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is in =
IPv4 packet format and the outer header is in IPv6</td><td> </td><td =
class=3D"right">   header is in IPv4 packet format and the outer header =
is in IPv6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packet format) =
or IPv6 EIDs with IPv4 RLOCs (where the inner header</td><td> </td><td =
class=3D"right">   packet format) or IPv6 EIDs with IPv4 RLOCs (where =
the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is in IPv6 =
packet format and the outer header is in IPv4 packet</td><td> </td><td =
class=3D"right">   is in IPv6 packet format and the outer header is in =
IPv4 packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   format).  The =
next sub-sections illustrate packet formats for the</td><td> </td><td =
class=3D"right">   format).  The next sub-sections illustrate packet =
formats for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   homogeneous =
case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4</td><td> </td><td =
class=3D"right">   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but =
all 4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   combinations =
MUST be supported.  Additional types of EIDs are defined</td><td> =
</td><td class=3D"right">   combinations MUST be supported.  Additional =
types of EIDs are defined</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in =
[RFC8060].</td><td> </td><td class=3D"right">   in [RFC8060].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.1.  LISP =
IPv4-in-IPv4 Header Format</td><td> </td><td class=3D"right">5.1.  LISP =
IPv4-in-IPv4 Header Format</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0042"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        0         =
          1                   2                   3</td><td> </td><td =
class=3D"right">        0                   1                   2        =
           3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        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</td><td> </td><td =
class=3D"right">        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</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0043"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version|  IHL  |<span class=3D"delete">Type of Service</span>|          =
Total Length         |</td><td> </td><td class=3D"rblock">     / =
|Version|  IHL  |<span class=3D"insert">    DSCP   |ECN</span>|          =
Total Length         |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Identification        |Flags|      Fragment Offset    |</td><td> =
</td><td class=3D"right">   |   |         Identification        |Flags|  =
    Fragment Offset    |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   OH  |  Time to =
Live | Protocol =3D 17 |         Header Checksum       |</td><td> =
</td><td class=3D"right">   OH  |  Time to Live | Protocol =3D 17 |      =
   Header Checksum       |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |          =
          Source Routing Locator                     |</td><td> </td><td =
class=3D"right">   |   |                    Source Routing Locator       =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
       Destination Routing Locator                   |</td><td> </td><td =
class=3D"right">     \ |                 Destination Routing Locator     =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     / |       =
Source Port =3D xxxx      |       Dest Port =3D 4341        |</td><td> =
</td><td class=3D"right">     / |       Source Port =3D xxxx      |      =
 Dest Port =3D 4341        |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
 UDP Length          |        UDP Checksum           |</td><td> </td><td =
class=3D"right">     \ |           UDP Length          |        UDP =
Checksum           |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   L   =
|N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|</td><td> </td><td class=3D"right">   L   |N|L|E|V|I|R|K|K|            =
Nonce/Map-Version                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   S / |          =
       Instance ID/Locator-Status-Bits               |</td><td> </td><td =
class=3D"right">   S / |                 Instance ID/Locator-Status-Bits =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0044"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version|  IHL  |<span class=3D"delete">Type of Service</span>|          =
Total Length         |</td><td> </td><td class=3D"rblock">     / =
|Version|  IHL  |<span class=3D"insert">    DSCP   |ECN</span>|          =
Total Length         |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Identification        |Flags|      Fragment Offset    |</td><td> =
</td><td class=3D"right">   |   |         Identification        |Flags|  =
    Fragment Offset    |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   IH  |  Time to =
Live |    Protocol   |         Header Checksum       |</td><td> </td><td =
class=3D"right">   IH  |  Time to Live |    Protocol   |         Header =
Checksum       |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |          =
                 Source EID                          |</td><td> </td><td =
class=3D"right">   |   |                           Source EID            =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
               Destination EID                       |</td><td> </td><td =
class=3D"right">     \ |                         Destination EID         =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       IHL =3D =
IP-Header-Length</td><td> </td><td class=3D"right">       IHL =3D =
IP-Header-Length</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.2.  LISP =
IPv6-in-IPv6 Header Format</td><td> </td><td class=3D"right">5.2.  LISP =
IPv6-in-IPv6 Header Format</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        0         =
          1                   2                   3</td><td> </td><td =
class=3D"right">        0                   1                   2        =
           3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">        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</td><td> </td><td =
class=3D"right">        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</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0045"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version| <span class=3D"delete">Traffic Class </span>|           Flow =
Label                  |</td><td> </td><td class=3D"rblock">     / =
|Version| <span class=3D"insert">   DSCP   |ECN</span>|           Flow =
Label                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   |   |         =
Payload Length        | Next Header=3D17|   Hop Limit   |</td><td> =
</td><td class=3D"right">   |   |         Payload Length        | Next =
Header=3D17|   Hop Limit   |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   O   +          =
                                                     +</td><td> </td><td =
class=3D"right">   O   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   u   |          =
                                                     |</td><td> </td><td =
class=3D"right">   u   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   t   +          =
           Source Routing Locator                    +</td><td> </td><td =
class=3D"right">   t   +                     Source Routing Locator      =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-8" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> =
page 15, line 38<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> page 15, line =
23<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
                                                     |</td><td> </td><td =
class=3D"right">     \ |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     / |       =
Source Port =3D xxxx      |       Dest Port =3D 4341        |</td><td> =
</td><td class=3D"right">     / |       Source Port =3D xxxx      |      =
 Dest Port =3D 4341        |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
 UDP Length          |        UDP Checksum           |</td><td> </td><td =
class=3D"right">     \ |           UDP Length          |        UDP =
Checksum           |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   L   =
|N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|</td><td> </td><td class=3D"right">   L   |N|L|E|V|I|R|K|K|            =
Nonce/Map-Version                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   S / |          =
       Instance ID/Locator-Status-Bits               |</td><td> </td><td =
class=3D"right">   S / |                 Instance ID/Locator-Status-Bits =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0046"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     / =
|Version| <span class=3D"delete">Traffic Class </span>|           Flow =
Label                  |</td><td> </td><td class=3D"rblock">     / =
|Version| <span class=3D"insert">   DSCP   |ECN</span>|           Flow =
Label                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   /   |         =
Payload Length        |  Next Header  |   Hop Limit   |</td><td> =
</td><td class=3D"right">   /   |         Payload Length        |  Next =
Header  |   Hop Limit   |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I   +          =
                                                     +</td><td> </td><td =
class=3D"right">   I   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   |          =
                                                     |</td><td> </td><td =
class=3D"right">   n   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   +          =
                Source EID                           +</td><td> </td><td =
class=3D"right">   n   +                          Source EID             =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-9" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> =
page 16, line 4<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> page 15, line =
38<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   I   +          =
                                                     +</td><td> </td><td =
class=3D"right">   I   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   |          =
                                                     |</td><td> </td><td =
class=3D"right">   n   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   n   +          =
                Source EID                           +</td><td> </td><td =
class=3D"right">   n   +                          Source EID             =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   e   |          =
                                                     |</td><td> </td><td =
class=3D"right">   e   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">   H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   d   |          =
                                                     |</td><td> </td><td =
class=3D"right">   d   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   r   +          =
                                                     +</td><td> </td><td =
class=3D"right">   r   +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       |          =
                                                     |</td><td> </td><td =
class=3D"right">       |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0047"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ^   +          =
              Destination EID                        +</td><td> </td><td =
class=3D"right">   ^   +                        Destination EID          =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   \   |          =
                                                     |</td><td> </td><td =
class=3D"right">   \   |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    \  +          =
                                                     +</td><td> </td><td =
class=3D"right">    \  +                                                 =
              +</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     \ |          =
                                                     |</td><td> </td><td =
class=3D"right">     \ |                                                 =
              |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">       =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.3.  Tunnel =
Header Field Descriptions</td><td> </td><td class=3D"right">5.3.  Tunnel =
Header Field Descriptions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0048"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Inner Header =
(IH):  The inner header is the header on the datagram</td><td> </td><td =
class=3D"rblock">   Inner Header           (IH):  The inner header is =
the header on the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      received =
from the originating <span class=3D"delete">host.</span>  The source and =
destination IP</td><td> </td><td class=3D"rblock">      datagram =
received from the originating <span class=3D"insert">host [RFC0791] =
[RFC8200]</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      addresses =
are <span class=3D"delete">EIDs [RFC0791] [RFC8200].</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      [RFC2474].</span> =
 The source and destination IP addresses are <span =
class=3D"insert">EIDs.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Outer Header: =
(OH)  The outer header is a new header prepended by an</td><td> </td><td =
class=3D"right">   Outer Header: (OH)  The outer header is a new header =
prepended by an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      ITR.  The =
address fields contain RLOCs obtained from the ingress</td><td> </td><td =
class=3D"right">      ITR.  The address fields contain RLOCs obtained =
from the ingress</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      router's =
EID-to-RLOC Cache.  The IP protocol number is "UDP (17)"</td><td> =
</td><td class=3D"right">      router's EID-to-RLOC Cache.  The IP =
protocol number is "UDP (17)"</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      from =
[RFC0768].  The setting of the Don't Fragment (DF) bit</td><td> </td><td =
class=3D"right">      from [RFC0768].  The setting of the Don't Fragment =
(DF) bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      'Flags' =
field is according to rules listed in Sections 7.1 and</td><td> </td><td =
class=3D"right">      'Flags' field is according to rules listed in =
Sections 7.1 and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
7.2.</td><td> </td><td class=3D"right">      7.2.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP Header:  =
The UDP header contains an ITR selected source port when</td><td> =
</td><td class=3D"right">   UDP Header:  The UDP header contains an ITR =
selected source port when</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulating a packet.  See Section 12 for details on the hash</td><td> =
</td><td class=3D"right">      encapsulating a packet.  See Section 12 =
for details on the hash</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      algorithm =
used to select a source port based on the 5-tuple of the</td><td> =
</td><td class=3D"right">      algorithm used to select a source port =
based on the 5-tuple of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      inner =
header.  The destination port MUST be set to the well-known</td><td> =
</td><td class=3D"right">      inner header.  The destination port MUST =
be set to the well-known</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
IANA-assigned port value 4341.</td><td> </td><td class=3D"right">      =
IANA-assigned port value 4341.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   UDP Checksum:  =
The 'UDP Checksum' field SHOULD be transmitted as zero</td><td> </td><td =
class=3D"right">   UDP Checksum:  The 'UDP Checksum' field SHOULD be =
transmitted as zero</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0049"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      by an ITR =
for either IPv4 [RFC0768] <span class=3D"delete">or</span> IPv6 =
encapsulation</td><td> </td><td class=3D"rblock">      by an ITR for =
either IPv4 [RFC0768] <span class=3D"insert">and</span> IPv6 =
encapsulation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      [RFC6935] =
[RFC6936].  When a packet with a zero UDP checksum is</td><td> </td><td =
class=3D"right">      [RFC6935] [RFC6936].  When a packet with a zero =
UDP checksum is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      received by =
an ETR, the ETR MUST accept the packet for</td><td> </td><td =
class=3D"right">      received by an ETR, the ETR MUST accept the packet =
for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
decapsulation.  When an ITR transmits a non-zero value for the =
UDP</td><td> </td><td class=3D"right">      decapsulation.  When an ITR =
transmits a non-zero value for the UDP</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">      checksum, =
it MUST send a correctly computed value in this field.</td><td> </td><td =
class=3D"right">      checksum, it MUST send a correctly computed value =
in this field.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      When an ETR =
receives a packet with a non-zero UDP checksum, it MAY</td><td> </td><td =
class=3D"right">      When an ETR receives a packet with a non-zero UDP =
checksum, it MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      choose to =
verify the checksum value.  If it chooses to perform</td><td> </td><td =
class=3D"right">      choose to verify the checksum value.  If it =
chooses to perform</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      such =
verification, and the verification fails, the packet MUST be</td><td> =
</td><td class=3D"right">      such verification, and the verification =
fails, the packet MUST be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      silently =
dropped.  If the ETR chooses not to perform the</td><td> </td><td =
class=3D"right">      silently dropped.  If the ETR chooses not to =
perform the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
verification, or performs the verification successfully, the</td><td> =
</td><td class=3D"right">      verification, or performs the =
verification successfully, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      packet MUST =
be accepted for decapsulation.  The handling of UDP</td><td> </td><td =
class=3D"right">      packet MUST be accepted for decapsulation.  The =
handling of UDP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-10" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 19, line =
43<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 19, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copying the =
Time to Live (TTL) serves two purposes: first, it</td><td> </td><td =
class=3D"right">   Copying the Time to Live (TTL) serves two purposes: =
first, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   preserves the =
distance the host intended the packet to travel;</td><td> </td><td =
class=3D"right">   preserves the distance the host intended the packet =
to travel;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   second, and =
more importantly, it provides for suppression of looping</td><td> =
</td><td class=3D"right">   second, and more importantly, it provides =
for suppression of looping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets in the =
event there is a loop of concatenated tunnels due to</td><td> </td><td =
class=3D"right">   packets in the event there is a loop of concatenated =
tunnels due to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
misconfiguration.  See Section 18.3 for TTL exception handling =
for</td><td> </td><td class=3D"right">   misconfiguration.  See Section =
18.3 for TTL exception handling for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   traceroute =
packets.</td><td> </td><td class=3D"right">   traceroute =
packets.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The Explicit =
Congestion Notification ('ECN') field occupies bits 6</td><td> </td><td =
class=3D"right">   The Explicit Congestion Notification ('ECN') field =
occupies bits 6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and 7 of both =
the IPv4 'Type of Service' field and the IPv6 'Traffic</td><td> </td><td =
class=3D"right">   and 7 of both the IPv4 'Type of Service' field and =
the IPv6 'Traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Class' field =
[RFC3168].  The 'ECN' field requires special treatment</td><td> </td><td =
class=3D"right">   Class' field [RFC3168].  The 'ECN' field requires =
special treatment</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0050"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   in order to =
avoid discarding indications of congestion [RFC3168].</td><td> </td><td =
class=3D"rblock">   in order to avoid discarding indications of =
congestion [RFC3168].  <span class=3D"insert">An</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">ITR</span> encapsulation MUST copy the 2-bit 'ECN' =
field from the inner</td><td> </td><td class=3D"rblock"><span =
class=3D"insert">   ITR/PITR</span> encapsulation MUST copy the 2-bit =
'ECN' field from the inner</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header to the =
outer header.  Re-encapsulation MUST copy the 2-bit</td><td> </td><td =
class=3D"right">   header to the outer header.  Re-encapsulation MUST =
copy the 2-bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   'ECN' field =
from the stripped outer header to the new outer header.</td><td> =
</td><td class=3D"right">   'ECN' field from the stripped outer header =
to the new outer header.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   If the 'ECN' =
field contains a congestion indication codepoint (the</td><td> </td><td =
class=3D"right">   If the 'ECN' field contains a congestion indication =
codepoint (the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0051"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   value is =
'11', the Congestion Experienced (CE) codepoint), then <span =
class=3D"delete">ETR</span></td><td> </td><td class=3D"rblock">   value =
is '11', the Congestion Experienced (CE) codepoint), then <span =
class=3D"insert">ETR/</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
decapsulation MUST copy the 2-bit 'ECN' field from the stripped =
outer</td><td> </td><td class=3D"rblock"><span class=3D"insert">   =
PETR</span> decapsulation MUST copy the 2-bit 'ECN' field from the =
stripped</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   header to =
the surviving inner header that is used to forward the</td><td> </td><td =
class=3D"rblock">   outer header to the surviving inner header that is =
used to forward</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   packet =
beyond the ETR.  These requirements preserve CE indications</td><td> =
</td><td class=3D"rblock">   the packet beyond the ETR.  These =
requirements preserve CE</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   when a =
packet that uses ECN traverses a LISP tunnel and becomes</td><td> =
</td><td class=3D"rblock">   indications when a packet that uses ECN =
traverses a LISP tunnel and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   marked with =
a CE indication due to congestion between the tunnel</td><td> </td><td =
class=3D"rblock">   becomes marked with a CE indication due to =
congestion between the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
endpoints.</td><td> </td><td class=3D"rblock">   tunnel =
endpoints.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">6.  LISP =
EID-to-RLOC Map-Cache</td><td> </td><td class=3D"right">6.  LISP =
EID-to-RLOC Map-Cache</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITRs and PITRs =
maintain an on-demand cache, referred as LISP EID-to-</td><td> </td><td =
class=3D"right">   ITRs and PITRs maintain an on-demand cache, referred =
as LISP EID-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC =
Map-Cache, that contains mappings from EID-prefixes to locator</td><td> =
</td><td class=3D"right">   RLOC Map-Cache, that contains mappings from =
EID-prefixes to locator</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sets.  The =
cache is used to encapsulate packets from the EID space to</td><td> =
</td><td class=3D"right">   sets.  The cache is used to encapsulate =
packets from the EID space to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
corresponding RLOC network attachment point.</td><td> </td><td =
class=3D"right">   the corresponding RLOC network attachment =
point.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an =
ITR/PITR receives a packet from inside of the LISP site to</td><td> =
</td><td class=3D"right">   When an ITR/PITR receives a packet from =
inside of the LISP site to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destinations =
outside of the site a longest-prefix match lookup of the</td><td> =
</td><td class=3D"right">   destinations outside of the site a =
longest-prefix match lookup of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-11" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 20, line =
40<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 20, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
about EIDs and RLOCs, and uses LISP reachability</td><td> </td><td =
class=3D"right">   information about EIDs and RLOCs, and uses LISP =
reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
mechanisms to determine the reachability of RLOCs, see</td><td> </td><td =
class=3D"right">   information mechanisms to determine the reachability =
of RLOCs, see</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Section 10 for =
the specific mechanisms.</td><td> </td><td class=3D"right">   Section 10 =
for the specific mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">7.  Dealing with =
Large Encapsulated Packets</td><td> </td><td class=3D"right">7.  Dealing =
with Large Encapsulated Packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
proposes two mechanisms to deal with packets that exceed</td><td> =
</td><td class=3D"right">   This section proposes two mechanisms to deal =
with packets that exceed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the path MTU =
between the ITR and ETR.</td><td> </td><td class=3D"right">   the path =
MTU between the ITR and ETR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   It is left to =
the implementor to decide if the stateless or stateful</td><td> </td><td =
class=3D"right">   It is left to the implementor to decide if the =
stateless or stateful</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0052"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   mechanism =
<span class=3D"delete">should</span> be implemented.  Both or neither =
can be used, since</td><td> </td><td class=3D"rblock">   mechanism <span =
class=3D"insert">SHOULD</span> be implemented.  Both or neither can be =
used, since</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   it is a local =
decision in the ITR regarding how to deal with MTU</td><td> </td><td =
class=3D"right">   it is a local decision in the ITR regarding how to =
deal with MTU</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   issues, and =
sites can interoperate with differing mechanisms.</td><td> </td><td =
class=3D"right">   issues, and sites can interoperate with differing =
mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Both stateless =
and stateful mechanisms also apply to Re-encapsulating</td><td> </td><td =
class=3D"right">   Both stateless and stateful mechanisms also apply to =
Re-encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and Recursive =
Tunneling, so any actions below referring to an ITR</td><td> </td><td =
class=3D"right">   and Recursive Tunneling, so any actions below =
referring to an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   also apply to =
a TE-ITR.</td><td> </td><td class=3D"right">   also apply to a =
TE-ITR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">7.1.  A Stateless =
Solution to MTU Handling</td><td> </td><td class=3D"right">7.1.  A =
Stateless Solution to MTU Handling</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An ITR =
stateless solution to handle MTU issues is described as</td><td> =
</td><td class=3D"right">   An ITR stateless solution to handle MTU =
issues is described as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-12" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 21, line =
19<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 20, line =
49<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  Define H =
to be the size, in octets, of the outer header an ITR</td><td> </td><td =
class=3D"right">   1.  Define H to be the size, in octets, of the outer =
header an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       prepends =
to a packet.  This includes the UDP and LISP header</td><td> </td><td =
class=3D"right">       prepends to a packet.  This includes the UDP and =
LISP header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
lengths.</td><td> </td><td class=3D"right">       lengths.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  Define L =
to be the size, in octets, of the maximum-sized packet</td><td> </td><td =
class=3D"right">   2.  Define L to be the size, in octets, of the =
maximum-sized packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       an ITR can =
send to an ETR without the need for the ITR or any</td><td> </td><td =
class=3D"right">       an ITR can send to an ETR without the need for =
the ITR or any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
intermediate routers to fragment the packet.</td><td> </td><td =
class=3D"right">       intermediate routers to fragment the =
packet.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Define an =
architectural constant S for the maximum size of a</td><td> </td><td =
class=3D"right">   3.  Define an architectural constant S for the =
maximum size of a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0053"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       packet, =
in octets, an ITR <span class=3D"delete">must</span> receive from the =
source so the</td><td> </td><td class=3D"rblock">       packet, in =
octets, an ITR <span class=3D"insert">MUST</span> receive from the =
source so the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       effective =
MTU can be met.  That is, L =3D S + H.</td><td> </td><td class=3D"right"> =
      effective MTU can be met.  That is, L =3D S + H.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ITR =
receives a packet from a site-facing interface and adds H</td><td> =
</td><td class=3D"right">   When an ITR receives a packet from a =
site-facing interface and adds H</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   octets worth =
of encapsulation to yield a packet size greater than L</td><td> </td><td =
class=3D"right">   octets worth of encapsulation to yield a packet size =
greater than L</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   octets =
(meaning the received packet size was greater than S octets</td><td> =
</td><td class=3D"right">   octets (meaning the received packet size was =
greater than S octets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from the =
source), it resolves the MTU issue by first splitting the</td><td> =
</td><td class=3D"right">   from the source), it resolves the MTU issue =
by first splitting the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   original =
packet into 2 equal-sized fragments.  A LISP header is then</td><td> =
</td><td class=3D"right">   original packet into 2 equal-sized =
fragments.  A LISP header is then</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   prepended to =
each fragment.  The size of the encapsulated fragments</td><td> </td><td =
class=3D"right">   prepended to each fragment.  The size of the =
encapsulated fragments</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is then (S/2 + =
H), which is less than the ITR's estimate of the path</td><td> </td><td =
class=3D"right">   is then (S/2 + H), which is less than the ITR's =
estimate of the path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   MTU between =
the ITR and its correspondent ETR.</td><td> </td><td class=3D"right">   =
MTU between the ITR and its correspondent ETR.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-13" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 23, line =
14<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 22, line =
43<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
decapsulates a packet, the Instance ID from the LISP</td><td> </td><td =
class=3D"right">   When an ETR decapsulates a packet, the Instance ID =
from the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header is used =
as a table identifier to locate the forwarding table</td><td> </td><td =
class=3D"right">   header is used as a table identifier to locate the =
forwarding table</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to use for the =
inner destination EID lookup.</td><td> </td><td class=3D"right">   to =
use for the inner destination EID lookup.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   For example, =
an 802.1Q VLAN tag or VPN identifier could be used as a</td><td> =
</td><td class=3D"right">   For example, an 802.1Q VLAN tag or VPN =
identifier could be used as a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   24-bit =
Instance ID.  See [I-D.ietf-lisp-vpn] for LISP VPN use-case</td><td> =
</td><td class=3D"right">   24-bit Instance ID.  See [I-D.ietf-lisp-vpn] =
for LISP VPN use-case</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
details.</td><td> </td><td class=3D"right">   details.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The Instance =
ID that is stored in the mapping database when LISP-DDT</td><td> =
</td><td class=3D"right">   The Instance ID that is stored in the =
mapping database when LISP-DDT</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0054"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-ddt]</span> is used is 32 bits in =
length.  That means the</td><td> </td><td class=3D"rblock">   <span =
class=3D"insert">[RFC8111]</span> is used is 32 bits in length.  That =
means the control-plane</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
control-plane can store more instances than a given data-plane =
can</td><td> </td><td class=3D"rblock">   can store more instances than =
a given data-plane can use.  Multiple</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   use.  =
Multiple data-planes can use the same 32-bit space as long as</td><td> =
</td><td class=3D"rblock">   data-planes can use the same 32-bit space =
as long as the low-order 24</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
low-order 24 bits don't overlap among xTRs.</td><td> </td><td =
class=3D"rblock">   bits don't overlap among xTRs.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">9.  Routing =
Locator Selection</td><td> </td><td class=3D"right">9.  Routing Locator =
Selection</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0055"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Both the =
client-side and server-side <span class=3D"delete">may</span> need =
control over the</td><td> </td><td class=3D"rblock">   Both the =
client-side and server-side <span class=3D"insert">MAY</span> need =
control over the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   selection of =
RLOCs for conversations between them.  This control is</td><td> </td><td =
class=3D"right">   selection of RLOCs for conversations between them.  =
This control is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   achieved by =
manipulating the 'Priority' and 'Weight' fields in EID-</td><td> =
</td><td class=3D"right">   achieved by manipulating the 'Priority' and =
'Weight' fields in EID-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to-RLOC =
Map-Reply messages.  Alternatively, RLOC information MAY be</td><td> =
</td><td class=3D"right">   to-RLOC Map-Reply messages.  Alternatively, =
RLOC information MAY be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   gleaned from =
received tunneled packets or EID-to-RLOC Map-Request</td><td> </td><td =
class=3D"right">   gleaned from received tunneled packets or EID-to-RLOC =
Map-Request</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
messages.</td><td> </td><td class=3D"right">   messages.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The following =
are different scenarios for choosing RLOCs and the</td><td> </td><td =
class=3D"right">   The following are different scenarios for choosing =
RLOCs and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   controls that =
are available:</td><td> </td><td class=3D"right">   controls that are =
available:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
server-side returns one RLOC.  The client-side can only use</td><td> =
</td><td class=3D"right">   o  The server-side returns one RLOC.  The =
client-side can only use</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-14" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 24, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 24, line =
34<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   stored in the =
mapping database system provides reachability</td><td> </td><td =
class=3D"right">   stored in the mapping database system provides =
reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   information =
for RLOCs.  Note that reachability is not part of the</td><td> </td><td =
class=3D"right">   information for RLOCs.  Note that reachability is not =
part of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping system =
and is determined using one or more of the Routing</td><td> </td><td =
class=3D"right">   mapping system and is determined using one or more of =
the Routing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator =
reachability algorithms described in the next section.</td><td> </td><td =
class=3D"right">   Locator reachability algorithms described in the next =
section.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">10.  Routing =
Locator Reachability</td><td> </td><td class=3D"right">10.  Routing =
Locator Reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Several =
mechanisms for determining RLOC reachability are currently</td><td> =
</td><td class=3D"right">   Several mechanisms for determining RLOC =
reachability are currently</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
defined:</td><td> </td><td class=3D"right">   defined:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0056"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   1.  An ETR =
<span class=3D"delete">may</span> examine the Locator-Status-Bits in the =
LISP header of</td><td> </td><td class=3D"rblock">   1.  An ETR <span =
class=3D"insert">MAY</span> examine the Locator-Status-Bits in the LISP =
header of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       an =
encapsulated data packet received from an ITR.  If the ETR is</td><td> =
</td><td class=3D"right">       an encapsulated data packet received =
from an ITR.  If the ETR is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       also =
acting as an ITR and has traffic to return to the original</td><td> =
</td><td class=3D"right">       also acting as an ITR and has traffic to =
return to the original</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       ITR site, =
it can use this status information to help select an</td><td> </td><td =
class=3D"right">       ITR site, it can use this status information to =
help select an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
RLOC.</td><td> </td><td class=3D"right">       RLOC.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0057"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   2.  An ITR =
<span class=3D"delete">may</span> receive an ICMP Network Unreachable or =
Host</td><td> </td><td class=3D"rblock">   2.  An ITR <span =
class=3D"insert">MAY</span> receive an ICMP Network Unreachable or =
Host</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Unreachable message for an RLOC it is using.  This indicates =
that</td><td> </td><td class=3D"right">       Unreachable message for an =
RLOC it is using.  This indicates that</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">       the RLOC =
is likely down.  Note that trusting ICMP messages may</td><td> </td><td =
class=3D"right">       the RLOC is likely down.  Note that trusting ICMP =
messages may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       not be =
desirable, but neither is ignoring them completely.</td><td> </td><td =
class=3D"right">       not be desirable, but neither is ignoring them =
completely.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Implementations are encouraged to follow current best practices</td><td> =
</td><td class=3D"right">       Implementations are encouraged to follow =
current best practices</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       in =
treating these conditions.</td><td> </td><td class=3D"right">       in =
treating these conditions.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  An ITR =
that participates in the global routing system can</td><td> </td><td =
class=3D"right">   3.  An ITR that participates in the global routing =
system can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       determine =
that an RLOC is down if no BGP Routing Information Base</td><td> =
</td><td class=3D"right">       determine that an RLOC is down if no BGP =
Routing Information Base</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       (RIB) =
route exists that matches the RLOC IP address.</td><td> </td><td =
class=3D"right">       (RIB) route exists that matches the RLOC IP =
address.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0058"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   4.  An ITR =
<span class=3D"delete">may</span> receive an ICMP Port Unreachable =
message from a</td><td> </td><td class=3D"rblock">   4.  An ITR <span =
class=3D"insert">MAY</span> receive an ICMP Port Unreachable message =
from a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
destination host.  This occurs if an ITR attempts to use</td><td> =
</td><td class=3D"right">       destination host.  This occurs if an ITR =
attempts to use</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
interworking [RFC6832] and LISP-encapsulated data is sent to a</td><td> =
</td><td class=3D"right">       interworking [RFC6832] and =
LISP-encapsulated data is sent to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
non-LISP-capable site.</td><td> </td><td class=3D"right">       =
non-LISP-capable site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0059"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   5.  An ITR =
<span class=3D"delete">may</span> receive a Map-Reply from an ETR in =
response to a</td><td> </td><td class=3D"rblock">   5.  An ITR <span =
class=3D"insert">MAY</span> receive a Map-Reply from an ETR in response =
to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       previously =
sent Map-Request.  The RLOC source of the Map-Reply is</td><td> </td><td =
class=3D"right">       previously sent Map-Request.  The RLOC source of =
the Map-Reply is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       likely up, =
since the ETR was able to send the Map-Reply to the</td><td> </td><td =
class=3D"right">       likely up, since the ETR was able to send the =
Map-Reply to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
ITR.</td><td> </td><td class=3D"right">       ITR.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   6.  When an =
ETR receives an encapsulated packet from an ITR, the</td><td> </td><td =
class=3D"right">   6.  When an ETR receives an encapsulated packet from =
an ITR, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       source =
RLOC from the outer header of the packet is likely up.</td><td> </td><td =
class=3D"right">       source RLOC from the outer header of the packet =
is likely up.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  An ITR/ETR =
pair can use the Locator reachability algorithms</td><td> </td><td =
class=3D"right">   7.  An ITR/ETR pair can use the Locator reachability =
algorithms</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       described =
in this section, namely Echo-Noncing or RLOC-Probing.</td><td> </td><td =
class=3D"right">       described in this section, namely Echo-Noncing or =
RLOC-Probing.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-15" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 26, line =
17<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 26, line =
6<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
decapsulates a packet, it will check for any change in</td><td> </td><td =
class=3D"right">   When an ETR decapsulates a packet, it will check for =
any change in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
'Locator-Status-Bits' field.  When a bit goes from 1 to 0, the</td><td> =
</td><td class=3D"right">   the 'Locator-Status-Bits' field.  When a bit =
goes from 1 to 0, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ETR, if acting =
also as an ITR, will refrain from encapsulating</td><td> </td><td =
class=3D"right">   ETR, if acting also as an ITR, will refrain from =
encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets to an =
RLOC that is indicated as down.  It will only resume</td><td> </td><td =
class=3D"right">   packets to an RLOC that is indicated as down.  It =
will only resume</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   using that =
RLOC if the corresponding Locator-Status-Bit returns to a</td><td> =
</td><td class=3D"right">   using that RLOC if the corresponding =
Locator-Status-Bit returns to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   value of 1.  =
Locator-Status-Bits are associated with a Locator-Set</td><td> </td><td =
class=3D"right">   value of 1.  Locator-Status-Bits are associated with =
a Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   per =
EID-Prefix.  Therefore, when a Locator becomes unreachable, the</td><td> =
</td><td class=3D"right">   per EID-Prefix.  Therefore, when a Locator =
becomes unreachable, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Locator-Status-Bit that corresponds to that Locator's position in =
the</td><td> </td><td class=3D"right">   Locator-Status-Bit that =
corresponds to that Locator's position in the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   list returned =
by the last Map-Reply will be set to zero for that</td><td> </td><td =
class=3D"right">   list returned by the last Map-Reply will be set to =
zero for that</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0060"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   particular =
EID-Prefix.</td><td> </td><td class=3D"rblock">   particular EID-Prefix. =
 <span class=3D"insert">Refer to Section 19 for security =
related</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   issues regarding =
Locator-Status-Bits.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When ITRs at =
the site are not deployed in CE routers, the IGP can</td><td> </td><td =
class=3D"right">   When ITRs at the site are not deployed in CE routers, =
the IGP can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   still be used =
to determine the reachability of Locators, provided</td><td> </td><td =
class=3D"right">   still be used to determine the reachability of =
Locators, provided</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   they are =
injected into the IGP.  This is typically done when a /32</td><td> =
</td><td class=3D"right">   they are injected into the IGP.  This is =
typically done when a /32</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   address is =
configured on a loopback interface.</td><td> </td><td class=3D"right">   =
address is configured on a loopback interface.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When ITRs =
receive ICMP Network Unreachable or Host Unreachable</td><td> </td><td =
class=3D"right">   When ITRs receive ICMP Network Unreachable or Host =
Unreachable</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages as a =
method to determine unreachability, they will refrain</td><td> </td><td =
class=3D"right">   messages as a method to determine unreachability, =
they will refrain</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from using =
Locators that are described in Locator lists of Map-</td><td> </td><td =
class=3D"right">   from using Locators that are described in Locator =
lists of Map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Replies.  =
However, using this approach is unreliable because many</td><td> =
</td><td class=3D"right">   Replies.  However, using this approach is =
unreliable because many</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-16" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 27, line =
45<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 27, line =
36<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   E-bit cleared. =
 The ITR sees this "echoed nonce" and knows that the</td><td> </td><td =
class=3D"right">   E-bit cleared.  The ITR sees this "echoed nonce" and =
knows that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   path to and =
from the ETR is up.</td><td> </td><td class=3D"right">   path to and =
from the ETR is up.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The ITR will =
set the E-bit and N-bit for every packet it sends while</td><td> =
</td><td class=3D"right">   The ITR will set the E-bit and N-bit for =
every packet it sends while</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in the =
echo-nonce-request state.  The time the ITR waits to process</td><td> =
</td><td class=3D"right">   in the echo-nonce-request state.  The time =
the ITR waits to process</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the echoed =
nonce before it determines the path is unreachable is</td><td> </td><td =
class=3D"right">   the echoed nonce before it determines the path is =
unreachable is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   variable and =
is a choice left for the implementation.</td><td> </td><td =
class=3D"right">   variable and is a choice left for the =
implementation.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   If the ITR is =
receiving packets from the ETR but does not see the</td><td> </td><td =
class=3D"right">   If the ITR is receiving packets from the ETR but does =
not see the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   nonce echoed =
while being in the echo-nonce-request state, then the</td><td> </td><td =
class=3D"right">   nonce echoed while being in the echo-nonce-request =
state, then the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0061"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   path to the =
ETR is unreachable.  This decision <span class=3D"delete">may</span> be =
overridden by</td><td> </td><td class=3D"rblock">   path to the ETR is =
unreachable.  This decision <span class=3D"insert">MAY</span> be =
overridden by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   other Locator =
reachability algorithms.  Once the ITR determines that</td><td> </td><td =
class=3D"right">   other Locator reachability algorithms.  Once the ITR =
determines that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the path to =
the ETR is down, it can switch to another Locator for</td><td> </td><td =
class=3D"right">   the path to the ETR is down, it can switch to another =
Locator for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that =
EID-Prefix.</td><td> </td><td class=3D"right">   that =
EID-Prefix.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Note that =
"ITR" and "ETR" are relative terms here.  Both devices MUST</td><td> =
</td><td class=3D"right">   Note that "ITR" and "ETR" are relative terms =
here.  Both devices MUST</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   be =
implementing both ITR and ETR functionality for the echo nonce</td><td> =
</td><td class=3D"right">   be implementing both ITR and ETR =
functionality for the echo nonce</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mechanism to =
operate.</td><td> </td><td class=3D"right">   mechanism to =
operate.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0062"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   The ITR and =
ETR <span class=3D"delete">may</span> both go into the =
echo-nonce-request state at the</td><td> </td><td class=3D"rblock">   =
The ITR and ETR <span class=3D"insert">MAY</span> both go into the =
echo-nonce-request state at the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   same time.  =
The number of packets sent or the time during which echo</td><td> =
</td><td class=3D"right">   same time.  The number of packets sent or =
the time during which echo</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   nonce requests =
are sent is an implementation-specific setting.</td><td> </td><td =
class=3D"right">   nonce requests are sent is an implementation-specific =
setting.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   However, when =
an ITR is in the echo-nonce-request state, it can echo</td><td> </td><td =
class=3D"right">   However, when an ITR is in the echo-nonce-request =
state, it can echo</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the ETR's =
nonce in the next set of packets that it encapsulates and</td><td> =
</td><td class=3D"right">   the ETR's nonce in the next set of packets =
that it encapsulates and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   subsequently =
continue sending echo-nonce-request packets.</td><td> </td><td =
class=3D"right">   subsequently continue sending echo-nonce-request =
packets.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This mechanism =
does not completely solve the forward path</td><td> </td><td =
class=3D"right">   This mechanism does not completely solve the forward =
path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
problem, as traffic may be unidirectional.  That is, the</td><td> =
</td><td class=3D"right">   reachability problem, as traffic may be =
unidirectional.  That is, the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0063"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ETR =
receiving traffic at a site <span class=3D"delete">may</span> not be the =
same device as an ITR</td><td> </td><td class=3D"rblock">   ETR =
receiving traffic at a site <span class=3D"insert">MAY</span> not be the =
same device as an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that transmits =
traffic from that site, or the site-to-site traffic is</td><td> </td><td =
class=3D"right">   that transmits traffic from that site, or the =
site-to-site traffic is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   unidirectional =
so there is no ITR returning traffic.</td><td> </td><td class=3D"right"> =
  unidirectional so there is no ITR returning traffic.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The echo-nonce =
algorithm is bilateral.  That is, if one side sets the</td><td> </td><td =
class=3D"right">   The echo-nonce algorithm is bilateral.  That is, if =
one side sets the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   E-bit and the =
other side is not enabled for echo-noncing, then the</td><td> </td><td =
class=3D"right">   E-bit and the other side is not enabled for =
echo-noncing, then the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   echoing of the =
nonce does not occur and the requesting side may</td><td> </td><td =
class=3D"right">   echoing of the nonce does not occur and the =
requesting side may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   erroneously =
consider the Locator unreachable.  An ITR SHOULD only set</td><td> =
</td><td class=3D"right">   erroneously consider the Locator =
unreachable.  An ITR SHOULD only set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the E-bit in =
an encapsulated data packet when it knows the ETR is</td><td> </td><td =
class=3D"right">   the E-bit in an encapsulated data packet when it =
knows the ETR is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   enabled for =
echo-noncing.  This is conveyed by the E-bit in the RLOC-</td><td> =
</td><td class=3D"right">   enabled for echo-noncing.  This is conveyed =
by the E-bit in the RLOC-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   probe =
Map-Reply message.</td><td> </td><td class=3D"right">   probe Map-Reply =
message.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0064"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Note <span =
class=3D"delete">that</span> other Locator <span =
class=3D"delete">reachability</span> mechanisms <span class=3D"delete">are=
 being researched</span></td><td> </td><td class=3D"rblock">   Note =
other Locator <span class=3D"insert">Reachability</span> mechanisms can =
be used to compliment</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   and</span> can be used to compliment or even =
override the echo nonce</td><td> </td><td class=3D"rblock">   or even =
override the echo nonce algorithm.  See the next section for</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   algorithm.  =
See the next section for an example of control-plane</td><td> </td><td =
class=3D"rblock">   an example of control-plane probing.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   =
probing.</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">10.2.  =
RLOC-Probing Algorithm</td><td> </td><td class=3D"right">10.2.  =
RLOC-Probing Algorithm</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC-Probing =
is a method that an ITR or PITR can use to determine the</td><td> =
</td><td class=3D"right">   RLOC-Probing is a method that an ITR or PITR =
can use to determine the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
status of one or more Locators that it has cached in a</td><td> </td><td =
class=3D"right">   reachability status of one or more Locators that it =
has cached in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Map-Cache =
entry.  The probe-bit of the Map-Request and Map-Reply</td><td> </td><td =
class=3D"right">   Map-Cache entry.  The probe-bit of the Map-Request =
and Map-Reply</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages is =
used for RLOC-Probing.</td><td> </td><td class=3D"right">   messages is =
used for RLOC-Probing.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC-Probing =
is done in the control plane on a timer basis, where an</td><td> =
</td><td class=3D"right">   RLOC-Probing is done in the control plane on =
a timer basis, where an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR or PITR =
will originate a Map-Request destined to a locator</td><td> </td><td =
class=3D"right">   ITR or PITR will originate a Map-Request destined to =
a locator</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   address from =
one of its own locator addresses.  A Map-Request used as</td><td> =
</td><td class=3D"right">   address from one of its own locator =
addresses.  A Map-Request used as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   an RLOC-probe =
is NOT encapsulated and NOT sent to a Map-Server or to</td><td> </td><td =
class=3D"right">   an RLOC-probe is NOT encapsulated and NOT sent to a =
Map-Server or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the mapping =
database system as one would when soliciting mapping</td><td> </td><td =
class=3D"right">   the mapping database system as one would when =
soliciting mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   data.  The EID =
record encoded in the Map-Request is the EID-Prefix of</td><td> </td><td =
class=3D"right">   data.  The EID record encoded in the Map-Request is =
the EID-Prefix of</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0065"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
Map-Cache entry cached by the ITR or PITR.  The ITR <span =
class=3D"delete">may</span> include a</td><td> </td><td class=3D"rblock"> =
  the Map-Cache entry cached by the ITR or PITR.  The ITR <span =
class=3D"insert">MAY</span> include a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping data =
record for its own database mapping information that</td><td> </td><td =
class=3D"right">   mapping data record for its own database mapping =
information that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   contains the =
local EID-Prefixes and RLOCs for its site.  RLOC-probes</td><td> =
</td><td class=3D"right">   contains the local EID-Prefixes and RLOCs =
for its site.  RLOC-probes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   are sent =
periodically using a jittered timer interval.</td><td> </td><td =
class=3D"right">   are sent periodically using a jittered timer =
interval.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ETR =
receives a Map-Request message with the probe-bit set, it</td><td> =
</td><td class=3D"right">   When an ETR receives a Map-Request message =
with the probe-bit set, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   returns a =
Map-Reply with the probe-bit set.  The source address of</td><td> =
</td><td class=3D"right">   returns a Map-Reply with the probe-bit set.  =
The source address of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the Map-Reply =
is set according to the procedure described in</td><td> </td><td =
class=3D"right">   the Map-Reply is set according to the procedure =
described in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis].  The Map-Reply SHOULD contain =
mapping</td><td> </td><td class=3D"right">   [I-D.ietf-lisp-rfc6833bis]. =
 The Map-Reply SHOULD contain mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   data for the =
EID-Prefix contained in the Map-Request.  This provides</td><td> =
</td><td class=3D"right">   data for the EID-Prefix contained in the =
Map-Request.  This provides</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
opportunity for the ITR or PITR that sent the RLOC-probe to get</td><td> =
</td><td class=3D"right">   the opportunity for the ITR or PITR that =
sent the RLOC-probe to get</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-17" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 29, line =
27<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 29, line =
14<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachable or =
has become unreachable, thus providing a robust</td><td> </td><td =
class=3D"right">   reachable or has become unreachable, thus providing a =
robust</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mechanism for =
switching to using another Locator from the cached</td><td> </td><td =
class=3D"right">   mechanism for switching to using another Locator from =
the cached</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator.  =
RLOC-Probing can also provide rough Round-Trip Time (RTT)</td><td> =
</td><td class=3D"right">   Locator.  RLOC-Probing can also provide =
rough Round-Trip Time (RTT)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   estimates =
between a pair of Locators, which can be useful for network</td><td> =
</td><td class=3D"right">   estimates between a pair of Locators, which =
can be useful for network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   management =
purposes as well as for selecting low delay paths.  The</td><td> =
</td><td class=3D"right">   management purposes as well as for selecting =
low delay paths.  The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   major =
disadvantage of RLOC-Probing is in the number of control</td><td> =
</td><td class=3D"right">   major disadvantage of RLOC-Probing is in the =
number of control</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   messages =
required and the amount of bandwidth used to obtain those</td><td> =
</td><td class=3D"right">   messages required and the amount of =
bandwidth used to obtain those</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   benefits, =
especially if the requirement for failure detection times</td><td> =
</td><td class=3D"right">   benefits, especially if the requirement for =
failure detection times</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is very =
small.</td><td> </td><td class=3D"right">   is very small.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0066"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Continued research and testing will attempt to =
characterize the</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   tradeoffs of failure detection times versus message =
overhead.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">11.  EID =
Reachability within a LISP Site</td><td> </td><td class=3D"right">11.  =
EID Reachability within a LISP Site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0067"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   A site <span =
class=3D"delete">may</span> be multihomed using two or more ETRs.  The =
hosts and</td><td> </td><td class=3D"rblock">   A site <span =
class=3D"insert">MAY</span> be multihomed using two or more ETRs.  The =
hosts and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   infrastructure =
within a site will be addressed using one or more EID-</td><td> </td><td =
class=3D"right">   infrastructure within a site will be addressed using =
one or more EID-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Prefixes that =
are mapped to the RLOCs of the relevant ETRs in the</td><td> </td><td =
class=3D"right">   Prefixes that are mapped to the RLOCs of the relevant =
ETRs in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping =
system.  One possible failure mode is for an ETR to lose</td><td> =
</td><td class=3D"right">   mapping system.  One possible failure mode =
is for an ETR to lose</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reachability =
to one or more of the EID-Prefixes within its own site.</td><td> =
</td><td class=3D"right">   reachability to one or more of the =
EID-Prefixes within its own site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When this =
occurs when the ETR sends Map-Replies, it can clear the</td><td> =
</td><td class=3D"right">   When this occurs when the ETR sends =
Map-Replies, it can clear the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   R-bit =
associated with its own Locator.  And when the ETR is also an</td><td> =
</td><td class=3D"right">   R-bit associated with its own Locator.  And =
when the ETR is also an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR, it can =
clear its Locator-Status-Bit in the encapsulation data</td><td> </td><td =
class=3D"right">   ITR, it can clear its Locator-Status-Bit in the =
encapsulation data</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
header.</td><td> </td><td class=3D"right">   header.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   It is =
recognized that there are no simple solutions to the site</td><td> =
</td><td class=3D"right">   It is recognized that there are no simple =
solutions to the site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   partitioning =
problem because it is hard to know which part of the</td><td> </td><td =
class=3D"right">   partitioning problem because it is hard to know which =
part of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EID-Prefix =
range is partitioned and which Locators can reach any sub-</td><td> =
</td><td class=3D"right">   EID-Prefix range is partitioned and which =
Locators can reach any sub-</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0068"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ranges of =
the EID-Prefixes.  <span class=3D"delete">This problem is under =
investigation with</span></td><td> </td><td class=3D"rblock">   ranges =
of the EID-Prefixes.  Note that this is not a new problem</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   the expectation that experiments will tell us =
more.</span>  Note that this</td><td> </td><td class=3D"rblock">   =
introduced by the LISP architecture.  The problem exists today when =
a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   is not a new =
problem introduced by the LISP architecture.  The</td><td> </td><td =
class=3D"rblock">   multihomed site uses BGP to advertise its =
reachability upstream.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   problem =
exists today when a multihomed site uses BGP to advertise its</td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   reachability =
upstream.</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">12.  Routing =
Locator Hashing</td><td> </td><td class=3D"right">12.  Routing Locator =
Hashing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0069"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   When an ETR =
provides an EID-to-RLOC mapping in a Map-Reply message <span =
class=3D"delete">to</span></td><td> </td><td class=3D"rblock">   When an =
ETR provides an EID-to-RLOC mapping in a Map-Reply message</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   a requesting =
ITR, the Locator-Set for the EID-Prefix <span class=3D"delete">may</span> =
contain</td><td> </td><td class=3D"rblock">   <span class=3D"insert">that =
is stored in the map-cache of</span> a requesting ITR, the =
Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   different =
Priority values for each locator address.  When more than</td><td> =
</td><td class=3D"rblock">   for the EID-Prefix <span =
class=3D"insert">MAY</span> contain different Priority <span =
class=3D"insert">and Weight</span> values</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   one best =
Priority Locator exists, the ITR can decide how to <span =
class=3D"delete">load-</span></td><td> </td><td class=3D"rblock">   for =
each locator address.  When more than one best Priority Locator</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   share</span> traffic against the corresponding =
Locators.</td><td> </td><td class=3D"rblock">   exists, the ITR can =
decide how to <span class=3D"insert">load-share</span> traffic against =
the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   corresponding Locators.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0070"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   The =
following hash algorithm <span class=3D"delete">may</span> be used by an =
ITR to select a</td><td> </td><td class=3D"rblock">   The following hash =
algorithm <span class=3D"insert">MAY</span> be used by an ITR to select =
a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator for a =
packet destined to an EID for the EID-to-RLOC mapping:</td><td> </td><td =
class=3D"right">   Locator for a packet destined to an EID for the =
EID-to-RLOC mapping:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  Either a =
source and destination address hash or the traditional</td><td> </td><td =
class=3D"right">   1.  Either a source and destination address hash or =
the traditional</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       5-tuple =
hash can be used.  The traditional 5-tuple hash includes</td><td> =
</td><td class=3D"right">       5-tuple hash can be used.  The =
traditional 5-tuple hash includes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the source =
and destination addresses; source and destination TCP,</td><td> </td><td =
class=3D"right">       the source and destination addresses; source and =
destination TCP,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       UDP, or =
Stream Control Transmission Protocol (SCTP) port numbers;</td><td> =
</td><td class=3D"right">       UDP, or Stream Control Transmission =
Protocol (SCTP) port numbers;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       and the IP =
protocol number field or IPv6 next-protocol fields of</td><td> </td><td =
class=3D"right">       and the IP protocol number field or IPv6 =
next-protocol fields of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       a packet =
that a host originates from within a LISP site.  When a</td><td> =
</td><td class=3D"right">       a packet that a host originates from =
within a LISP site.  When a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       packet is =
not a TCP, UDP, or SCTP packet, the source and</td><td> </td><td =
class=3D"right">       packet is not a TCP, UDP, or SCTP packet, the =
source and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
destination addresses only from the header are used to compute</td><td> =
</td><td class=3D"right">       destination addresses only from the =
header are used to compute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-18" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 34, line =
6<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 33, line =
30<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Replies.  To =
avoid Map-Cache entry corruption by a third party, a</td><td> </td><td =
class=3D"right">   Replies.  To avoid Map-Cache entry corruption by a =
third party, a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sender of an =
SMR-based Map-Request MUST be verified.  If an ITR</td><td> </td><td =
class=3D"right">   sender of an SMR-based Map-Request MUST be verified.  =
If an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   receives an =
SMR-based Map-Request and the source is not in the</td><td> </td><td =
class=3D"right">   receives an SMR-based Map-Request and the source is =
not in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Locator-Set =
for the stored Map-Cache entry, then the responding Map-</td><td> =
</td><td class=3D"right">   Locator-Set for the stored Map-Cache entry, =
then the responding Map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Request MUST =
be sent with an EID destination to the mapping database</td><td> =
</td><td class=3D"right">   Request MUST be sent with an EID destination =
to the mapping database</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   system.  Since =
the mapping database system is a more secure way to</td><td> </td><td =
class=3D"right">   system.  Since the mapping database system is a more =
secure way to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   reach an =
authoritative ETR, it will deliver the Map-Request to the</td><td> =
</td><td class=3D"right">   reach an authoritative ETR, it will deliver =
the Map-Request to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   authoritative =
source of the mapping data.</td><td> </td><td class=3D"right">   =
authoritative source of the mapping data.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an ITR =
receives an SMR-based Map-Request for which it does not</td><td> =
</td><td class=3D"right">   When an ITR receives an SMR-based =
Map-Request for which it does not</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0071"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   have a =
cached mapping for the EID in the SMR message, it <span =
class=3D"delete">MAY</span> not send</td><td> </td><td class=3D"rblock"> =
  have a cached mapping for the EID in the SMR message, it <span =
class=3D"insert">may</span> not send</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   an SMR-invoked =
Map-Request.  This scenario can occur when an ETR</td><td> </td><td =
class=3D"right">   an SMR-invoked Map-Request.  This scenario can occur =
when an ETR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sends SMR =
messages to all Locators in the Locator-Set it has stored</td><td> =
</td><td class=3D"right">   sends SMR messages to all Locators in the =
Locator-Set it has stored</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in its =
map-cache but the remote ITRs that receive the SMR may not be</td><td> =
</td><td class=3D"right">   in its map-cache but the remote ITRs that =
receive the SMR may not be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sending =
packets to the site.  There is no point in updating the ITRs</td><td> =
</td><td class=3D"right">   sending packets to the site.  There is no =
point in updating the ITRs</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   until they =
need to send, in which case they will send Map-Requests to</td><td> =
</td><td class=3D"right">   until they need to send, in which case they =
will send Map-Requests to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   obtain a =
Map-Cache entry.</td><td> </td><td class=3D"right">   obtain a Map-Cache =
entry.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">13.3.  Database =
Map-Versioning</td><td> </td><td class=3D"right">13.3.  Database =
Map-Versioning</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When there is =
unidirectional packet flow between an ITR and ETR, and</td><td> </td><td =
class=3D"right">   When there is unidirectional packet flow between an =
ITR and ETR, and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-19" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 35, line =
52<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 35, line =
26<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   few =
implementation techniques can be used to incrementally =
implement</td><td> </td><td class=3D"right">   few implementation =
techniques can be used to incrementally implement</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP:</td><td> =
</td><td class=3D"right">   LISP:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  When a =
tunnel-encapsulated packet is received by an ETR, the outer</td><td> =
</td><td class=3D"right">   o  When a tunnel-encapsulated packet is =
received by an ETR, the outer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
address may not be the address of the router.  This</td><td> </td><td =
class=3D"right">      destination address may not be the address of the =
router.  This</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      makes it =
challenging for the control plane to get packets from the</td><td> =
</td><td class=3D"right">      makes it challenging for the control =
plane to get packets from the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hardware.  =
This may be mitigated by creating special Forwarding</td><td> </td><td =
class=3D"right">      hardware.  This may be mitigated by creating =
special Forwarding</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Information =
Base (FIB) entries for the EID-Prefixes of EIDs served</td><td> </td><td =
class=3D"right">      Information Base (FIB) entries for the =
EID-Prefixes of EIDs served</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      by the ETR =
(those for which the router provides an RLOC</td><td> </td><td =
class=3D"right">      by the ETR (those for which the router provides an =
RLOC</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
translation).  These FIB entries are marked with a flag =
indicating</td><td> </td><td class=3D"right">      translation).  These =
FIB entries are marked with a flag indicating</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0072"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      that =
control-plane processing <span class=3D"delete">should</span> be =
performed.  The forwarding</td><td> </td><td class=3D"rblock">      that =
control-plane processing <span class=3D"insert">SHOULD</span> be =
performed.  The forwarding</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      logic of =
testing for particular IP protocol number values is not</td><td> =
</td><td class=3D"right">      logic of testing for particular IP =
protocol number values is not</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      necessary.  =
There are a few proven cases where no changes to</td><td> </td><td =
class=3D"right">      necessary.  There are a few proven cases where no =
changes to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      existing =
deployed hardware were needed to support the LISP data-</td><td> =
</td><td class=3D"right">      existing deployed hardware were needed to =
support the LISP data-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
plane.</td><td> </td><td class=3D"right">      plane.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  On an ITR, =
prepending a new IP header consists of adding more</td><td> </td><td =
class=3D"right">   o  On an ITR, prepending a new IP header consists of =
adding more</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      octets to a =
MAC rewrite string and prepending the string as part</td><td> </td><td =
class=3D"right">      octets to a MAC rewrite string and prepending the =
string as part</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of the =
outgoing encapsulation procedure.  Routers that support</td><td> =
</td><td class=3D"right">      of the outgoing encapsulation procedure.  =
Routers that support</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Generic =
Routing Encapsulation (GRE) tunneling [RFC2784] or 6to4</td><td> =
</td><td class=3D"right">      Generic Routing Encapsulation (GRE) =
tunneling [RFC2784] or 6to4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      tunneling =
[RFC3056] may already support this action.</td><td> </td><td =
class=3D"right">      tunneling [RFC3056] may already support this =
action.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-20" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 38, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 37, line =
40<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">17.  LISP xTR =
Placement and Encapsulation Methods</td><td> </td><td class=3D"right">17. =
 LISP xTR Placement and Encapsulation Methods</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
will explore how and where ITRs and ETRs can be placed</td><td> </td><td =
class=3D"right">   This section will explore how and where ITRs and ETRs =
can be placed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in the network =
and will discuss the pros and cons of each scenario.</td><td> </td><td =
class=3D"right">   in the network and will discuss the pros and cons of =
each scenario.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   For a more =
detailed networkd design deployment recommendation, refer</td><td> =
</td><td class=3D"right">   For a more detailed networkd design =
deployment recommendation, refer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to =
[RFC7215].</td><td> </td><td class=3D"right">   to [RFC7215].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   There are two =
basic deployment tradeoffs to consider: centralized</td><td> </td><td =
class=3D"right">   There are two basic deployment tradeoffs to consider: =
centralized</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   versus =
distributed caches; and flat, Recursive, or Re-encapsulating</td><td> =
</td><td class=3D"right">   versus distributed caches; and flat, =
Recursive, or Re-encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tunneling.  =
When deciding on centralized versus distributed caching,</td><td> =
</td><td class=3D"right">   Tunneling.  When deciding on centralized =
versus distributed caching,</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0073"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
following issues <span class=3D"delete">should</span> be =
considered:</td><td> </td><td class=3D"rblock">   the following issues =
<span class=3D"insert">SHOULD</span> be considered:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Are the =
xTRs spread out so that the caches are spread across all</td><td> =
</td><td class=3D"right">   o  Are the xTRs spread out so that the =
caches are spread across all</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the =
memories of each router?  A centralized cache is when an ITR</td><td> =
</td><td class=3D"right">      the memories of each router?  A =
centralized cache is when an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      keeps a =
cache for all the EIDs it is encapsulating to.  The packet</td><td> =
</td><td class=3D"right">      keeps a cache for all the EIDs it is =
encapsulating to.  The packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      takes a =
direct path to the destination Locator.  A distributed</td><td> </td><td =
class=3D"right">      takes a direct path to the destination Locator.  A =
distributed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      cache is =
when an ITR needs help from other Re-Encapsulating Tunnel</td><td> =
</td><td class=3D"right">      cache is when an ITR needs help from =
other Re-Encapsulating Tunnel</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Routers =
(RTRs) because it does not store all the cache entries for</td><td> =
</td><td class=3D"right">      Routers (RTRs) because it does not store =
all the cache entries for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the EIDs it =
is encapsulating to.  So, the packet takes a path</td><td> </td><td =
class=3D"right">      the EIDs it is encapsulating to.  So, the packet =
takes a path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      through =
RTRs that have a different set of cache entries.</td><td> </td><td =
class=3D"right">      through RTRs that have a different set of cache =
entries.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Should =
management "touch points" be minimized by only choosing a</td><td> =
</td><td class=3D"right">   o  Should management "touch points" be =
minimized by only choosing a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      few xTRs, =
just enough for redundancy?</td><td> </td><td class=3D"right">      few =
xTRs, just enough for redundancy?</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  In general, =
using more ITRs doesn't increase management load,</td><td> </td><td =
class=3D"right">   o  In general, using more ITRs doesn't increase =
management load,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      since =
caches are built and stored dynamically.  On the other hand,</td><td> =
</td><td class=3D"right">      since caches are built and stored =
dynamically.  On the other hand,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      using more =
ETRs does require more management, since EID-Prefix-to-</td><td> =
</td><td class=3D"right">      using more ETRs does require more =
management, since EID-Prefix-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      RLOC =
mappings need to be explicitly configured.</td><td> </td><td =
class=3D"right">      RLOC mappings need to be explicitly =
configured.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When deciding =
on flat, Recursive, or Re-Encapsulating Tunneling, the</td><td> </td><td =
class=3D"right">   When deciding on flat, Recursive, or Re-Encapsulating =
Tunneling, the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0074"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   following =
issues <span class=3D"delete">should</span> be considered:</td><td> =
</td><td class=3D"rblock">   following issues <span =
class=3D"insert">SHOULD</span> be considered:</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Flat =
tunneling implements a single encapsulation path between the</td><td> =
</td><td class=3D"right">   o  Flat tunneling implements a single =
encapsulation path between the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      source site =
and destination site.  This generally offers better</td><td> </td><td =
class=3D"right">      source site and destination site.  This generally =
offers better</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      paths =
between sources and destinations with a single encapsulation</td><td> =
</td><td class=3D"right">      paths between sources and destinations =
with a single encapsulation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
path.</td><td> </td><td class=3D"right">      path.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recursive =
Tunneling is when encapsulated traffic is again further</td><td> =
</td><td class=3D"right">   o  Recursive Tunneling is when encapsulated =
traffic is again further</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulated in another tunnel, either to implement VPNs or to</td><td> =
</td><td class=3D"right">      encapsulated in another tunnel, either to =
implement VPNs or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      perform =
Traffic Engineering.  When doing VPN-based tunneling, the</td><td> =
</td><td class=3D"right">      perform Traffic Engineering.  When doing =
VPN-based tunneling, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      site has =
some control, since the site is prepending a new</td><td> </td><td =
class=3D"right">      site has some control, since the site is =
prepending a new</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulation header.  In the case of TE-based tunneling, the =
site</td><td> </td><td class=3D"right">      encapsulation header.  In =
the case of TE-based tunneling, the site</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0075"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">may</span> have control if it is prepending a new =
tunnel header, but if</td><td> </td><td class=3D"rblock">      <span =
class=3D"insert">MAY</span> have control if it is prepending a new =
tunnel header, but if</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the site's =
ISP is doing the TE, then the site has no control.</td><td> </td><td =
class=3D"right">      the site's ISP is doing the TE, then the site has =
no control.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Recursive =
Tunneling generally will result in suboptimal paths but</td><td> =
</td><td class=3D"right">      Recursive Tunneling generally will result =
in suboptimal paths but</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      with the =
benefit of steering traffic to parts of the network that</td><td> =
</td><td class=3D"right">      with the benefit of steering traffic to =
parts of the network that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      have more =
resources available.</td><td> </td><td class=3D"right">      have more =
resources available.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
technique of Re-Encapsulation ensures that packets only</td><td> =
</td><td class=3D"right">   o  The technique of Re-Encapsulation ensures =
that packets only</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      require one =
encapsulation header.  So, if a packet needs to be re-</td><td> </td><td =
class=3D"right">      require one encapsulation header.  So, if a packet =
needs to be re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      routed, it =
is first decapsulated by the RTR and then Re-</td><td> </td><td =
class=3D"right">      routed, it is first decapsulated by the RTR and =
then Re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Encapsulated with a new encapsulation header using a new RLOC.</td><td> =
</td><td class=3D"right">      Encapsulated with a new encapsulation =
header using a new RLOC.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-21" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 41, line =
12<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 40, line =
36<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   addresses MUST =
be used only in the outer IP header so the NAT device</td><td> </td><td =
class=3D"right">   addresses MUST be used only in the outer IP header so =
the NAT device</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   can translate =
properly.  Otherwise, EID addresses MUST be translated</td><td> </td><td =
class=3D"right">   can translate properly.  Otherwise, EID addresses =
MUST be translated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   before =
encapsulation is performed when LISP VPNs are not in use.</td><td> =
</td><td class=3D"right">   before encapsulation is performed when LISP =
VPNs are not in use.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Both NAT =
translation and LISP encapsulation functions could be co-</td><td> =
</td><td class=3D"right">   Both NAT translation and LISP encapsulation =
functions could be co-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   located in the =
same device.</td><td> </td><td class=3D"right">   located in the same =
device.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">17.5.  Packets =
Egressing a LISP Site</td><td> </td><td class=3D"right">17.5.  Packets =
Egressing a LISP Site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When a LISP =
site is using two ITRs for redundancy, the failure of one</td><td> =
</td><td class=3D"right">   When a LISP site is using two ITRs for =
redundancy, the failure of one</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITR will =
likely shift outbound traffic to the second.  This second</td><td> =
</td><td class=3D"right">   ITR will likely shift outbound traffic to =
the second.  This second</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0076"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   ITR's cache =
<span class=3D"delete">may</span> not be populated with the same =
EID-to-RLOC mapping</td><td> </td><td class=3D"rblock">   ITR's cache =
<span class=3D"insert">MAY</span> not be populated with the same =
EID-to-RLOC mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   entries as the =
first.  If this second ITR does not have these</td><td> </td><td =
class=3D"right">   entries as the first.  If this second ITR does not =
have these</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mappings, =
traffic will be dropped while the mappings are retrieved</td><td> =
</td><td class=3D"right">   mappings, traffic will be dropped while the =
mappings are retrieved</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   from the =
mapping system.  The retrieval of these messages may</td><td> </td><td =
class=3D"right">   from the mapping system.  The retrieval of these =
messages may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   increase the =
load of requests being sent into the mapping system.</td><td> </td><td =
class=3D"right">   increase the load of requests being sent into the =
mapping system.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">18.  Traceroute =
Considerations</td><td> </td><td class=3D"right">18.  Traceroute =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When a source =
host in a LISP site initiates a traceroute to a</td><td> </td><td =
class=3D"right">   When a source host in a LISP site initiates a =
traceroute to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destination =
host in another LISP site, it is highly desirable for it</td><td> =
</td><td class=3D"right">   destination host in another LISP site, it is =
highly desirable for it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to see the =
entire path.  Since packets are encapsulated from the ITR</td><td> =
</td><td class=3D"right">   to see the entire path.  Since packets are =
encapsulated from the ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-22" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 44, line =
16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 43, line =
42<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Map-Versioning =
is a data-plane mechanism used to signal a peering xTR</td><td> </td><td =
class=3D"right">   Map-Versioning is a data-plane mechanism used to =
signal a peering xTR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   that a local =
EID-to-RLOC mapping has been updated, so that the</td><td> </td><td =
class=3D"right">   that a local EID-to-RLOC mapping has been updated, so =
that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   peering xTR =
uses LISP Control-Plane signaling message to retrieve a</td><td> =
</td><td class=3D"right">   peering xTR uses LISP Control-Plane =
signaling message to retrieve a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fresh mapping. =
 This can be used by an attacker to forge the map-</td><td> </td><td =
class=3D"right">   fresh mapping.  This can be used by an attacker to =
forge the map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   versioning =
field of a LISP encapsulated header and force an excessive</td><td> =
</td><td class=3D"right">   versioning field of a LISP encapsulated =
header and force an excessive</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   amount of =
signaling between xTRs that may overload them.</td><td> </td><td =
class=3D"right">   amount of signaling between xTRs that may overload =
them.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Most of the =
attack vectors can be mitigated with careful deployment</td><td> =
</td><td class=3D"right">   Most of the attack vectors can be mitigated =
with careful deployment</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and =
configuration, information learned opportunistically (such as =
LSB</td><td> </td><td class=3D"right">   and configuration, information =
learned opportunistically (such as LSB</td><td class=3D"lineno"></td></tr>=

      <tr id=3D"diff0077"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   or gleaning) =
<span class=3D"delete">should</span> be verified with other reachability =
mechanisms.</td><td> </td><td class=3D"rblock">   or gleaning) <span =
class=3D"insert">SHOULD</span> be verified with other reachability =
mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   In addition, =
systematic rate-limitation and filtering is an effective</td><td> =
</td><td class=3D"right">   In addition, systematic rate-limitation and =
filtering is an effective</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   technique to =
mitigate attacks that aim to overload the control-plane.</td><td> =
</td><td class=3D"right">   technique to mitigate attacks that aim to =
overload the control-plane.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">20.  Network =
Management Considerations</td><td> </td><td class=3D"right">20.  Network =
Management Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Considerations =
for network management tools exist so the LISP</td><td> </td><td =
class=3D"right">   Considerations for network management tools exist so =
the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   protocol suite =
can be operationally managed.  These mechanisms can be</td><td> </td><td =
class=3D"right">   protocol suite can be operationally managed.  These =
mechanisms can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   found in =
[RFC7052] and [RFC6835].</td><td> </td><td class=3D"right">   found in =
[RFC7052] and [RFC6835].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.  IANA =
Considerations</td><td> </td><td class=3D"right">21.  IANA =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
provides guidance to the Internet Assigned Numbers</td><td> </td><td =
class=3D"right">   This section provides guidance to the Internet =
Assigned Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Authority =
(IANA) regarding registration of values related to this</td><td> =
</td><td class=3D"right">   Authority (IANA) regarding registration of =
values related to this</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0078"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   data-plane =
LISP specification, in accordance with BCP 26 [RFC<span =
class=3D"delete">52</span>26].</td><td> </td><td class=3D"rblock">   =
data-plane LISP specification, in accordance with BCP 26 [RFC<span =
class=3D"insert">81</span>26].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.1.  LISP UDP =
Port Numbers</td><td> </td><td class=3D"right">21.1.  LISP UDP Port =
Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The IANA =
registry has allocated UDP port numbers 4341 and 4342 for</td><td> =
</td><td class=3D"right">   The IANA registry has allocated UDP port =
numbers 4341 and 4342 for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   lisp-data and =
lisp-control operation, respectively.  IANA has updated</td><td> =
</td><td class=3D"right">   lisp-data and lisp-control operation, =
respectively.  IANA has updated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
description for UDP ports 4341 and 4342 as follows:</td><td> </td><td =
class=3D"right">   the description for UDP ports 4341 and 4342 as =
follows:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       lisp-data  =
    4341 udp    LISP Data Packets</td><td> </td><td class=3D"right">     =
  lisp-data      4341 udp    LISP Data Packets</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
lisp-control   4342 udp    LISP Control Packets</td><td> </td><td =
class=3D"right">       lisp-control   4342 udp    LISP Control =
Packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.  =
References</td><td> </td><td class=3D"right">22.  References</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.1.  Normative =
References</td><td> </td><td class=3D"right">22.1.  Normative =
References</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0079"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-ddt]</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Fuller, V., Lewis, D., Ermagan, V., Jain, =
A., and A.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Smirnov, "LISP Delegated Database Tree", =
draft-ietf-lisp-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              ddt-09 (work in progress), January =
2017.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [I-D.ietf-lisp-introduction]</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Cabellos-Aparicio, A. and D. Saucez, "An =
Architectural</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Introduction to the Locator/ID Separation =
Protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (LISP)", draft-ietf-lisp-introduction-13 =
(work in</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              progress), April 2015.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,</td><td> </td><td =
class=3D"right">              Fuller, V., Farinacci, D., and A. =
Cabellos-Aparicio,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Locator/ID Separation Protocol (LISP) Control-Plane",</td><td> </td><td =
class=3D"right">              "Locator/ID Separation Protocol (LISP) =
Control-Plane",</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0080"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
draft-ietf-lisp-rfc6833bis-0<span class=3D"delete">6 (work in progress), =
Octo</span>ber</td><td> </td><td class=3D"rblock">              =
draft-ietf-lisp-rfc6833bis-0<span class=3D"insert">7 (work in progress), =
Decem</span>ber</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2017.</td><td> </td><td class=3D"right">              2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0081"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[I-D.ietf-lisp-sec]</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Maino, F., Ermagan, V., =
Cabellos-Aparicio, A., and D.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Saucez, "LISP-Security (LISP-SEC)", =
draft-ietf-lisp-sec-14</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (work in progress), October =
2017.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC0768]  =
Postel, J., "User Datagram Protocol", STD 6, RFC 768,</td><td> </td><td =
class=3D"right">   [RFC0768]  Postel, J., "User Datagram Protocol", STD =
6, RFC 768,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC0768, August 1980,</td><td> </td><td class=3D"right">        =
      DOI 10.17487/RFC0768, August 1980,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc768&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc768&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC0791]  =
Postel, J., "Internet Protocol", STD 5, RFC 791,</td><td> </td><td =
class=3D"right">   [RFC0791]  Postel, J., "Internet Protocol", STD 5, =
RFC 791,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC0791, September 1981,</td><td> </td><td class=3D"right">     =
         DOI 10.17487/RFC0791, September 1981,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc791&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc791&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC1918]  =
Rekhter, Y., Moskowitz, B., Karrenberg, D., de Groot, G.,</td><td> =
</td><td class=3D"right">   [RFC1918]  Rekhter, Y., Moskowitz, B., =
Karrenberg, D., de Groot, G.,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              and =
E. Lear, "Address Allocation for Private Internets",</td><td> </td><td =
class=3D"right">              and E. Lear, "Address Allocation for =
Private Internets",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              BCP =
5, RFC 1918, DOI 10.17487/RFC1918, February 1996,</td><td> </td><td =
class=3D"right">              BCP 5, RFC 1918, DOI 10.17487/RFC1918, =
February 1996,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc1918&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc1918&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC2119]  =
Bradner, S., "Key words for use in RFCs to Indicate</td><td> </td><td =
class=3D"right">   [RFC2119]  Bradner, S., "Key words for use in RFCs to =
Indicate</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Requirement Levels", BCP 14, RFC 2119,</td><td> </td><td class=3D"right"> =
             Requirement Levels", BCP 14, RFC 2119,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC2119, March 1997,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC2119, March 1997,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc2119&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc2119&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0082"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC2404]  Madson, C.</span> and <span =
class=3D"delete">R. Glenn, "The Use</span> of <span =
class=3D"delete">HMAC-SHA-1-96 within</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">[RFC2474]  Nichols, K., =
Blake, S., Baker, F.,</span> and <span class=3D"insert">D. =
Black,</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              ESP</span> and <span =
class=3D"delete">AH",</span> RFC <span class=3D"delete">2404,</span> DOI =
<span class=3D"delete">10.17487/RFC2404, November</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
"Definition</span> of <span class=3D"insert">the Differentiated Services =
Field (DS</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
1998, <span =
class=3D"delete">&lt;https://www.rfc-editor.org/info/rfc2404&gt;.</span></=
td><td> </td><td class=3D"rblock"><span class=3D"insert">              =
Field) in the IPv4</span> and <span class=3D"insert">IPv6 =
Headers",</span> RFC <span class=3D"insert">2474,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">              DOI <span =
class=3D"insert">10.17487/RFC2474, December</span> 1998,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">              <span =
class=3D"insert">&lt;https://www.rfc-editor.org/info/rfc2474&gt;.</span></=
td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3168]  =
Ramakrishnan, K., Floyd, S., and D. Black, "The Addition</td><td> =
</td><td class=3D"right">   [RFC3168]  Ramakrishnan, K., Floyd, S., and =
D. Black, "The Addition</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              of =
Explicit Congestion Notification (ECN) to IP",</td><td> </td><td =
class=3D"right">              of Explicit Congestion Notification (ECN) =
to IP",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
3168, DOI 10.17487/RFC3168, September 2001,</td><td> </td><td =
class=3D"right">              RFC 3168, DOI 10.17487/RFC3168, September =
2001,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc3168&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc3168&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0083"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC3232]  Reynolds, J., Ed., "Assigned Numbers: RFC =
1700 is Replaced</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              by an On-line Database", RFC 3232, DOI =
10.17487/RFC3232,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              January 2002, =
&lt;https://www.rfc-editor.org/info/rfc3232&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4086]  =
Eastlake 3rd, D., Schiller, J., and S. Crocker,</td><td> </td><td =
class=3D"right">   [RFC4086]  Eastlake 3rd, D., Schiller, J., and S. =
Crocker,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Randomness Requirements for Security", BCP 106, RFC 4086,</td><td> =
</td><td class=3D"right">              "Randomness Requirements for =
Security", BCP 106, RFC 4086,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4086, June 2005,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC4086, June 2005,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4086&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4086&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4632]  =
Fuller, V. and T. Li, "Classless Inter-domain Routing</td><td> </td><td =
class=3D"right">   [RFC4632]  Fuller, V. and T. Li, "Classless =
Inter-domain Routing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(CIDR): The Internet Address Assignment and Aggregation</td><td> =
</td><td class=3D"right">              (CIDR): The Internet Address =
Assignment and Aggregation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Plan", BCP 122, RFC 4632, DOI 10.17487/RFC4632, August</td><td> </td><td =
class=3D"right">              Plan", BCP 122, RFC 4632, DOI =
10.17487/RFC4632, August</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2006, &lt;https://www.rfc-editor.org/info/rfc4632&gt;.</td><td> </td><td =
class=3D"right">              2006, =
&lt;https://www.rfc-editor.org/info/rfc4632&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0084"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC4868]  Kelly, S. and S. Frankel, "Using =
HMAC-SHA-256, HMAC-SHA-</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              384, and HMAC-SHA-512 with IPsec", RFC =
4868,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC4868, May =
2007,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc4868&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC5226]  Narten, T. and H. Alvestrand, "Guidelines =
for Writing an</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              IANA Considerations Section in RFCs", RFC =
5226,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC5226, May =
2008,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc5226&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC5496]  Wijnands, IJ., Boers, A., and E. Rosen, =
"The Reverse Path</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Forwarding (RPF) Vector TLV", RFC =
5496,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC5496, March =
2009,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc5496&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC5944]  =
Perkins, C., Ed., "IP Mobility Support for IPv4, Revised",</td><td> =
</td><td class=3D"right">   [RFC5944]  Perkins, C., Ed., "IP Mobility =
Support for IPv4, Revised",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
5944, DOI 10.17487/RFC5944, November 2010,</td><td> </td><td =
class=3D"right">              RFC 5944, DOI 10.17487/RFC5944, November =
2010,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc5944&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc5944&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0085"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6115]  Li, T., Ed., "Recommendation for a Routing =
Architecture",</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              RFC 6115, DOI 10.17487/RFC6115, February =
2011,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6115&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6275]  =
Perkins, C., Ed., Johnson, D., and J. Arkko, "Mobility</td><td> </td><td =
class=3D"right">   [RFC6275]  Perkins, C., Ed., Johnson, D., and J. =
Arkko, "Mobility</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Support in IPv6", RFC 6275, DOI 10.17487/RFC6275, July</td><td> </td><td =
class=3D"right">              Support in IPv6", RFC 6275, DOI =
10.17487/RFC6275, July</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2011, &lt;https://www.rfc-editor.org/info/rfc6275&gt;.</td><td> </td><td =
class=3D"right">              2011, =
&lt;https://www.rfc-editor.org/info/rfc6275&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0086"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6834]  Iannone, L., Saucez, D., and O. Bonaventure, =
"Locator/ID</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) =
Map-Versioning", RFC 6834,</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6834, January =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6834&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC6836]  Fuller, V., Farinacci, D., Meyer, D., and =
D. Lewis,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              "Locator/ID Separation Protocol =
Alternative Logical</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Topology (LISP+ALT)", RFC 6836, DOI =
10.17487/RFC6836,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              January 2013, =
&lt;https://www.rfc-editor.org/info/rfc6836&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7052]  Schudel, G., Jain, A., and V. Moreno, =
"Locator/ID</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) MIB", RFC =
7052,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC7052, October =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7052&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7214]  Andersson, L. and C. Pignataro, "Moving =
Generic Associated</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Channel (G-ACh) IANA Registries to a New =
Registry",</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              RFC 7214, DOI 10.17487/RFC7214, May =
2014,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7214&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC7215]  Jakab, L., Cabellos-Aparicio, A., Coras, =
F., Domingo-</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Pascual, J., and D. Lewis, =
"Locator/Identifier Separation</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Protocol (LISP) Network Element =
Deployment</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Considerations", RFC 7215, DOI =
10.17487/RFC7215, April</span></td><td> </td><td class=3D"rblock"></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              2014, =
&lt;https://www.rfc-editor.org/info/rfc7215&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC7833]  =
Howlett, J., Hartman, S., and A. Perez-Mendez, Ed., "A</td><td> </td><td =
class=3D"right">   [RFC7833]  Howlett, J., Hartman, S., and A. =
Perez-Mendez, Ed., "A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
RADIUS Attribute, Binding, Profiles, Name Identifier</td><td> </td><td =
class=3D"right">              RADIUS Attribute, Binding, Profiles, Name =
Identifier</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Format, and Confirmation Methods for the Security</td><td> </td><td =
class=3D"right">              Format, and Confirmation Methods for the =
Security</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Assertion Markup Language (SAML)", RFC 7833,</td><td> </td><td =
class=3D"right">              Assertion Markup Language (SAML)", RFC =
7833,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC7833, May 2016,</td><td> </td><td class=3D"right">           =
   DOI 10.17487/RFC7833, May 2016,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc7833&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc7833&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0087"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC7835]  Saucez, D., Iannone, L.,</span> and <span =
class=3D"delete">O. Bonaventure, "Locator/ID</span></td><td> </td><td =
class=3D"rblock">   <span class=3D"insert">[RFC8126]  Cotton, M., Leiba, =
B.,</span> and <span class=3D"insert">T. Narten, "Guidelines =
for</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Separation Protocol (LISP) Threat =
Analysis",</span> RFC <span class=3D"delete">7835,</span></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Writing =
an IANA Considerations Section in RFCs", BCP 26,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
DOI <span class=3D"delete">10.17487/RFC7835, April 2016,</span></td><td> =
</td><td class=3D"rblock">              RFC <span =
class=3D"insert">8126,</span> DOI <span class=3D"insert">10.17487/RFC8126,=
 June</span> 2017,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc7835&gt;.</span></td><td> =
</td><td class=3D"rblock">              <span =
class=3D"insert">&lt;https://www.rfc-editor.org/info/rfc8126&gt;.</span></=
td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC8061]  Farinacci, D. and B. Weis, "Locator/ID =
Separation Protocol</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              (LISP) Data-Plane Confidentiality", RFC =
8061,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC8061, February</span> =
2017,</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
<span =
class=3D"delete">&lt;https://www.rfc-editor.org/info/rfc8061&gt;.</span></=
td><td> </td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC8200]  =
Deering, S. and R. Hinden, "Internet Protocol, Version 6</td><td> =
</td><td class=3D"right">   [RFC8200]  Deering, S. and R. Hinden, =
"Internet Protocol, Version 6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(IPv6) Specification", STD 86, RFC 8200,</td><td> </td><td =
class=3D"right">              (IPv6) Specification", STD 86, RFC =
8200,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC8200, July 2017,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC8200, July 2017,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc8200&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc8200&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.2.  =
Informative References</td><td> </td><td class=3D"right">22.2.  =
Informative References</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [AFN]      =
IANA, "Address Family Numbers", August 2016,</td><td> </td><td =
class=3D"right">   [AFN]      IANA, "Address Family Numbers", August =
2016,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;http://www.iana.org/assignments/address-family-numbers&gt;.</td><td> =
</td><td class=3D"right">              =
&lt;http://www.iana.org/assignments/address-family-numbers&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [CHIAPPA]  =
Chiappa, J., "Endpoints and Endpoint names: A Proposed",</td><td> =
</td><td class=3D"right">   [CHIAPPA]  Chiappa, J., "Endpoints and =
Endpoint names: A Proposed",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
1999,</td><td> </td><td class=3D"right">              1999,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt&gt;.</td><td> =
</td><td class=3D"right">              =
&lt;http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-eid-mobility]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-eid-mobility]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,</td><td> =
</td><td class=3D"right">              Portoles-Comeras, M., Ashtaputre, =
V., Moreno, V., Maino,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              F., =
and D. Farinacci, "LISP L2/L3 EID Mobility Using a</td><td> </td><td =
class=3D"right">              F., and D. Farinacci, "LISP L2/L3 EID =
Mobility Using a</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0088"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
Unified Control Plane", <span =
class=3D"delete">draft-ietf-lisp-eid-mobility-00</span></td><td> =
</td><td class=3D"rblock">              Unified Control Plane", <span =
class=3D"insert">draft-ietf-lisp-eid-mobility-01</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
(work in progress), <span class=3D"delete">May</span> 2017.</td><td> =
</td><td class=3D"rblock">              (work in progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span =
class=3D"insert">[I-D.ietf-lisp-introduction]</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Cabellos-Aparicio, A. and D. Saucez, "An Architectural</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Introduction to the Locator/ID Separation Protocol</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (LISP)", =
draft-ietf-lisp-introduction-13 (work in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
progress), April 2015.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-mn]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-mn]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Farinacci, D., Lewis, D., Meyer, D., and C. White, "LISP</td><td> =
</td><td class=3D"right">              Farinacci, D., Lewis, D., Meyer, =
D., and C. White, "LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Mobile Node", draft-ietf-lisp-mn-01 (work in progress),</td><td> =
</td><td class=3D"right">              Mobile Node", =
draft-ietf-lisp-mn-01 (work in progress),</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
October 2017.</td><td> </td><td class=3D"right">              October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-predictive-rlocs]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-predictive-rlocs]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Farinacci, D. and P. Pillay-Esnault, "LISP Predictive</td><td> </td><td =
class=3D"right">              Farinacci, D. and P. Pillay-Esnault, "LISP =
Predictive</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0089"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
RLOCs", <span class=3D"delete">draft-ietf-lisp-predictive-rlocs-00</span> =
(work in</td><td> </td><td class=3D"rblock">              RLOCs", <span =
class=3D"insert">draft-ietf-lisp-predictive-rlocs-01</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">June</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span class=3D"insert">November =
2017.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   =
[I-D.ietf-lisp-sec]</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Maino, =
F., Ermagan, V., Cabellos-Aparicio, A., and D.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Saucez, =
"LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-14</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (work in =
progress), October</span> 2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-signal-free-multicast]</td><td> </td><td class=3D"right"> =
  [I-D.ietf-lisp-signal-free-multicast]</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",</td><td> =
</td><td class=3D"right">              Moreno, V. and D. Farinacci, =
"Signal-Free LISP Multicast",</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0090"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
<span class=3D"delete">draft-ietf-lisp-signal-free-multicast-06</span> =
(work in</td><td> </td><td class=3D"rblock">              <span =
class=3D"insert">draft-ietf-lisp-signal-free-multicast-07</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">August</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-vpn]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-vpn]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "LISP Virtual Private</td><td> </td><td =
class=3D"right">              Moreno, V. and D. Farinacci, "LISP Virtual =
Private</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0091"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
Networks (VPNs)", <span class=3D"delete">draft-ietf-lisp-vpn-00</span> =
(work in</td><td> </td><td class=3D"rblock">              Networks =
(VPNs)", <span class=3D"insert">draft-ietf-lisp-vpn-01</span> (work =
in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">              =
progress), <span class=3D"delete">May</span> 2017.</td><td> </td><td =
class=3D"rblock">              progress), <span =
class=3D"insert">November</span> 2017.</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.meyer-loc-id-implications]</td><td> </td><td class=3D"right">   =
[I-D.meyer-loc-id-implications]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Meyer, D. and D. Lewis, "Architectural Implications of</td><td> </td><td =
class=3D"right">              Meyer, D. and D. Lewis, "Architectural =
Implications of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Locator/ID Separation", draft-meyer-loc-id-implications-01</td><td> =
</td><td class=3D"right">              Locator/ID Separation", =
draft-meyer-loc-id-implications-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(work in progress), January 2009.</td><td> </td><td class=3D"right">     =
         (work in progress), January 2009.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [LISA96]   =
Lear, E., Tharp, D., Katinsky, J., and J. Coffin,</td><td> </td><td =
class=3D"right">   [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. =
Coffin,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Renumbering: Threat or Menace?", Usenix Tenth System</td><td> </td><td =
class=3D"right">              "Renumbering: Threat or Menace?", Usenix =
Tenth System</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Administration Conference (LISA 96), October 1996.</td><td> </td><td =
class=3D"right">              Administration Conference (LISA 96), =
October 1996.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-23" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-23"><em> page 49, line =
9<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-23"><em> page 47, line =
22<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC2784]  =
Farinacci, D., Li, T., Hanks, S., Meyer, D., and P.</td><td> </td><td =
class=3D"right">   [RFC2784]  Farinacci, D., Li, T., Hanks, S., Meyer, =
D., and P.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Traina, "Generic Routing Encapsulation (GRE)", RFC 2784,</td><td> =
</td><td class=3D"right">              Traina, "Generic Routing =
Encapsulation (GRE)", RFC 2784,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC2784, March 2000,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC2784, March 2000,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc2784&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc2784&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3056]  =
Carpenter, B. and K. Moore, "Connection of IPv6 Domains</td><td> =
</td><td class=3D"right">   [RFC3056]  Carpenter, B. and K. Moore, =
"Connection of IPv6 Domains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              via =
IPv4 Clouds", RFC 3056, DOI 10.17487/RFC3056, February</td><td> </td><td =
class=3D"right">              via IPv4 Clouds", RFC 3056, DOI =
10.17487/RFC3056, February</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2001, &lt;https://www.rfc-editor.org/info/rfc3056&gt;.</td><td> </td><td =
class=3D"right">              2001, =
&lt;https://www.rfc-editor.org/info/rfc3056&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0092"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC3232]  Reynolds, =
J., Ed., "Assigned Numbers: RFC 1700 is Replaced</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              by an =
On-line Database", RFC 3232, DOI 10.17487/RFC3232,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              January =
2002, &lt;https://www.rfc-editor.org/info/rfc3232&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC3261]  =
Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston,</td><td> =
</td><td class=3D"right">   [RFC3261]  Rosenberg, J., Schulzrinne, H., =
Camarillo, G., Johnston,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              A., =
Peterson, J., Sparks, R., Handley, M., and E.</td><td> </td><td =
class=3D"right">              A., Peterson, J., Sparks, R., Handley, M., =
and E.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Schooler, "SIP: Session Initiation Protocol", RFC 3261,</td><td> =
</td><td class=3D"right">              Schooler, "SIP: Session =
Initiation Protocol", RFC 3261,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC3261, June 2002,</td><td> </td><td class=3D"right">          =
    DOI 10.17487/RFC3261, June 2002,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc3261&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc3261&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0093"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC4107]  Bellovin, S. and R. Housley, "Guidelines for =
Cryptographic</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Key Management", BCP 107, RFC 4107, DOI =
10.17487/RFC4107,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              June 2005, =
&lt;https://www.rfc-editor.org/info/rfc4107&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4192]  =
Baker, F., Lear, E., and R. Droms, "Procedures for</td><td> </td><td =
class=3D"right">   [RFC4192]  Baker, F., Lear, E., and R. Droms, =
"Procedures for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Renumbering an IPv6 Network without a Flag Day", RFC 4192,</td><td> =
</td><td class=3D"right">              Renumbering an IPv6 Network =
without a Flag Day", RFC 4192,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4192, September 2005,</td><td> </td><td class=3D"right">     =
         DOI 10.17487/RFC4192, September 2005,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4192&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4192&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4866]  =
Arkko, J., Vogt, C., and W. Haddad, "Enhanced Route</td><td> </td><td =
class=3D"right">   [RFC4866]  Arkko, J., Vogt, C., and W. Haddad, =
"Enhanced Route</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Optimization for Mobile IPv6", RFC 4866,</td><td> </td><td =
class=3D"right">              Optimization for Mobile IPv6", RFC =
4866,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC4866, May 2007,</td><td> </td><td class=3D"right">           =
   DOI 10.17487/RFC4866, May 2007,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4866&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4866&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC4984]  =
Meyer, D., Ed., Zhang, L., Ed., and K. Fall, Ed., "Report</td><td> =
</td><td class=3D"right">   [RFC4984]  Meyer, D., Ed., Zhang, L., Ed., =
and K. Fall, Ed., "Report</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
from the IAB Workshop on Routing and Addressing",</td><td> </td><td =
class=3D"right">              from the IAB Workshop on Routing and =
Addressing",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
4984, DOI 10.17487/RFC4984, September 2007,</td><td> </td><td =
class=3D"right">              RFC 4984, DOI 10.17487/RFC4984, September =
2007,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc4984&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc4984&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0094"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6480]  Lepinski, M. and S. Kent, "An Infrastructure =
to Support</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Secure Internet Routing", RFC 6480, DOI =
10.17487/RFC6480,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              February 2012, =
&lt;https://www.rfc-editor.org/info/rfc6480&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   [RFC6518]  Lebovitz, G. and M. Bhatia, "Keying and =
Authentication for</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Routing Protocols (KARP) Design =
Guidelines", RFC 6518,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6518, February =
2012,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6518&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6831]  =
Farinacci, D., Meyer, D., Zwiebel, J., and S. Venaas, "The</td><td> =
</td><td class=3D"right">   [RFC6831]  Farinacci, D., Meyer, D., =
Zwiebel, J., and S. Venaas, "The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Locator/ID Separation Protocol (LISP) for Multicast</td><td> </td><td =
class=3D"right">              Locator/ID Separation Protocol (LISP) for =
Multicast</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Environments", RFC 6831, DOI 10.17487/RFC6831, January</td><td> </td><td =
class=3D"right">              Environments", RFC 6831, DOI =
10.17487/RFC6831, January</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2013, &lt;https://www.rfc-editor.org/info/rfc6831&gt;.</td><td> </td><td =
class=3D"right">              2013, =
&lt;https://www.rfc-editor.org/info/rfc6831&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6832]  =
Lewis, D., Meyer, D., Farinacci, D., and V. Fuller,</td><td> </td><td =
class=3D"right">   [RFC6832]  Lewis, D., Meyer, D., Farinacci, D., and =
V. Fuller,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Interworking between Locator/ID Separation Protocol</td><td> </td><td =
class=3D"right">              "Interworking between Locator/ID =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(LISP) and Non-LISP Sites", RFC 6832,</td><td> </td><td class=3D"right"> =
             (LISP) and Non-LISP Sites", RFC 6832,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6832, January 2013,</td><td> </td><td class=3D"right">       =
       DOI 10.17487/RFC6832, January 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6832&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6832&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0095"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC6834]  Iannone, =
L., Saucez, D., and O. Bonaventure, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) Map-Versioning", RFC 6834,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC6834, January 2013,</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc6834&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6835]  =
Farinacci, D. and D. Meyer, "The Locator/ID Separation</td><td> </td><td =
class=3D"right">   [RFC6835]  Farinacci, D. and D. Meyer, "The =
Locator/ID Separation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Protocol Internet Groper (LIG)", RFC 6835,</td><td> </td><td =
class=3D"right">              Protocol Internet Groper (LIG)", RFC =
6835,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6835, January 2013,</td><td> </td><td class=3D"right">       =
       DOI 10.17487/RFC6835, January 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6835&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6835&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0096"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">[RFC6837]  Lear, E., "NERD: A Not-so-novel Endpoint ID =
(EID) to</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              Routing Locator (RLOC) Database", RFC =
6837,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              DOI 10.17487/RFC6837, January =
2013,</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">              =
&lt;https://www.rfc-editor.org/info/rfc6837&gt;.</span></td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6935]  =
Eubanks, M., Chimento, P., and M. Westerlund, "IPv6 and</td><td> =
</td><td class=3D"right">   [RFC6935]  Eubanks, M., Chimento, P., and M. =
Westerlund, "IPv6 and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              UDP =
Checksums for Tunneled Packets", RFC 6935,</td><td> </td><td =
class=3D"right">              UDP Checksums for Tunneled Packets", RFC =
6935,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              DOI =
10.17487/RFC6935, April 2013,</td><td> </td><td class=3D"right">         =
     DOI 10.17487/RFC6935, April 2013,</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6935&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6935&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC6936]  =
Fairhurst, G. and M. Westerlund, "Applicability Statement</td><td> =
</td><td class=3D"right">   [RFC6936]  Fairhurst, G. and M. Westerlund, =
"Applicability Statement</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              for =
the Use of IPv6 UDP Datagrams with Zero Checksums",</td><td> </td><td =
class=3D"right">              for the Use of IPv6 UDP Datagrams with =
Zero Checksums",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              RFC =
6936, DOI 10.17487/RFC6936, April 2013,</td><td> </td><td class=3D"right">=
              RFC 6936, DOI 10.17487/RFC6936, April 2013,</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
&lt;https://www.rfc-editor.org/info/rfc6936&gt;.</td><td> </td><td =
class=3D"right">              =
&lt;https://www.rfc-editor.org/info/rfc6936&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0097"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC7052]  Schudel, =
G., Jain, A., and V. Moreno, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) MIB", RFC 7052,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC7052, October 2013,</span></td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc7052&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC7215]  Jakab, =
L., Cabellos-Aparicio, A., Coras, F., Domingo-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Pascual, =
J., and D. Lewis, "Locator/Identifier Separation</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Protocol =
(LISP) Network Element Deployment</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Considerations", RFC 7215, DOI 10.17487/RFC7215, April</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              2014, =
&lt;https://www.rfc-editor.org/info/rfc7215&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC7835]  Saucez, =
D., Iannone, L., and O. Bonaventure, "Locator/ID</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
Separation Protocol (LISP) Threat Analysis", RFC 7835,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC7835, April 2016,</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc7835&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC8060]  =
Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical</td><td> =
</td><td class=3D"right">   [RFC8060]  Farinacci, D., Meyer, D., and J. =
Snijders, "LISP Canonical</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,</td><td> =
</td><td class=3D"right">              Address Format (LCAF)", RFC 8060, =
DOI 10.17487/RFC8060,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
February 2017, &lt;https://www.rfc-editor.org/info/rfc8060&gt;.</td><td> =
</td><td class=3D"right">              February 2017, =
&lt;https://www.rfc-editor.org/info/rfc8060&gt;.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0098"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span class=3D"insert">[RFC8061]  =
Farinacci, D. and B. Weis, "Locator/ID Separation =
Protocol</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              (LISP) =
Data-Plane Confidentiality", RFC 8061,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              DOI =
10.17487/RFC8061, February 2017,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
&lt;https://www.rfc-editor.org/info/rfc8061&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   [RFC8111]  Fuller, =
V., Lewis, D., Ermagan, V., Jain, A., and A.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Smirnov, =
"Locator/ID Separation Protocol Delegated</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Database =
Tree (LISP-DDT)", RFC 8111, DOI 10.17487/RFC8111,</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              May 2017, =
&lt;https://www.rfc-editor.org/info/rfc8111&gt;.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix A.  =
Acknowledgments</td><td> </td><td class=3D"right">Appendix A.  =
Acknowledgments</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An initial =
thank you goes to Dave Oran for planting the seeds for the</td><td> =
</td><td class=3D"right">   An initial thank you goes to Dave Oran for =
planting the seeds for the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   initial ideas =
for LISP.  His consultation continues to provide value</td><td> </td><td =
class=3D"right">   initial ideas for LISP.  His consultation continues =
to provide value</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to the LISP =
authors.</td><td> </td><td class=3D"right">   to the LISP =
authors.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   A special and =
appreciative thank you goes to Noel Chiappa for</td><td> </td><td =
class=3D"right">   A special and appreciative thank you goes to Noel =
Chiappa for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   providing =
architectural impetus over the past decades on separation</td><td> =
</td><td class=3D"right">   providing architectural impetus over the =
past decades on separation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   of location =
and identity, as well as detailed reviews of the LISP</td><td> </td><td =
class=3D"right">   of location and identity, as well as detailed reviews =
of the LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   architecture =
and documents, coupled with enthusiasm for making LISP a</td><td> =
</td><td class=3D"right">   architecture and documents, coupled with =
enthusiasm for making LISP a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-24" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-24"><em> page 52, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-24"><em> page 51, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The LISP =
working group would like to give a special thanks to Jari</td><td> =
</td><td class=3D"right">   The LISP working group would like to give a =
special thanks to Jari</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Arkko, the =
Internet Area AD at the time that the set of LISP</td><td> </td><td =
class=3D"right">   Arkko, the Internet Area AD at the time that the set =
of LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   documents were =
being prepared for IESG last call, and for his</td><td> </td><td =
class=3D"right">   documents were being prepared for IESG last call, and =
for his</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   meticulous =
reviews and detailed commentaries on the 7 working group</td><td> =
</td><td class=3D"right">   meticulous reviews and detailed commentaries =
on the 7 working group</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   last call =
documents progressing toward standards-track RFCs.</td><td> </td><td =
class=3D"right">   last call documents progressing toward =
standards-track RFCs.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix B.  =
Document Change Log</td><td> </td><td class=3D"right">Appendix B.  =
Document Change Log</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC Editor: =
Please delete this section on publication as RFC.]</td><td> </td><td =
class=3D"right">   [RFC Editor: Please delete this section on =
publication as RFC.]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0099"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.1.  Changes =
to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span></td><td> =
</td><td class=3D"rblock">B.1.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Posted January =
2018.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Remove references =
to research work for any protocol mechanisms.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Document scanned =
to make sure it is RFC 2119 compliant.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Made changes to =
reflect comments from document WG shepherd Luigi</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
Iannone.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Ran IDNITs on the =
document.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">B.2.  Changes to =
draft-ietf-lisp-rfc6830bis-07</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
November 2017.</td><td> </td><td class=3D"right">   o  Posted November =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rephrase =
how Instance-IDs are used and don't refer to [RFC1918]</td><td> </td><td =
class=3D"right">   o  Rephrase how Instance-IDs are used and don't refer =
to [RFC1918]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
addresses.</td><td> </td><td class=3D"right">      addresses.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0100"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">2</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
October 2017.</td><td> </td><td class=3D"right">   o  Posted October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Put RTR =
definition before it is used.</td><td> </td><td class=3D"right">   o  =
Put RTR definition before it is used.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rename =
references that are now working group drafts.</td><td> </td><td =
class=3D"right">   o  Rename references that are now working group =
drafts.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
"EIDs MUST NOT be used as used by a host to refer to other</td><td> =
</td><td class=3D"right">   o  Remove "EIDs MUST NOT be used as used by =
a host to refer to other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hosts.  =
Note that EID blocks MAY LISP RLOCs".</td><td> </td><td class=3D"right"> =
     hosts.  Note that EID blocks MAY LISP RLOCs".</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-25" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-25"><em> page 52, line =
35<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-25"><em> page 51, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  ETRs may, =
rather than will, be the ones to send Map-Replies.</td><td> </td><td =
class=3D"right">   o  ETRs may, rather than will, be the ones to send =
Map-Replies.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recommend, =
rather than mandate, max encapsulation headers to 2.</td><td> </td><td =
class=3D"right">   o  Recommend, rather than mandate, max encapsulation =
headers to 2.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reference =
VPN draft when introducing Instance-ID.</td><td> </td><td class=3D"right">=
   o  Reference VPN draft when introducing Instance-ID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that SMRs can be sent when ITR/ETR are in the same node.</td><td> =
</td><td class=3D"right">   o  Indicate that SMRs can be sent when =
ITR/ETR are in the same node.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarify =
when private addreses can be used.</td><td> </td><td class=3D"right">   =
o  Clarify when private addreses can be used.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0101"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
August 2017.</td><td> </td><td class=3D"right">   o  Posted August =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Make it =
clear that a Reencapsulating Tunnel Router is an RTR.</td><td> </td><td =
class=3D"right">   o  Make it clear that a Reencapsulating Tunnel Router =
is an RTR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0102"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted July =
2017.</td><td> </td><td class=3D"right">   o  Posted July 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Changed =
reference of IPv6 RFC2460 to RFC8200.</td><td> </td><td class=3D"right"> =
  o  Changed reference of IPv6 RFC2460 to RFC8200.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that the applicability statement for UDP zero checksums</td><td> =
</td><td class=3D"right">   o  Indicate that the applicability statement =
for UDP zero checksums</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      over IPv6 =
adheres to RFC6936.</td><td> </td><td class=3D"right">      over IPv6 =
adheres to RFC6936.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0103"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted May =
2017.</td><td> </td><td class=3D"right">   o  Posted May 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Move the =
control-plane related codepoints in the IANA</td><td> </td><td =
class=3D"right">   o  Move the control-plane related codepoints in the =
IANA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Considerations section to RFC6833bis.</td><td> </td><td class=3D"right"> =
     Considerations section to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0104"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
April 2017.</td><td> </td><td class=3D"right">   o  Posted April =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reflect =
some editorial comments from Damien Sausez.</td><td> </td><td =
class=3D"right">   o  Reflect some editorial comments from Damien =
Sausez.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0105"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
March 2017.</td><td> </td><td class=3D"right">   o  Posted March =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Include =
references to new RFCs published.</td><td> </td><td class=3D"right">   o =
 Include references to new RFCs published.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Change =
references from RFC6833 to RFC6833bis.</td><td> </td><td class=3D"right"> =
  o  Change references from RFC6833 to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarified =
LCAF text in the IANA section.</td><td> </td><td class=3D"right">   o  =
Clarified LCAF text in the IANA section.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to "experimental".</td><td> </td><td class=3D"right">   o  =
Remove references to "experimental".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0106"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
December 2016.</td><td> </td><td class=3D"right">   o  Posted December =
2016.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Created =
working group document from draft-farinacci-lisp</td><td> </td><td =
class=3D"right">   o  Created working group document from =
draft-farinacci-lisp</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      -rfc6830-00 =
individual submission.  No other changes made.</td><td> </td><td =
class=3D"right">      -rfc6830-00 individual submission.  No other =
changes made.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Authors' =
Addresses</td><td> </td><td class=3D"right">Authors' Addresses</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0107"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">                                                        =
                 </span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dino =
Farinacci</td><td> </td><td class=3D"right">   Dino Farinacci</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
farinacci@gmail.com</td><td> </td><td class=3D"right">   EMail: =
farinacci@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0108"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">                        =
                                                 </span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Vince =
Fuller</td><td> </td><td class=3D"right">   Vince Fuller</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
vince.fuller@gmail.com</td><td> </td><td class=3D"right">   EMail: =
vince.fuller@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dave =
Meyer</td><td> </td><td class=3D"right">   Dave Meyer</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>

     <tr><td></td><td class=3D"left"></td><td> </td><td =
class=3D"right"></td><td></td></tr>
     <tr id=3D"end" bgcolor=3D"gray"><th colspan=3D"5" =
align=3D"center">&nbsp;End of changes. 108 change =
blocks.&nbsp;</th></tr>
     <tr class=3D"stats"><td></td><th><i>396 lines changed or =
deleted</i></th><th><i> </i></th><th><i>340 lines changed or =
added</i></th><td></td></tr>
     <tr><td colspan=3D"5" align=3D"center" class=3D"small"><br>This =
html diff was produced by rfcdiff 1.46. The latest version is available =
from <a =
href=3D"http://www.tools.ietf.org/tools/rfcdiff/">http://tools.ietf.org/to=
ols/rfcdiff/</a> </td></tr>
   </tbody></table>
  =20
  =20
</body></html>=

--Apple-Mail=_9947AF75-7CFD-4DA1-B244-66A2B4196060
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8



> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>=20
>=20
> HI Albert,
>=20
> thanks for your reply.=20
>=20
> My comments inline. (trimming what is OK for me)
>=20
> Luigi
>=20
>> On 27 Dec 2017, at 02:48, Albert Cabellos <albert.cabellos@gmail.com> =
wrote:
>>=20
>=20
> [snip]
>> >
>> >
>> >   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit =
(for
>> >      IPv6) value used in the source and destination address fields =
of
>> >      the first (most inner) LISP header of a packet.  The host =
obtains
>> >      a destination EID the same way it obtains a destination =
address
>> >      today, for example, through a Domain Name System (DNS) =
[RFC1034]
>> >      lookup or Session Initiation Protocol (SIP) [RFC3261] =
exchange.
>> >      The source EID is obtained via existing mechanisms used to set =
a
>> >      host's "local" IP address.  An EID used on the public Internet
>> >      must have the same properties as any other IP address used in =
that
>> >      manner; this means, among other things, that it must be =
globally
>> >      unique.  An EID is allocated to a host from an EID-Prefix =
block
>> >      associated with the site where the host is located.  An EID =
can be
>> >      used by a host to refer to other hosts.  Note that EID blocks =
MAY
>> >      be assigned in a hierarchical manner, independent of the =
network
>> >      topology, to facilitate scaling of the mapping database.  In
>> >      addition, an EID block assigned to a site may have site-local
>> >      structure (subnetting) for routing within the site; this =
structure
>> >      is not visible to the global routing system.  In theory, the =
bit
>> >      string that represents an EID for one device can represent an =
RLOC
>> >      for a different device.  As the architecture is realized, if a
>> >      given bit string is both an RLOC and an EID, it must refer to =
the
>> >      same entity in both cases.
>> >
>> >
>> > Is the above sentence really necessary?
>> >
>>=20
>> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID =
is an address of the overlay and an RLOC an address of the overlay. This =
change may require further changes on the document so I am not 100% sure =
if this is a good idea.
>=20
> For clarification I was just referring to the sentence:
>=20
>  " As the architecture is realized, if a given bit string is both an =
RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=20=

>=20
> I am wondering if such constrain is really necessary. If namespaces =
are well scoped there is no need for this.=20
>=20
> [snip]
>=20
> About the following:
>=20
>>=20
>> >
>> >   o  EIDs are typically IP addresses assigned to hosts.
>> >
>> >   o  Other types of EID are supported by LISP, see [RFC8060] for
>> >      further information.
>> >
>> > I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>> >
>> >
>>=20
>> I suggest to leave them here, I don=C2=B4t think that readers start =
from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>=20
> Good point about de definition of terms. What really bothers me is the =
bullet organisation. What can be done is to merge these two bullets with =
the previous one.=20
>=20
>>=20
>> >
>> > The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>> > ECN bits and DSCP .
>> >
>> > 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>> >
>> > 2. How to deal with ECN should be part of the description of the  =
encap/decap not a paragraph apart.
>> >    This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
>> >    and the other half  in the ETR/PETR operation.
>>=20
>>=20
>> Agreed, what about this (please comment):
>>=20
>>    When doing ITR/PITR encapsulation:
>>=20
>>     o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>     o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>    o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>=20
>> When doing ETR/PETR decapsulation:
>>=20
>>    o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>    o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>    o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>=20
>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>=20
>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>=20
>=20
> Text looks very good to me.
>=20
>=20
>>=20
>> >
>> > Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>> >
>> > What this section should state is that priority and weight are used =
to select the RLOC to use.
>> > Only exception is gleaning where we have one single RLOC and we do =
not know neither priority nor weight.
>> >
>> > All the other operational discussion goes elsewhere, but not in =
this document.
>> >
>>=20
>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is =
less obvious, maybe something like (not final, just a couple of ideas):
>>=20
>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>=20
>=20
> Yes, this is what I meant.
>=20
>=20
>> Actually we should merge this section with 'Routing Locator Hashing'
>>=20
>>=20
>=20
> I think is a good idea.
>=20
> [snip]
>> > 13.  Changing the Contents of EID-to-RLOC Mappings
>> >
>> >
>> > This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>> > The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
>> >
>> > All of the rest 6833bis
>> >
>> > Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
>> >
>> >
>>=20
>> So you are suggesting that the LISP control-plane does not define any =
mechanism to update EID-to-RLOC mappings?=20
>>=20
>=20
> Not exactly. Control-plane should discuss how to change the mappings, =
but things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense  to put =
it elsewhere.
>=20
> Thanks
>=20
> Luigi
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


--Apple-Mail=_9947AF75-7CFD-4DA1-B244-66A2B4196060--


From nobody Tue Jan  9 10:00:27 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 0BC3B127010 for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 10:00:25 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id D5FO85g8irWb for <lisp@ietfa.amsl.com>; Tue,  9 Jan 2018 10:00:23 -0800 (PST)
Received: from mail-pg0-x229.google.com (mail-pg0-x229.google.com [IPv6:2607:f8b0:400e:c05::229]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 548671200FC for <lisp@ietf.org>; Tue,  9 Jan 2018 10:00:23 -0800 (PST)
Received: by mail-pg0-x229.google.com with SMTP id i196so8495273pgd.0 for <lisp@ietf.org>; Tue, 09 Jan 2018 10:00:23 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=7IhF6i3kDOvgBpwr7ZUghwT4ITZvlyYW/sGHNxZKIbo=; b=jJlBvvZk28Zt8Vmyoj7k5/Dym/wkvzPdcsRxnoZiTw49TpttENDQ3WSHBihalx1ZlM giOSnMrkdOrN8uaiqDBv565OtlsO+EJj6nt7uiCswqEDXtSKIoUKd2DVmfiWq82mlWuz vbED0tqctnKizaw1nY1AQaBhLVUjOjoMv2z82EyOXXXxuQcRdBDsGo6NCRmGM7ZkdJQZ KMC9UT6vHkhUY76kAHWzftCKtYPLRYwtiFwjAguprCBcUdAshrcIramgU8FlK03R/FMk Uu5rjlb/XeymOfVR65CCrxFdHpnkhtcVU5N5ZQgriIsIKNFSkl8KI1yoRSOq+qLCV5oX j0Nw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=7IhF6i3kDOvgBpwr7ZUghwT4ITZvlyYW/sGHNxZKIbo=; b=VSjV0aUniOHcHPlVl6jvIrdzo7a4zFitCeqfHAMjmYXShEyHK5kMRB87DXVGgSm9pP PYF4y99kAfCj0RZSN0qADaw10vnPz86w2DtA0vajbxTVC0qjBNpPgHc+iL0uLEApGfQp 2UFAnMFwK+kJFhtO+XxpdnkgEsIfvFccQBi7WEovE6dZbV0qCo8hhRCk461YXQS0vlX4 GRRr3cNRVUvHIqXntakqpfXaQ7K1NJlQyMzh/JwdAiMIftdPph91085slpTiY7CD6Zfx xO0pqhAF0P2+wF5nAran6CC8r31PqKW15bU512+pynJVKIiAYM40qXucsAPccIRrkh+V h2KA==
X-Gm-Message-State: AKGB3mKdGNRGxzCSfjksXTY/HTRIJTJ/PmzFOMmRzcb4QRJVhL3awBhB vwiWsksNl8JTq2NDA/OPcdKi2Ec5
X-Google-Smtp-Source: ACJfBov3EX/cjte6GPO5WMG5VhstIm2Y8pr55MZaReSA1Xe1bAvnEikzckALlz+q2TqmIvaE/xDQTw==
X-Received: by 10.99.111.193 with SMTP id k184mr6613458pgc.378.1515520822903;  Tue, 09 Jan 2018 10:00:22 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id p124sm5939127pga.66.2018.01.09.10.00.21 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 09 Jan 2018 10:00:21 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <E808D20D-368A-45E5-8672-5ED36A69E0EB@gigix.net>
Date: Tue, 9 Jan 2018 10:00:08 -0800
Cc: "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <131849F0-AA8F-440E-A75E-5E3407B182F3@gmail.com>
References: <599A8A3E-E291-4F8A-9461-CBE87C1A2C6F@gigix.net> <DD3BF978-9197-45FD-B448-0AFF45E31251@gigix.net> <E808D20D-368A-45E5-8672-5ED36A69E0EB@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/a1-cPMCq7pn-bnqhq1rdINURZ6U>
Subject: Re: [lisp] 6830bis Review (PLEASE COMMENTS)
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 18:00:25 -0000

Brief reply.

>>>>=20
>>>> The OAM information is necessary for the data-plane. And if =
LISP-GPE, VXLAN, or any other data plane wants to use their own OAM or =
use the LISP control-plane differently, it needs to be documented in =
their data-planes. Hence, why this information is there.
>>>=20
>>> Doesn=E2=80=99t make sense to me. That is not a reason.=20
>>=20
>> It is a reason, maybe one you don=E2=80=99t like, but it is a reason.
>>=20
>=20
> The point is that in the current document there is a lot of OAM text =
that does not belong to the data-plane.=20

The OAM mechanisms are only used for data-plane purposes and to manage =
the elements in the map-cache. It=E2=80=99s the only place it should go.

>=20
>=20
>>> That information can be available in another document and still be =
used by LISP-GPE, VxLAN, or any other data plane.
>>=20
>> But we decided on only 2 documents. And if we put data-plane usage in =
a control-plane document, then we are making 6833bis like 6830.
>>=20
>=20
> We are better organising the specifications so that they are clearer =
and easier to read.


>=20
>=20
> [snip]
>>=20
>>>>> You break the operational flow by opening a different point =
describing what is what. It makes the overall procedure unclear.
>>>>=20
>>>> It was put there because someone commented on it. You have to tell =
me why you think it breaks flow. We discuss how end-systems send to =
EIDs. We say what EIDs are and how they are assigned to hosts. And then =
we move to RLOCs. It is pretty plan, simple, and straight-forward.
>>>>=20
>>>=20
>>> Those two point would have more emphasis somewhere else.=20
>>> Where they are now they break the flow and do not provide details.
>>=20
>> Unless you provide clear text where they should go, I=E2=80=99m not =
going to change it.
>>=20
>=20
> Suggested to merge with previous bullet in the reply to Albert.

Sorry the references to references do not help. I want a comment to the =
-08 text.

>> I made some minor comments but do not want to undo what David Black =
spent effort on and got approval for. And I certainly don=E2=80=99t want =
to repeat text as you suggested above.
>>=20
>=20
> The text provided by Albert is very good, I will ask David to review =
the text again to make sure nothing has been lost.

Sorry the references to references do not help. I want a comment to the =
-08 text.

> As I suggested in first mail:=20
>=20
> We need to keep: 1, 6, Echo-Nonce,=20
>=20
> We need to move: 2, 3, 4, 5,  RLOC-Probing

Sorry, I can=E2=80=99t follow these references.

Dino


From nobody Tue Jan  9 10:02:52 2018
Return-Path: <internet-drafts@ietf.org>
X-Original-To: lisp@ietf.org
Delivered-To: lisp@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 4F38512D849; Tue,  9 Jan 2018 10:02:48 -0800 (PST)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: <i-d-announce@ietf.org>
Cc: lisp@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 6.68.3
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <151552096827.1835.17094288542668257819@ietfa.amsl.com>
Date: Tue, 09 Jan 2018 10:02:48 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/7tUFe0xrSJHa4WF409bxmACPzY0>
Subject: [lisp] I-D Action: draft-ietf-lisp-rfc6830bis-08.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jan 2018 18:02:48 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Locator/ID Separation Protocol WG of the IETF.

        Title           : The Locator/ID Separation Protocol (LISP)
        Authors         : Dino Farinacci
                          Vince Fuller
                          Dave Meyer
                          Darrel Lewis
                          Albert Cabellos
	Filename        : draft-ietf-lisp-rfc6830bis-08.txt
	Pages           : 53
	Date            : 2018-01-09

Abstract:
   This document describes the data-plane protocol for the Locator/ID
   Separation Protocol (LISP).  LISP defines two namespaces, End-point
   Identifiers (EIDs) that identify end-hosts and Routing Locators
   (RLOCs) that 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.

   LISP requires no change to either host protocol stacks or to underlay
   routers and offers Traffic Engineering, multihoming and mobility,
   among other features.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-lisp-rfc6830bis/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-08
https://datatracker.ietf.org/doc/html/draft-ietf-lisp-rfc6830bis-08

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-ietf-lisp-rfc6830bis-08


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/


From nobody Wed Jan 10 01:53:18 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 6E3BD127077 for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 01:53:16 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id eG7A5owujv4A for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 01:53:14 -0800 (PST)
Received: from mail-wm0-x231.google.com (mail-wm0-x231.google.com [IPv6:2a00:1450:400c:c09::231]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 4D3C71241F8 for <lisp@ietf.org>; Wed, 10 Jan 2018 01:53:14 -0800 (PST)
Received: by mail-wm0-x231.google.com with SMTP id 141so8985110wme.3 for <lisp@ietf.org>; Wed, 10 Jan 2018 01:53:14 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=4I4ZC2fGqWMDIcwDGzkHdY8QwIwsZUBKK7pPNLSF8wI=; b=cyXLuG9AJj7oS/UPA8cqslry8YUp83EZ298BSt3qENpExQvedljvGhUqaX/g/xyRaE IlklrgxN58M0OxRK/7lixZSp1OHDQp298KjuAveqaD8eVh2KhZVBz1AmdLVyBPAyY14n iOKH6JXDS2ExFz2/C4W7k63cTQ3+TSER4HneZqgpVTJEOiLDjLvVeSbgD8lSpfZY6FKb 6cq50WE1As9PGohLwFEdyXy9mjAIB3WkcSoIw4RwdM0dekrfEoPGm3u1IxaJ5ETKZQCR 9oa7hjo1gRE8DdMNfnNlflSdzwOzTBxsCbiIDmWbUsfqoj6qJtqX6Cg3IVK05W4YL1iM 0QUg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=4I4ZC2fGqWMDIcwDGzkHdY8QwIwsZUBKK7pPNLSF8wI=; b=PsRRx0bXDwwufwKBg8GbCQzCEN1+njsXqBV/zQG60bPh4uuPV5pz9rqz9Ro9ahWqmJ BuBVgD6wNwQtg4eim7KdhfLGLa8KyLDukPQGpM48FV20vWOH3qDN3/x00N7egtNcygXj iViTMgH8FzwYAWyECrug58NxT4/f6grWy08nTOThRY4to6clrBeWSu578X5up7JDrOTm 3bfFTgadyrAc9EjYV+gCs+fVNaDw6oo6Y3CUUckil9tM64x7DUrhSTpH+NIkscSsNfeF LbehT/0YxCGXFHjpNb8LicQB+s36B/SkjZNPY5DesESiQ4+/qBpTSfnjub2GRYTlLFgp mcQg==
X-Gm-Message-State: AKGB3mI6s2XocL+ygNGom6PDyEgy1LbDLF3wVaxFqbmaPw6wJ/0/y8Bw LzSofgyqvIRgJNa1PJ6YBn5PupqWNtY=
X-Google-Smtp-Source: ACJfBosvztxjfw3orEx4wFjiydJG0rD3e2DORQ/LDqm/yoZrqJaKdiiOcEmt7fgp/zqtYQfa00f1Mw==
X-Received: by 10.80.171.225 with SMTP id u88mr24714409edc.167.1515577992533;  Wed, 10 Jan 2018 01:53:12 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:6d04:1cfe:3b8d:cb39? ([2001:660:330f:a4:6d04:1cfe:3b8d:cb39]) by smtp.gmail.com with ESMTPSA id u21sm9165070edl.54.2018.01.10.01.53.10 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Wed, 10 Jan 2018 01:53:10 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <131849F0-AA8F-440E-A75E-5E3407B182F3@gmail.com>
Date: Wed, 10 Jan 2018 10:53:07 +0100
Cc: "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <85F1B405-03CB-4DAC-9CC0-F55210FAACCA@gigix.net>
References: <599A8A3E-E291-4F8A-9461-CBE87C1A2C6F@gigix.net> <DD3BF978-9197-45FD-B448-0AFF45E31251@gigix.net> <E808D20D-368A-45E5-8672-5ED36A69E0EB@gigix.net> <131849F0-AA8F-440E-A75E-5E3407B182F3@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/z6ZXzo_5i_yiXrvnd0hDPtuovhY>
Subject: Re: [lisp] 6830bis Review (PLEASE COMMENTS)
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 10 Jan 2018 09:53:16 -0000

> On 9 Jan 2018, at 19:00, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Brief reply.
>=20
>>>>>=20
>>>>> The OAM information is necessary for the data-plane. And if =
LISP-GPE, VXLAN, or any other data plane wants to use their own OAM or =
use the LISP control-plane differently, it needs to be documented in =
their data-planes. Hence, why this information is there.
>>>>=20
>>>> Doesn=E2=80=99t make sense to me. That is not a reason.=20
>>>=20
>>> It is a reason, maybe one you don=E2=80=99t like, but it is a =
reason.
>>>=20
>>=20
>> The point is that in the current document there is a lot of OAM text =
that does not belong to the data-plane.=20
>=20
> The OAM mechanisms are only used for data-plane purposes and to manage =
the elements in the map-cache.

You just mixed up data-plane and control plane, hence, would be better =
move the OAM text


> It=E2=80=99s the only place it should go.
>=20
>>=20
>>=20
>>>> That information can be available in another document and still be =
used by LISP-GPE, VxLAN, or any other data plane.
>>>=20
>>> But we decided on only 2 documents. And if we put data-plane usage =
in a control-plane document, then we are making 6833bis like 6830.
>>>=20
>>=20
>> We are better organising the specifications so that they are clearer =
and easier to read.
>=20
>=20
>>=20
>>=20
>> [snip]
>>>=20
>>>>>> You break the operational flow by opening a different point =
describing what is what. It makes the overall procedure unclear.
>>>>>=20
>>>>> It was put there because someone commented on it. You have to tell =
me why you think it breaks flow. We discuss how end-systems send to =
EIDs. We say what EIDs are and how they are assigned to hosts. And then =
we move to RLOCs. It is pretty plan, simple, and straight-forward.
>>>>>=20
>>>>=20
>>>> Those two point would have more emphasis somewhere else.=20
>>>> Where they are now they break the flow and do not provide details.
>>>=20
>>> Unless you provide clear text where they should go, I=E2=80=99m not =
going to change it.
>>>=20
>>=20
>> Suggested to merge with previous bullet in the reply to Albert.
>=20
> Sorry the references to references do not help. I want a comment to =
the -08 text.

Please read reply to Albert.


>=20
>>> I made some minor comments but do not want to undo what David Black =
spent effort on and got approval for. And I certainly don=E2=80=99t want =
to repeat text as you suggested above.
>>>=20
>>=20
>> The text provided by Albert is very good, I will ask David to review =
the text again to make sure nothing has been lost.
>=20
> Sorry the references to references do not help. I want a comment to =
the -08 text.

Please read reply to Albert.

>=20
>> As I suggested in first mail:=20
>>=20
>> We need to keep: 1, 6, Echo-Nonce,=20
>>=20
>> We need to move: 2, 3, 4, 5,  RLOC-Probing
>=20
> Sorry, I can=E2=80=99t follow these references.

Please read reply to Albert and my original review.

Thanks

L.



>=20
> Dino
>=20


From nobody Wed Jan 10 02:03:28 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 27160124D85 for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 02:03:27 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id nwdTpmnTlZjs for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 02:03:24 -0800 (PST)
Received: from mail-wm0-x22d.google.com (mail-wm0-x22d.google.com [IPv6:2a00:1450:400c:c09::22d]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 320411241F8 for <lisp@ietf.org>; Wed, 10 Jan 2018 02:03:24 -0800 (PST)
Received: by mail-wm0-x22d.google.com with SMTP id b141so25766439wme.1 for <lisp@ietf.org>; Wed, 10 Jan 2018 02:03:24 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=+UXFXJtdPd4SHNUpa5XGlQm0dHgiO1oHvx1LH4iwy7w=; b=v4V88zDyjlko4oDfN6Y0FL64JWa8qyuoEL//eIT3JKDTIM7Jw0Gjg5Kl6LsJNG+i0c T259bz5WHJhLkszgWAhLO+IvE1QIiu24tsZg9GJFVYbWoEb99d+hqmYkSB0E7Y27neO8 wweOJfJQFACamQLPtaFrL0bTSqx7+d2Q9qXekeYRIULuQCs5b4hLRKEPz2bFllEC3siw XcXfdKXxu/PeGklbbg0J1gZ93SUfo8XQ8d/s63pY/fWSzRx6BDhI7Np6o+xkpq1F/lR4 ZtvTGbzc+geuVwslYDUWMX+xiBrx3/pRtQ2lOG4Sj5CmUpPur/h/XLUig1cvHQYmYjgg 0o1A==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=+UXFXJtdPd4SHNUpa5XGlQm0dHgiO1oHvx1LH4iwy7w=; b=CxZ7uIOcAzgPPWeaNwUN1DcR1GLxMHjXApuBWP6Lo2rfVrVqWYyh21lJZHKGIEIN55 Gfwz4Fyxr2irDkF7dpDIBIojgcFQGvFoVtwp9YyVUVeVKQ8cbIclc6vopmjPBENurm/J f8cgxoKYAV2C+TzZyTvmZrSaC9iurVi0F47t/bmfodagBYTlJX2S1nqQdYS5ClvjhVIk kKMH25CHrnIzUaYu/NE1NE+D9w+rEbqOSEf1F5omahRAnn7U6jOn8nleqmB0WU2Fdd0G 0DEqSuW6rKYKn1z1mF3tFZvuXQjMoigZ7qrT9f/eTqDzqMHT+Yr4AOHeYT82lU/3dRA+ Bl1g==
X-Gm-Message-State: AKwxytf5A/7Gtay7NjdubUNLzfgWv2uXwztKzpgNI6dxUW9uVwEi40ni vSG88YJKm0vuaQq+3oE1zreaQA==
X-Google-Smtp-Source: ACJfBosN4YSzr4YnwypL5zupuEkakpCibkKUc13unfGwF1820i1kyKWX6kt9RrahjVnwn79L3Q/D1A==
X-Received: by 10.28.190.20 with SMTP id o20mr3531555wmf.122.1515578602329; Wed, 10 Jan 2018 02:03:22 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:6d04:1cfe:3b8d:cb39? ([2001:660:330f:a4:6d04:1cfe:3b8d:cb39]) by smtp.gmail.com with ESMTPSA id 90sm16617825wrp.39.2018.01.10.02.03.20 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Wed, 10 Jan 2018 02:03:20 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <829870A2-2D90-4967-983A-56F62E765796@gmail.com>
Date: Wed, 10 Jan 2018 11:03:17 +0100
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/bzyXSgTjO8Vw7vYAZlwervjHeXg>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 10 Jan 2018 10:03:27 -0000

Dino,

> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Guys, please look at the latest changes instead of hashing the same =
arguments.=20
>=20
> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>=20

I find this request unfair.=20
I spent quite a bit of time reviewing and discussing this document, now =
you just try to wash all out by requesting comments on -08.

Please let's continue discussing on the open issues so to find a =
solution.

Thanks

Luigi



> The diff of the changes are included yet again.
>=20
> Dino
>=20
> <rfcdiff-rfc6830bis.html>
>=20
>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>=20
>>=20
>> HI Albert,
>>=20
>> thanks for your reply.=20
>>=20
>> My comments inline. (trimming what is OK for me)
>>=20
>> Luigi
>>=20
>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>=20
>>=20
>> [snip]
>>>>=20
>>>>=20
>>>>  Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>>>>     IPv6) value used in the source and destination address fields =
of
>>>>     the first (most inner) LISP header of a packet.  The host =
obtains
>>>>     a destination EID the same way it obtains a destination address
>>>>     today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>     lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>     The source EID is obtained via existing mechanisms used to set =
a
>>>>     host's "local" IP address.  An EID used on the public Internet
>>>>     must have the same properties as any other IP address used in =
that
>>>>     manner; this means, among other things, that it must be =
globally
>>>>     unique.  An EID is allocated to a host from an EID-Prefix block
>>>>     associated with the site where the host is located.  An EID can =
be
>>>>     used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>     be assigned in a hierarchical manner, independent of the =
network
>>>>     topology, to facilitate scaling of the mapping database.  In
>>>>     addition, an EID block assigned to a site may have site-local
>>>>     structure (subnetting) for routing within the site; this =
structure
>>>>     is not visible to the global routing system.  In theory, the =
bit
>>>>     string that represents an EID for one device can represent an =
RLOC
>>>>     for a different device.  As the architecture is realized, if a
>>>>     given bit string is both an RLOC and an EID, it must refer to =
the
>>>>     same entity in both cases.
>>>>=20
>>>>=20
>>>> Is the above sentence really necessary?
>>>>=20
>>>=20
>>> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID =
is an address of the overlay and an RLOC an address of the overlay. This =
change may require further changes on the document so I am not 100% sure =
if this is a good idea.
>>=20
>> For clarification I was just referring to the sentence:
>>=20
>> " As the architecture is realized, if a given bit string is both an =
RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=20=

>>=20
>> I am wondering if such constrain is really necessary. If namespaces =
are well scoped there is no need for this.=20
>>=20
>> [snip]
>>=20
>> About the following:
>>=20
>>>=20
>>>>=20
>>>>  o  EIDs are typically IP addresses assigned to hosts.
>>>>=20
>>>>  o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>     further information.
>>>>=20
>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>=20
>>>>=20
>>>=20
>>> I suggest to leave them here, I don=C2=B4t think that readers start =
from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>=20
>> Good point about de definition of terms. What really bothers me is =
the bullet organisation. What can be done is to merge these two bullets =
with the previous one.=20
>>=20
>>>=20
>>>>=20
>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>> ECN bits and DSCP .
>>>>=20
>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>=20
>>>> 2. How to deal with ECN should be part of the description of the  =
encap/decap not a paragraph apart.
>>>>   This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
>>>>   and the other half  in the ETR/PETR operation.
>>>=20
>>>=20
>>> Agreed, what about this (please comment):
>>>=20
>>>   When doing ITR/PITR encapsulation:
>>>=20
>>>    o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>    o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>=20
>>> When doing ETR/PETR decapsulation:
>>>=20
>>>   o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>   o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>>=20
>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>=20
>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>=20
>>=20
>> Text looks very good to me.
>>=20
>>=20
>>>=20
>>>>=20
>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>=20
>>>> What this section should state is that priority and weight are used =
to select the RLOC to use.
>>>> Only exception is gleaning where we have one single RLOC and we do =
not know neither priority nor weight.
>>>>=20
>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>=20
>>>=20
>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is =
less obvious, maybe something like (not final, just a couple of ideas):
>>>=20
>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>=20
>>=20
>> Yes, this is what I meant.
>>=20
>>=20
>>> Actually we should merge this section with 'Routing Locator Hashing'
>>>=20
>>>=20
>>=20
>> I think is a good idea.
>>=20
>> [snip]
>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>=20
>>>>=20
>>>> This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>>>> The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
>>>>=20
>>>> All of the rest 6833bis
>>>>=20
>>>> Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
>>>>=20
>>>>=20
>>>=20
>>> So you are suggesting that the LISP control-plane does not define =
any mechanism to update EID-to-RLOC mappings?=20
>>>=20
>>=20
>> Not exactly. Control-plane should discuss how to change the mappings, =
but things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense  to put =
it elsewhere.
>>=20
>> Thanks
>>=20
>> Luigi
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>> _______________________________________________
>> lisp mailing list
>> lisp@ietf.org
>> https://www.ietf.org/mailman/listinfo/lisp
>=20


From nobody Wed Jan 10 05:32:34 2018
Return-Path: <damien.saucez@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id CD51B12741D for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 05:32:31 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.7
X-Spam-Level: 
X-Spam-Status: No, score=-2.7 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id YLlagtuIwBx5 for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 05:32:29 -0800 (PST)
Received: from mail-wm0-x232.google.com (mail-wm0-x232.google.com [IPv6:2a00:1450:400c:c09::232]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 95010127275 for <lisp@ietf.org>; Wed, 10 Jan 2018 05:32:28 -0800 (PST)
Received: by mail-wm0-x232.google.com with SMTP id f206so27049527wmf.5 for <lisp@ietf.org>; Wed, 10 Jan 2018 05:32:28 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=U98CWKJmGOWWGKmzffsiByJ4UJ00vPNzfPO6M0N4kD8=; b=dHQlcnhqPxxhXg+I49KDT+pmJmg90Q8agLHqZhROB7lwRFptzvye0n89aHKPurZXVP exeE0176aAFPvUoaomuxdl88dSsWpD6SJrX6PR0qYHhbKUd03c7+KeMprkq6brohcvoc VgQhSp0aDpMGXYs2HjdJG6qq5OBvu4e61FnH57bT9byNhD0z3GyuTWNEyEojDvx+dkK5 agPEdOxu4bB8viVAI8mrJW8tdNUqok5Oo0u+6FqI0HpLWm6vyqdrcHmbGbB1K8budo+V ed/iLUIR/yZrHTKOYBI+yt95M8ET27d+PB46dL6secHLrtTuCwpgNGufhv1jREM4gYeQ 1G6A==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=U98CWKJmGOWWGKmzffsiByJ4UJ00vPNzfPO6M0N4kD8=; b=E0Mh178zCKxBByJiZetl8/69lR4NK5J1chOG5iwZ5XjCxcDuOzK7GgvYBMZ20k7wi1 NmVBr8q5IHws8kVnwtXK8h5cUlr88eFUGDWSznTHbiN+5pKzhiRx8KrlDyOfcclp+is2 FamrBBxT21BPOKU9ICE/AZJ/FYLDSCg+plbSaM1vkLLfinP29FE4AKJTzcKom1BxQH1X Qk+7Xz6zgLbBVa8ceYrOmgU/MU9f8w7P8gxLdAIk6tz4RBGMS5ABA5JuW9b6VPI0Z1v3 i5mxm2M1ciOKuZ2jzR/7TBoFewiCEp97iy/MA6Q/DRZq9P3S0VsVgSLCSgvF/JX1LXg7 9ppg==
X-Gm-Message-State: AKwxytfAOn++8AHegGz4LGSlB+etcyFZ8q8e5JxAmvx9lsogQr3bxPoI KQWnV7hlNMPFhOB0JwlXyFHWVynw
X-Google-Smtp-Source: ACJfBot1RBgGrDyDbH9Nr3V1Hw4aghgDLC3M/A5aTnyAy8Nk+lI2nWy6Id5wZMZlqnypHMHZ5rT3jA==
X-Received: by 10.28.125.19 with SMTP id y19mr4229549wmc.101.1515591146669; Wed, 10 Jan 2018 05:32:26 -0800 (PST)
Received: from gullinbursti.inria.fr (gullinbursti.inria.fr. [138.96.193.255]) by smtp.gmail.com with ESMTPSA id p32sm5881992wrc.9.2018.01.10.05.32.25 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Wed, 10 Jan 2018 05:32:25 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 10.3 \(3273\))
From: Damien Saucez <damien.saucez@gmail.com>
In-Reply-To: <829870A2-2D90-4967-983A-56F62E765796@gmail.com>
Date: Wed, 10 Jan 2018 14:32:25 +0100
Cc: Luigi Iannone <ggx@gigix.net>, LISP mailing list list <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <C6152BA8-1996-4026-AC06-6B97DB6D7242@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3273)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/79gWNKSAQ0y-7OsXWEDpYKTVmPk>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 10 Jan 2018 13:32:32 -0000

Hello Dino,

Thanks for the efforts.

The propositions in -08 are fine but are addressing only minor
details. As long as the structure of the document is not
fundamentally re-worked the document will remain poor and
barely readable for who doesn=E2=80=99t know LISP yet.

I already clearly gave my comments about all this, I don=E2=80=99t need
to repeat myself.

Regards,

Damien Saucez

> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Guys, please look at the latest changes instead of hashing the same =
arguments.=20
>=20
> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>=20
> The diff of the changes are included yet again.
>=20
> Dino
>=20
> <rfcdiff-rfc6830bis.html>
>=20
>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>=20
>>=20
>> HI Albert,
>>=20
>> thanks for your reply.=20
>>=20
>> My comments inline. (trimming what is OK for me)
>>=20
>> Luigi
>>=20
>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>=20
>>=20
>> [snip]
>>>>=20
>>>>=20
>>>>  Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>>>>     IPv6) value used in the source and destination address fields =
of
>>>>     the first (most inner) LISP header of a packet.  The host =
obtains
>>>>     a destination EID the same way it obtains a destination address
>>>>     today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>     lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>     The source EID is obtained via existing mechanisms used to set =
a
>>>>     host's "local" IP address.  An EID used on the public Internet
>>>>     must have the same properties as any other IP address used in =
that
>>>>     manner; this means, among other things, that it must be =
globally
>>>>     unique.  An EID is allocated to a host from an EID-Prefix block
>>>>     associated with the site where the host is located.  An EID can =
be
>>>>     used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>     be assigned in a hierarchical manner, independent of the =
network
>>>>     topology, to facilitate scaling of the mapping database.  In
>>>>     addition, an EID block assigned to a site may have site-local
>>>>     structure (subnetting) for routing within the site; this =
structure
>>>>     is not visible to the global routing system.  In theory, the =
bit
>>>>     string that represents an EID for one device can represent an =
RLOC
>>>>     for a different device.  As the architecture is realized, if a
>>>>     given bit string is both an RLOC and an EID, it must refer to =
the
>>>>     same entity in both cases.
>>>>=20
>>>>=20
>>>> Is the above sentence really necessary?
>>>>=20
>>>=20
>>> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID =
is an address of the overlay and an RLOC an address of the overlay. This =
change may require further changes on the document so I am not 100% sure =
if this is a good idea.
>>=20
>> For clarification I was just referring to the sentence:
>>=20
>> " As the architecture is realized, if a given bit string is both an =
RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=20=

>>=20
>> I am wondering if such constrain is really necessary. If namespaces =
are well scoped there is no need for this.=20
>>=20
>> [snip]
>>=20
>> About the following:
>>=20
>>>=20
>>>>=20
>>>>  o  EIDs are typically IP addresses assigned to hosts.
>>>>=20
>>>>  o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>     further information.
>>>>=20
>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>=20
>>>>=20
>>>=20
>>> I suggest to leave them here, I don=C2=B4t think that readers start =
from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>=20
>> Good point about de definition of terms. What really bothers me is =
the bullet organisation. What can be done is to merge these two bullets =
with the previous one.=20
>>=20
>>>=20
>>>>=20
>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>> ECN bits and DSCP .
>>>>=20
>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>=20
>>>> 2. How to deal with ECN should be part of the description of the  =
encap/decap not a paragraph apart.
>>>>   This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
>>>>   and the other half  in the ETR/PETR operation.
>>>=20
>>>=20
>>> Agreed, what about this (please comment):
>>>=20
>>>   When doing ITR/PITR encapsulation:
>>>=20
>>>    o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>    o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>=20
>>> When doing ETR/PETR decapsulation:
>>>=20
>>>   o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>   o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>>=20
>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>=20
>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>=20
>>=20
>> Text looks very good to me.
>>=20
>>=20
>>>=20
>>>>=20
>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>=20
>>>> What this section should state is that priority and weight are used =
to select the RLOC to use.
>>>> Only exception is gleaning where we have one single RLOC and we do =
not know neither priority nor weight.
>>>>=20
>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>=20
>>>=20
>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is =
less obvious, maybe something like (not final, just a couple of ideas):
>>>=20
>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>=20
>>=20
>> Yes, this is what I meant.
>>=20
>>=20
>>> Actually we should merge this section with 'Routing Locator Hashing'
>>>=20
>>>=20
>>=20
>> I think is a good idea.
>>=20
>> [snip]
>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>=20
>>>>=20
>>>> This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>>>> The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
>>>>=20
>>>> All of the rest 6833bis
>>>>=20
>>>> Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
>>>>=20
>>>>=20
>>>=20
>>> So you are suggesting that the LISP control-plane does not define =
any mechanism to update EID-to-RLOC mappings?=20
>>>=20
>>=20
>> Not exactly. Control-plane should discuss how to change the mappings, =
but things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense  to put =
it elsewhere.
>>=20
>> Thanks
>>=20
>> Luigi
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>> _______________________________________________
>> lisp mailing list
>> lisp@ietf.org
>> https://www.ietf.org/mailman/listinfo/lisp
>=20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


From nobody Wed Jan 10 09:26:45 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id D063312DA3D for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 09:26:43 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id oIX3u7eRHbDf for <lisp@ietfa.amsl.com>; Wed, 10 Jan 2018 09:26:41 -0800 (PST)
Received: from mail-pg0-x22e.google.com (mail-pg0-x22e.google.com [IPv6:2607:f8b0:400e:c05::22e]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id E0F1412D7E2 for <lisp@ietf.org>; Wed, 10 Jan 2018 09:26:40 -0800 (PST)
Received: by mail-pg0-x22e.google.com with SMTP id d6so10269691pgv.2 for <lisp@ietf.org>; Wed, 10 Jan 2018 09:26:40 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=e01FZhL8ubimVOextYgzl/o82rTntPfGUbvGMcTyvQ8=; b=CzZVq4KCSPMM4T20N9Ajg5rYcy5IxAvJhqFJoFOVvzL8CDXzmSrU/6WHZvj3p3yRbH sXBeyzK1vDmQWXZjoMSher5CmfZBf8yZ9JT9GCWw237QTzVlKvJfTCNdx+Vk6hRRrSSK FTyAGp/l5Qiz9Cttu8PDe+yf0zRKHBD/Fq9QaBvo23PqPGo8l9qjoN+80x5CIvkapVRS 8JidYpzA3Zppj1J737bREAbLmN59Y4N4UVf4gXoqASf44G7vq/BSxbwK4Q04mh5xOwpa lfdAlvPvUqfQOybCqtjA7eA13Nrf5aXpiyCZUSg5qH7Nwr57523wHh6QhCNEodA2q+eU 9lRg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=e01FZhL8ubimVOextYgzl/o82rTntPfGUbvGMcTyvQ8=; b=ANznhqzerLdfUiAHLNht+z2oTzwNUNQvHw80MCetYe3pUh0qRUx5Dy1qskMnOfz5xc 2jNg0tsQmaqaurqPqiIqodUW0dcGgrEqQvF3qQ9j26xGSrIwIcclFe0kLtZWSUIFH7Id buZkkmXgolfzEYPCePSA+azP5FTFoYAGSYJwKTFek434osjKMf4YTD6V5eujceQPNzI6 42UBehAjwxvOHKwYh9FWnCDmkc/ofMYz02SukDu5hH/Np6FXzlu7pnW/PIplrvChHQ8p E4i1nj50uJbJZAJD3wnHKDmhz6YUcxTnaGOgjEPR7EjR5KoZIaJKrzGyGoAYL6gVC727 1sfg==
X-Gm-Message-State: AKGB3mIB0klRMiAAw0fmXgKVO8RFIbtZ6aPQlnpp/d3DQzGwnFg8Hcvj OA9Ltx0m7oCz3DvrZNxQtlE=
X-Google-Smtp-Source: ACJfBospin028UACWoSYllSQoH9VA4FWzP+nrL9P/jMUxd8eWoE2HRNtEfpoQxfAp1bwEuikECVtuw==
X-Received: by 10.101.77.133 with SMTP id p5mr15916526pgq.106.1515605200099; Wed, 10 Jan 2018 09:26:40 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id r68sm36673463pfb.149.2018.01.10.09.26.38 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Wed, 10 Jan 2018 09:26:39 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net>
Date: Wed, 10 Jan 2018 09:26:38 -0800
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/4Ko46TzjG1YHKs2h9FS1g-aZ-N0>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 10 Jan 2018 17:26:44 -0000

=46rom my perspective on the situation:

(1) I made changes exactly to text that was requested.
(2) I sometimes modify what the text that was requested.
(3) I disgree with some text so don=E2=80=99t include it.
(4) I have made many sub-revisions of -08.
(5) Comments are coming in throughout the review period and I don=E2=80=99=
t know what revision you have read and what you have not read. I don=E2=80=
=99t know if your comments are old or based on one of the revisions. =
Because I see comments that I addressed but its not clear to me you know =
that (or at least you have not told me).
(6) The changes in (1) and (2) have not been confirmed or denied by =
commenters. So I don=E2=80=99t know if what I changed has been accepted.
(7) Adding text to something that has changed won=E2=80=99t go in =
properly. So referencing some offered text in a previous email can=E2=80=99=
t be just inserted.

So -08 has been submitted. I don=E2=80=99t know what are the outstanding =
issues at this point. So I need commenters to be specific. This is what =
I suggest:

(1) List the open issues by commenting on the latest submitted -08.
(2) Include text from the -08 draft and your comments follow with =
suggested text.

Let=E2=80=99s use that as a base to comment and discuss further. I =
can=E2=80=99t read your minds so I need more of your help. So please put =
more effort into it.

Thanks in advance for your support,
Dino


> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>=20
> Dino,
>=20
>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> wrote:
>>=20
>> Guys, please look at the latest changes instead of hashing the same =
arguments.=20
>>=20
>> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>>=20
>=20
> I find this request unfair.=20
> I spent quite a bit of time reviewing and discussing this document, =
now you just try to wash all out by requesting comments on -08.
>=20
> Please let's continue discussing on the open issues so to find a =
solution.
>=20
> Thanks
>=20
> Luigi
>=20
>=20
>=20
>> The diff of the changes are included yet again.
>>=20
>> Dino
>>=20
>> <rfcdiff-rfc6830bis.html>
>>=20
>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>=20
>>>=20
>>> HI Albert,
>>>=20
>>> thanks for your reply.=20
>>>=20
>>> My comments inline. (trimming what is OK for me)
>>>=20
>>> Luigi
>>>=20
>>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>>=20
>>>=20
>>> [snip]
>>>>>=20
>>>>>=20
>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>>>>>    IPv6) value used in the source and destination address fields =
of
>>>>>    the first (most inner) LISP header of a packet.  The host =
obtains
>>>>>    a destination EID the same way it obtains a destination address
>>>>>    today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>>    lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>>    The source EID is obtained via existing mechanisms used to set =
a
>>>>>    host's "local" IP address.  An EID used on the public Internet
>>>>>    must have the same properties as any other IP address used in =
that
>>>>>    manner; this means, among other things, that it must be =
globally
>>>>>    unique.  An EID is allocated to a host from an EID-Prefix block
>>>>>    associated with the site where the host is located.  An EID can =
be
>>>>>    used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>>    be assigned in a hierarchical manner, independent of the =
network
>>>>>    topology, to facilitate scaling of the mapping database.  In
>>>>>    addition, an EID block assigned to a site may have site-local
>>>>>    structure (subnetting) for routing within the site; this =
structure
>>>>>    is not visible to the global routing system.  In theory, the =
bit
>>>>>    string that represents an EID for one device can represent an =
RLOC
>>>>>    for a different device.  As the architecture is realized, if a
>>>>>    given bit string is both an RLOC and an EID, it must refer to =
the
>>>>>    same entity in both cases.
>>>>>=20
>>>>>=20
>>>>> Is the above sentence really necessary?
>>>>>=20
>>>>=20
>>>> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID =
is an address of the overlay and an RLOC an address of the overlay. This =
change may require further changes on the document so I am not 100% sure =
if this is a good idea.
>>>=20
>>> For clarification I was just referring to the sentence:
>>>=20
>>> " As the architecture is realized, if a given bit string is both an =
RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=20=

>>>=20
>>> I am wondering if such constrain is really necessary. If namespaces =
are well scoped there is no need for this.=20
>>>=20
>>> [snip]
>>>=20
>>> About the following:
>>>=20
>>>>=20
>>>>>=20
>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>=20
>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>    further information.
>>>>>=20
>>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>>=20
>>>>>=20
>>>>=20
>>>> I suggest to leave them here, I don=C2=B4t think that readers start =
from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>>=20
>>> Good point about de definition of terms. What really bothers me is =
the bullet organisation. What can be done is to merge these two bullets =
with the previous one.=20
>>>=20
>>>>=20
>>>>>=20
>>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>>> ECN bits and DSCP .
>>>>>=20
>>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>>=20
>>>>> 2. How to deal with ECN should be part of the description of the  =
encap/decap not a paragraph apart.
>>>>>  This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
>>>>>  and the other half  in the ETR/PETR operation.
>>>>=20
>>>>=20
>>>> Agreed, what about this (please comment):
>>>>=20
>>>>  When doing ITR/PITR encapsulation:
>>>>=20
>>>>   o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>>   o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>>=20
>>>> When doing ETR/PETR decapsulation:
>>>>=20
>>>>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>>  o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>>>=20
>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>>=20
>>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>>=20
>>>=20
>>> Text looks very good to me.
>>>=20
>>>=20
>>>>=20
>>>>>=20
>>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>>=20
>>>>> What this section should state is that priority and weight are =
used to select the RLOC to use.
>>>>> Only exception is gleaning where we have one single RLOC and we do =
not know neither priority nor weight.
>>>>>=20
>>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>>=20
>>>>=20
>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is =
less obvious, maybe something like (not final, just a couple of ideas):
>>>>=20
>>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>>=20
>>>=20
>>> Yes, this is what I meant.
>>>=20
>>>=20
>>>> Actually we should merge this section with 'Routing Locator =
Hashing'
>>>>=20
>>>>=20
>>>=20
>>> I think is a good idea.
>>>=20
>>> [snip]
>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>=20
>>>>>=20
>>>>> This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>>>>> The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
>>>>>=20
>>>>> All of the rest 6833bis
>>>>>=20
>>>>> Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
>>>>>=20
>>>>>=20
>>>>=20
>>>> So you are suggesting that the LISP control-plane does not define =
any mechanism to update EID-to-RLOC mappings?=20
>>>>=20
>>>=20
>>> Not exactly. Control-plane should discuss how to change the =
mappings, but things like clock sweep is just management not a control =
plane mechanism, as such it does not really needs to be standardised =
because there are no interoperability issues, hence it make really sense =
 to put it elsewhere.
>>>=20
>>> Thanks
>>>=20
>>> Luigi
>>>=20
>>>=20
>>>=20
>>>=20
>>>=20
>>>=20
>>>=20
>>>=20
>>>=20
>>> _______________________________________________
>>> lisp mailing list
>>> lisp@ietf.org
>>> https://www.ietf.org/mailman/listinfo/lisp
>>=20
>=20


From nobody Thu Jan 11 06:22:01 2018
Return-Path: <rodrigueznatal@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 73B7512EB84 for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 06:21:59 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.699
X-Spam-Level: 
X-Spam-Status: No, score=-2.699 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id PrSDmBInlZVs for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 06:21:56 -0800 (PST)
Received: from mail-it0-x236.google.com (mail-it0-x236.google.com [IPv6:2607:f8b0:4001:c0b::236]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 8E97212EB83 for <lisp@ietf.org>; Thu, 11 Jan 2018 06:21:56 -0800 (PST)
Received: by mail-it0-x236.google.com with SMTP id b5so4540342itc.3 for <lisp@ietf.org>; Thu, 11 Jan 2018 06:21:56 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc:content-transfer-encoding; bh=GY9lUt36jZMmWTlEciOu2lA1UN/8ChSFZU1CLiIzJYg=; b=C8QrhXuScmSqJvIHmbIlCDRwkX1sPF3B12faUrDb1Wyq0TWrsHADmJoP68hYA2oUXB giyxKCkRCXsZtMAJnaW9ogKj3z8Cq/wpNEhDVYsLdxcKSB+1cyZGNfdnI22PGqt4mbNG XYzmN5e2NprmPMyUuEE+lLmpdWh+SoPp01UqKfGpJ+opJdUtll23b/45uIBsi+CfrvQN 1sQq6WVAj40l5EwNec4/6/lHXgJW+YxRokKQs2wP0Je2ktdihHmGQtRQOG3sAOn+aTal j3Uy+KfpvM/4rdbmMd/6vlzzeCxkJEDJ0Unuw9raryM+8ysxyKEHNchbok79UxJbXdCs U4iA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc:content-transfer-encoding; bh=GY9lUt36jZMmWTlEciOu2lA1UN/8ChSFZU1CLiIzJYg=; b=BZoeXT4pDki7q7eSuhoX3rpbn7sFr9dzSwAD5Bbwoa4iNZcXWokGF/EFcCU1aw5Y8J rKGQtT/7W1Nt6E6KeYn0E7PItk6BlF149UKO8dbPpnF0LVlfMnZ+8iIRL9C/4PD8i212 Rg3APu39Pn3vok5jfHU9zZG3pzRd+ImHKTTVQ0uvEQ+WuCrMAIK3yPbXMyd07vARF0U7 9wqF5b+9NiRiCHbeadAR3I/0REwZQpPuJWthL/rdDrEHSgUe5LZt+vlvOelVvd//qnAI XqRig+sdMqZLxbpChhH6G4LC0IK/JkaCuBF0o0FN91tjNDTd/3nUTiMkchI7UCGK1SHt 3UPw==
X-Gm-Message-State: AKwxyteuXlwMXNTjMHr/bn9OAyn2wrxkBD8rw9BygL/0PtkhMyU5beIH 42ZxtCinErRi2jNbEmAiP+7b4bAFQQX4jkX2gns=
X-Google-Smtp-Source: ACJfBou9H9QJ3UbmP3Y3DLHeOCjtQlEfF9+nq3gd5QjI+CzCzLPL7waHZPcLTd2aUfN6lVGSIRn/c7W+BHorh3lYN7s=
X-Received: by 10.107.7.41 with SMTP id 41mr4744364ioh.249.1515680515578; Thu, 11 Jan 2018 06:21:55 -0800 (PST)
MIME-Version: 1.0
Received: by 10.107.181.65 with HTTP; Thu, 11 Jan 2018 06:21:34 -0800 (PST)
In-Reply-To: <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com>
From: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
Date: Thu, 11 Jan 2018 15:21:34 +0100
Message-ID: <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/KPNrRXyLWCMGxMAMEwHDMMZARZY>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 11 Jan 2018 14:21:59 -0000

Adding my two cents to this discussion, in the hope that it helps with
the convergence.

My original hope with the reorganization of the RFCs was to be able to
use the LISP control-plane with a non-LISP data-plane. Putting aside
the discussion of what goes where, and with some pragmatism in mind, I
think we're close to that with the current 6833bis. The major
roadblock for me is the lack of SMR in that document, and I think this
aligns with the view of others in the list.

I believe that with the addition of SMR, 6833bis will have all the
required pieces to put together a viable LISP deployment (using a
non-LISP data-plane) without having to look into 6830bis. Sure, there
would be some mechanisms (e.g. RLOC probing) that would not be
available using only 6833bis, but I could live without those. In
addition, we could work on adding some extra explanation to the
introduction of 6833bis so a non-familiar reader could make use of
LISP without looking into 6830bis.

I think these two things (i.e. move SMR and extend 6833bis intro)
would minimize the changes required on the current documents and would
allow us to reach some rough consensus to make progress with the docs.
What do you guys think?

Alberto

On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci <farinacci@gmail.com> wrote=
:
> From my perspective on the situation:
>
> (1) I made changes exactly to text that was requested.
> (2) I sometimes modify what the text that was requested.
> (3) I disgree with some text so don=E2=80=99t include it.
> (4) I have made many sub-revisions of -08.
> (5) Comments are coming in throughout the review period and I don=E2=80=
=99t know what revision you have read and what you have not read. I don=E2=
=80=99t know if your comments are old or based on one of the revisions. Bec=
ause I see comments that I addressed but its not clear to me you know that =
(or at least you have not told me).
> (6) The changes in (1) and (2) have not been confirmed or denied by comme=
nters. So I don=E2=80=99t know if what I changed has been accepted.
> (7) Adding text to something that has changed won=E2=80=99t go in properl=
y. So referencing some offered text in a previous email can=E2=80=99t be ju=
st inserted.
>
> So -08 has been submitted. I don=E2=80=99t know what are the outstanding =
issues at this point. So I need commenters to be specific. This is what I s=
uggest:
>
> (1) List the open issues by commenting on the latest submitted -08.
> (2) Include text from the -08 draft and your comments follow with suggest=
ed text.
>
> Let=E2=80=99s use that as a base to comment and discuss further. I can=E2=
=80=99t read your minds so I need more of your help. So please put more eff=
ort into it.
>
> Thanks in advance for your support,
> Dino
>
>
>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>
>> Dino,
>>
>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> wrote:
>>>
>>> Guys, please look at the latest changes instead of hashing the same arg=
uments.
>>>
>>> This is what I am going to do. I am going to submit the myriad of chang=
es already agreed to and then we can open up comments again for -08. I have=
 been holding these diffs for a few weeks now and have received little comm=
entary on the latest changes. So if your points have not been addressed, st=
ate them again AFTER reading the changes to -08.
>>>
>>
>> I find this request unfair.
>> I spent quite a bit of time reviewing and discussing this document, now =
you just try to wash all out by requesting comments on -08.
>>
>> Please let's continue discussing on the open issues so to find a solutio=
n.
>>
>> Thanks
>>
>> Luigi
>>
>>
>>
>>> The diff of the changes are included yet again.
>>>
>>> Dino
>>>
>>> <rfcdiff-rfc6830bis.html>
>>>
>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>
>>>>
>>>> HI Albert,
>>>>
>>>> thanks for your reply.
>>>>
>>>> My comments inline. (trimming what is OK for me)
>>>>
>>>> Luigi
>>>>
>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos <albert.cabellos@gmail.com>=
 wrote:
>>>>>
>>>>
>>>> [snip]
>>>>>>
>>>>>>
>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>>>>>>    IPv6) value used in the source and destination address fields of
>>>>>>    the first (most inner) LISP header of a packet.  The host obtains
>>>>>>    a destination EID the same way it obtains a destination address
>>>>>>    today, for example, through a Domain Name System (DNS) [RFC1034]
>>>>>>    lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>>>    The source EID is obtained via existing mechanisms used to set a
>>>>>>    host's "local" IP address.  An EID used on the public Internet
>>>>>>    must have the same properties as any other IP address used in tha=
t
>>>>>>    manner; this means, among other things, that it must be globally
>>>>>>    unique.  An EID is allocated to a host from an EID-Prefix block
>>>>>>    associated with the site where the host is located.  An EID can b=
e
>>>>>>    used by a host to refer to other hosts.  Note that EID blocks MAY
>>>>>>    be assigned in a hierarchical manner, independent of the network
>>>>>>    topology, to facilitate scaling of the mapping database.  In
>>>>>>    addition, an EID block assigned to a site may have site-local
>>>>>>    structure (subnetting) for routing within the site; this structur=
e
>>>>>>    is not visible to the global routing system.  In theory, the bit
>>>>>>    string that represents an EID for one device can represent an RLO=
C
>>>>>>    for a different device.  As the architecture is realized, if a
>>>>>>    given bit string is both an RLOC and an EID, it must refer to the
>>>>>>    same entity in both cases.
>>>>>>
>>>>>>
>>>>>> Is the above sentence really necessary?
>>>>>>
>>>>>
>>>>> Agreed, why not simplify the definitions. They are written from the =
=E2=80=98Internet scalability mindset=E2=80=99, why not say that an EID is =
an address of the overlay and an RLOC an address of the overlay. This chang=
e may require further changes on the document so I am not 100% sure if this=
 is a good idea.
>>>>
>>>> For clarification I was just referring to the sentence:
>>>>
>>>> " As the architecture is realized, if a given bit string is both an RL=
OC and an EID, it must refer to the same entity in both cases.=E2=80=9D
>>>>
>>>> I am wondering if such constrain is really necessary. If namespaces ar=
e well scoped there is no need for this.
>>>>
>>>> [snip]
>>>>
>>>> About the following:
>>>>
>>>>>
>>>>>>
>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>
>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>>    further information.
>>>>>>
>>>>>> I would put the last two bullets in the definition of EID. It simpli=
fies the story here.
>>>>>>
>>>>>>
>>>>>
>>>>> I suggest to leave them here, I don=C2=B4t think that readers start f=
rom the =E2=80=98Definition of terms=E2=80=99, these are relevant concepts =
to understand LISP.
>>>>
>>>> Good point about de definition of terms. What really bothers me is the=
 bullet organisation. What can be done is to merge these two bullets with t=
he previous one.
>>>>
>>>>>
>>>>>>
>>>>>> The description of the encap/decap operation lacks of clarity concer=
ning how to deal with
>>>>>> ECN bits and DSCP .
>>>>>>
>>>>>> 1. I think that the text should make explicitly the difference betwe=
en DSCP and ECN fields.
>>>>>>
>>>>>> 2. How to deal with ECN should be part of the description of the  en=
cap/decap not a paragraph apart.
>>>>>>  This basically means that half of the last paragraph should be a bu=
llet of the ITR/PITR encapsulation
>>>>>>  and the other half  in the ETR/PETR operation.
>>>>>
>>>>>
>>>>> Agreed, what about this (please comment):
>>>>>
>>>>>  When doing ITR/PITR encapsulation:
>>>>>
>>>>>   o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' fie=
ld.
>>>>>   o  The outer-header 'Differentiated Services Code Point' (DSCP) fie=
ld (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied fro=
m the inner-header DSCP field ('Traffic Class' field, in the case of IPv6) =
considering the exception listed below.
>>>>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order to a=
void discarding indications of congestion [RFC3168]. ITR encapsulation MUST=
 copy the 2-bit 'ECN' field from the inner header to the outer header. Re-e=
ncapsulation MUST copy the 2-bit 'ECN' field from the stripped outer header=
 to the new outer header.
>>>>>
>>>>> When doing ETR/PETR decapsulation:
>>>>>
>>>>>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in t=
he case of IPv6) SHOULD be copied from the outer-header 'Time to Live' fiel=
d, when the Time to Live value of the outer header is less than the Time to=
 Live value of the inner header.  Failing to perform this check can cause t=
he Time to Live of the inner header to increment across encapsulation/decap=
sulation cycles.  This check is also performed when doing initial encapsula=
tion, when a packet comes to an ITR or PITR destined for a LISP site.
>>>>>  o  The inner-header 'Differentiated Services Code Point' (DSCP) fiel=
d (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from=
 the outer-header DSCP field ('Traffic Class' field, in the case of IPv6) c=
onsidering the exception listed below.
>>>>>  o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order to a=
void discarding indications of congestion [RFC3168]. If the 'ECN' field con=
tains a congestion indication codepoint (the value is '11', the Congestion =
Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit 'EC=
N' field from the stripped outer header to the surviving inner header that =
is used to forward the packet beyond the ETR.  These requirements preserve =
CE indications when a packet that uses ECN traverses a LISP tunnel and beco=
mes marked with a CE indication due to congestion between the tunnel endpoi=
nts.
>>>>>
>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encaps=
ulate after decapsulating, the net effect of this is that the new outer hea=
der will carry the same Time to Live as the old outer header minus 1.
>>>>>
>>>>> Copying the Time to Live (TTL) serves two purposes: first, it preserv=
es the distance the host intended the packet to travel; second, and more im=
portantly, it provides for suppression of looping packets in the event ther=
e is a loop of concatenated tunnels due to misconfiguration.  See Section 1=
8.3 for TTL exception handling for traceroute packets.
>>>>>
>>>>
>>>> Text looks very good to me.
>>>>
>>>>
>>>>>
>>>>>>
>>>>>> Large part of this section is about control plane issues and as such=
 should be put in 6833bis.
>>>>>>
>>>>>> What this section should state is that priority and weight are used =
to select the RLOC to use.
>>>>>> Only exception is gleaning where we have one single RLOC and we do n=
ot know neither priority nor weight.
>>>>>>
>>>>>> All the other operational discussion goes elsewhere, but not in this=
 document.
>>>>>>
>>>>>
>>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is le=
ss obvious, maybe something like (not final, just a couple of ideas):
>>>>>
>>>>> The data-plane must follow the state stored in the map-cache to encap=
sulate and decapsulate packets. The map-cache is populated using a control-=
plane, such as [6833bis]. ETRs encapsulate packets following the Priorities=
 and Weights stored in the map-cache.
>>>>>
>>>>
>>>> Yes, this is what I meant.
>>>>
>>>>
>>>>> Actually we should merge this section with 'Routing Locator Hashing'
>>>>>
>>>>>
>>>>
>>>> I think is a good idea.
>>>>
>>>> [snip]
>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>
>>>>>>
>>>>>> This is a control plane issue, as such it has to go in 6833bis, with=
 two exception:
>>>>>> The very first paragraph stetting the problem, and the versioning su=
bsection, because it is a data-plane mechanism.
>>>>>>
>>>>>> All of the rest 6833bis
>>>>>>
>>>>>> Actually I remember a suggestion about putting operations issues lik=
e this in an OAM document which would be a good idea.
>>>>>>
>>>>>>
>>>>>
>>>>> So you are suggesting that the LISP control-plane does not define any=
 mechanism to update EID-to-RLOC mappings?
>>>>>
>>>>
>>>> Not exactly. Control-plane should discuss how to change the mappings, =
but things like clock sweep is just management not a control plane mechanis=
m, as such it does not really needs to be standardised because there are no=
 interoperability issues, hence it make really sense  to put it elsewhere.
>>>>
>>>> Thanks
>>>>
>>>> Luigi
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>> _______________________________________________
>>>> lisp mailing list
>>>> lisp@ietf.org
>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>
>>
>
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


From nobody Thu Jan 11 09:50:22 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 52EAB12DA4B for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 09:50:17 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 7VsLl_-J7wg7 for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 09:50:13 -0800 (PST)
Received: from mail-pg0-x244.google.com (mail-pg0-x244.google.com [IPv6:2607:f8b0:400e:c05::244]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 8090412EC07 for <lisp@ietf.org>; Thu, 11 Jan 2018 09:50:05 -0800 (PST)
Received: by mail-pg0-x244.google.com with SMTP id 136so2106781pgd.8 for <lisp@ietf.org>; Thu, 11 Jan 2018 09:50:05 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=kQ609utNDrpux0qhe+XqJHlgQF6XZS4cNGk9C9ZhZZs=; b=ZrmTD59HMfJ1g1sc5MLzUk/p+AbC+Zb7TujWpd9QBB/woIGOrhdTL0ZXb1Iu3V4kfW L/NwIqEPDP8XWxxj/Ly5e2fQyhqNYpO3cmGFbd4NsNvVMA5jSP7lKApsX3aeTSkU0db/ +c2kWKlXb4SSueqqLYmoyL8a5Tgek6AlCUuBk5bW6CloJofa/4U66KiRWc+BqSzXb93e 0SG4zpwypq0cz1MwUwqjpZHYwF7py/Bv9YfJLU3SznyvpMEB+ixYUoCK2+qlLd8ia5IS nJYPJuwdhxUyT41ezQ/epEEmQpdGtOX8yLJbVEFxFffyUbD88g3zjmeUOiAJPGnR8zMV ROaA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=kQ609utNDrpux0qhe+XqJHlgQF6XZS4cNGk9C9ZhZZs=; b=V08EBZFxgHx0WpEhQoyRAk8jGLOJtHmUl2Isr5xypH758sNDiNeXytidCsXs9IQlhV U+71GYRCqlQtrLqtTGvh8cQ5Vpn73jZt4dciiC5gRXtkIWPs1zG0+jIyQ9N0BO+HhCSg gS074o1xsN1SWhaGFoysYy7mJoZNxQzcCSvCORSqYdN8euzQOSfuumjgc2KfDqiTsPyl ggEQouOQcsaNt1w0Lw07MOUNzobFL2y0UgrdazXWhDz9zPlhlOCiDuY5YE43sm/TblJ9 Og8X3SJHDWV9VONT3TS4+iiF04IUzAa+XF1qNd7xYINsQ5y52+lZBrxNxWsSqKGUhaxS JA5w==
X-Gm-Message-State: AKwxytfTuA0kaTBHuMZjebIWUiONInqgGh1v2Ga161no93q5Y5KuiLUb eRCyEzaTggVn+KN+nsq4XCs=
X-Google-Smtp-Source: ACJfBovh8jBsKzblOaPbIkMzCTn/1wf/5wqaf8hRtLWaS7vAJxs1Jfuge5qGdy+qTslbf6EqQBNVmw==
X-Received: by 10.99.123.28 with SMTP id w28mr7691805pgc.305.1515693004805; Thu, 11 Jan 2018 09:50:04 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id s25sm36638925pge.63.2018.01.11.09.50.03 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Thu, 11 Jan 2018 09:50:03 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com>
Date: Thu, 11 Jan 2018 09:50:02 -0800
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, Dino Farinacci <farinacci@gmail.com>
Content-Transfer-Encoding: quoted-printable
Message-Id: <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com>
To: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/pzSHFhqeKeSoSW_Q_LKtcbOM2sY>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 11 Jan 2018 17:50:17 -0000

Thanks Alberto for your comments. Here is how I break up items in the =
control-plane and the data-plane.=20

Control-Plane (6833bis document):

(1) The definition of control-plane messages. These are already =
documented in 6833bis.
(2) What components make up the control-plane that are not also in the =
data-plane. That is Map-Servers, Map-Resovers, LISP-ALT nodes, LISP-DDT =
nodes. These are already documented in 6833bis.

Data-Plane (6830bis document):

(1) What is required to move packets. Which includes the encapsulation =
format and the database-mappings and map-cache xTRs use. These are =
already documented in RFC6830bis.
(2) The components that make up the data-plane. That is ITRs, ETRs, =
PxTRs, and RTRs.
(3) And the elements of operation that the components in (2) use. So =
RLOC-probing and SMRs are explained in RFC6830bis because the components =
in (2) use. They are using control-plane messages obviously but those =
messages are defined in 6833bis.

Note that ETRs send SMRs, note ITRs and PITR send RLOC-probes. These =
messages are not sent by any control-plane components. Another =
data-plane can be defined to do its own OAM or map version updating and =
use the messages defined in 6833bis to do that. But they could also =
might =E2=80=9Clet me try to use the same map-cache mechanisms as LISP =
but use a different encapsulation format=E2=80=9D. In this case, an =
implementor or deployer would read 6830bis.

Having said that, people don=E2=80=99t create walls between getting =
information so if they want to do their own data-plane they can still =
read 6830bis.

Another point about SMRs, the entire section talks about what ITRs and =
ETRs do. And these devices are data-plane components. Putting this =
section in 6833bis would possibly surprise a reader implementing another =
data-plane. For instance, a VXLAN data-plane reader would say =E2=80=9Cwha=
t is an ITR and ETR? I have VTEPs=E2=80=9D. Another point about SMRs, =
they can be data driven. This happens when an ITR encapsulates to an ETR =
where the EID is no longer residing. That ETR, could respond with a SMR =
to the ITR to inform it that it has out of date mappings. This is all =
data-plane driven. Wouldn=E2=80=99t make logical sense to put it in =
6833bis.

Anyways, that is the way I look at it,
Dino

> On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal =
<rodrigueznatal@gmail.com> wrote:
>=20
> Adding my two cents to this discussion, in the hope that it helps with
> the convergence.
>=20
> My original hope with the reorganization of the RFCs was to be able to
> use the LISP control-plane with a non-LISP data-plane. Putting aside
> the discussion of what goes where, and with some pragmatism in mind, I
> think we're close to that with the current 6833bis. The major
> roadblock for me is the lack of SMR in that document, and I think this
> aligns with the view of others in the list.
>=20
> I believe that with the addition of SMR, 6833bis will have all the
> required pieces to put together a viable LISP deployment (using a
> non-LISP data-plane) without having to look into 6830bis. Sure, there
> would be some mechanisms (e.g. RLOC probing) that would not be
> available using only 6833bis, but I could live without those. In
> addition, we could work on adding some extra explanation to the
> introduction of 6833bis so a non-familiar reader could make use of
> LISP without looking into 6830bis.
>=20
> I think these two things (i.e. move SMR and extend 6833bis intro)
> would minimize the changes required on the current documents and would
> allow us to reach some rough consensus to make progress with the docs.
> What do you guys think?
>=20
> Alberto
>=20
> On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci <farinacci@gmail.com> =
wrote:
>> =46rom my perspective on the situation:
>>=20
>> (1) I made changes exactly to text that was requested.
>> (2) I sometimes modify what the text that was requested.
>> (3) I disgree with some text so don=E2=80=99t include it.
>> (4) I have made many sub-revisions of -08.
>> (5) Comments are coming in throughout the review period and I don=E2=80=
=99t know what revision you have read and what you have not read. I =
don=E2=80=99t know if your comments are old or based on one of the =
revisions. Because I see comments that I addressed but its not clear to =
me you know that (or at least you have not told me).
>> (6) The changes in (1) and (2) have not been confirmed or denied by =
commenters. So I don=E2=80=99t know if what I changed has been accepted.
>> (7) Adding text to something that has changed won=E2=80=99t go in =
properly. So referencing some offered text in a previous email can=E2=80=99=
t be just inserted.
>>=20
>> So -08 has been submitted. I don=E2=80=99t know what are the =
outstanding issues at this point. So I need commenters to be specific. =
This is what I suggest:
>>=20
>> (1) List the open issues by commenting on the latest submitted -08.
>> (2) Include text from the -08 draft and your comments follow with =
suggested text.
>>=20
>> Let=E2=80=99s use that as a base to comment and discuss further. I =
can=E2=80=99t read your minds so I need more of your help. So please put =
more effort into it.
>>=20
>> Thanks in advance for your support,
>> Dino
>>=20
>>=20
>>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>=20
>>> Dino,
>>>=20
>>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>>>=20
>>>> Guys, please look at the latest changes instead of hashing the same =
arguments.
>>>>=20
>>>> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>>>>=20
>>>=20
>>> I find this request unfair.
>>> I spent quite a bit of time reviewing and discussing this document, =
now you just try to wash all out by requesting comments on -08.
>>>=20
>>> Please let's continue discussing on the open issues so to find a =
solution.
>>>=20
>>> Thanks
>>>=20
>>> Luigi
>>>=20
>>>=20
>>>=20
>>>> The diff of the changes are included yet again.
>>>>=20
>>>> Dino
>>>>=20
>>>> <rfcdiff-rfc6830bis.html>
>>>>=20
>>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>=20
>>>>>=20
>>>>> HI Albert,
>>>>>=20
>>>>> thanks for your reply.
>>>>>=20
>>>>> My comments inline. (trimming what is OK for me)
>>>>>=20
>>>>> Luigi
>>>>>=20
>>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>>>>=20
>>>>>=20
>>>>> [snip]
>>>>>>>=20
>>>>>>>=20
>>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit =
(for
>>>>>>>  IPv6) value used in the source and destination address fields =
of
>>>>>>>  the first (most inner) LISP header of a packet.  The host =
obtains
>>>>>>>  a destination EID the same way it obtains a destination address
>>>>>>>  today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>>>>  lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>>>>  The source EID is obtained via existing mechanisms used to set =
a
>>>>>>>  host's "local" IP address.  An EID used on the public Internet
>>>>>>>  must have the same properties as any other IP address used in =
that
>>>>>>>  manner; this means, among other things, that it must be =
globally
>>>>>>>  unique.  An EID is allocated to a host from an EID-Prefix block
>>>>>>>  associated with the site where the host is located.  An EID can =
be
>>>>>>>  used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>>>>  be assigned in a hierarchical manner, independent of the =
network
>>>>>>>  topology, to facilitate scaling of the mapping database.  In
>>>>>>>  addition, an EID block assigned to a site may have site-local
>>>>>>>  structure (subnetting) for routing within the site; this =
structure
>>>>>>>  is not visible to the global routing system.  In theory, the =
bit
>>>>>>>  string that represents an EID for one device can represent an =
RLOC
>>>>>>>  for a different device.  As the architecture is realized, if a
>>>>>>>  given bit string is both an RLOC and an EID, it must refer to =
the
>>>>>>>  same entity in both cases.
>>>>>>>=20
>>>>>>>=20
>>>>>>> Is the above sentence really necessary?
>>>>>>>=20
>>>>>>=20
>>>>>> Agreed, why not simplify the definitions. They are written from =
the =E2=80=98Internet scalability mindset=E2=80=99, why not say that an =
EID is an address of the overlay and an RLOC an address of the overlay. =
This change may require further changes on the document so I am not 100% =
sure if this is a good idea.
>>>>>=20
>>>>> For clarification I was just referring to the sentence:
>>>>>=20
>>>>> " As the architecture is realized, if a given bit string is both =
an RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=

>>>>>=20
>>>>> I am wondering if such constrain is really necessary. If =
namespaces are well scoped there is no need for this.
>>>>>=20
>>>>> [snip]
>>>>>=20
>>>>> About the following:
>>>>>=20
>>>>>>=20
>>>>>>>=20
>>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>>=20
>>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>>>  further information.
>>>>>>>=20
>>>>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>>>>=20
>>>>>>>=20
>>>>>>=20
>>>>>> I suggest to leave them here, I don=C2=B4t think that readers =
start from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>>>>=20
>>>>> Good point about de definition of terms. What really bothers me is =
the bullet organisation. What can be done is to merge these two bullets =
with the previous one.
>>>>>=20
>>>>>>=20
>>>>>>>=20
>>>>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>>>>> ECN bits and DSCP .
>>>>>>>=20
>>>>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>>>>=20
>>>>>>> 2. How to deal with ECN should be part of the description of the =
 encap/decap not a paragraph apart.
>>>>>>> This basically means that half of the last paragraph should be a =
bullet of the ITR/PITR encapsulation
>>>>>>> and the other half  in the ETR/PETR operation.
>>>>>>=20
>>>>>>=20
>>>>>> Agreed, what about this (please comment):
>>>>>>=20
>>>>>> When doing ITR/PITR encapsulation:
>>>>>>=20
>>>>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>>>> o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>>>>=20
>>>>>> When doing ETR/PETR decapsulation:
>>>>>>=20
>>>>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the outer-header 'Time to =
Live' field, when the Time to Live value of the outer header is less =
than the Time to Live value of the inner header.  Failing to perform =
this check can cause the Time to Live of the inner header to increment =
across encapsulation/decapsulation cycles.  This check is also performed =
when doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>>>> o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and =
7 of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>>>>>=20
>>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>>>>=20
>>>>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>>>>=20
>>>>>=20
>>>>> Text looks very good to me.
>>>>>=20
>>>>>=20
>>>>>>=20
>>>>>>>=20
>>>>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>>>>=20
>>>>>>> What this section should state is that priority and weight are =
used to select the RLOC to use.
>>>>>>> Only exception is gleaning where we have one single RLOC and we =
do not know neither priority nor weight.
>>>>>>>=20
>>>>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>>>>=20
>>>>>>=20
>>>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis =
is less obvious, maybe something like (not final, just a couple of =
ideas):
>>>>>>=20
>>>>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>>>>=20
>>>>>=20
>>>>> Yes, this is what I meant.
>>>>>=20
>>>>>=20
>>>>>> Actually we should merge this section with 'Routing Locator =
Hashing'
>>>>>>=20
>>>>>>=20
>>>>>=20
>>>>> I think is a good idea.
>>>>>=20
>>>>> [snip]
>>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>>=20
>>>>>>>=20
>>>>>>> This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>>>>>>> The very first paragraph stetting the problem, and the =
versioning subsection, because it is a data-plane mechanism.
>>>>>>>=20
>>>>>>> All of the rest 6833bis
>>>>>>>=20
>>>>>>> Actually I remember a suggestion about putting operations issues =
like this in an OAM document which would be a good idea.
>>>>>>>=20
>>>>>>>=20
>>>>>>=20
>>>>>> So you are suggesting that the LISP control-plane does not define =
any mechanism to update EID-to-RLOC mappings?
>>>>>>=20
>>>>>=20
>>>>> Not exactly. Control-plane should discuss how to change the =
mappings, but things like clock sweep is just management not a control =
plane mechanism, as such it does not really needs to be standardised =
because there are no interoperability issues, hence it make really sense =
 to put it elsewhere.
>>>>>=20
>>>>> Thanks
>>>>>=20
>>>>> Luigi
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>=20
>>>>> _______________________________________________
>>>>> lisp mailing list
>>>>> lisp@ietf.org
>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>>=20
>>>=20
>>=20
>> _______________________________________________
>> lisp mailing list
>> lisp@ietf.org
>> https://www.ietf.org/mailman/listinfo/lisp


From nobody Thu Jan 11 09:57:11 2018
Return-Path: <jmh@joelhalpern.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 8AD6612EC19 for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 09:56:56 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.7
X-Spam-Level: 
X-Spam-Status: No, score=-2.7 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=joelhalpern.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id PrZxVDkJdjll for <lisp@ietfa.amsl.com>; Thu, 11 Jan 2018 09:56:52 -0800 (PST)
Received: from maila2.tigertech.net (maila2.tigertech.net [208.80.4.152]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id A608112EC14 for <lisp@ietf.org>; Thu, 11 Jan 2018 09:56:46 -0800 (PST)
Received: from localhost (localhost [127.0.0.1]) by maila2.tigertech.net (Postfix) with ESMTP id 8B62824006B; Thu, 11 Jan 2018 09:56:46 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=joelhalpern.com; s=1.tigertech; t=1515693406; bh=gTObgtBzwUSK264hJaq51TF/l7TyysS1AgWoZgQS5mw=; h=Subject:To:Cc:References:From:Date:In-Reply-To:From; b=b1kkqxRxmarjc2Rj+9bkJSJpPFZUaiF9BGY2fFfr0sEE6pm4bmoJF5Y48SkVtamqc EtKwKH+qVDvF9tRmuPkQ5TCWTZ8Gqa6T5QxtiQS2eMpGx3UdwWFWp5AsM7xge47JXo w2FqQJrtNqDgPkF3SbUts7hPW+QWCJp4JQYVIX0U=
X-Virus-Scanned: Debian amavisd-new at maila2.tigertech.net
Received: from Joels-MacBook-Pro.local (unknown [50.225.209.67]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by maila2.tigertech.net (Postfix) with ESMTPSA id 999E524D4C0; Thu, 11 Jan 2018 09:56:45 -0800 (PST)
To: Dino Farinacci <farinacci@gmail.com>, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
Cc: "lisp@ietf.org list" <lisp@ietf.org>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com>
From: "Joel M. Halpern" <jmh@joelhalpern.com>
Message-ID: <105294f9-2214-e9f2-d0d1-6ca656bd6d75@joelhalpern.com>
Date: Thu, 11 Jan 2018 12:56:44 -0500
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
In-Reply-To: <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 8bit
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/j8ir94gxRlwxqnjNngX4HOMmETE>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 11 Jan 2018 17:56:57 -0000

Working group:

I see folks making a case for SMR being in either 6830bis or 6833bis.
It is up to the WG.
What say you?

Yours,
Joel

On 1/11/18 12:50 PM, Dino Farinacci wrote:
> Thanks Alberto for your comments. Here is how I break up items in the control-plane and the data-plane.
> 
> Control-Plane (6833bis document):
> 
> (1) The definition of control-plane messages. These are already documented in 6833bis.
> (2) What components make up the control-plane that are not also in the data-plane. That is Map-Servers, Map-Resovers, LISP-ALT nodes, LISP-DDT nodes. These are already documented in 6833bis.
> 
> Data-Plane (6830bis document):
> 
> (1) What is required to move packets. Which includes the encapsulation format and the database-mappings and map-cache xTRs use. These are already documented in RFC6830bis.
> (2) The components that make up the data-plane. That is ITRs, ETRs, PxTRs, and RTRs.
> (3) And the elements of operation that the components in (2) use. So RLOC-probing and SMRs are explained in RFC6830bis because the components in (2) use. They are using control-plane messages obviously but those messages are defined in 6833bis.
> 
> Note that ETRs send SMRs, note ITRs and PITR send RLOC-probes. These messages are not sent by any control-plane components. Another data-plane can be defined to do its own OAM or map version updating and use the messages defined in 6833bis to do that. But they could also might “let me try to use the same map-cache mechanisms as LISP but use a different encapsulation format”. In this case, an implementor or deployer would read 6830bis.
> 
> Having said that, people don’t create walls between getting information so if they want to do their own data-plane they can still read 6830bis.
> 
> Another point about SMRs, the entire section talks about what ITRs and ETRs do. And these devices are data-plane components. Putting this section in 6833bis would possibly surprise a reader implementing another data-plane. For instance, a VXLAN data-plane reader would say “what is an ITR and ETR? I have VTEPs”. Another point about SMRs, they can be data driven. This happens when an ITR encapsulates to an ETR where the EID is no longer residing. That ETR, could respond with a SMR to the ITR to inform it that it has out of date mappings. This is all data-plane driven. Wouldn’t make logical sense to put it in 6833bis.
> 
> Anyways, that is the way I look at it,
> Dino
> 
>> On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com> wrote:
>>
>> Adding my two cents to this discussion, in the hope that it helps with
>> the convergence.
>>
>> My original hope with the reorganization of the RFCs was to be able to
>> use the LISP control-plane with a non-LISP data-plane. Putting aside
>> the discussion of what goes where, and with some pragmatism in mind, I
>> think we're close to that with the current 6833bis. The major
>> roadblock for me is the lack of SMR in that document, and I think this
>> aligns with the view of others in the list.
>>
>> I believe that with the addition of SMR, 6833bis will have all the
>> required pieces to put together a viable LISP deployment (using a
>> non-LISP data-plane) without having to look into 6830bis. Sure, there
>> would be some mechanisms (e.g. RLOC probing) that would not be
>> available using only 6833bis, but I could live without those. In
>> addition, we could work on adding some extra explanation to the
>> introduction of 6833bis so a non-familiar reader could make use of
>> LISP without looking into 6830bis.
>>
>> I think these two things (i.e. move SMR and extend 6833bis intro)
>> would minimize the changes required on the current documents and would
>> allow us to reach some rough consensus to make progress with the docs.
>> What do you guys think?
>>
>> Alberto
>>
>> On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci <farinacci@gmail.com> wrote:
>>>  From my perspective on the situation:
>>>
>>> (1) I made changes exactly to text that was requested.
>>> (2) I sometimes modify what the text that was requested.
>>> (3) I disgree with some text so don’t include it.
>>> (4) I have made many sub-revisions of -08.
>>> (5) Comments are coming in throughout the review period and I don’t know what revision you have read and what you have not read. I don’t know if your comments are old or based on one of the revisions. Because I see comments that I addressed but its not clear to me you know that (or at least you have not told me).
>>> (6) The changes in (1) and (2) have not been confirmed or denied by commenters. So I don’t know if what I changed has been accepted.
>>> (7) Adding text to something that has changed won’t go in properly. So referencing some offered text in a previous email can’t be just inserted.
>>>
>>> So -08 has been submitted. I don’t know what are the outstanding issues at this point. So I need commenters to be specific. This is what I suggest:
>>>
>>> (1) List the open issues by commenting on the latest submitted -08.
>>> (2) Include text from the -08 draft and your comments follow with suggested text.
>>>
>>> Let’s use that as a base to comment and discuss further. I can’t read your minds so I need more of your help. So please put more effort into it.
>>>
>>> Thanks in advance for your support,
>>> Dino
>>>
>>>
>>>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>
>>>> Dino,
>>>>
>>>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> wrote:
>>>>>
>>>>> Guys, please look at the latest changes instead of hashing the same arguments.
>>>>>
>>>>> This is what I am going to do. I am going to submit the myriad of changes already agreed to and then we can open up comments again for -08. I have been holding these diffs for a few weeks now and have received little commentary on the latest changes. So if your points have not been addressed, state them again AFTER reading the changes to -08.
>>>>>
>>>>
>>>> I find this request unfair.
>>>> I spent quite a bit of time reviewing and discussing this document, now you just try to wash all out by requesting comments on -08.
>>>>
>>>> Please let's continue discussing on the open issues so to find a solution.
>>>>
>>>> Thanks
>>>>
>>>> Luigi
>>>>
>>>>
>>>>
>>>>> The diff of the changes are included yet again.
>>>>>
>>>>> Dino
>>>>>
>>>>> <rfcdiff-rfc6830bis.html>
>>>>>
>>>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>>
>>>>>>
>>>>>> HI Albert,
>>>>>>
>>>>>> thanks for your reply.
>>>>>>
>>>>>> My comments inline. (trimming what is OK for me)
>>>>>>
>>>>>> Luigi
>>>>>>
>>>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos <albert.cabellos@gmail.com> wrote:
>>>>>>>
>>>>>>
>>>>>> [snip]
>>>>>>>>
>>>>>>>>
>>>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>>>>>>>>   IPv6) value used in the source and destination address fields of
>>>>>>>>   the first (most inner) LISP header of a packet.  The host obtains
>>>>>>>>   a destination EID the same way it obtains a destination address
>>>>>>>>   today, for example, through a Domain Name System (DNS) [RFC1034]
>>>>>>>>   lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>>>>>   The source EID is obtained via existing mechanisms used to set a
>>>>>>>>   host's "local" IP address.  An EID used on the public Internet
>>>>>>>>   must have the same properties as any other IP address used in that
>>>>>>>>   manner; this means, among other things, that it must be globally
>>>>>>>>   unique.  An EID is allocated to a host from an EID-Prefix block
>>>>>>>>   associated with the site where the host is located.  An EID can be
>>>>>>>>   used by a host to refer to other hosts.  Note that EID blocks MAY
>>>>>>>>   be assigned in a hierarchical manner, independent of the network
>>>>>>>>   topology, to facilitate scaling of the mapping database.  In
>>>>>>>>   addition, an EID block assigned to a site may have site-local
>>>>>>>>   structure (subnetting) for routing within the site; this structure
>>>>>>>>   is not visible to the global routing system.  In theory, the bit
>>>>>>>>   string that represents an EID for one device can represent an RLOC
>>>>>>>>   for a different device.  As the architecture is realized, if a
>>>>>>>>   given bit string is both an RLOC and an EID, it must refer to the
>>>>>>>>   same entity in both cases.
>>>>>>>>
>>>>>>>>
>>>>>>>> Is the above sentence really necessary?
>>>>>>>>
>>>>>>>
>>>>>>> Agreed, why not simplify the definitions. They are written from the ‘Internet scalability mindset’, why not say that an EID is an address of the overlay and an RLOC an address of the overlay. This change may require further changes on the document so I am not 100% sure if this is a good idea.
>>>>>>
>>>>>> For clarification I was just referring to the sentence:
>>>>>>
>>>>>> " As the architecture is realized, if a given bit string is both an RLOC and an EID, it must refer to the same entity in both cases.”
>>>>>>
>>>>>> I am wondering if such constrain is really necessary. If namespaces are well scoped there is no need for this.
>>>>>>
>>>>>> [snip]
>>>>>>
>>>>>> About the following:
>>>>>>
>>>>>>>
>>>>>>>>
>>>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>>>
>>>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>>>>   further information.
>>>>>>>>
>>>>>>>> I would put the last two bullets in the definition of EID. It simplifies the story here.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> I suggest to leave them here, I don´t think that readers start from the ‘Definition of terms’, these are relevant concepts to understand LISP.
>>>>>>
>>>>>> Good point about de definition of terms. What really bothers me is the bullet organisation. What can be done is to merge these two bullets with the previous one.
>>>>>>
>>>>>>>
>>>>>>>>
>>>>>>>> The description of the encap/decap operation lacks of clarity concerning how to deal with
>>>>>>>> ECN bits and DSCP .
>>>>>>>>
>>>>>>>> 1. I think that the text should make explicitly the difference between DSCP and ECN fields.
>>>>>>>>
>>>>>>>> 2. How to deal with ECN should be part of the description of the  encap/decap not a paragraph apart.
>>>>>>>> This basically means that half of the last paragraph should be a bullet of the ITR/PITR encapsulation
>>>>>>>> and the other half  in the ETR/PETR operation.
>>>>>>>
>>>>>>>
>>>>>>> Agreed, what about this (please comment):
>>>>>>>
>>>>>>> When doing ITR/PITR encapsulation:
>>>>>>>
>>>>>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' field.
>>>>>>> o  The outer-header 'Differentiated Services Code Point' (DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the inner-header DSCP field ('Traffic Class' field, in the case of IPv6) considering the exception listed below.
>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the IPv6 'Traffic Class' field) requires special treatment in order to avoid discarding indications of congestion [RFC3168]. ITR encapsulation MUST copy the 2-bit 'ECN' field from the inner header to the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer header to the new outer header.
>>>>>>>
>>>>>>> When doing ETR/PETR decapsulation:
>>>>>>>
>>>>>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' field, when the Time to Live value of the outer header is less than the Time to Live value of the inner header.  Failing to perform this check can cause the Time to Live of the inner header to increment across encapsulation/decapsulation cycles.  This check is also performed when doing initial encapsulation, when a packet comes to an ITR or PITR destined for a LISP site.
>>>>>>> o  The inner-header 'Differentiated Services Code Point' (DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the outer-header DSCP field ('Traffic Class' field, in the case of IPv6) considering the exception listed below.
>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the IPv6 'Traffic Class' field) requires special treatment in order to avoid discarding indications of congestion [RFC3168]. If the 'ECN' field contains a congestion indication codepoint (the value is '11', the Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit 'ECN' field from the stripped outer header to the surviving inner header that is used to forward the packet beyond the ETR.  These requirements preserve CE indications when a packet that uses ECN traverses a LISP tunnel and becomes marked with a CE indication due to congestion between the tunnel endpoints.
>>>>>>>
>>>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate after decapsulating, the net effect of this is that the new outer header will carry the same Time to Live as the old outer header minus 1.
>>>>>>>
>>>>>>> Copying the Time to Live (TTL) serves two purposes: first, it preserves the distance the host intended the packet to travel; second, and more importantly, it provides for suppression of looping packets in the event there is a loop of concatenated tunnels due to misconfiguration.  See Section 18.3 for TTL exception handling for traceroute packets.
>>>>>>>
>>>>>>
>>>>>> Text looks very good to me.
>>>>>>
>>>>>>
>>>>>>>
>>>>>>>>
>>>>>>>> Large part of this section is about control plane issues and as such should be put in 6833bis.
>>>>>>>>
>>>>>>>> What this section should state is that priority and weight are used to select the RLOC to use.
>>>>>>>> Only exception is gleaning where we have one single RLOC and we do not know neither priority nor weight.
>>>>>>>>
>>>>>>>> All the other operational discussion goes elsewhere, but not in this document.
>>>>>>>>
>>>>>>>
>>>>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis is less obvious, maybe something like (not final, just a couple of ideas):
>>>>>>>
>>>>>>> The data-plane must follow the state stored in the map-cache to encapsulate and decapsulate packets. The map-cache is populated using a control-plane, such as [6833bis]. ETRs encapsulate packets following the Priorities and Weights stored in the map-cache.
>>>>>>>
>>>>>>
>>>>>> Yes, this is what I meant.
>>>>>>
>>>>>>
>>>>>>> Actually we should merge this section with 'Routing Locator Hashing'
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> I think is a good idea.
>>>>>>
>>>>>> [snip]
>>>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>>>
>>>>>>>>
>>>>>>>> This is a control plane issue, as such it has to go in 6833bis, with two exception:
>>>>>>>> The very first paragraph stetting the problem, and the versioning subsection, because it is a data-plane mechanism.
>>>>>>>>
>>>>>>>> All of the rest 6833bis
>>>>>>>>
>>>>>>>> Actually I remember a suggestion about putting operations issues like this in an OAM document which would be a good idea.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> So you are suggesting that the LISP control-plane does not define any mechanism to update EID-to-RLOC mappings?
>>>>>>>
>>>>>>
>>>>>> Not exactly. Control-plane should discuss how to change the mappings, but things like clock sweep is just management not a control plane mechanism, as such it does not really needs to be standardised because there are no interoperability issues, hence it make really sense  to put it elsewhere.
>>>>>>
>>>>>> Thanks
>>>>>>
>>>>>> Luigi
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> _______________________________________________
>>>>>> lisp mailing list
>>>>>> lisp@ietf.org
>>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>>>
>>>>
>>>
>>> _______________________________________________
>>> lisp mailing list
>>> lisp@ietf.org
>>> https://www.ietf.org/mailman/listinfo/lisp
> 
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
> 


From nobody Thu Jan 11 22:48:25 2018
Return-Path: <ginsberg@cisco.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id B67E81289B0; Thu, 11 Jan 2018 22:48:20 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -14.531
X-Spam-Level: 
X-Spam-Status: No, score=-14.531 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_HI=-5, RCVD_IN_MSPIKE_H4=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, USER_IN_DEF_DKIM_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=cisco.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id xzFtpml5if8X; Thu, 11 Jan 2018 22:48:18 -0800 (PST)
Received: from alln-iport-1.cisco.com (alln-iport-1.cisco.com [173.37.142.88]) (using TLSv1.2 with cipher DHE-RSA-SEED-SHA (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 78E3B126CD6; Thu, 11 Jan 2018 22:48:18 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=@cisco.com; l=2103; q=dns/txt; s=iport; t=1515739698; x=1516949298; h=from:to:cc:subject:date:message-id: content-transfer-encoding:mime-version; bh=GkLdi4UaBgYnAfbOd5v2f0bag7F+EhA+gWqM0QjCnLs=; b=YiYtWn8RpEExLtueqAn8BoQSYR85Z0zwOp0+myDGi/pXV6R7s7nNXqe/ FYw0XSqGAp15glnFOD/ljAIRQ0flmnPP6fdDnjyIwZ/oe4T6svY1kP0O2 ih0uNRpI4+9U32DewVyuvbLxR7DZCrIj1bknLWt7gdPipStLAWr1BAkXr A=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0B/BADQWVha/5ldJa1dGQEBAQEBAQEBA?= =?us-ascii?q?QEBAQcBAQEBAYNBZnQnAQaOJI5hmTIUggIKI4UYhEE/GAEBAQEBAQEBAWsdC4V?= =?us-ascii?q?kMQ4SARwiQiYBBA4NiisQshqKPAEBAQEBBQEBAQEkhDyCFYFXgWmGUgsCgT4BE?= =?us-ascii?q?gGGGwWKW48XiXICiAmNNYIiZ4EbhBuEFYdFjT6JOgIRGQGBOwEfOWBwbxWCaAi?= =?us-ascii?q?ETnmJG4ElgRcBAQE?=
X-IronPort-AV: E=Sophos;i="5.46,348,1511827200"; d="scan'208";a="55638340"
Received: from rcdn-core-2.cisco.com ([173.37.93.153]) by alln-iport-1.cisco.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 12 Jan 2018 06:48:17 +0000
Received: from XCH-RCD-002.cisco.com (xch-rcd-002.cisco.com [173.37.102.12]) by rcdn-core-2.cisco.com (8.14.5/8.14.5) with ESMTP id w0C6mGZr008454 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=FAIL); Fri, 12 Jan 2018 06:48:17 GMT
Received: from xch-aln-001.cisco.com (173.36.7.11) by XCH-RCD-002.cisco.com (173.37.102.12) with Microsoft SMTP Server (TLS) id 15.0.1320.4; Fri, 12 Jan 2018 00:48:16 -0600
Received: from xch-aln-001.cisco.com ([173.36.7.11]) by XCH-ALN-001.cisco.com ([173.36.7.11]) with mapi id 15.00.1320.000; Fri, 12 Jan 2018 00:48:16 -0600
From: "Les Ginsberg (ginsberg)" <ginsberg@cisco.com>
To: "rtg-ads@ietf.org" <rtg-ads@ietf.org>
CC: "rtg-dir@ietf.org" <rtg-dir@ietf.org>, "draft-ietf-lisp-signal-free-multicast.all@ietf.org" <draft-ietf-lisp-signal-free-multicast.all@ietf.org>, "lisp@ietf.org" <lisp@ietf.org>
Thread-Topic: [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
Thread-Index: AdOLcLxCyIYYx6rFQ5mJ4GHzb7Xvog==
Date: Fri, 12 Jan 2018 06:48:16 +0000
Message-ID: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com>
Accept-Language: en-US
Content-Language: en-US
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
x-ms-exchange-transport-fromentityheader: Hosted
x-originating-ip: [10.65.57.31]
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: quoted-printable
MIME-Version: 1.0
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/b6HOmTq3DGowEH1IKVzmLcGazbo>
Subject: [lisp] [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 06:48:21 -0000

Hello,

I have been selected as the Routing Directorate reviewer for this draft. Th=
e Routing Directorate seeks to review all routing or routing-related drafts=
 as they pass through IETF last call and IESG review, and sometimes on spec=
ial request. The purpose of the review is to provide assistance to the Rout=
ing ADs. For more information about the Routing Directorate, please see htt=
p://trac.tools.ietf.org/area/rtg/trac/wiki/RtgDir .

Although these comments are primarily for the use of the Routing ADs, it wo=
uld be helpful if you could consider them along with any other IETF Last Ca=
ll comments that you receive, and strive to resolve them through discussion=
 or by updating the draft.

Document: draft-ietf-lisp-signal-free-multicast-07.txt
Reviewer: Les Ginsberg
Review Date: 11 January 2018
IETF LC End Date: Unknown
Intended Status: Experimental

Summary:
    This document is basically ready for publication, but has nits that sho=
uld be considered prior to publication.

Comments:

This draft is very well written. Ideas are presented in a logical and coher=
ent manner and I find it easy to understand the concepts even
without necessarily being an expert in the specific technology.

Major Issues:

No major issues found.

Minor Issues:

No minor issues found.

Nits:

The first use of LCAF (Section 2) should be expanded.

I find the acronym "RTR" a bit unfortunate for the obvious reason that it i=
ntuitively represents "just a router". I wonder if the authors could
consider something like "ReTR". I am sensitive to the fact that this docume=
nt has been around since 2014 and has undergone significant WG review. I ha=
ve
not attempted to track all of the email history regarding this document. Pe=
rhaps this point has been considered and consensus has been that the
RTR acronym is the best choice. If so, feel free to disregard my suggestion=
, but as someone who read this document for the first time I found myself=20
looking back for the definition of "RTR" multiple times as I read through t=
he text.

   Les


From nobody Fri Jan 12 03:01:54 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id C17BF12E04A for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 03:01:52 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.9
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id MydQVdTEnMDj for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 03:01:48 -0800 (PST)
Received: from mail-wm0-x242.google.com (mail-wm0-x242.google.com [IPv6:2a00:1450:400c:c09::242]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id ABAB0126C23 for <lisp@ietf.org>; Fri, 12 Jan 2018 03:01:47 -0800 (PST)
Received: by mail-wm0-x242.google.com with SMTP id b141so11345590wme.1 for <lisp@ietf.org>; Fri, 12 Jan 2018 03:01:47 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=z5id+B6nonc96kgRhdcdJxUltqO555Hd3z24pwJ6WjY=; b=kyTM+e0GL+EbXXeCTdrBOfu+z+ylRM31ey4zE6o07dX0YJ83lH7FmApCSmA11QgW2J q8gNCzkoI224FXTeXnGafDtmjHuutOIqQu1xq7AVicOijiQVhJbLNcFqY4LDcoB1nkNx 8/GjS8Q7kXUo/gTMWeyQrFTAjJ0l0ztJ+vHnF/tvunoxQ9rhEi4kFnS6nm4uXSvDxG8b RFlSGS6mRAoOZEDblFhXS7rJ79L6ciLk50SkZ3CkyHxlrgHBediwP0hzCMrB0M5XK/45 280BA5u0nN7Y3+lDamcKogHb1sGZiMiuwNEqtF+4/k/01aVvYyqRyrRrmFLlcumacUpf ezOg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=z5id+B6nonc96kgRhdcdJxUltqO555Hd3z24pwJ6WjY=; b=IxEhp3Ke9IqRjRKvdI85OLYUIInKDr4BQT7sjiZ5PEMJDdvHG2k100l88wkEO5pRyB rJ26OwVnrMj1Kb9oE/XMi1GW2tgnIc2sd7z+Bo82bb5NG6FshjVXZN5/8jHjNShJVCaM rJfO1Pzp+8HbYnlix5xnjinqieum+xx2UYWWlhP5TyNxwaPSdbU4s48AJbr8L535SecP 4znEYszdoRGxvSki820wUklEJoWO1LyS0WTh8VpJiP8kEfDtvWKVaLhgeZZzoPfNmZwt a7iBC5qjiDjZQZpFLbu8EfVe3s5XoNN85hF1I4YaPlAH251zGX1VT2+nReREy/vqt2uS /OAQ==
X-Gm-Message-State: AKwxyte37FgHVSVRwGZVytAJZNP7Hgh40XAjFRzBlzc8Ag26D4uoATXr Ss0jHvH4vXorzckUp/G67DtChh9aLoc=
X-Google-Smtp-Source: ACJfBovVE0C8QGA8CPAESBCdU68u60E4ZBa5H3wfZrdljVLRrmc6oRDBY4HpUWqaRMSOs0ohSvuY7A==
X-Received: by 10.80.173.45 with SMTP id y42mr5600182edc.247.1515754906032; Fri, 12 Jan 2018 03:01:46 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:f1ab:1862:7e58:42c5? ([2001:660:330f:a4:f1ab:1862:7e58:42c5]) by smtp.gmail.com with ESMTPSA id r15sm12269982edi.23.2018.01.12.03.01.44 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 12 Jan 2018 03:01:44 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Message-Id: <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_5C82D885-C62C-4A1B-AE0B-87C9AD6430C1"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Fri, 12 Jan 2018 12:01:34 +0100
In-Reply-To: <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com>
Cc: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
To: Dino Farinacci <farinacci@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/6VbuvsYnx-V3IMwmWq94i9uPZGA>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 11:01:53 -0000

--Apple-Mail=_5C82D885-C62C-4A1B-AE0B-87C9AD6430C1
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8



> On 11 Jan 2018, at 18:50, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Thanks Alberto for your comments. Here is how I break up items in the =
control-plane and the data-plane.=20
>=20
> Control-Plane (6833bis document):
>=20
> (1) The definition of control-plane messages. These are already =
documented in 6833bis.
> (2) What components make up the control-plane that are not also in the =
data-plane. That is Map-Servers, Map-Resovers, LISP-ALT nodes, LISP-DDT =
nodes. These are already documented in 6833bis.
>=20
> Data-Plane (6830bis document):
>=20
> (1) What is required to move packets. Which includes the encapsulation =
format and the database-mappings and map-cache xTRs use. These are =
already documented in RFC6830bis.
> (2) The components that make up the data-plane. That is ITRs, ETRs, =
PxTRs, and RTRs.
> (3) And the elements of operation that the components in (2) use. So =
RLOC-probing and SMRs are explained in RFC6830bis because the components =
in (2) use. They are using control-plane messages obviously but those =
messages are defined in 6833bis.
>=20
> Note that ETRs send SMRs, note ITRs and PITR send RLOC-probes. These =
messages are not sent by any control-plane components. Another =
data-plane can be defined to do its own OAM or map version updating and =
use the messages defined in 6833bis to do that. But they could also =
might =E2=80=9Clet me try to use the same map-cache mechanisms as LISP =
but use a different encapsulation format=E2=80=9D. In this case, an =
implementor or deployer would read 6830bis.
>=20
> Having said that, people don=E2=80=99t create walls between getting =
information so if they want to do their own data-plane they can still =
read 6830bis.
>=20
> Another point about SMRs, the entire section talks about what ITRs and =
ETRs do. And these devices are data-plane components. Putting this =
section in 6833bis would possibly surprise a reader implementing another =
data-plane. For instance, a VXLAN data-plane reader would say =E2=80=9Cwha=
t is an ITR and ETR? I have VTEPs=E2=80=9D.

This reasoning does not hold.

[dhcp164-133] ~/Desktop # grep -c ITR draft-ietf-lisp-rfc6833bis-07.txt=20=

65
[dhcp164-133] ~/Desktop # grep -c ETR draft-ietf-lisp-rfc6833bis-07.txt
83
[dhcp164-133] ~/Desktop # grep -c xTR draft-ietf-lisp-rfc6833bis-07.txt
20
[dhcp164-133] ~/Desktop #=20




Whoever reads 6833bis has to know what an ITR and an ETR is and what it =
does.

L.


> Another point about SMRs, they can be data driven. This happens when =
an ITR encapsulates to an ETR where the EID is no longer residing. That =
ETR, could respond with a SMR to the ITR to inform it that it has out of =
date mappings. This is all data-plane driven. Wouldn=E2=80=99t make =
logical sense to put it in 6833bis.
>=20
> Anyways, that is the way I look at it,
> Dino
>=20
>> On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal =
<rodrigueznatal@gmail.com> wrote:
>>=20
>> Adding my two cents to this discussion, in the hope that it helps =
with
>> the convergence.
>>=20
>> My original hope with the reorganization of the RFCs was to be able =
to
>> use the LISP control-plane with a non-LISP data-plane. Putting aside
>> the discussion of what goes where, and with some pragmatism in mind, =
I
>> think we're close to that with the current 6833bis. The major
>> roadblock for me is the lack of SMR in that document, and I think =
this
>> aligns with the view of others in the list.
>>=20
>> I believe that with the addition of SMR, 6833bis will have all the
>> required pieces to put together a viable LISP deployment (using a
>> non-LISP data-plane) without having to look into 6830bis. Sure, there
>> would be some mechanisms (e.g. RLOC probing) that would not be
>> available using only 6833bis, but I could live without those. In
>> addition, we could work on adding some extra explanation to the
>> introduction of 6833bis so a non-familiar reader could make use of
>> LISP without looking into 6830bis.
>>=20
>> I think these two things (i.e. move SMR and extend 6833bis intro)
>> would minimize the changes required on the current documents and =
would
>> allow us to reach some rough consensus to make progress with the =
docs.
>> What do you guys think?
>>=20
>> Alberto
>>=20
>> On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>> =46rom my perspective on the situation:
>>>=20
>>> (1) I made changes exactly to text that was requested.
>>> (2) I sometimes modify what the text that was requested.
>>> (3) I disgree with some text so don=E2=80=99t include it.
>>> (4) I have made many sub-revisions of -08.
>>> (5) Comments are coming in throughout the review period and I =
don=E2=80=99t know what revision you have read and what you have not =
read. I don=E2=80=99t know if your comments are old or based on one of =
the revisions. Because I see comments that I addressed but its not clear =
to me you know that (or at least you have not told me).
>>> (6) The changes in (1) and (2) have not been confirmed or denied by =
commenters. So I don=E2=80=99t know if what I changed has been accepted.
>>> (7) Adding text to something that has changed won=E2=80=99t go in =
properly. So referencing some offered text in a previous email can=E2=80=99=
t be just inserted.
>>>=20
>>> So -08 has been submitted. I don=E2=80=99t know what are the =
outstanding issues at this point. So I need commenters to be specific. =
This is what I suggest:
>>>=20
>>> (1) List the open issues by commenting on the latest submitted -08.
>>> (2) Include text from the -08 draft and your comments follow with =
suggested text.
>>>=20
>>> Let=E2=80=99s use that as a base to comment and discuss further. I =
can=E2=80=99t read your minds so I need more of your help. So please put =
more effort into it.
>>>=20
>>> Thanks in advance for your support,
>>> Dino
>>>=20
>>>=20
>>>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>=20
>>>> Dino,
>>>>=20
>>>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>>>>=20
>>>>> Guys, please look at the latest changes instead of hashing the =
same arguments.
>>>>>=20
>>>>> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>>>>>=20
>>>>=20
>>>> I find this request unfair.
>>>> I spent quite a bit of time reviewing and discussing this document, =
now you just try to wash all out by requesting comments on -08.
>>>>=20
>>>> Please let's continue discussing on the open issues so to find a =
solution.
>>>>=20
>>>> Thanks
>>>>=20
>>>> Luigi
>>>>=20
>>>>=20
>>>>=20
>>>>> The diff of the changes are included yet again.
>>>>>=20
>>>>> Dino
>>>>>=20
>>>>> <rfcdiff-rfc6830bis.html>
>>>>>=20
>>>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>>=20
>>>>>>=20
>>>>>> HI Albert,
>>>>>>=20
>>>>>> thanks for your reply.
>>>>>>=20
>>>>>> My comments inline. (trimming what is OK for me)
>>>>>>=20
>>>>>> Luigi
>>>>>>=20
>>>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>>>>>=20
>>>>>>=20
>>>>>> [snip]
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit =
(for
>>>>>>>> IPv6) value used in the source and destination address fields =
of
>>>>>>>> the first (most inner) LISP header of a packet.  The host =
obtains
>>>>>>>> a destination EID the same way it obtains a destination address
>>>>>>>> today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>>>>> lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>>>>>>>> The source EID is obtained via existing mechanisms used to set =
a
>>>>>>>> host's "local" IP address.  An EID used on the public Internet
>>>>>>>> must have the same properties as any other IP address used in =
that
>>>>>>>> manner; this means, among other things, that it must be =
globally
>>>>>>>> unique.  An EID is allocated to a host from an EID-Prefix block
>>>>>>>> associated with the site where the host is located.  An EID can =
be
>>>>>>>> used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>>>>> be assigned in a hierarchical manner, independent of the =
network
>>>>>>>> topology, to facilitate scaling of the mapping database.  In
>>>>>>>> addition, an EID block assigned to a site may have site-local
>>>>>>>> structure (subnetting) for routing within the site; this =
structure
>>>>>>>> is not visible to the global routing system.  In theory, the =
bit
>>>>>>>> string that represents an EID for one device can represent an =
RLOC
>>>>>>>> for a different device.  As the architecture is realized, if a
>>>>>>>> given bit string is both an RLOC and an EID, it must refer to =
the
>>>>>>>> same entity in both cases.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Is the above sentence really necessary?
>>>>>>>>=20
>>>>>>>=20
>>>>>>> Agreed, why not simplify the definitions. They are written from =
the =E2=80=98Internet scalability mindset=E2=80=99, why not say that an =
EID is an address of the overlay and an RLOC an address of the overlay. =
This change may require further changes on the document so I am not 100% =
sure if this is a good idea.
>>>>>>=20
>>>>>> For clarification I was just referring to the sentence:
>>>>>>=20
>>>>>> " As the architecture is realized, if a given bit string is both =
an RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=

>>>>>>=20
>>>>>> I am wondering if such constrain is really necessary. If =
namespaces are well scoped there is no need for this.
>>>>>>=20
>>>>>> [snip]
>>>>>>=20
>>>>>> About the following:
>>>>>>=20
>>>>>>>=20
>>>>>>>>=20
>>>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>>>=20
>>>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>>>> further information.
>>>>>>>>=20
>>>>>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>=20
>>>>>>> I suggest to leave them here, I don=C2=B4t think that readers =
start from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>>>>>=20
>>>>>> Good point about de definition of terms. What really bothers me =
is the bullet organisation. What can be done is to merge these two =
bullets with the previous one.
>>>>>>=20
>>>>>>>=20
>>>>>>>>=20
>>>>>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>>>>>> ECN bits and DSCP .
>>>>>>>>=20
>>>>>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>>>>>=20
>>>>>>>> 2. How to deal with ECN should be part of the description of =
the  encap/decap not a paragraph apart.
>>>>>>>> This basically means that half of the last paragraph should be =
a bullet of the ITR/PITR encapsulation
>>>>>>>> and the other half  in the ETR/PETR operation.
>>>>>>>=20
>>>>>>>=20
>>>>>>> Agreed, what about this (please comment):
>>>>>>>=20
>>>>>>> When doing ITR/PITR encapsulation:
>>>>>>>=20
>>>>>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>>>>> o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>>>>>=20
>>>>>>> When doing ETR/PETR decapsulation:
>>>>>>>=20
>>>>>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the outer-header 'Time to =
Live' field, when the Time to Live value of the outer header is less =
than the Time to Live value of the inner header.  Failing to perform =
this check can cause the Time to Live of the inner header to increment =
across encapsulation/decapsulation cycles.  This check is also performed =
when doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>>>>> o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. If the =
'ECN' field contains a congestion indication codepoint (the value is =
'11', the Congestion Experienced (CE) codepoint), then ETR decapsulation =
MUST copy the 2-bit 'ECN' field from the stripped outer header to the =
surviving inner header that is used to forward the packet beyond the =
ETR.  These requirements preserve CE indications when a packet that uses =
ECN traverses a LISP tunnel and becomes marked with a CE indication due =
to congestion between the tunnel endpoints.
>>>>>>>=20
>>>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>>>>>=20
>>>>>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>>>>>=20
>>>>>>=20
>>>>>> Text looks very good to me.
>>>>>>=20
>>>>>>=20
>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Large part of this section is about control plane issues and as =
such should be put in 6833bis.
>>>>>>>>=20
>>>>>>>> What this section should state is that priority and weight are =
used to select the RLOC to use.
>>>>>>>> Only exception is gleaning where we have one single RLOC and we =
do not know neither priority nor weight.
>>>>>>>>=20
>>>>>>>> All the other operational discussion goes elsewhere, but not in =
this document.
>>>>>>>>=20
>>>>>>>=20
>>>>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis =
is less obvious, maybe something like (not final, just a couple of =
ideas):
>>>>>>>=20
>>>>>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>>>>>=20
>>>>>>=20
>>>>>> Yes, this is what I meant.
>>>>>>=20
>>>>>>=20
>>>>>>> Actually we should merge this section with 'Routing Locator =
Hashing'
>>>>>>>=20
>>>>>>>=20
>>>>>>=20
>>>>>> I think is a good idea.
>>>>>>=20
>>>>>> [snip]
>>>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> This is a control plane issue, as such it has to go in 6833bis, =
with two exception:
>>>>>>>> The very first paragraph stetting the problem, and the =
versioning subsection, because it is a data-plane mechanism.
>>>>>>>>=20
>>>>>>>> All of the rest 6833bis
>>>>>>>>=20
>>>>>>>> Actually I remember a suggestion about putting operations =
issues like this in an OAM document which would be a good idea.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>=20
>>>>>>> So you are suggesting that the LISP control-plane does not =
define any mechanism to update EID-to-RLOC mappings?
>>>>>>>=20
>>>>>>=20
>>>>>> Not exactly. Control-plane should discuss how to change the =
mappings, but things like clock sweep is just management not a control =
plane mechanism, as such it does not really needs to be standardised =
because there are no interoperability issues, hence it make really sense =
 to put it elsewhere.
>>>>>>=20
>>>>>> Thanks
>>>>>>=20
>>>>>> Luigi
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>> _______________________________________________
>>>>>> lisp mailing list
>>>>>> lisp@ietf.org
>>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>>>=20
>>>>=20
>>>=20
>>> _______________________________________________
>>> lisp mailing list
>>> lisp@ietf.org
>>> https://www.ietf.org/mailman/listinfo/lisp
>=20


--Apple-Mail=_5C82D885-C62C-4A1B-AE0B-87C9AD6430C1
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D""><br =
class=3D""><div><br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D"">On 11 Jan 2018, at 18:50, Dino Farinacci &lt;<a =
href=3D"mailto:farinacci@gmail.com" class=3D"">farinacci@gmail.com</a>&gt;=
 wrote:</div><br class=3D"Apple-interchange-newline"><div class=3D""><div =
class=3D"">Thanks Alberto for your comments. Here is how I break up =
items in the control-plane and the data-plane. <br class=3D""><br =
class=3D"">Control-Plane (6833bis document):<br class=3D""><br =
class=3D"">(1) The definition of control-plane messages. These are =
already documented in 6833bis.<br class=3D"">(2) What components make up =
the control-plane that are not also in the data-plane. That is =
Map-Servers, Map-Resovers, LISP-ALT nodes, LISP-DDT nodes. These are =
already documented in 6833bis.<br class=3D""><br class=3D"">Data-Plane =
(6830bis document):<br class=3D""><br class=3D"">(1) What is required to =
move packets. Which includes the encapsulation format and the =
database-mappings and map-cache xTRs use. These are already documented =
in RFC6830bis.<br class=3D"">(2) The components that make up the =
data-plane. That is ITRs, ETRs, PxTRs, and RTRs.<br class=3D"">(3) And =
the elements of operation that the components in (2) use. So =
RLOC-probing and SMRs are explained in RFC6830bis because the components =
in (2) use. They are using control-plane messages obviously but those =
messages are defined in 6833bis.<br class=3D""><br class=3D"">Note that =
ETRs send SMRs, note ITRs and PITR send RLOC-probes. These messages are =
not sent by any control-plane components. Another data-plane can be =
defined to do its own OAM or map version updating and use the messages =
defined in 6833bis to do that. But they could also might =E2=80=9Clet me =
try to use the same map-cache mechanisms as LISP but use a different =
encapsulation format=E2=80=9D. In this case, an implementor or deployer =
would read 6830bis.<br class=3D""><br class=3D"">Having said that, =
people don=E2=80=99t create walls between getting information so if they =
want to do their own data-plane they can still read 6830bis.<br =
class=3D""><br class=3D"">Another point about SMRs, the entire section =
talks about what ITRs and ETRs do. And these devices are data-plane =
components. Putting this section in 6833bis would possibly surprise a =
reader implementing another data-plane. For instance, a VXLAN data-plane =
reader would say =E2=80=9Cwhat is an ITR and ETR? I have =
VTEPs=E2=80=9D.</div></div></blockquote><div><br =
class=3D""></div><div>This reasoning does not hold.</div><div><br =
class=3D""></div><div><div style=3D"margin: 0px; font-stretch: normal; =
font-size: 10px; line-height: normal; font-family: Monaco; color: =
rgb(244, 244, 244); background-color: rgba(0, 0, 0, 0.85098);" =
class=3D""><span style=3D"font-variant-ligatures: no-common-ligatures" =
class=3D"">[dhcp164-133] ~/Desktop # grep -c ITR =
draft-ietf-lisp-rfc6833bis-07.txt&nbsp;</span></div><div style=3D"margin: =
0px; font-stretch: normal; font-size: 10px; line-height: normal; =
font-family: Monaco; color: rgb(244, 244, 244); background-color: =
rgba(0, 0, 0, 0.85098);" class=3D""><span style=3D"font-variant-ligatures:=
 no-common-ligatures" class=3D"">65</span></div><div style=3D"margin: =
0px; font-stretch: normal; font-size: 10px; line-height: normal; =
font-family: Monaco; color: rgb(244, 244, 244); background-color: =
rgba(0, 0, 0, 0.85098);" class=3D""><span style=3D"font-variant-ligatures:=
 no-common-ligatures" class=3D"">[dhcp164-133] ~/Desktop # grep -c ETR =
draft-ietf-lisp-rfc6833bis-07.txt</span></div><div style=3D"margin: 0px; =
font-stretch: normal; font-size: 10px; line-height: normal; font-family: =
Monaco; color: rgb(244, 244, 244); background-color: rgba(0, 0, 0, =
0.85098);" class=3D""><span style=3D"font-variant-ligatures: =
no-common-ligatures" class=3D"">83</span></div><div style=3D"margin: =
0px; font-stretch: normal; font-size: 10px; line-height: normal; =
font-family: Monaco; color: rgb(244, 244, 244); background-color: =
rgba(0, 0, 0, 0.85098);" class=3D""><span style=3D"font-variant-ligatures:=
 no-common-ligatures" class=3D"">[dhcp164-133] ~/Desktop # grep -c xTR =
draft-ietf-lisp-rfc6833bis-07.txt</span></div><div style=3D"margin: 0px; =
font-stretch: normal; font-size: 10px; line-height: normal; font-family: =
Monaco; color: rgb(244, 244, 244); background-color: rgba(0, 0, 0, =
0.85098);" class=3D""><span style=3D"font-variant-ligatures: =
no-common-ligatures" class=3D"">20</span></div><div style=3D"margin: =
0px; font-stretch: normal; font-size: 10px; line-height: normal; =
font-family: Monaco; color: rgb(244, 244, 244); background-color: =
rgba(0, 0, 0, 0.85098);" class=3D""><span style=3D"font-variant-ligatures:=
 no-common-ligatures" class=3D"">[dhcp164-133] ~/Desktop =
#&nbsp;</span></div><div style=3D"margin: 0px; font-stretch: normal; =
font-size: 10px; line-height: normal; font-family: Monaco; color: =
rgb(244, 244, 244); background-color: rgba(0, 0, 0, 0.85098); =
min-height: 14px;" class=3D""><span style=3D"font-variant-ligatures: =
no-common-ligatures" class=3D""></span><br class=3D""></div><div =
style=3D"margin: 0px; font-stretch: normal; font-size: 10px; =
line-height: normal; font-family: Monaco; color: rgb(244, 244, 244); =
background-color: rgba(0, 0, 0, 0.85098); min-height: 14px;" =
class=3D""><br class=3D""></div></div><div><br class=3D""></div><div><br =
class=3D""></div><div>Whoever reads 6833bis has to know what an ITR and =
an ETR is and what it does.</div><div><br =
class=3D""></div><div>L.</div><div><br class=3D""></div><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><div =
class=3D""> Another point about SMRs, they can be data driven. This =
happens when an ITR encapsulates to an ETR where the EID is no longer =
residing. That ETR, could respond with a SMR to the ITR to inform it =
that it has out of date mappings. This is all data-plane driven. =
Wouldn=E2=80=99t make logical sense to put it in 6833bis.<br =
class=3D""><br class=3D"">Anyways, that is the way I look at it,<br =
class=3D"">Dino<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D"">On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal &lt;<a =
href=3D"mailto:rodrigueznatal@gmail.com" =
class=3D"">rodrigueznatal@gmail.com</a>&gt; wrote:<br class=3D""><br =
class=3D"">Adding my two cents to this discussion, in the hope that it =
helps with<br class=3D"">the convergence.<br class=3D""><br class=3D"">My =
original hope with the reorganization of the RFCs was to be able to<br =
class=3D"">use the LISP control-plane with a non-LISP data-plane. =
Putting aside<br class=3D"">the discussion of what goes where, and with =
some pragmatism in mind, I<br class=3D"">think we're close to that with =
the current 6833bis. The major<br class=3D"">roadblock for me is the =
lack of SMR in that document, and I think this<br class=3D"">aligns with =
the view of others in the list.<br class=3D""><br class=3D"">I believe =
that with the addition of SMR, 6833bis will have all the<br =
class=3D"">required pieces to put together a viable LISP deployment =
(using a<br class=3D"">non-LISP data-plane) without having to look into =
6830bis. Sure, there<br class=3D"">would be some mechanisms (e.g. RLOC =
probing) that would not be<br class=3D"">available using only 6833bis, =
but I could live without those. In<br class=3D"">addition, we could work =
on adding some extra explanation to the<br class=3D"">introduction of =
6833bis so a non-familiar reader could make use of<br class=3D"">LISP =
without looking into 6830bis.<br class=3D""><br class=3D"">I think these =
two things (i.e. move SMR and extend 6833bis intro)<br class=3D"">would =
minimize the changes required on the current documents and would<br =
class=3D"">allow us to reach some rough consensus to make progress with =
the docs.<br class=3D"">What do you guys think?<br class=3D""><br =
class=3D"">Alberto<br class=3D""><br class=3D"">On Wed, Jan 10, 2018 at =
6:26 PM, Dino Farinacci &lt;<a href=3D"mailto:farinacci@gmail.com" =
class=3D"">farinacci@gmail.com</a>&gt; wrote:<br class=3D""><blockquote =
type=3D"cite" class=3D"">=46rom my perspective on the situation:<br =
class=3D""><br class=3D"">(1) I made changes exactly to text that was =
requested.<br class=3D"">(2) I sometimes modify what the text that was =
requested.<br class=3D"">(3) I disgree with some text so don=E2=80=99t =
include it.<br class=3D"">(4) I have made many sub-revisions of -08.<br =
class=3D"">(5) Comments are coming in throughout the review period and I =
don=E2=80=99t know what revision you have read and what you have not =
read. I don=E2=80=99t know if your comments are old or based on one of =
the revisions. Because I see comments that I addressed but its not clear =
to me you know that (or at least you have not told me).<br class=3D"">(6) =
The changes in (1) and (2) have not been confirmed or denied by =
commenters. So I don=E2=80=99t know if what I changed has been =
accepted.<br class=3D"">(7) Adding text to something that has changed =
won=E2=80=99t go in properly. So referencing some offered text in a =
previous email can=E2=80=99t be just inserted.<br class=3D""><br =
class=3D"">So -08 has been submitted. I don=E2=80=99t know what are the =
outstanding issues at this point. So I need commenters to be specific. =
This is what I suggest:<br class=3D""><br class=3D"">(1) List the open =
issues by commenting on the latest submitted -08.<br class=3D"">(2) =
Include text from the -08 draft and your comments follow with suggested =
text.<br class=3D""><br class=3D"">Let=E2=80=99s use that as a base to =
comment and discuss further. I can=E2=80=99t read your minds so I need =
more of your help. So please put more effort into it.<br class=3D""><br =
class=3D"">Thanks in advance for your support,<br class=3D"">Dino<br =
class=3D""><br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D"">On Jan 10, 2018, at 2:03 AM, Luigi Iannone &lt;<a =
href=3D"mailto:ggx@gigix.net" class=3D"">ggx@gigix.net</a>&gt; wrote:<br =
class=3D""><br class=3D"">Dino,<br class=3D""><br class=3D""><blockquote =
type=3D"cite" class=3D"">On 9 Jan 2018, at 18:54, Dino Farinacci &lt;<a =
href=3D"mailto:farinacci@gmail.com" class=3D"">farinacci@gmail.com</a>&gt;=
 wrote:<br class=3D""><br class=3D"">Guys, please look at the latest =
changes instead of hashing the same arguments.<br class=3D""><br =
class=3D"">This is what I am going to do. I am going to submit the =
myriad of changes already agreed to and then we can open up comments =
again for -08. I have been holding these diffs for a few weeks now and =
have received little commentary on the latest changes. So if your points =
have not been addressed, state them again AFTER reading the changes to =
-08.<br class=3D""><br class=3D""></blockquote><br class=3D"">I find =
this request unfair.<br class=3D"">I spent quite a bit of time reviewing =
and discussing this document, now you just try to wash all out by =
requesting comments on -08.<br class=3D""><br class=3D"">Please let's =
continue discussing on the open issues so to find a solution.<br =
class=3D""><br class=3D"">Thanks<br class=3D""><br class=3D"">Luigi<br =
class=3D""><br class=3D""><br class=3D""><br class=3D""><blockquote =
type=3D"cite" class=3D"">The diff of the changes are included yet =
again.<br class=3D""><br class=3D"">Dino<br class=3D""><br =
class=3D"">&lt;rfcdiff-rfc6830bis.html&gt;<br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D"">On Jan 9, 2018, at 7:04 =
AM, Luigi Iannone &lt;<a href=3D"mailto:ggx@gigix.net" =
class=3D"">ggx@gigix.net</a>&gt; wrote:<br class=3D""><br class=3D""><br =
class=3D"">HI Albert,<br class=3D""><br class=3D"">thanks for your =
reply.<br class=3D""><br class=3D"">My comments inline. (trimming what =
is OK for me)<br class=3D""><br class=3D"">Luigi<br class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D"">On 27 Dec 2017, at =
02:48, Albert Cabellos &lt;<a href=3D"mailto:albert.cabellos@gmail.com" =
class=3D"">albert.cabellos@gmail.com</a>&gt; wrote:<br class=3D""><br =
class=3D""></blockquote><br class=3D"">[snip]<br class=3D""><blockquote =
type=3D"cite" class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D""><br class=3D"">Endpoint ID (EID): &nbsp;&nbsp;An EID is a =
32-bit (for IPv4) or 128-bit (for<br class=3D""> IPv6) value used in the =
source and destination address fields of<br class=3D""> the first (most =
inner) LISP header of a packet. &nbsp;The host obtains<br class=3D""> a =
destination EID the same way it obtains a destination address<br =
class=3D""> today, for example, through a Domain Name System (DNS) =
[RFC1034]<br class=3D""> lookup or Session Initiation Protocol (SIP) =
[RFC3261] exchange.<br class=3D""> The source EID is obtained via =
existing mechanisms used to set a<br class=3D""> host's "local" IP =
address. &nbsp;An EID used on the public Internet<br class=3D""> must =
have the same properties as any other IP address used in that<br =
class=3D""> manner; this means, among other things, that it must be =
globally<br class=3D""> unique. &nbsp;An EID is allocated to a host from =
an EID-Prefix block<br class=3D""> associated with the site where the =
host is located. &nbsp;An EID can be<br class=3D""> used by a host to =
refer to other hosts. &nbsp;Note that EID blocks MAY<br class=3D""> be =
assigned in a hierarchical manner, independent of the network<br =
class=3D""> topology, to facilitate scaling of the mapping database. =
&nbsp;In<br class=3D""> addition, an EID block assigned to a site may =
have site-local<br class=3D""> structure (subnetting) for routing within =
the site; this structure<br class=3D""> is not visible to the global =
routing system. &nbsp;In theory, the bit<br class=3D""> string that =
represents an EID for one device can represent an RLOC<br class=3D""> =
for a different device. &nbsp;As the architecture is realized, if a<br =
class=3D""> given bit string is both an RLOC and an EID, it must refer =
to the<br class=3D""> same entity in both cases.<br class=3D""><br =
class=3D""><br class=3D"">Is the above sentence really necessary?<br =
class=3D""><br class=3D""></blockquote><br class=3D"">Agreed, why not =
simplify the definitions. They are written from the =E2=80=98Internet =
scalability mindset=E2=80=99, why not say that an EID is an address of =
the overlay and an RLOC an address of the overlay. This change may =
require further changes on the document so I am not 100% sure if this is =
a good idea.<br class=3D""></blockquote><br class=3D"">For clarification =
I was just referring to the sentence:<br class=3D""><br class=3D"">" As =
the architecture is realized, if a given bit string is both an RLOC and =
an EID, it must refer to the same entity in both cases.=E2=80=9D<br =
class=3D""><br class=3D"">I am wondering if such constrain is really =
necessary. If namespaces are well scoped there is no need for this.<br =
class=3D""><br class=3D"">[snip]<br class=3D""><br class=3D"">About the =
following:<br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D"">o &nbsp;EIDs are typically IP addresses assigned to hosts.<br =
class=3D""><br class=3D"">o &nbsp;Other types of EID are supported by =
LISP, see [RFC8060] for<br class=3D""> further information.<br =
class=3D""><br class=3D"">I would put the last two bullets in the =
definition of EID. It simplifies the story here.<br class=3D""><br =
class=3D""><br class=3D""></blockquote><br class=3D"">I suggest to leave =
them here, I don=C2=B4t think that readers start from the =E2=80=98Definit=
ion of terms=E2=80=99, these are relevant concepts to understand =
LISP.<br class=3D""></blockquote><br class=3D"">Good point about de =
definition of terms. What really bothers me is the bullet organisation. =
What can be done is to merge these two bullets with the previous one.<br =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D""><blockquote type=3D"cite" class=3D""><br class=3D"">The =
description of the encap/decap operation lacks of clarity concerning how =
to deal with<br class=3D"">ECN bits and DSCP .<br class=3D""><br =
class=3D"">1. I think that the text should make explicitly the =
difference between DSCP and ECN fields.<br class=3D""><br class=3D"">2. =
How to deal with ECN should be part of the description of the =
&nbsp;encap/decap not a paragraph apart.<br class=3D"">This basically =
means that half of the last paragraph should be a bullet of the ITR/PITR =
encapsulation<br class=3D"">and the other half &nbsp;in the ETR/PETR =
operation.<br class=3D""></blockquote><br class=3D""><br =
class=3D"">Agreed, what about this (please comment):<br class=3D""><br =
class=3D"">When doing ITR/PITR encapsulation:<br class=3D""><br =
class=3D"">o &nbsp;The outer-header 'Time to Live' field (or 'Hop Limit' =
field, in the case of IPv6) SHOULD be copied from the inner-header 'Time =
to Live' field.<br class=3D"">o &nbsp;The outer-header 'Differentiated =
Services Code Point' (DSCP) field (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be copied from the inner-header DSCP field =
('Traffic Class' field, in the case of IPv6) considering the exception =
listed below.<br class=3D"">o &nbsp;The 'Explicit Congestion =
Notification' (ECN) field (bits 6 and 7 of the IPv6 'Traffic Class' =
field) requires special treatment in order to avoid discarding =
indications of congestion [RFC3168]. ITR encapsulation MUST copy the =
2-bit 'ECN' field from the inner header to the outer header. =
Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer =
header to the new outer header.<br class=3D""><br class=3D"">When doing =
ETR/PETR decapsulation:<br class=3D""><br class=3D"">o &nbsp;The =
inner-header 'Time to Live' field (or 'Hop Limit' field, in the case of =
IPv6) SHOULD be copied from the outer-header 'Time to Live' field, when =
the Time to Live value of the outer header is less than the Time to Live =
value of the inner header. &nbsp;Failing to perform this check can cause =
the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles. &nbsp;This check is also performed =
when doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.<br class=3D"">o &nbsp;The inner-header =
'Differentiated Services Code Point' (DSCP) field (or the 'Traffic =
Class' field, in the case of IPv6) SHOULD be copied from the =
outer-header DSCP field ('Traffic Class' field, in the case of IPv6) =
considering the exception listed below.<br class=3D"">o &nbsp;The =
'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the IPv6 =
'Traffic Class' field) requires special treatment in order to avoid =
discarding indications of congestion [RFC3168]. If the 'ECN' field =
contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR. =
&nbsp;These requirements preserve CE indications when a packet that uses =
ECN traverses a LISP tunnel and becomes marked with a CE indication due =
to congestion between the tunnel endpoints.<br class=3D""><br =
class=3D"">Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.<br class=3D""><br class=3D"">Copying the Time to Live =
(TTL) serves two purposes: first, it preserves the distance the host =
intended the packet to travel; second, and more importantly, it provides =
for suppression of looping packets in the event there is a loop of =
concatenated tunnels due to misconfiguration. &nbsp;See Section 18.3 for =
TTL exception handling for traceroute packets.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">Text looks very good to me.<br =
class=3D""><br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><br class=3D""><blockquote type=3D"cite" class=3D""><br =
class=3D"">Large part of this section is about control plane issues and =
as such should be put in 6833bis.<br class=3D""><br class=3D"">What this =
section should state is that priority and weight are used to select the =
RLOC to use.<br class=3D"">Only exception is gleaning where we have one =
single RLOC and we do not know neither priority nor weight.<br =
class=3D""><br class=3D"">All the other operational discussion goes =
elsewhere, but not in this document.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">Agree, I suggest moving it to =
6833bis. What to leave in 6830bis is less obvious, maybe something like =
(not final, just a couple of ideas):<br class=3D""><br class=3D"">The =
data-plane must follow the state stored in the map-cache to encapsulate =
and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.<br class=3D""><br =
class=3D""></blockquote><br class=3D"">Yes, this is what I meant.<br =
class=3D""><br class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D"">Actually we should merge this section with 'Routing Locator =
Hashing'<br class=3D""><br class=3D""><br class=3D""></blockquote><br =
class=3D"">I think is a good idea.<br class=3D""><br class=3D"">[snip]<br =
class=3D""><blockquote type=3D"cite" class=3D""><blockquote type=3D"cite" =
class=3D"">13. &nbsp;Changing the Contents of EID-to-RLOC Mappings<br =
class=3D""><br class=3D""><br class=3D"">This is a control plane issue, =
as such it has to go in 6833bis, with two exception:<br class=3D"">The =
very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.<br class=3D""><br =
class=3D"">All of the rest 6833bis<br class=3D""><br class=3D"">Actually =
I remember a suggestion about putting operations issues like this in an =
OAM document which would be a good idea.<br class=3D""><br class=3D""><br =
class=3D""></blockquote><br class=3D"">So you are suggesting that the =
LISP control-plane does not define any mechanism to update EID-to-RLOC =
mappings?<br class=3D""><br class=3D""></blockquote><br class=3D"">Not =
exactly. Control-plane should discuss how to change the mappings, but =
things like clock sweep is just management not a control plane =
mechanism, as such it does not really needs to be standardised because =
there are no interoperability issues, hence it make really sense =
&nbsp;to put it elsewhere.<br class=3D""><br class=3D"">Thanks<br =
class=3D""><br class=3D"">Luigi<br class=3D""><br class=3D""><br =
class=3D""><br class=3D""><br class=3D""><br class=3D""><br class=3D""><br=
 class=3D""><br class=3D""><br =
class=3D"">_______________________________________________<br =
class=3D"">lisp mailing list<br class=3D""><a =
href=3D"mailto:lisp@ietf.org" class=3D"">lisp@ietf.org</a><br =
class=3D"">https://www.ietf.org/mailman/listinfo/lisp<br =
class=3D""></blockquote><br class=3D""></blockquote><br =
class=3D""></blockquote><br =
class=3D"">_______________________________________________<br =
class=3D"">lisp mailing list<br class=3D""><a =
href=3D"mailto:lisp@ietf.org" class=3D"">lisp@ietf.org</a><br =
class=3D"">https://www.ietf.org/mailman/listinfo/lisp<br =
class=3D""></blockquote></blockquote><br =
class=3D""></div></div></blockquote></div><br class=3D""></body></html>=

--Apple-Mail=_5C82D885-C62C-4A1B-AE0B-87C9AD6430C1--


From nobody Fri Jan 12 08:20:44 2018
Return-Path: <albert.cabellos@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id DE64B12420B for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 08:20:42 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id suyMF2dFgTVJ for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 08:20:41 -0800 (PST)
Received: from mail-yb0-x232.google.com (mail-yb0-x232.google.com [IPv6:2607:f8b0:4002:c09::232]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 011BA12D943 for <lisp@ietf.org>; Fri, 12 Jan 2018 08:20:41 -0800 (PST)
Received: by mail-yb0-x232.google.com with SMTP id j7so2908690ybl.3 for <lisp@ietf.org>; Fri, 12 Jan 2018 08:20:40 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:from:date:message-id:subject:to:cc; bh=lusukQn0nZXRRTBUTHBQbp693cl+XBMDEkc4p1Bfzfw=; b=Sn73kliE6+TtS1LJ4Oub/eacwpmAk2R5R10E+eXhhLgyIguPjdVGhFeVl/FLesOckd Hic1ig5wWHIYpfD4RXeYt1tmj//vnJkSLFDzQVbUvY7ZBeIlKO0XvUXDPt82mVUl8M3X eD42B1oStoCti57Cm6ONNXqAbdcw5LHnRJnuQQ31KOs23FXWMEmBJRR0DLACpG9ZbYXP jSCPLx8gVeh5DH4oh7AbayLFSLleNnR9mHKU8N2rGYf5iIjU4HVU87AqgGOx40AMFg8H 7PhtvUKuGEXVOAZN0kvou6H0UgPkvUT2055En1X5QrjezIV+6FdAaNhVhp1yCnCN2KFO fsJw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to:cc; bh=lusukQn0nZXRRTBUTHBQbp693cl+XBMDEkc4p1Bfzfw=; b=fwbcPDc98hDu7os//SRrLc80UsiQDEWUW3WR4u7Pxvvk/B6VysCtXn8UHat7djuPWX C9h8A1T18O1U1jQzRxuvhSKIHeuVOkEUl+T/FDLgpTD/aXkwSkWXC+eMzo4a5Re3g/QN G+7fn9ZDY4Pu+Venfc5ryczykBWiEGyT/qQH4AuManB2sID2msb1H7x/UBkBw7PvCL3A bLp5eb3olOXpmljFC3i6NA0siK1CXDSn24F9GNOwVmWr6cE69tJviw+aJROmzQWW9s+5 uFzFM/XYD/IkxQ800kv5dOKyWSAudtl476V68M8ZkP9Hn82QxnNse2SEIMoV0U7BSGvZ lYwQ==
X-Gm-Message-State: AKGB3mJRbrMGDbFFxM4Oa0YOqVEu0MHLSoP/sYyR/zUPl3TS/AiLeDu+ 9oYPYlB1OH4LCCbAtASTCUlYV42k1lZPqjw7OprpGDrm
X-Google-Smtp-Source: ACJfBosjjGluKqZV7viXzUaGYiDOwVXaWb4J5xAXMFn7nO2C1yS2YNk1npXx9Qy/OCcirsjnvfu9NOtHjmIT/l9OJ9g=
X-Received: by 10.37.131.16 with SMTP id s16mr22203873ybk.129.1515774039932; Fri, 12 Jan 2018 08:20:39 -0800 (PST)
MIME-Version: 1.0
Received: by 10.37.164.38 with HTTP; Fri, 12 Jan 2018 08:20:39 -0800 (PST)
From: Albert Cabellos <albert.cabellos@gmail.com>
Date: Fri, 12 Jan 2018 17:20:39 +0100
Message-ID: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
To: "lisp@ietf.org list" <lisp@ietf.org>
Cc: Dino Farinacci <farinacci@gmail.com>, lisp-chairs@tools.ietf.org
Content-Type: multipart/alternative; boundary="089e0832e26035c4b1056296a5a7"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/wg0mdUKNrpK8ZZR-AUxdcwSjcOk>
Subject: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 16:20:43 -0000

--089e0832e26035c4b1056296a5a7
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi all

As editor of 6830bis I=C2=B4d like to confirm or deny the following changes
which I believe have support.

Please note that I have intentionally ignored minor/editorial changes to
help sync all the participants. I hope that the list below captures the
most relevant ones.

Also note that I don=C2=B4t necessarily agree with all the changes listed b=
elow,
but that=C2=B4s an opinion with a different hat.

WG: Please CONFIRM or DENY:

-------

A.- Remove definitions of PA and PI

B.- Change definitions of EID and RLOC as =E2=80=98identifier of the overla=
y=E2=80=99 and
=E2=80=98identifier of the underlay=E2=80=99 respectively.

C.- In section 5.3, change the description of the encap/decap operation
concerning how to deal with ECN and DSCP bits to (new text needs to be
validated by experts):

When doing ITR/PITR encapsulation:

o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the case
of IPv6) SHOULD be copied from the inner-header 'Time to Live' field.

o  The outer-header 'Differentiated Services Code Point' (DSCP) field (or
the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
inner-header DSCP field ('Traffic Class' field, in the case of IPv6)
considering the exception listed below.

o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the
IPv6 'Traffic Class' field) requires special treatment in order to avoid
discarding indications of congestion [RFC3168]. ITR encapsulation MUST copy
the 2-bit 'ECN' field from the inner header to the outer header.
Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer
header to the new outer header.

When doing ETR/PETR decapsulation:

 o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in the
case of IPv6) SHOULD be copied from the outer-header 'Time to Live' field,
when the Time to Live value of the outer header is less than the Time to
Live value of the inner header.  Failing to perform this check can cause
the Time to Live of the inner header to increment across
encapsulation/decapsulation cycles.  This check is also performed when
doing initial encapsulation, when a packet comes to an ITR or PITR destined
for a LISP site.

o  The inner-header 'Differentiated Services Code Point' (DSCP) field (or
the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
outer-header DSCP field ('Traffic Class' field, in the case of IPv6)
considering the exception listed below.

o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the
IPv6 'Traffic Class' field) requires special treatment in order to avoid
discarding indications of congestion [RFC3168]. If the 'ECN' field contains
a congestion indication codepoint (the value is '11', the Congestion
Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit
'ECN' field from the stripped outer header to the surviving inner header
that is used to forward the packet beyond the ETR.  These requirements
preserve CE indications when a packet that uses ECN traverses a LISP tunnel
and becomes marked with a CE indication due to congestion between the
tunnel endpoints.

Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate
after decapsulating, the net effect of this is that the new outer header
will carry the same Time to Live as the old outer header minus 1.

Copying the Time to Live (TTL) serves two purposes: first, it preserves the
distance the host intended the packet to travel; second, and more
importantly, it provides for suppression of looping packets in the event
there is a loop of concatenated tunnels due to misconfiguration.  See
Section 18.3 for TTL exception handling for traceroute packets.


D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stating tha=
t the data-plane
MUST follow what=C2=B4s stored in the map-cache (priorities and weights), t=
he
remaining text should go to an OAM document.

E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D consider=
ing the
following changes:

*    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) and
Echo-Nonce
*    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3
(hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a
response) and RLOC probing



F.- Move Solicit-Map-Request to 6833bis

G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
Considerations), 18 (Traceroute Consideration) to a new OAM document

--089e0832e26035c4b1056296a5a7
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi all<br><br>As editor of 6830bis I=C2=B4d like to confir=
m or deny the following changes which I believe have support. <br><br>Pleas=
e note that I have intentionally ignored minor/editorial changes to help sy=
nc all the participants. I hope that the list below captures the most relev=
ant ones.<div><br></div><div>Also note that I don=C2=B4t necessarily agree =
with all the changes listed below, but that=C2=B4s an opinion with a differ=
ent hat.<br><br>WG: Please CONFIRM or DENY:<div><br></div><div>-------<br><=
br>A.- Remove definitions of PA and PI<br><br>B.- Change definitions of EID=
 and RLOC as =E2=80=98identifier of the overlay=E2=80=99 and =E2=80=98ident=
ifier of the underlay=E2=80=99 respectively.=C2=A0<br><br>C.- In section 5.=
3, change the description of the encap/decap operation concerning how to de=
al with ECN and DSCP bits to (new text needs to be validated by experts):<b=
r><br><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px">When =
doing ITR/PITR encapsulation:<br><br>o =C2=A0The outer-header &#39;Time to =
Live&#39; field (or &#39;Hop Limit&#39; field, in the case of IPv6) SHOULD =
be copied from the inner-header &#39;Time to Live&#39; field.<br><br>o =C2=
=A0The outer-header &#39;Differentiated Services Code Point&#39; (DSCP) fie=
ld (or the &#39;Traffic Class&#39; field, in the case of IPv6) SHOULD be co=
pied from the inner-header DSCP field (&#39;Traffic Class&#39; field, in th=
e case of IPv6) considering the exception listed below.<br><br>o =C2=A0The =
&#39;Explicit Congestion Notification&#39; (ECN) field (bits 6 and 7 of the=
 IPv6 &#39;Traffic Class&#39; field) requires special treatment in order to=
 avoid discarding indications of congestion [RFC3168]. ITR encapsulation MU=
ST copy the 2-bit &#39;ECN&#39; field from the inner header to the outer he=
ader. Re-encapsulation MUST copy the 2-bit &#39;ECN&#39; field from the str=
ipped outer header to the new outer header.<br><br>When doing ETR/PETR deca=
psulation:<br><br>=C2=A0o =C2=A0The inner-header &#39;Time to Live&#39; fie=
ld (or &#39;Hop Limit&#39; field, in the case of IPv6) SHOULD be copied fro=
m the outer-header &#39;Time to Live&#39; field, when the Time to Live valu=
e of the outer header is less than the Time to Live value of the inner head=
er.=C2=A0 Failing to perform this check can cause the Time to Live of the i=
nner header to increment across encapsulation/decapsulation cycles.=C2=A0 T=
his check is also performed when doing initial encapsulation, when a packet=
 comes to an ITR or PITR destined for a LISP site.<br><br>o =C2=A0The inner=
-header &#39;Differentiated Services Code Point&#39; (DSCP) field (or the &=
#39;Traffic Class&#39; field, in the case of IPv6) SHOULD be copied from th=
e outer-header DSCP field (&#39;Traffic Class&#39; field, in the case of IP=
v6) considering the exception listed below.<br><br>o =C2=A0The &#39;Explici=
t Congestion Notification&#39; (ECN) field (bits 6 and 7 of the IPv6 &#39;T=
raffic Class&#39; field) requires special treatment in order to avoid disca=
rding indications of congestion [RFC3168]. If the &#39;ECN&#39; field conta=
ins a congestion indication codepoint (the value is &#39;11&#39;, the Conge=
stion Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-b=
it &#39;ECN&#39; field from the stripped outer header to the surviving inne=
r header that is used to forward the packet beyond the ETR.=C2=A0 These req=
uirements preserve CE indications when a packet that uses ECN traverses a L=
ISP tunnel and becomes marked with a CE indication due to congestion betwee=
n the tunnel endpoints.<br><br>Note that if an ETR/PETR is also an ITR/PITR=
 and chooses to re-encapsulate after decapsulating, the net effect of this =
is that the new outer header will carry the same Time to Live as the old ou=
ter header minus 1.<br><br>Copying the Time to Live (TTL) serves two purpos=
es: first, it preserves the distance the host intended the packet to travel=
; second, and more importantly, it provides for suppression of looping pack=
ets in the event there is a loop of concatenated tunnels due to misconfigur=
ation.=C2=A0 See Section 18.3 for TTL exception handling for traceroute pac=
kets.</blockquote><br>D.- Simplify section =E2=80=98Router Locator Selectio=
n=E2=80=99 stating that the data-plane MUST follow what=C2=B4s stored in th=
e map-cache (priorities and weights), the remaining text should go to an OA=
M document.<br><br>E.- Rewrite Section =E2=80=9CRouting Locator Reachabilit=
y=E2=80=9D considering the following changes:<br><br><blockquote style=3D"m=
argin:0 0 0 40px;border:none;padding:0px">*=C2=A0 =C2=A0 Keep bullet point =
1 (examine LSB), 6 (receiving a data-packet) and Echo-Nonce<br>*=C2=A0 =C2=
=A0 Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3 (hints=
 from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a response) =
and RLOC probing</blockquote><br><br>F.- Move Solicit-Map-Request to 6833bi=
s<br><br>G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement =
Considerations), 18 (Traceroute Consideration) to a new OAM document<br><br=
>=C2=A0</div></div></div>

--089e0832e26035c4b1056296a5a7--


From nobody Fri Jan 12 09:38:43 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 39A0C12D7F7 for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 09:38:42 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 3h03DuERKUdZ for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 09:38:38 -0800 (PST)
Received: from mail-pg0-x244.google.com (mail-pg0-x244.google.com [IPv6:2607:f8b0:400e:c05::244]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 8CAA612D831 for <lisp@ietf.org>; Fri, 12 Jan 2018 09:38:38 -0800 (PST)
Received: by mail-pg0-x244.google.com with SMTP id q12so4990835pgt.7 for <lisp@ietf.org>; Fri, 12 Jan 2018 09:38:38 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=RmCJVZ924Hlu0iovflekJ6G3FvHPaO3QECTkO9qYmZY=; b=hhL6ZkPYSJe4F0FaOJEex7oftXlg9MLv6Iq8HxsK+nEKSeNXqtDcdyyHJBiUkE8asp W/UNC8SSDiUeNim8sn61Mn7rJNWXdmtcpTtjwVe1l29AFNWWGsh3d8NmB1keF9Z9w+Yv IMZ3cgfRw8ecI8RFj7bUEkViALvLyXVlZfarYCe4/Xb24ogiy+v503c3sFIsjtDTiQhv Fw0AzcjjR06s7/aXF0aaBgCIeqxqu5hwELlDtGjoJeKwLimC6cuVOxWUN4cP4MD7GU5t HzBrxKo0KxGGbaWPp3exIRshP7+cDDpbOIQMuEjxQZPIWGQ5xVHLQdWriDLquQCa8AGC x0WQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=RmCJVZ924Hlu0iovflekJ6G3FvHPaO3QECTkO9qYmZY=; b=NrTCSc7niVZq23KtvQVEoCNW0snuO3lt/dwLgv95xODVdk0eGYtXeTrDaOdwCIcViU Hhc6yT6+anYeW1Has/ROMiRVtViYT7vP1AvmvguMSvZMUoTxMw2qh/RNjwMcRvVLUJv9 MuItIjBcCcBWqB0fuvlVp+nf8Ay0kDwsyzweiK4S82wU4HoSEvFve/aGY7kFIqj6tiEP muYQQj48dE6TrrBe6gRtHWCXCEkuOwmtchbm+zFkY+ZYND4LmebgkqCx3xAwLBD2jrGp zSLiw3nrlwiirQk8GUdpYZUXcM1cstfQre63xGEfxlsGPbCdeiNnmKA3VCtlVyiq6Xwe rcFg==
X-Gm-Message-State: AKGB3mIJln+4aEp9I1+Se0rFNFhyqeGND4Azw1wcHY3W1b73C+d04WZB qeCatIhdtISVqn6TYHDAbdUg6i9F
X-Google-Smtp-Source: ACJfBosm0h0Bn5vIv42YsDQZO3y5m5U09SJ01OTHQzSah8z0Qmvck/IhGKX3eOddB93KwwzIecfvpA==
X-Received: by 10.84.130.75 with SMTP id 69mr27022668plc.409.1515778717656; Fri, 12 Jan 2018 09:38:37 -0800 (PST)
Received: from ?IPv6:2603:3024:151c:55f0:a9e9:12fe:1dc9:ceb6? ([2603:3024:151c:55f0:a9e9:12fe:1dc9:ceb6]) by smtp.gmail.com with ESMTPSA id p14sm17481935pff.108.2018.01.12.09.38.35 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 12 Jan 2018 09:38:36 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net>
Date: Fri, 12 Jan 2018 09:38:35 -0800
Cc: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/iEX3XBNWtrE4rKDcmTbcpPuVg2o>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 17:38:42 -0000

Let me put it even simpler for you Luigi. Say someone wants to write a =
client program that uses the LISP control-plane documented in 6833bis. A =
perfect example of this is a lig client (RFC 6835).=20

If SMRs and RLOC-Probing were to be documented in 6833bis, the lig =
client implementor would be wondering if it needs to implement SMRs and =
RLOC-probes. A lig client simply looks up an EID and prints out the =
RLOC-records.

Conclusion, SMRs and RLOC-probes are used by xTRs to be able to run the =
data-plane. xTRs are data-plane components. Therefore SMRs and =
RLOC-probes should stay in 6830bis, the data-plane specification.

Dino

> On Jan 12, 2018, at 3:01 AM, Luigi Iannone <ggx@gigix.net> wrote:
>=20
>=20
>=20
>> On 11 Jan 2018, at 18:50, Dino Farinacci <farinacci@gmail.com> wrote:
>>=20
>> Thanks Alberto for your comments. Here is how I break up items in the =
control-plane and the data-plane.=20
>>=20
>> Control-Plane (6833bis document):
>>=20
>> (1) The definition of control-plane messages. These are already =
documented in 6833bis.
>> (2) What components make up the control-plane that are not also in =
the data-plane. That is Map-Servers, Map-Resovers, LISP-ALT nodes, =
LISP-DDT nodes. These are already documented in 6833bis.
>>=20
>> Data-Plane (6830bis document):
>>=20
>> (1) What is required to move packets. Which includes the =
encapsulation format and the database-mappings and map-cache xTRs use. =
These are already documented in RFC6830bis.
>> (2) The components that make up the data-plane. That is ITRs, ETRs, =
PxTRs, and RTRs.
>> (3) And the elements of operation that the components in (2) use. So =
RLOC-probing and SMRs are explained in RFC6830bis because the components =
in (2) use. They are using control-plane messages obviously but those =
messages are defined in 6833bis.
>>=20
>> Note that ETRs send SMRs, note ITRs and PITR send RLOC-probes. These =
messages are not sent by any control-plane components. Another =
data-plane can be defined to do its own OAM or map version updating and =
use the messages defined in 6833bis to do that. But they could also =
might =E2=80=9Clet me try to use the same map-cache mechanisms as LISP =
but use a different encapsulation format=E2=80=9D. In this case, an =
implementor or deployer would read 6830bis.
>>=20
>> Having said that, people don=E2=80=99t create walls between getting =
information so if they want to do their own data-plane they can still =
read 6830bis.
>>=20
>> Another point about SMRs, the entire section talks about what ITRs =
and ETRs do. And these devices are data-plane components. Putting this =
section in 6833bis would possibly surprise a reader implementing another =
data-plane. For instance, a VXLAN data-plane reader would say =E2=80=9Cwha=
t is an ITR and ETR? I have VTEPs=E2=80=9D.
>=20
> This reasoning does not hold.
>=20
> [dhcp164-133] ~/Desktop # grep -c ITR =
draft-ietf-lisp-rfc6833bis-07.txt=20
> 65
> [dhcp164-133] ~/Desktop # grep -c ETR =
draft-ietf-lisp-rfc6833bis-07.txt
> 83
> [dhcp164-133] ~/Desktop # grep -c xTR =
draft-ietf-lisp-rfc6833bis-07.txt
> 20
> [dhcp164-133] ~/Desktop #=20
>=20
>=20
>=20
>=20
> Whoever reads 6833bis has to know what an ITR and an ETR is and what =
it does.
>=20
> L.
>=20
>=20
>> Another point about SMRs, they can be data driven. This happens when =
an ITR encapsulates to an ETR where the EID is no longer residing. That =
ETR, could respond with a SMR to the ITR to inform it that it has out of =
date mappings. This is all data-plane driven. Wouldn=E2=80=99t make =
logical sense to put it in 6833bis.
>>=20
>> Anyways, that is the way I look at it,
>> Dino
>>=20
>>> On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal =
<rodrigueznatal@gmail.com> wrote:
>>>=20
>>> Adding my two cents to this discussion, in the hope that it helps =
with
>>> the convergence.
>>>=20
>>> My original hope with the reorganization of the RFCs was to be able =
to
>>> use the LISP control-plane with a non-LISP data-plane. Putting aside
>>> the discussion of what goes where, and with some pragmatism in mind, =
I
>>> think we're close to that with the current 6833bis. The major
>>> roadblock for me is the lack of SMR in that document, and I think =
this
>>> aligns with the view of others in the list.
>>>=20
>>> I believe that with the addition of SMR, 6833bis will have all the
>>> required pieces to put together a viable LISP deployment (using a
>>> non-LISP data-plane) without having to look into 6830bis. Sure, =
there
>>> would be some mechanisms (e.g. RLOC probing) that would not be
>>> available using only 6833bis, but I could live without those. In
>>> addition, we could work on adding some extra explanation to the
>>> introduction of 6833bis so a non-familiar reader could make use of
>>> LISP without looking into 6830bis.
>>>=20
>>> I think these two things (i.e. move SMR and extend 6833bis intro)
>>> would minimize the changes required on the current documents and =
would
>>> allow us to reach some rough consensus to make progress with the =
docs.
>>> What do you guys think?
>>>=20
>>> Alberto
>>>=20
>>> On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci =
<farinacci@gmail.com> wrote:
>>>> =46rom my perspective on the situation:
>>>>=20
>>>> (1) I made changes exactly to text that was requested.
>>>> (2) I sometimes modify what the text that was requested.
>>>> (3) I disgree with some text so don=E2=80=99t include it.
>>>> (4) I have made many sub-revisions of -08.
>>>> (5) Comments are coming in throughout the review period and I =
don=E2=80=99t know what revision you have read and what you have not =
read. I don=E2=80=99t know if your comments are old or based on one of =
the revisions. Because I see comments that I addressed but its not clear =
to me you know that (or at least you have not told me).
>>>> (6) The changes in (1) and (2) have not been confirmed or denied by =
commenters. So I don=E2=80=99t know if what I changed has been accepted.
>>>> (7) Adding text to something that has changed won=E2=80=99t go in =
properly. So referencing some offered text in a previous email can=E2=80=99=
t be just inserted.
>>>>=20
>>>> So -08 has been submitted. I don=E2=80=99t know what are the =
outstanding issues at this point. So I need commenters to be specific. =
This is what I suggest:
>>>>=20
>>>> (1) List the open issues by commenting on the latest submitted -08.
>>>> (2) Include text from the -08 draft and your comments follow with =
suggested text.
>>>>=20
>>>> Let=E2=80=99s use that as a base to comment and discuss further. I =
can=E2=80=99t read your minds so I need more of your help. So please put =
more effort into it.
>>>>=20
>>>> Thanks in advance for your support,
>>>> Dino
>>>>=20
>>>>=20
>>>>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>=20
>>>>> Dino,
>>>>>=20
>>>>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>>>>>=20
>>>>>> Guys, please look at the latest changes instead of hashing the =
same arguments.
>>>>>>=20
>>>>>> This is what I am going to do. I am going to submit the myriad of =
changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>>>>>>=20
>>>>>=20
>>>>> I find this request unfair.
>>>>> I spent quite a bit of time reviewing and discussing this =
document, now you just try to wash all out by requesting comments on =
-08.
>>>>>=20
>>>>> Please let's continue discussing on the open issues so to find a =
solution.
>>>>>=20
>>>>> Thanks
>>>>>=20
>>>>> Luigi
>>>>>=20
>>>>>=20
>>>>>=20
>>>>>> The diff of the changes are included yet again.
>>>>>>=20
>>>>>> Dino
>>>>>>=20
>>>>>> <rfcdiff-rfc6830bis.html>
>>>>>>=20
>>>>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>>>=20
>>>>>>>=20
>>>>>>> HI Albert,
>>>>>>>=20
>>>>>>> thanks for your reply.
>>>>>>>=20
>>>>>>> My comments inline. (trimming what is OK for me)
>>>>>>>=20
>>>>>>> Luigi
>>>>>>>=20
>>>>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>>>>>>=20
>>>>>>>=20
>>>>>>> [snip]
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit =
(for
>>>>>>>>> IPv6) value used in the source and destination address fields =
of
>>>>>>>>> the first (most inner) LISP header of a packet.  The host =
obtains
>>>>>>>>> a destination EID the same way it obtains a destination =
address
>>>>>>>>> today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>>>>>> lookup or Session Initiation Protocol (SIP) [RFC3261] =
exchange.
>>>>>>>>> The source EID is obtained via existing mechanisms used to set =
a
>>>>>>>>> host's "local" IP address.  An EID used on the public Internet
>>>>>>>>> must have the same properties as any other IP address used in =
that
>>>>>>>>> manner; this means, among other things, that it must be =
globally
>>>>>>>>> unique.  An EID is allocated to a host from an EID-Prefix =
block
>>>>>>>>> associated with the site where the host is located.  An EID =
can be
>>>>>>>>> used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>>>>>> be assigned in a hierarchical manner, independent of the =
network
>>>>>>>>> topology, to facilitate scaling of the mapping database.  In
>>>>>>>>> addition, an EID block assigned to a site may have site-local
>>>>>>>>> structure (subnetting) for routing within the site; this =
structure
>>>>>>>>> is not visible to the global routing system.  In theory, the =
bit
>>>>>>>>> string that represents an EID for one device can represent an =
RLOC
>>>>>>>>> for a different device.  As the architecture is realized, if a
>>>>>>>>> given bit string is both an RLOC and an EID, it must refer to =
the
>>>>>>>>> same entity in both cases.
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Is the above sentence really necessary?
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Agreed, why not simplify the definitions. They are written from =
the =E2=80=98Internet scalability mindset=E2=80=99, why not say that an =
EID is an address of the overlay and an RLOC an address of the overlay. =
This change may require further changes on the document so I am not 100% =
sure if this is a good idea.
>>>>>>>=20
>>>>>>> For clarification I was just referring to the sentence:
>>>>>>>=20
>>>>>>> " As the architecture is realized, if a given bit string is both =
an RLOC and an EID, it must refer to the same entity in both cases.=E2=80=9D=

>>>>>>>=20
>>>>>>> I am wondering if such constrain is really necessary. If =
namespaces are well scoped there is no need for this.
>>>>>>>=20
>>>>>>> [snip]
>>>>>>>=20
>>>>>>> About the following:
>>>>>>>=20
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>>>>=20
>>>>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] for
>>>>>>>>> further information.
>>>>>>>>>=20
>>>>>>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> I suggest to leave them here, I don=C2=B4t think that readers =
start from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>>>>>>=20
>>>>>>> Good point about de definition of terms. What really bothers me =
is the bullet organisation. What can be done is to merge these two =
bullets with the previous one.
>>>>>>>=20
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>>>>>>> ECN bits and DSCP .
>>>>>>>>>=20
>>>>>>>>> 1. I think that the text should make explicitly the difference =
between DSCP and ECN fields.
>>>>>>>>>=20
>>>>>>>>> 2. How to deal with ECN should be part of the description of =
the  encap/decap not a paragraph apart.
>>>>>>>>> This basically means that half of the last paragraph should be =
a bullet of the ITR/PITR encapsulation
>>>>>>>>> and the other half  in the ETR/PETR operation.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Agreed, what about this (please comment):
>>>>>>>>=20
>>>>>>>> When doing ITR/PITR encapsulation:
>>>>>>>>=20
>>>>>>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the inner-header 'Time to =
Live' field.
>>>>>>>> o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>>>>>>=20
>>>>>>>> When doing ETR/PETR decapsulation:
>>>>>>>>=20
>>>>>>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, =
in the case of IPv6) SHOULD be copied from the outer-header 'Time to =
Live' field, when the Time to Live value of the outer header is less =
than the Time to Live value of the inner header.  Failing to perform =
this check can cause the Time to Live of the inner header to increment =
across encapsulation/decapsulation cycles.  This check is also performed =
when doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>>>>>> o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. If the =
'ECN' field contains a congestion indication codepoint (the value is =
'11', the Congestion Experienced (CE) codepoint), then ETR decapsulation =
MUST copy the 2-bit 'ECN' field from the stripped outer header to the =
surviving inner header that is used to forward the packet beyond the =
ETR.  These requirements preserve CE indications when a packet that uses =
ECN traverses a LISP tunnel and becomes marked with a CE indication due =
to congestion between the tunnel endpoints.
>>>>>>>>=20
>>>>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>>>>>>=20
>>>>>>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>>>>>>=20
>>>>>>>=20
>>>>>>> Text looks very good to me.
>>>>>>>=20
>>>>>>>=20
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Large part of this section is about control plane issues and =
as such should be put in 6833bis.
>>>>>>>>>=20
>>>>>>>>> What this section should state is that priority and weight are =
used to select the RLOC to use.
>>>>>>>>> Only exception is gleaning where we have one single RLOC and =
we do not know neither priority nor weight.
>>>>>>>>>=20
>>>>>>>>> All the other operational discussion goes elsewhere, but not =
in this document.
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Agree, I suggest moving it to 6833bis. What to leave in 6830bis =
is less obvious, maybe something like (not final, just a couple of =
ideas):
>>>>>>>>=20
>>>>>>>> The data-plane must follow the state stored in the map-cache to =
encapsulate and decapsulate packets. The map-cache is populated using a =
control-plane, such as [6833bis]. ETRs encapsulate packets following the =
Priorities and Weights stored in the map-cache.
>>>>>>>>=20
>>>>>>>=20
>>>>>>> Yes, this is what I meant.
>>>>>>>=20
>>>>>>>=20
>>>>>>>> Actually we should merge this section with 'Routing Locator =
Hashing'
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>=20
>>>>>>> I think is a good idea.
>>>>>>>=20
>>>>>>> [snip]
>>>>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> This is a control plane issue, as such it has to go in =
6833bis, with two exception:
>>>>>>>>> The very first paragraph stetting the problem, and the =
versioning subsection, because it is a data-plane mechanism.
>>>>>>>>>=20
>>>>>>>>> All of the rest 6833bis
>>>>>>>>>=20
>>>>>>>>> Actually I remember a suggestion about putting operations =
issues like this in an OAM document which would be a good idea.
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> So you are suggesting that the LISP control-plane does not =
define any mechanism to update EID-to-RLOC mappings?
>>>>>>>>=20
>>>>>>>=20
>>>>>>> Not exactly. Control-plane should discuss how to change the =
mappings, but things like clock sweep is just management not a control =
plane mechanism, as such it does not really needs to be standardised =
because there are no interoperability issues, hence it make really sense =
 to put it elsewhere.
>>>>>>>=20
>>>>>>> Thanks
>>>>>>>=20
>>>>>>> Luigi
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>>=20
>>>>>>> _______________________________________________
>>>>>>> lisp mailing list
>>>>>>> lisp@ietf.org
>>>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>>>>=20
>>>>>=20
>>>>=20
>>>> _______________________________________________
>>>> lisp mailing list
>>>> lisp@ietf.org
>>>> https://www.ietf.org/mailman/listinfo/lisp
>>=20
>=20


From nobody Fri Jan 12 09:58:59 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 7610412D856; Fri, 12 Jan 2018 09:58:57 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id RrMozDuDOWhY; Fri, 12 Jan 2018 09:58:55 -0800 (PST)
Received: from mail-pf0-x22d.google.com (mail-pf0-x22d.google.com [IPv6:2607:f8b0:400e:c00::22d]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 83D75129C6B; Fri, 12 Jan 2018 09:58:52 -0800 (PST)
Received: by mail-pf0-x22d.google.com with SMTP id 23so4923731pfp.3; Fri, 12 Jan 2018 09:58:52 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=YnBYxk3QtsEykws4km8u4ABTx1A1qfkdvn5UyDGQPhs=; b=uL2aljjG7/hwF6nS1SSXz/RrgkhsXz/KAVt4UlCRQGTXaUr8JfrXWGcwgDoukAIdvX +8WkqswtPRYJXhwsDI1Sz3eNnfAYI4lLUt28PGZhQLGppGuZFKb2x3TQrb8I0HmLXhws irBrL4OFVhPa9wjxj0cTzyq884J42k5hf+jsMOIIE95HWTii97q7Ws7dWSYb4hndz8ey EMZ4S0SZdYGAKtEC6b5Vgb3lZCSSY1xvbDqNRctWbksED8pZ1JoHSLFn2NdMb0EXpmE5 eX8tJwo+Z565SGCwYHpboCvQYPyzls+mdVwtWOgSX3+nJ4QJdlhoIITz/Mm3OEnX3e/i uAtQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=YnBYxk3QtsEykws4km8u4ABTx1A1qfkdvn5UyDGQPhs=; b=C/mV1BQ4LZQG71q4eNKAW6apAJyk5VWgsOqibYLxShTLGQTAjPhVyxZkrjsVquXxtm NaEoDFWUZ3LZTCG3uoOqV8JGldAfaVbZvrGINrI/53gZUIbci1+GTm2FCsTHh4L8NT99 Qecu4JGg25KCj4UHRw6jylFfuPCJ1MsRHZG24Dx4dzP0zLAjF8hB5ot4iD6KufivXT0B AZEh8Iq+xlZhJfcBD0L0zejLm9umsZmErgYz5/CjZ6Mks+qW5YXdgbohDyqudGpEKPyB eld2sONAy63ecWemrgEuj3NTOI1GF/bgoN4HDBTpzQ3qdtaz4MlGhxarm7c0hwOsW99t mEzA==
X-Gm-Message-State: AKGB3mIReI4qCUYwXi2fTNvigg11iI4xTnaC9kXoHtWtCBKhS7vi/q2v mkdQN8kNbo1gi1K/kShfMEA=
X-Google-Smtp-Source: ACJfBos5xSxTdS8hN44k4kK2HUJ0am3qkRBD/ZHwsSm2z7LoN2PkoINpzH/Xass6vL8qfsA/o+nsTQ==
X-Received: by 10.99.148.26 with SMTP id m26mr21028997pge.157.1515779932012; Fri, 12 Jan 2018 09:58:52 -0800 (PST)
Received: from ?IPv6:2603:3024:151c:55f0:a9e9:12fe:1dc9:ceb6? ([2603:3024:151c:55f0:a9e9:12fe:1dc9:ceb6]) by smtp.gmail.com with ESMTPSA id x4sm45728463pfb.13.2018.01.12.09.58.50 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 12 Jan 2018 09:58:50 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com>
Date: Fri, 12 Jan 2018 09:58:50 -0800
Cc: "rtg-ads@ietf.org" <rtg-ads@ietf.org>, "rtg-dir@ietf.org" <rtg-dir@ietf.org>, "draft-ietf-lisp-signal-free-multicast.all@ietf.org" <draft-ietf-lisp-signal-free-multicast.all@ietf.org>,  "lisp@ietf.org" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <73A6A40F-3193-4C01-9ABC-B1E8BDF0FB33@gmail.com>
References: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com>
To: Les Ginsberg <ginsberg@cisco.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/j1LRPWiGVZzNaCRZS01v1tr9wZY>
Subject: Re: [lisp] [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 17:58:57 -0000

> The first use of LCAF (Section 2) should be expanded.
>=20
> I find the acronym "RTR" a bit unfortunate for the obvious reason that =
it intuitively represents "just a router". I wonder if the authors could

Les, I understand your concern here. However, RTR is littered throughout =
many LISP documents as well as in product documentation and =
implementations. We have clearly defined it in the base documents and =
for any new use-case of an RTR, it is explained in the use-case =
documents.

I really think it is too late. The term will continue to be used even if =
IETF changes the documents. And adding a new term could add confusion =
(you=E2=80=99d have to clarify everywhere that an RTR and a ReTR is the =
same thing).

> consider something like "ReTR". I am sensitive to the fact that this =
document has been around since 2014 and has undergone significant WG =
review. I have

RTR was introduced in a general way in RFC6830 which dates even further =
back in time. And the component has added NAT functionality, TE =
functionality, and in this document multicast functionality.

> not attempted to track all of the email history regarding this =
document. Perhaps this point has been considered and consensus has been =
that the
> RTR acronym is the best choice. If so, feel free to disregard my =
suggestion, but as someone who read this document for the first time I =
found myself=20
> looking back for the definition of "RTR" multiple times as I read =
through the text.

Do you believe the definition is sufficient? This is what=E2=80=99s in =
the current document:

  Re-encapsulating Tunnel Router (RTR): An RTR is a router that
   implements the re-encapsulating tunnel function detailed in Section 8
   of the main LISP specification [RFC6830].  A LISP RTR performs packet
   re-routing by chaining ETR and ITR functions, whereby it first
   removes the LISP header of an ingress packet and then prepends a new
   LISP header to an egress packet.

Dino



From nobody Fri Jan 12 10:31:29 2018
Return-Path: <ginsberg@cisco.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id B9F9F12785F; Fri, 12 Jan 2018 10:31:21 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -14.531
X-Spam-Level: 
X-Spam-Status: No, score=-14.531 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_HI=-5, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, USER_IN_DEF_DKIM_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=cisco.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id wNc7Us-EIVs7; Fri, 12 Jan 2018 10:31:20 -0800 (PST)
Received: from rcdn-iport-3.cisco.com (rcdn-iport-3.cisco.com [173.37.86.74]) (using TLSv1.2 with cipher DHE-RSA-SEED-SHA (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id A73071200C5; Fri, 12 Jan 2018 10:31:19 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=@cisco.com; l=4056; q=dns/txt; s=iport; t=1515781879; x=1516991479; h=from:to:cc:subject:date:message-id:references: in-reply-to:content-transfer-encoding:mime-version; bh=neMNFWfuA6utcyPCzD9SZOZ0IVNbzBm1wkkfH2SntLg=; b=cvioZNzWtieHS1tsLATPRaYDO04GQgbIYCGUgkN7BQ5iMLVdAMrfTwCm mP1kfCsOKI136HV+ptxw7dUbEHRrLIQgTg2mdT+6DiIUcx9MKdn3nU2D8 8LNKtuYYMc+1+U2ScLTbJ/oHFXUgmeNRLtl3k+E6q4YKlW3uEz20hBs5a o=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0D4AADQ/Vha/5JdJa1dGQEBAQEBAQEBA?= =?us-ascii?q?QEBAQcBAQEBAYNBgVonB4QAiiSOYYICiQuOJhSCAgqFOwIahCc/GAEBAQEBAQE?= =?us-ascii?q?BAWsohSMBAQEDASMRRQUHBAIBCBEEAQEDAiMDAgICHxEUAQgIAQEEDgUIihMDD?= =?us-ascii?q?QiubYInhzsNgnABAQEBAQEBAQEBAQEBAQEBAQEBAQEdgQ+DLYIVgVeBaYMugmt?= =?us-ascii?q?EBIE8ARIBgzaCZQWjJz0CkEeEeYIihh2EFYdFjX6IegIRGQGBOwEfOWBwbxWCZ?= =?us-ascii?q?4JUHBmBTniJeYElgRcBAQE?=
X-IronPort-AV: E=Sophos;i="5.46,350,1511827200"; d="scan'208";a="332262576"
Received: from rcdn-core-10.cisco.com ([173.37.93.146]) by rcdn-iport-3.cisco.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 12 Jan 2018 18:31:18 +0000
Received: from XCH-RCD-003.cisco.com (xch-rcd-003.cisco.com [173.37.102.13]) by rcdn-core-10.cisco.com (8.14.5/8.14.5) with ESMTP id w0CIVI3F028307 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=FAIL); Fri, 12 Jan 2018 18:31:18 GMT
Received: from xch-aln-001.cisco.com (173.36.7.11) by XCH-RCD-003.cisco.com (173.37.102.13) with Microsoft SMTP Server (TLS) id 15.0.1320.4; Fri, 12 Jan 2018 12:31:17 -0600
Received: from xch-aln-001.cisco.com ([173.36.7.11]) by XCH-ALN-001.cisco.com ([173.36.7.11]) with mapi id 15.00.1320.000; Fri, 12 Jan 2018 12:31:17 -0600
From: "Les Ginsberg (ginsberg)" <ginsberg@cisco.com>
To: Dino Farinacci <farinacci@gmail.com>
CC: "rtg-ads@ietf.org" <rtg-ads@ietf.org>, "rtg-dir@ietf.org" <rtg-dir@ietf.org>, "draft-ietf-lisp-signal-free-multicast.all@ietf.org" <draft-ietf-lisp-signal-free-multicast.all@ietf.org>, "lisp@ietf.org" <lisp@ietf.org>
Thread-Topic: [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
Thread-Index: AdOLcLxCyIYYx6rFQ5mJ4GHzb7XvogAkI5wAAAvoOqA=
Date: Fri, 12 Jan 2018 18:31:17 +0000
Message-ID: <225a4de9cbc54c50abbe8503dcf98093@XCH-ALN-001.cisco.com>
References: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com> <73A6A40F-3193-4C01-9ABC-B1E8BDF0FB33@gmail.com>
In-Reply-To: <73A6A40F-3193-4C01-9ABC-B1E8BDF0FB33@gmail.com>
Accept-Language: en-US
Content-Language: en-US
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
x-ms-exchange-transport-fromentityheader: Hosted
x-originating-ip: [10.65.57.31]
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: base64
MIME-Version: 1.0
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/hbBjJjvNjaRYdmqMzI9QcMhA9fM>
Subject: Re: [lisp] [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 18:31:22 -0000

RGlubyAtDQoNCkkgLSBvZiBjb3Vyc2UgLSBkZWZlciB0byB5b3UgYXMgcmVnYXJkcyBhbGwgdGhp
bmdzIExJU1AuIEFuZCBpZiB0aGUgdXNlIG9mIFJUUiBpcyBhbHJlYWR5IHdpZGVzcHJlYWQsIHRo
ZW4gcGxlYXNlIGlnbm9yZSBteSBjb21tZW50Lg0KDQpUaGF0IHNhaWQsIEkgZG8gbm90IHNlZSB1
c2Ugb2YgIlJUUiIgaW4gUkZDIDY4MzAuIEkgc2VlIElUUiBhbmQgRVRSIGFuZCB0aGVpciBURSBl
cXVpdmFsZW50cywgYnV0IEkgZG8gbm90IHNlZSAiUlRSIi4NCj8/Pw0KDQpUaGUgZGVmaW5pdGlv
biBvZiBSZS1lbmNhcHN1bGF0aW5nIFR1bm5lbCBSb3V0ZXIgaXMgZmluZS4gSXQgaXMganVzdCB0
aGF0IHdoZW4gSSBzYXcgIlJUUiIgdXNlZCBpbiB0aGUgdGV4dCBJIGhhZCB0byBnbyBiYWNrIHRv
IHRoZSB0ZXJtaW5vbG9neSBzZWN0aW9uIGJlY2F1c2Ugb3RoZXJ3aXNlIEkgdGhvdWdodCB5b3Ug
d2VyZSBqdXN0IHRhbGtpbmcgYWJvdXQgYSAiUm91dGVyIi4NCg0KICAgTGVzDQoNCiANCg0KPiAt
LS0tLU9yaWdpbmFsIE1lc3NhZ2UtLS0tLQ0KPiBGcm9tOiBEaW5vIEZhcmluYWNjaSBbbWFpbHRv
OmZhcmluYWNjaUBnbWFpbC5jb21dDQo+IFNlbnQ6IEZyaWRheSwgSmFudWFyeSAxMiwgMjAxOCA5
OjU5IEFNDQo+IFRvOiBMZXMgR2luc2JlcmcgKGdpbnNiZXJnKSA8Z2luc2JlcmdAY2lzY28uY29t
Pg0KPiBDYzogcnRnLWFkc0BpZXRmLm9yZzsgcnRnLWRpckBpZXRmLm9yZzsgZHJhZnQtaWV0Zi1s
aXNwLXNpZ25hbC1mcmVlLQ0KPiBtdWx0aWNhc3QuYWxsQGlldGYub3JnOyBsaXNwQGlldGYub3Jn
DQo+IFN1YmplY3Q6IFJlOiBbUlRHLURJUn0gUnRnRGlyIGxhc3QgY2FsbCByZXZpZXc6IGRyYWZ0
LWlldGYtbGlzcC1zaWduYWwtZnJlZS0NCj4gbXVsdGljYXN0LTA3LnR4dA0KPiANCj4gPiBUaGUg
Zmlyc3QgdXNlIG9mIExDQUYgKFNlY3Rpb24gMikgc2hvdWxkIGJlIGV4cGFuZGVkLg0KPiA+DQo+
ID4gSSBmaW5kIHRoZSBhY3JvbnltICJSVFIiIGEgYml0IHVuZm9ydHVuYXRlIGZvciB0aGUgb2J2
aW91cyByZWFzb24gdGhhdA0KPiA+IGl0IGludHVpdGl2ZWx5IHJlcHJlc2VudHMgImp1c3QgYSBy
b3V0ZXIiLiBJIHdvbmRlciBpZiB0aGUgYXV0aG9ycw0KPiA+IGNvdWxkDQo+IA0KPiBMZXMsIEkg
dW5kZXJzdGFuZCB5b3VyIGNvbmNlcm4gaGVyZS4gSG93ZXZlciwgUlRSIGlzIGxpdHRlcmVkIHRo
cm91Z2hvdXQNCj4gbWFueSBMSVNQIGRvY3VtZW50cyBhcyB3ZWxsIGFzIGluIHByb2R1Y3QgZG9j
dW1lbnRhdGlvbiBhbmQNCj4gaW1wbGVtZW50YXRpb25zLiBXZSBoYXZlIGNsZWFybHkgZGVmaW5l
ZCBpdCBpbiB0aGUgYmFzZSBkb2N1bWVudHMgYW5kIGZvcg0KPiBhbnkgbmV3IHVzZS1jYXNlIG9m
IGFuIFJUUiwgaXQgaXMgZXhwbGFpbmVkIGluIHRoZSB1c2UtY2FzZSBkb2N1bWVudHMuDQo+IA0K
PiBJIHJlYWxseSB0aGluayBpdCBpcyB0b28gbGF0ZS4gVGhlIHRlcm0gd2lsbCBjb250aW51ZSB0
byBiZSB1c2VkIGV2ZW4gaWYgSUVURg0KPiBjaGFuZ2VzIHRoZSBkb2N1bWVudHMuIEFuZCBhZGRp
bmcgYSBuZXcgdGVybSBjb3VsZCBhZGQgY29uZnVzaW9uICh5b3XigJlkDQo+IGhhdmUgdG8gY2xh
cmlmeSBldmVyeXdoZXJlIHRoYXQgYW4gUlRSIGFuZCBhIFJlVFIgaXMgdGhlIHNhbWUgdGhpbmcp
Lg0KPiANCj4gPiBjb25zaWRlciBzb21ldGhpbmcgbGlrZSAiUmVUUiIuIEkgYW0gc2Vuc2l0aXZl
IHRvIHRoZSBmYWN0IHRoYXQgdGhpcw0KPiA+IGRvY3VtZW50IGhhcyBiZWVuIGFyb3VuZCBzaW5j
ZSAyMDE0IGFuZCBoYXMgdW5kZXJnb25lIHNpZ25pZmljYW50IFdHDQo+ID4gcmV2aWV3LiBJIGhh
dmUNCj4gDQo+IFJUUiB3YXMgaW50cm9kdWNlZCBpbiBhIGdlbmVyYWwgd2F5IGluIFJGQzY4MzAg
d2hpY2ggZGF0ZXMgZXZlbiBmdXJ0aGVyDQo+IGJhY2sgaW4gdGltZS4gQW5kIHRoZSBjb21wb25l
bnQgaGFzIGFkZGVkIE5BVCBmdW5jdGlvbmFsaXR5LCBURQ0KPiBmdW5jdGlvbmFsaXR5LCBhbmQg
aW4gdGhpcyBkb2N1bWVudCBtdWx0aWNhc3QgZnVuY3Rpb25hbGl0eS4NCj4gDQo+ID4gbm90IGF0
dGVtcHRlZCB0byB0cmFjayBhbGwgb2YgdGhlIGVtYWlsIGhpc3RvcnkgcmVnYXJkaW5nIHRoaXMN
Cj4gPiBkb2N1bWVudC4gUGVyaGFwcyB0aGlzIHBvaW50IGhhcyBiZWVuIGNvbnNpZGVyZWQgYW5k
IGNvbnNlbnN1cyBoYXMNCj4gPiBiZWVuIHRoYXQgdGhlIFJUUiBhY3JvbnltIGlzIHRoZSBiZXN0
IGNob2ljZS4gSWYgc28sIGZlZWwgZnJlZSB0byBkaXNyZWdhcmQNCj4gbXkgc3VnZ2VzdGlvbiwg
YnV0IGFzIHNvbWVvbmUgd2hvIHJlYWQgdGhpcyBkb2N1bWVudCBmb3IgdGhlIGZpcnN0IHRpbWUg
SQ0KPiBmb3VuZCBteXNlbGYgbG9va2luZyBiYWNrIGZvciB0aGUgZGVmaW5pdGlvbiBvZiAiUlRS
IiBtdWx0aXBsZSB0aW1lcyBhcyBJIHJlYWQNCj4gdGhyb3VnaCB0aGUgdGV4dC4NCj4gDQo+IERv
IHlvdSBiZWxpZXZlIHRoZSBkZWZpbml0aW9uIGlzIHN1ZmZpY2llbnQ/IFRoaXMgaXMgd2hhdOKA
mXMgaW4gdGhlIGN1cnJlbnQNCj4gZG9jdW1lbnQ6DQo+IA0KPiAgIFJlLWVuY2Fwc3VsYXRpbmcg
VHVubmVsIFJvdXRlciAoUlRSKTogQW4gUlRSIGlzIGEgcm91dGVyIHRoYXQNCj4gICAgaW1wbGVt
ZW50cyB0aGUgcmUtZW5jYXBzdWxhdGluZyB0dW5uZWwgZnVuY3Rpb24gZGV0YWlsZWQgaW4gU2Vj
dGlvbiA4DQo+ICAgIG9mIHRoZSBtYWluIExJU1Agc3BlY2lmaWNhdGlvbiBbUkZDNjgzMF0uICBB
IExJU1AgUlRSIHBlcmZvcm1zIHBhY2tldA0KPiAgICByZS1yb3V0aW5nIGJ5IGNoYWluaW5nIEVU
UiBhbmQgSVRSIGZ1bmN0aW9ucywgd2hlcmVieSBpdCBmaXJzdA0KPiAgICByZW1vdmVzIHRoZSBM
SVNQIGhlYWRlciBvZiBhbiBpbmdyZXNzIHBhY2tldCBhbmQgdGhlbiBwcmVwZW5kcyBhIG5ldw0K
PiAgICBMSVNQIGhlYWRlciB0byBhbiBlZ3Jlc3MgcGFja2V0Lg0KPiANCj4gRGlubw0KPiANCg0K


From nobody Fri Jan 12 10:40:26 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id CEEB5128D2E; Fri, 12 Jan 2018 10:40:19 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id A3dOo1GPKITr; Fri, 12 Jan 2018 10:40:17 -0800 (PST)
Received: from mail-pf0-x232.google.com (mail-pf0-x232.google.com [IPv6:2607:f8b0:400e:c00::232]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 34B5B12895E; Fri, 12 Jan 2018 10:40:17 -0800 (PST)
Received: by mail-pf0-x232.google.com with SMTP id p1so5008890pfh.4; Fri, 12 Jan 2018 10:40:17 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=T7U9u8EjPqAlI/JVxyJ15Gaswzd4oWqN7wzTwpjRnC8=; b=lnXfm93gfvLl9rjurLzBFbIdUJGTfaa6q+izRW32IuaJx/oUbD4k1rFzB6sFp+XHD+ T4ijySkCO2PdOX64YI0p4jMJCbi1X00EuaAMh8I0n198GLjNq6sTWwJTqk825Aib+YoS kPZfqdTKM6GvdrAJogE+HIOpJKoASFz4G1/fufIwH3kEOu6fT/s2qavHFLCb+UdN17/a ln2Gb/leEsYqyxavKNuAXvpzGYh6A3O8nWiDUh0iozON4urRDOcDMISSNnpA24o8Yrhr BlrLXqjJndZIk06WbgoVeppx9DANv4MhbB4dSCyHdZ0y661pPEapDSdGzCo4dQbhvBQL 6dAA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=T7U9u8EjPqAlI/JVxyJ15Gaswzd4oWqN7wzTwpjRnC8=; b=PJh4JCo7wSkCmrqHgbg0iF3xv8N4A+uPoEi9f/bjdX1PjhXEynVUkt0QMyMF06B4/u Yh9Pl+EmWklml0D2qts2O7dSQuQKAy+RHIOJppAxHSMQkX1jg7a0e9wmTZmvaHGRs7H8 gYupDYgszgLrgemwU8EzV4ckvDFRNNEbl5vpL8oRhus7WKzOCQiNmAWYqr71kxoToCth 0hgm3BQyt3glJA8zRfgbpo7PqQa+vLo0IB0GCQlPnMSVZMzVRL1eCZrBqNyeZwHsxcH3 u5oowXEhbe0PNC7RwfXF/KfA8J1JAHiSR/glfw83380x2vtTnhvJON63adwUY5y1oRgS l0+A==
X-Gm-Message-State: AKGB3mLPCbLyyZuK/5NIyhlaSHa03n1GqT0iu/DIpqpZuBoLDbT34RKD tPJZDNMhO0BXHBOJk9VvKoY=
X-Google-Smtp-Source: ACJfBovxFWxd0vbXEIeZZepgyxTjLgXb1D3DTUuTWnQ0jLrIYVhnLDAlXaEeuDNUOBH2L5OdpRFBtw==
X-Received: by 10.99.116.23 with SMTP id p23mr16311995pgc.60.1515782416665; Fri, 12 Jan 2018 10:40:16 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id w124sm44374952pfw.90.2018.01.12.10.40.15 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 12 Jan 2018 10:40:15 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <225a4de9cbc54c50abbe8503dcf98093@XCH-ALN-001.cisco.com>
Date: Fri, 12 Jan 2018 10:39:54 -0800
Cc: "rtg-ads@ietf.org" <rtg-ads@ietf.org>, "rtg-dir@ietf.org" <rtg-dir@ietf.org>, "draft-ietf-lisp-signal-free-multicast.all@ietf.org" <draft-ietf-lisp-signal-free-multicast.all@ietf.org>,  "lisp@ietf.org" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <3FC38CC3-F7C9-4C58-B4E0-68240FD589C1@gmail.com>
References: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com> <73A6A40F-3193-4C01-9ABC-B1E8BDF0FB33@gmail.com> <225a4de9cbc54c50abbe8503dcf98093@XCH-ALN-001.cisco.com>
To: Les Ginsberg <ginsberg@cisco.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/NOBO7YNeTL6ovWr1FIa7qW-WE10>
Subject: Re: [lisp] [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 18:40:20 -0000

> Dino -
>=20
> I - of course - defer to you as regards all things LISP. And if the =
use of RTR is already widespread, then please ignore my comment.

Thanks.

> That said, I do not see use of "RTR" in RFC 6830. I see ITR and ETR =
and their TE equivalents, but I do not see "RTR".
> ???

That has been noticed by many and the definition has been put in the =
6830bis draft. Sorry about referring to 6830 when I should have said =
draft-ietf-lisp-rfc6830bis-08.

> The definition of Re-encapsulating Tunnel Router is fine. It is just =
that when I saw "RTR" used in the text I had to go back to the =
terminology section because otherwise I thought you were just talking =
about a "Router=E2=80=9D.

A sign that you have been doing routers (aka RTRs) too long. ;-)

Dino

>=20
>   Les
>=20
>=20
>=20
>> -----Original Message-----
>> From: Dino Farinacci [mailto:farinacci@gmail.com]
>> Sent: Friday, January 12, 2018 9:59 AM
>> To: Les Ginsberg (ginsberg) <ginsberg@cisco.com>
>> Cc: rtg-ads@ietf.org; rtg-dir@ietf.org; draft-ietf-lisp-signal-free-
>> multicast.all@ietf.org; lisp@ietf.org
>> Subject: Re: [RTG-DIR} RtgDir last call review: =
draft-ietf-lisp-signal-free-
>> multicast-07.txt
>>=20
>>> The first use of LCAF (Section 2) should be expanded.
>>>=20
>>> I find the acronym "RTR" a bit unfortunate for the obvious reason =
that
>>> it intuitively represents "just a router". I wonder if the authors
>>> could
>>=20
>> Les, I understand your concern here. However, RTR is littered =
throughout
>> many LISP documents as well as in product documentation and
>> implementations. We have clearly defined it in the base documents and =
for
>> any new use-case of an RTR, it is explained in the use-case =
documents.
>>=20
>> I really think it is too late. The term will continue to be used even =
if IETF
>> changes the documents. And adding a new term could add confusion =
(you=E2=80=99d
>> have to clarify everywhere that an RTR and a ReTR is the same thing).
>>=20
>>> consider something like "ReTR". I am sensitive to the fact that this
>>> document has been around since 2014 and has undergone significant WG
>>> review. I have
>>=20
>> RTR was introduced in a general way in RFC6830 which dates even =
further
>> back in time. And the component has added NAT functionality, TE
>> functionality, and in this document multicast functionality.
>>=20
>>> not attempted to track all of the email history regarding this
>>> document. Perhaps this point has been considered and consensus has
>>> been that the RTR acronym is the best choice. If so, feel free to =
disregard
>> my suggestion, but as someone who read this document for the first =
time I
>> found myself looking back for the definition of "RTR" multiple times =
as I read
>> through the text.
>>=20
>> Do you believe the definition is sufficient? This is what=E2=80=99s =
in the current
>> document:
>>=20
>>  Re-encapsulating Tunnel Router (RTR): An RTR is a router that
>>   implements the re-encapsulating tunnel function detailed in Section =
8
>>   of the main LISP specification [RFC6830].  A LISP RTR performs =
packet
>>   re-routing by chaining ETR and ITR functions, whereby it first
>>   removes the LISP header of an ingress packet and then prepends a =
new
>>   LISP header to an egress packet.
>>=20
>> Dino
>>=20
>=20


From nobody Fri Jan 12 10:52:27 2018
Return-Path: <ginsberg@cisco.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 29DBA127201; Fri, 12 Jan 2018 10:52:25 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -14.531
X-Spam-Level: 
X-Spam-Status: No, score=-14.531 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_HI=-5, RCVD_IN_MSPIKE_H4=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, USER_IN_DEF_DKIM_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=cisco.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id tNGknNoLARKv; Fri, 12 Jan 2018 10:52:23 -0800 (PST)
Received: from rcdn-iport-8.cisco.com (rcdn-iport-8.cisco.com [173.37.86.79]) (using TLSv1.2 with cipher DHE-RSA-SEED-SHA (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id D2A34126D0C; Fri, 12 Jan 2018 10:52:22 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=@cisco.com; l=5806; q=dns/txt; s=iport; t=1515783142; x=1516992742; h=from:to:cc:subject:date:message-id:references: in-reply-to:content-transfer-encoding:mime-version; bh=o7i9MoUBZyRLn3xBaKlSB64ka+4kfaOcjmkpvPynqWQ=; b=Tl/OzCSTPMPl1PBxsf0djhncoStRVeI/HEANHYcOrns14VLbyUR/GS1D pctZAN2EC3I4vlbcX1tcjyiKtFYmZb2+avc2YasBHfdeIJBLDJ/BxQ11O YjOlMDrRRV/c6x8LB9wlozkV8DcTcH1vPx16IJpFsYR++eh2Mq5R0nCU4 4=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0A/AQCCA1la/40NJK1dGQEBAQEBAQEBA?= =?us-ascii?q?QEBAQcBAQEBAYNBgVonB4QNiiSOYYICfIgPjiYUggIKhTsCGoQnPxgBAQEBAQE?= =?us-ascii?q?BAQFrKIUjAQEBAQIBIxFFDAQCAQgRBAEBAwIjAwICAh8RFAEICAEBBA4FCIoTA?= =?us-ascii?q?w0IrnmCJ4c8DYJwAQEBAQEBAQEBAQEBAQEBAQEBAQEBHYEPgy2CFYFXgWmCeDa?= =?us-ascii?q?Ca0QEgTwBEgE2gwCCZQWjJz0CkEeEeYIihh2EFYdFjX6IegIRGQGBOwEfOWBwb?= =?us-ascii?q?xWCZ4JUHBmBTniJVIElgRcBAQE?=
X-IronPort-AV: E=Sophos;i="5.46,350,1511827200"; d="scan'208";a="340854248"
Received: from alln-core-8.cisco.com ([173.36.13.141]) by rcdn-iport-8.cisco.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 12 Jan 2018 18:52:21 +0000
Received: from XCH-RCD-003.cisco.com (xch-rcd-003.cisco.com [173.37.102.13]) by alln-core-8.cisco.com (8.14.5/8.14.5) with ESMTP id w0CIqLkb003488 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=FAIL); Fri, 12 Jan 2018 18:52:21 GMT
Received: from xch-aln-001.cisco.com (173.36.7.11) by XCH-RCD-003.cisco.com (173.37.102.13) with Microsoft SMTP Server (TLS) id 15.0.1320.4; Fri, 12 Jan 2018 12:52:20 -0600
Received: from xch-aln-001.cisco.com ([173.36.7.11]) by XCH-ALN-001.cisco.com ([173.36.7.11]) with mapi id 15.00.1320.000; Fri, 12 Jan 2018 12:52:20 -0600
From: "Les Ginsberg (ginsberg)" <ginsberg@cisco.com>
To: Dino Farinacci <farinacci@gmail.com>
CC: "rtg-ads@ietf.org" <rtg-ads@ietf.org>, "rtg-dir@ietf.org" <rtg-dir@ietf.org>, "draft-ietf-lisp-signal-free-multicast.all@ietf.org" <draft-ietf-lisp-signal-free-multicast.all@ietf.org>, "lisp@ietf.org" <lisp@ietf.org>
Thread-Topic: [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
Thread-Index: AdOLcLxCyIYYx6rFQ5mJ4GHzb7XvogAkI5wAAAvoOqD//6w3AIAAYg8g
Date: Fri, 12 Jan 2018 18:52:20 +0000
Message-ID: <00a867866a0c4a6a9be77e664ff39fac@XCH-ALN-001.cisco.com>
References: <67a4814cf3aa408c8794d9b937cb8fcf@XCH-ALN-001.cisco.com> <73A6A40F-3193-4C01-9ABC-B1E8BDF0FB33@gmail.com> <225a4de9cbc54c50abbe8503dcf98093@XCH-ALN-001.cisco.com> <3FC38CC3-F7C9-4C58-B4E0-68240FD589C1@gmail.com>
In-Reply-To: <3FC38CC3-F7C9-4C58-B4E0-68240FD589C1@gmail.com>
Accept-Language: en-US
Content-Language: en-US
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
x-ms-exchange-transport-fromentityheader: Hosted
x-originating-ip: [10.65.57.31]
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: base64
MIME-Version: 1.0
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/YR7gjoIOq-rknldZi8hrogybFJM>
Subject: Re: [lisp] [RTG-DIR} RtgDir last call review: draft-ietf-lisp-signal-free-multicast-07.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 18:52:25 -0000

DQoNCj4gLS0tLS1PcmlnaW5hbCBNZXNzYWdlLS0tLS0NCj4gRnJvbTogRGlubyBGYXJpbmFjY2kg
W21haWx0bzpmYXJpbmFjY2lAZ21haWwuY29tXQ0KPiBTZW50OiBGcmlkYXksIEphbnVhcnkgMTIs
IDIwMTggMTA6NDAgQU0NCj4gVG86IExlcyBHaW5zYmVyZyAoZ2luc2JlcmcpIDxnaW5zYmVyZ0Bj
aXNjby5jb20+DQo+IENjOiBydGctYWRzQGlldGYub3JnOyBydGctZGlyQGlldGYub3JnOyBkcmFm
dC1pZXRmLWxpc3Atc2lnbmFsLWZyZWUtDQo+IG11bHRpY2FzdC5hbGxAaWV0Zi5vcmc7IGxpc3BA
aWV0Zi5vcmcNCj4gU3ViamVjdDogUmU6IFtSVEctRElSfSBSdGdEaXIgbGFzdCBjYWxsIHJldmll
dzogZHJhZnQtaWV0Zi1saXNwLXNpZ25hbC1mcmVlLQ0KPiBtdWx0aWNhc3QtMDcudHh0DQo+IA0K
PiA+IERpbm8gLQ0KPiA+DQo+ID4gSSAtIG9mIGNvdXJzZSAtIGRlZmVyIHRvIHlvdSBhcyByZWdh
cmRzIGFsbCB0aGluZ3MgTElTUC4gQW5kIGlmIHRoZSB1c2Ugb2YgUlRSIGlzDQo+IGFscmVhZHkg
d2lkZXNwcmVhZCwgdGhlbiBwbGVhc2UgaWdub3JlIG15IGNvbW1lbnQuDQo+IA0KPiBUaGFua3Mu
DQo+IA0KPiA+IFRoYXQgc2FpZCwgSSBkbyBub3Qgc2VlIHVzZSBvZiAiUlRSIiBpbiBSRkMgNjgz
MC4gSSBzZWUgSVRSIGFuZCBFVFIgYW5kIHRoZWlyDQo+IFRFIGVxdWl2YWxlbnRzLCBidXQgSSBk
byBub3Qgc2VlICJSVFIiLg0KPiA+ID8/Pw0KPiANCj4gVGhhdCBoYXMgYmVlbiBub3RpY2VkIGJ5
IG1hbnkgYW5kIHRoZSBkZWZpbml0aW9uIGhhcyBiZWVuIHB1dCBpbiB0aGUNCj4gNjgzMGJpcyBk
cmFmdC4gU29ycnkgYWJvdXQgcmVmZXJyaW5nIHRvIDY4MzAgd2hlbiBJIHNob3VsZCBoYXZlIHNh
aWQgZHJhZnQtDQo+IGlldGYtbGlzcC1yZmM2ODMwYmlzLTA4Lg0KPiANCg0KW0xlczpdIFllcyAt
IEkgc2VlIHRoYXQuIEJ1dCAtIGF0IGEgcXVpY2sgcGVydXNhbCBvZiBvdGhlciBMSVNQIGRvY3Vt
ZW50cyAtIEkgZG8gbm90IHNlZSBhIGRlZmluaXRpb24gb2YgUlRSIGVsc2V3aGVyZS4gU28gaXQg
d291bGQgc2VlbSB5b3Ugc3RpbGwgaGF2ZSBhbiBvcHBvcnR1bml0eSB0byBjaGFuZ2UgdGhlIGFj
cm9ueW0gYW5kIGtlZXAgYWxsIHB1Ymxpc2hlZCBkb2N1bWVudHMgY29uc2lzdGVudC4NCg0KQnV0
LCBJIGRvbid0IHdhbnQgdG8gcHJvbG9uZyB0aGlzIGRpc2N1c3Npb24uIEkgdGhpbmsgd2UgdW5k
ZXJzdGFuZCBlYWNoIG90aGVyIGFuZCBJIGFtIGNvbWZvcnRhYmxlIHdpdGggd2hhdGV2ZXIgZGVj
aXNpb24geW91IG1ha2UuDQoNCiAgIExlcw0KDQo+ID4gVGhlIGRlZmluaXRpb24gb2YgUmUtZW5j
YXBzdWxhdGluZyBUdW5uZWwgUm91dGVyIGlzIGZpbmUuIEl0IGlzIGp1c3QgdGhhdCB3aGVuDQo+
IEkgc2F3ICJSVFIiIHVzZWQgaW4gdGhlIHRleHQgSSBoYWQgdG8gZ28gYmFjayB0byB0aGUgdGVy
bWlub2xvZ3kgc2VjdGlvbg0KPiBiZWNhdXNlIG90aGVyd2lzZSBJIHRob3VnaHQgeW91IHdlcmUg
anVzdCB0YWxraW5nIGFib3V0IGEgIlJvdXRlcuKAnS4NCj4gDQo+IEEgc2lnbiB0aGF0IHlvdSBo
YXZlIGJlZW4gZG9pbmcgcm91dGVycyAoYWthIFJUUnMpIHRvbyBsb25nLiA7LSkNCj4gDQo+IERp
bm8NCj4gDQo+ID4NCj4gPiAgIExlcw0KPiA+DQo+ID4NCj4gPg0KPiA+PiAtLS0tLU9yaWdpbmFs
IE1lc3NhZ2UtLS0tLQ0KPiA+PiBGcm9tOiBEaW5vIEZhcmluYWNjaSBbbWFpbHRvOmZhcmluYWNj
aUBnbWFpbC5jb21dDQo+ID4+IFNlbnQ6IEZyaWRheSwgSmFudWFyeSAxMiwgMjAxOCA5OjU5IEFN
DQo+ID4+IFRvOiBMZXMgR2luc2JlcmcgKGdpbnNiZXJnKSA8Z2luc2JlcmdAY2lzY28uY29tPg0K
PiA+PiBDYzogcnRnLWFkc0BpZXRmLm9yZzsgcnRnLWRpckBpZXRmLm9yZzsgZHJhZnQtaWV0Zi1s
aXNwLXNpZ25hbC1mcmVlLQ0KPiA+PiBtdWx0aWNhc3QuYWxsQGlldGYub3JnOyBsaXNwQGlldGYu
b3JnDQo+ID4+IFN1YmplY3Q6IFJlOiBbUlRHLURJUn0gUnRnRGlyIGxhc3QgY2FsbCByZXZpZXc6
DQo+ID4+IGRyYWZ0LWlldGYtbGlzcC1zaWduYWwtZnJlZS0gbXVsdGljYXN0LTA3LnR4dA0KPiA+
Pg0KPiA+Pj4gVGhlIGZpcnN0IHVzZSBvZiBMQ0FGIChTZWN0aW9uIDIpIHNob3VsZCBiZSBleHBh
bmRlZC4NCj4gPj4+DQo+ID4+PiBJIGZpbmQgdGhlIGFjcm9ueW0gIlJUUiIgYSBiaXQgdW5mb3J0
dW5hdGUgZm9yIHRoZSBvYnZpb3VzIHJlYXNvbg0KPiA+Pj4gdGhhdCBpdCBpbnR1aXRpdmVseSBy
ZXByZXNlbnRzICJqdXN0IGEgcm91dGVyIi4gSSB3b25kZXIgaWYgdGhlDQo+ID4+PiBhdXRob3Jz
IGNvdWxkDQo+ID4+DQo+ID4+IExlcywgSSB1bmRlcnN0YW5kIHlvdXIgY29uY2VybiBoZXJlLiBI
b3dldmVyLCBSVFIgaXMgbGl0dGVyZWQNCj4gPj4gdGhyb3VnaG91dCBtYW55IExJU1AgZG9jdW1l
bnRzIGFzIHdlbGwgYXMgaW4gcHJvZHVjdCBkb2N1bWVudGF0aW9uDQo+ID4+IGFuZCBpbXBsZW1l
bnRhdGlvbnMuIFdlIGhhdmUgY2xlYXJseSBkZWZpbmVkIGl0IGluIHRoZSBiYXNlIGRvY3VtZW50
cw0KPiA+PiBhbmQgZm9yIGFueSBuZXcgdXNlLWNhc2Ugb2YgYW4gUlRSLCBpdCBpcyBleHBsYWlu
ZWQgaW4gdGhlIHVzZS1jYXNlDQo+IGRvY3VtZW50cy4NCj4gPj4NCj4gPj4gSSByZWFsbHkgdGhp
bmsgaXQgaXMgdG9vIGxhdGUuIFRoZSB0ZXJtIHdpbGwgY29udGludWUgdG8gYmUgdXNlZCBldmVu
DQo+ID4+IGlmIElFVEYgY2hhbmdlcyB0aGUgZG9jdW1lbnRzLiBBbmQgYWRkaW5nIGEgbmV3IHRl
cm0gY291bGQgYWRkDQo+ID4+IGNvbmZ1c2lvbiAoeW914oCZZCBoYXZlIHRvIGNsYXJpZnkgZXZl
cnl3aGVyZSB0aGF0IGFuIFJUUiBhbmQgYSBSZVRSIGlzIHRoZQ0KPiBzYW1lIHRoaW5nKS4NCj4g
Pj4NCj4gPj4+IGNvbnNpZGVyIHNvbWV0aGluZyBsaWtlICJSZVRSIi4gSSBhbSBzZW5zaXRpdmUg
dG8gdGhlIGZhY3QgdGhhdCB0aGlzDQo+ID4+PiBkb2N1bWVudCBoYXMgYmVlbiBhcm91bmQgc2lu
Y2UgMjAxNCBhbmQgaGFzIHVuZGVyZ29uZSBzaWduaWZpY2FudA0KPiBXRw0KPiA+Pj4gcmV2aWV3
LiBJIGhhdmUNCj4gPj4NCj4gPj4gUlRSIHdhcyBpbnRyb2R1Y2VkIGluIGEgZ2VuZXJhbCB3YXkg
aW4gUkZDNjgzMCB3aGljaCBkYXRlcyBldmVuDQo+ID4+IGZ1cnRoZXIgYmFjayBpbiB0aW1lLiBB
bmQgdGhlIGNvbXBvbmVudCBoYXMgYWRkZWQgTkFUIGZ1bmN0aW9uYWxpdHksDQo+ID4+IFRFIGZ1
bmN0aW9uYWxpdHksIGFuZCBpbiB0aGlzIGRvY3VtZW50IG11bHRpY2FzdCBmdW5jdGlvbmFsaXR5
Lg0KPiA+Pg0KPiA+Pj4gbm90IGF0dGVtcHRlZCB0byB0cmFjayBhbGwgb2YgdGhlIGVtYWlsIGhp
c3RvcnkgcmVnYXJkaW5nIHRoaXMNCj4gPj4+IGRvY3VtZW50LiBQZXJoYXBzIHRoaXMgcG9pbnQg
aGFzIGJlZW4gY29uc2lkZXJlZCBhbmQgY29uc2Vuc3VzIGhhcw0KPiA+Pj4gYmVlbiB0aGF0IHRo
ZSBSVFIgYWNyb255bSBpcyB0aGUgYmVzdCBjaG9pY2UuIElmIHNvLCBmZWVsIGZyZWUgdG8NCj4g
Pj4+IGRpc3JlZ2FyZA0KPiA+PiBteSBzdWdnZXN0aW9uLCBidXQgYXMgc29tZW9uZSB3aG8gcmVh
ZCB0aGlzIGRvY3VtZW50IGZvciB0aGUgZmlyc3QNCj4gPj4gdGltZSBJIGZvdW5kIG15c2VsZiBs
b29raW5nIGJhY2sgZm9yIHRoZSBkZWZpbml0aW9uIG9mICJSVFIiIG11bHRpcGxlDQo+ID4+IHRp
bWVzIGFzIEkgcmVhZCB0aHJvdWdoIHRoZSB0ZXh0Lg0KPiA+Pg0KPiA+PiBEbyB5b3UgYmVsaWV2
ZSB0aGUgZGVmaW5pdGlvbiBpcyBzdWZmaWNpZW50PyBUaGlzIGlzIHdoYXTigJlzIGluIHRoZQ0K
PiA+PiBjdXJyZW50DQo+ID4+IGRvY3VtZW50Og0KPiA+Pg0KPiA+PiAgUmUtZW5jYXBzdWxhdGlu
ZyBUdW5uZWwgUm91dGVyIChSVFIpOiBBbiBSVFIgaXMgYSByb3V0ZXIgdGhhdA0KPiA+PiAgIGlt
cGxlbWVudHMgdGhlIHJlLWVuY2Fwc3VsYXRpbmcgdHVubmVsIGZ1bmN0aW9uIGRldGFpbGVkIGlu
IFNlY3Rpb24gOA0KPiA+PiAgIG9mIHRoZSBtYWluIExJU1Agc3BlY2lmaWNhdGlvbiBbUkZDNjgz
MF0uICBBIExJU1AgUlRSIHBlcmZvcm1zIHBhY2tldA0KPiA+PiAgIHJlLXJvdXRpbmcgYnkgY2hh
aW5pbmcgRVRSIGFuZCBJVFIgZnVuY3Rpb25zLCB3aGVyZWJ5IGl0IGZpcnN0DQo+ID4+ICAgcmVt
b3ZlcyB0aGUgTElTUCBoZWFkZXIgb2YgYW4gaW5ncmVzcyBwYWNrZXQgYW5kIHRoZW4gcHJlcGVu
ZHMgYSBuZXcNCj4gPj4gICBMSVNQIGhlYWRlciB0byBhbiBlZ3Jlc3MgcGFja2V0Lg0KPiA+Pg0K
PiA+PiBEaW5vDQo+ID4+DQo+ID4NCg0K


From nobody Fri Jan 12 11:01:29 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 1970512AF83 for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 11:01:28 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id RCwmOE2dnz2C for <lisp@ietfa.amsl.com>; Fri, 12 Jan 2018 11:01:26 -0800 (PST)
Received: from mail-pg0-x230.google.com (mail-pg0-x230.google.com [IPv6:2607:f8b0:400e:c05::230]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 4FC37126D0C for <lisp@ietf.org>; Fri, 12 Jan 2018 11:01:26 -0800 (PST)
Received: by mail-pg0-x230.google.com with SMTP id i196so5155281pgd.0 for <lisp@ietf.org>; Fri, 12 Jan 2018 11:01:26 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=FlA1YdBo0XYe41ixCUWEo16DLm5tpRT4HhBJ1zAvOC0=; b=P4WEAz53zMJK6cf7sfvfKwwtvdYWmdpHY5YnPahag4SeJyS5HEE/QTSIswRmBsAUQV W0PARCSh0c7/AZvMl1m4e4sw6O6SUZOcgdBrg3BhRwXO972HMEqZGBWLg6hG/LAXZaG5 d6lQTXK/lEQxQhKF+kIPrq9kc7QaDQWY/Uh3WSXJnruDed/z+oOdByot2tOWNO0a+z1z MvPYzCQbiVX6FmFWVptft5QOcT65KVXPdfv0vEaR3uy1ll2cklFwQiFsO81OOEcfeD+4 oKQhueaf+Go8fvH8Abjg6Xq0v48xPHyhls6e5gY5P1rUytcE05JXVe3xULM/uSEIh3kO rDsA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=FlA1YdBo0XYe41ixCUWEo16DLm5tpRT4HhBJ1zAvOC0=; b=emuOUs2mY83cBNZZzpTg7i+4DVZI2SEwUoz/6Lgww44bvqv1TeGj/mXVfsYBvzE8yR qFawMZO3/8RZkyhKPojgMqS0mgF6laJ96Po329D/TaY3LQ04FDJCSYMZ43/dD02in0HG E2xPZdAh83lHUWNSLANkz4OwH1TpuWWarO+W0NNgqCiU+5qRXbaasTY4mLLaM+WY67bU 2yL9Jp1rEwSJSHtjopwj64ADa0NnN3fApH/SwtcwuiliTRKiFsu8dfr4JH2F1lCzlber y2z2Fd+JqMyGlGALVq4G74qVTDEfkNUZpNMi77GSWTkY1OQ3Hii4/Ll8ftHj9BAvkYjS ditg==
X-Gm-Message-State: AKwxytenOCW6nzY1ro3MP0SGXbOoXyIqpgGKGAdwkNhR4QcbQjWl2ZXe cU2c+oASetTuPjymNKTymgCVe3YU
X-Google-Smtp-Source: ACJfBovmW5Z+M1jTqcToe4+IDo388KrRKcAxFMTffoVWkZldO1dLqPqF5TGAqFcIW/g+rvybwSyujw==
X-Received: by 10.101.89.3 with SMTP id f3mr9338101pgu.372.1515783685925; Fri, 12 Jan 2018 11:01:25 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id d24sm20677932pfb.30.2018.01.12.11.01.23 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 12 Jan 2018 11:01:24 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
Date: Fri, 12 Jan 2018 11:01:02 -0800
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <91B4E943-A0BF-421E-B941-1D9944BE37BB@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/mnwSP2zvVAymkk2WRnR0Hg2EF3c>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 12 Jan 2018 19:01:28 -0000

> Hi all
>=20
> As editor of 6830bis I=C2=B4d like to confirm or deny the following =
changes which I believe have support.=20

Thanks a lot for doing this Albert. This is very helpful.

> Please note that I have intentionally ignored minor/editorial changes =
to help sync all the participants. I hope that the list below captures =
the most relevant ones.
>=20
> Also note that I don=C2=B4t necessarily agree with all the changes =
listed below, but that=C2=B4s an opinion with a different hat.

See my brief comments below.

> WG: Please CONFIRM or DENY:

I won=E2=80=99t confirm or deny just yet. I want to hear from other WG =
members.

> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20

These definitions would be confusing. Because there are multiple =
identifiers on an overlay. And there are multiple overlays as well. And =
an instance-ID really defines an overlay. Also, putting the term =
=E2=80=9Cidentifier=E2=80=9D with the underlay would confuse many =
people. It has been decades where people redefine these terms. It just =
seems endless and doesn=E2=80=99t improve the situation. And note there =
isn=E2=80=99t one identifier for an underlay either. One could argue =
that an underlay VPN could be RLOC space that is different than another =
underlay VPN. But what identifies that VPN is the mechanism used to =
realize that VPN and not the RLOCs that use it.

> C.- In section 5.3, change the description of the encap/decap =
operation concerning how to deal with ECN and DSCP bits to (new text =
needs to be validated by experts):

These changes are reasonable. I am fine with adding them.

Dino



From nobody Mon Jan 15 01:53:41 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id F0298126B6D for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 01:53:39 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.9
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id vf9HsgcQR350 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 01:53:37 -0800 (PST)
Received: from mail-wm0-x241.google.com (mail-wm0-x241.google.com [IPv6:2a00:1450:400c:c09::241]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id E643E127076 for <lisp@ietf.org>; Mon, 15 Jan 2018 01:53:36 -0800 (PST)
Received: by mail-wm0-x241.google.com with SMTP id 141so588581wme.3 for <lisp@ietf.org>; Mon, 15 Jan 2018 01:53:36 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=DdpT3J/N/kzo8is438e38H37P7ezkNuEE78FP9B+CMQ=; b=STYUC9W6zRnbEFdsC8el4xhx4CNL/w9jnUHt9T7pLZgLIANitWi/gUmKpuRyXwNQrl pw1YqokUgvDb4t7gxOhEVklxCmB0l2cLFYEKtpit1H/G5HRkoGs30D4+JahlljF6+Lje BhI6fiJWpHxG5EG1L6vEYr952PTeNQStajYc83ayxDfyqrAeqrKjgW8AelHLbZIceD6g +Mq5Gjqw9aXP2VjKtIZXwFUaTEXIYWjAaLAPlTenoh5Bj6ulXuQNpJiQXKUTKWqVZYtY fiYds8Fq2bdy4zkQ8dMrrjMV4PQFG4hDI3HvxQyeL+vWBMEhFEiRt4aT5qNSYYZg18vm Ncxg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=DdpT3J/N/kzo8is438e38H37P7ezkNuEE78FP9B+CMQ=; b=ISiSW0KJs3A8GtWJmEORM5wOvLWjcQfT5yOSBn53t5Uzs8SHNOaTKNECNFHjrKJxic vrYvzRUE7Bz/k0cgUevDx0x1vvqwYHoRyCcmqXwsyRWe7wTyCOTXk9FXt8SECKH+NV24 NKq9T9sKJKeKxTUWLReXqFnaBVD4nWv6jWCMLnIRcDo93ptIDLZpjV9n0R5To9zXnx0z ORdXCwMlQqlaq13TfRrdKRS8+bIAuWgJPL8PSzYWbrI6jb892JBJYWJ7vJi6dZrpEasd fUdqEruHeVtbGxzWDmOlTk/if3G7RDTBSrqtdUKNOBC2N+oSVDJI6wsCMbeT5DSxNkju /9AQ==
X-Gm-Message-State: AKwxytdsmjj1jNvk1uBFyaUxw53DGaB2Lj4f5r9jVm3y3qNv8ry+DCrE A1QnnhXEi80zLiZGVQj9Nb6Osw==
X-Google-Smtp-Source: ACJfBot7bWng9KxPMqYGAKuwX2JBkFNzfclJF4NEBlB9IyAoTx4zQPMhT4gm6KqGUsy9RgNeHFlhJw==
X-Received: by 10.80.141.73 with SMTP id t9mr1149332edt.214.1516010015035; Mon, 15 Jan 2018 01:53:35 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:d0b5:8585:845:497f? ([2001:660:330f:a4:d0b5:8585:845:497f]) by smtp.gmail.com with ESMTPSA id o15sm17837193edk.25.2018.01.15.01.53.33 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 01:53:33 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com>
Date: Mon, 15 Jan 2018 10:53:30 +0100
Cc: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/jJDMwg9-E24AdAuUKThyvL44Jf0>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 09:53:40 -0000

> On 12 Jan 2018, at 18:38, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Let me put it even simpler for you Luigi. Say someone wants to write a =
client program that uses the LISP control-plane documented in 6833bis. A =
perfect example of this is a lig client (RFC 6835).=20
>=20
> If SMRs and RLOC-Probing were to be documented in 6833bis, the lig =
client implementor would be wondering if it needs to implement SMRs and =
RLOC-probes. A lig client simply looks up an EID and prints out the =
RLOC-records.
>=20
> Conclusion, SMRs and RLOC-probes are used by xTRs to be able to run =
the data-plane.

SMRs and RLOC-probes are control-plane features used by xTRs to be able =
to run the data-plane.

As such they go in 6833bis.

L.



> xTRs are data-plane components. Therefore SMRs and RLOC-probes should =
stay in 6830bis, the data-plane specification.
>=20
> Dino
>=20
>> On Jan 12, 2018, at 3:01 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>=20
>>=20
>>=20
>>> On 11 Jan 2018, at 18:50, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>>=20
>>> Thanks Alberto for your comments. Here is how I break up items in =
the control-plane and the data-plane.=20
>>>=20
>>> Control-Plane (6833bis document):
>>>=20
>>> (1) The definition of control-plane messages. These are already =
documented in 6833bis.
>>> (2) What components make up the control-plane that are not also in =
the data-plane. That is Map-Servers, Map-Resovers, LISP-ALT nodes, =
LISP-DDT nodes. These are already documented in 6833bis.
>>>=20
>>> Data-Plane (6830bis document):
>>>=20
>>> (1) What is required to move packets. Which includes the =
encapsulation format and the database-mappings and map-cache xTRs use. =
These are already documented in RFC6830bis.
>>> (2) The components that make up the data-plane. That is ITRs, ETRs, =
PxTRs, and RTRs.
>>> (3) And the elements of operation that the components in (2) use. So =
RLOC-probing and SMRs are explained in RFC6830bis because the components =
in (2) use. They are using control-plane messages obviously but those =
messages are defined in 6833bis.
>>>=20
>>> Note that ETRs send SMRs, note ITRs and PITR send RLOC-probes. These =
messages are not sent by any control-plane components. Another =
data-plane can be defined to do its own OAM or map version updating and =
use the messages defined in 6833bis to do that. But they could also =
might =E2=80=9Clet me try to use the same map-cache mechanisms as LISP =
but use a different encapsulation format=E2=80=9D. In this case, an =
implementor or deployer would read 6830bis.
>>>=20
>>> Having said that, people don=E2=80=99t create walls between getting =
information so if they want to do their own data-plane they can still =
read 6830bis.
>>>=20
>>> Another point about SMRs, the entire section talks about what ITRs =
and ETRs do. And these devices are data-plane components. Putting this =
section in 6833bis would possibly surprise a reader implementing another =
data-plane. For instance, a VXLAN data-plane reader would say =E2=80=9Cwha=
t is an ITR and ETR? I have VTEPs=E2=80=9D.
>>=20
>> This reasoning does not hold.
>>=20
>> [dhcp164-133] ~/Desktop # grep -c ITR =
draft-ietf-lisp-rfc6833bis-07.txt=20
>> 65
>> [dhcp164-133] ~/Desktop # grep -c ETR =
draft-ietf-lisp-rfc6833bis-07.txt
>> 83
>> [dhcp164-133] ~/Desktop # grep -c xTR =
draft-ietf-lisp-rfc6833bis-07.txt
>> 20
>> [dhcp164-133] ~/Desktop #=20
>>=20
>>=20
>>=20
>>=20
>> Whoever reads 6833bis has to know what an ITR and an ETR is and what =
it does.
>>=20
>> L.
>>=20
>>=20
>>> Another point about SMRs, they can be data driven. This happens when =
an ITR encapsulates to an ETR where the EID is no longer residing. That =
ETR, could respond with a SMR to the ITR to inform it that it has out of =
date mappings. This is all data-plane driven. Wouldn=E2=80=99t make =
logical sense to put it in 6833bis.
>>>=20
>>> Anyways, that is the way I look at it,
>>> Dino
>>>=20
>>>> On Jan 11, 2018, at 6:21 AM, Alberto Rodriguez-Natal =
<rodrigueznatal@gmail.com> wrote:
>>>>=20
>>>> Adding my two cents to this discussion, in the hope that it helps =
with
>>>> the convergence.
>>>>=20
>>>> My original hope with the reorganization of the RFCs was to be able =
to
>>>> use the LISP control-plane with a non-LISP data-plane. Putting =
aside
>>>> the discussion of what goes where, and with some pragmatism in =
mind, I
>>>> think we're close to that with the current 6833bis. The major
>>>> roadblock for me is the lack of SMR in that document, and I think =
this
>>>> aligns with the view of others in the list.
>>>>=20
>>>> I believe that with the addition of SMR, 6833bis will have all the
>>>> required pieces to put together a viable LISP deployment (using a
>>>> non-LISP data-plane) without having to look into 6830bis. Sure, =
there
>>>> would be some mechanisms (e.g. RLOC probing) that would not be
>>>> available using only 6833bis, but I could live without those. In
>>>> addition, we could work on adding some extra explanation to the
>>>> introduction of 6833bis so a non-familiar reader could make use of
>>>> LISP without looking into 6830bis.
>>>>=20
>>>> I think these two things (i.e. move SMR and extend 6833bis intro)
>>>> would minimize the changes required on the current documents and =
would
>>>> allow us to reach some rough consensus to make progress with the =
docs.
>>>> What do you guys think?
>>>>=20
>>>> Alberto
>>>>=20
>>>> On Wed, Jan 10, 2018 at 6:26 PM, Dino Farinacci =
<farinacci@gmail.com> wrote:
>>>>> =46rom my perspective on the situation:
>>>>>=20
>>>>> (1) I made changes exactly to text that was requested.
>>>>> (2) I sometimes modify what the text that was requested.
>>>>> (3) I disgree with some text so don=E2=80=99t include it.
>>>>> (4) I have made many sub-revisions of -08.
>>>>> (5) Comments are coming in throughout the review period and I =
don=E2=80=99t know what revision you have read and what you have not =
read. I don=E2=80=99t know if your comments are old or based on one of =
the revisions. Because I see comments that I addressed but its not clear =
to me you know that (or at least you have not told me).
>>>>> (6) The changes in (1) and (2) have not been confirmed or denied =
by commenters. So I don=E2=80=99t know if what I changed has been =
accepted.
>>>>> (7) Adding text to something that has changed won=E2=80=99t go in =
properly. So referencing some offered text in a previous email can=E2=80=99=
t be just inserted.
>>>>>=20
>>>>> So -08 has been submitted. I don=E2=80=99t know what are the =
outstanding issues at this point. So I need commenters to be specific. =
This is what I suggest:
>>>>>=20
>>>>> (1) List the open issues by commenting on the latest submitted =
-08.
>>>>> (2) Include text from the -08 draft and your comments follow with =
suggested text.
>>>>>=20
>>>>> Let=E2=80=99s use that as a base to comment and discuss further. I =
can=E2=80=99t read your minds so I need more of your help. So please put =
more effort into it.
>>>>>=20
>>>>> Thanks in advance for your support,
>>>>> Dino
>>>>>=20
>>>>>=20
>>>>>> On Jan 10, 2018, at 2:03 AM, Luigi Iannone <ggx@gigix.net> wrote:
>>>>>>=20
>>>>>> Dino,
>>>>>>=20
>>>>>>> On 9 Jan 2018, at 18:54, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>>>>>>=20
>>>>>>> Guys, please look at the latest changes instead of hashing the =
same arguments.
>>>>>>>=20
>>>>>>> This is what I am going to do. I am going to submit the myriad =
of changes already agreed to and then we can open up comments again for =
-08. I have been holding these diffs for a few weeks now and have =
received little commentary on the latest changes. So if your points have =
not been addressed, state them again AFTER reading the changes to -08.
>>>>>>>=20
>>>>>>=20
>>>>>> I find this request unfair.
>>>>>> I spent quite a bit of time reviewing and discussing this =
document, now you just try to wash all out by requesting comments on =
-08.
>>>>>>=20
>>>>>> Please let's continue discussing on the open issues so to find a =
solution.
>>>>>>=20
>>>>>> Thanks
>>>>>>=20
>>>>>> Luigi
>>>>>>=20
>>>>>>=20
>>>>>>=20
>>>>>>> The diff of the changes are included yet again.
>>>>>>>=20
>>>>>>> Dino
>>>>>>>=20
>>>>>>> <rfcdiff-rfc6830bis.html>
>>>>>>>=20
>>>>>>>> On Jan 9, 2018, at 7:04 AM, Luigi Iannone <ggx@gigix.net> =
wrote:
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> HI Albert,
>>>>>>>>=20
>>>>>>>> thanks for your reply.
>>>>>>>>=20
>>>>>>>> My comments inline. (trimming what is OK for me)
>>>>>>>>=20
>>>>>>>> Luigi
>>>>>>>>=20
>>>>>>>>> On 27 Dec 2017, at 02:48, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> [snip]
>>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit =
(for
>>>>>>>>>> IPv6) value used in the source and destination address fields =
of
>>>>>>>>>> the first (most inner) LISP header of a packet.  The host =
obtains
>>>>>>>>>> a destination EID the same way it obtains a destination =
address
>>>>>>>>>> today, for example, through a Domain Name System (DNS) =
[RFC1034]
>>>>>>>>>> lookup or Session Initiation Protocol (SIP) [RFC3261] =
exchange.
>>>>>>>>>> The source EID is obtained via existing mechanisms used to =
set a
>>>>>>>>>> host's "local" IP address.  An EID used on the public =
Internet
>>>>>>>>>> must have the same properties as any other IP address used in =
that
>>>>>>>>>> manner; this means, among other things, that it must be =
globally
>>>>>>>>>> unique.  An EID is allocated to a host from an EID-Prefix =
block
>>>>>>>>>> associated with the site where the host is located.  An EID =
can be
>>>>>>>>>> used by a host to refer to other hosts.  Note that EID blocks =
MAY
>>>>>>>>>> be assigned in a hierarchical manner, independent of the =
network
>>>>>>>>>> topology, to facilitate scaling of the mapping database.  In
>>>>>>>>>> addition, an EID block assigned to a site may have site-local
>>>>>>>>>> structure (subnetting) for routing within the site; this =
structure
>>>>>>>>>> is not visible to the global routing system.  In theory, the =
bit
>>>>>>>>>> string that represents an EID for one device can represent an =
RLOC
>>>>>>>>>> for a different device.  As the architecture is realized, if =
a
>>>>>>>>>> given bit string is both an RLOC and an EID, it must refer to =
the
>>>>>>>>>> same entity in both cases.
>>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> Is the above sentence really necessary?
>>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Agreed, why not simplify the definitions. They are written =
from the =E2=80=98Internet scalability mindset=E2=80=99, why not say =
that an EID is an address of the overlay and an RLOC an address of the =
overlay. This change may require further changes on the document so I am =
not 100% sure if this is a good idea.
>>>>>>>>=20
>>>>>>>> For clarification I was just referring to the sentence:
>>>>>>>>=20
>>>>>>>> " As the architecture is realized, if a given bit string is =
both an RLOC and an EID, it must refer to the same entity in both =
cases.=E2=80=9D
>>>>>>>>=20
>>>>>>>> I am wondering if such constrain is really necessary. If =
namespaces are well scoped there is no need for this.
>>>>>>>>=20
>>>>>>>> [snip]
>>>>>>>>=20
>>>>>>>> About the following:
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> o  EIDs are typically IP addresses assigned to hosts.
>>>>>>>>>>=20
>>>>>>>>>> o  Other types of EID are supported by LISP, see [RFC8060] =
for
>>>>>>>>>> further information.
>>>>>>>>>>=20
>>>>>>>>>> I would put the last two bullets in the definition of EID. It =
simplifies the story here.
>>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> I suggest to leave them here, I don=C2=B4t think that readers =
start from the =E2=80=98Definition of terms=E2=80=99, these are relevant =
concepts to understand LISP.
>>>>>>>>=20
>>>>>>>> Good point about de definition of terms. What really bothers me =
is the bullet organisation. What can be done is to merge these two =
bullets with the previous one.
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> The description of the encap/decap operation lacks of clarity =
concerning how to deal with
>>>>>>>>>> ECN bits and DSCP .
>>>>>>>>>>=20
>>>>>>>>>> 1. I think that the text should make explicitly the =
difference between DSCP and ECN fields.
>>>>>>>>>>=20
>>>>>>>>>> 2. How to deal with ECN should be part of the description of =
the  encap/decap not a paragraph apart.
>>>>>>>>>> This basically means that half of the last paragraph should =
be a bullet of the ITR/PITR encapsulation
>>>>>>>>>> and the other half  in the ETR/PETR operation.
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Agreed, what about this (please comment):
>>>>>>>>>=20
>>>>>>>>> When doing ITR/PITR encapsulation:
>>>>>>>>>=20
>>>>>>>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' =
field, in the case of IPv6) SHOULD be copied from the inner-header 'Time =
to Live' field.
>>>>>>>>> o  The outer-header 'Differentiated Services Code Point' =
(DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHOULD =
be copied from the inner-header DSCP field ('Traffic Class' field, in =
the case of IPv6) considering the exception listed below.
>>>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>>>>>>>=20
>>>>>>>>> When doing ETR/PETR decapsulation:
>>>>>>>>>=20
>>>>>>>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' =
field, in the case of IPv6) SHOULD be copied from the outer-header 'Time =
to Live' field, when the Time to Live value of the outer header is less =
than the Time to Live value of the inner header.  Failing to perform =
this check can cause the Time to Live of the inner header to increment =
across encapsulation/decapsulation cycles.  This check is also performed =
when doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>>>>>>> o  The inner-header 'Differentiated Services Code Point' =
(DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHOULD =
be copied from the outer-header DSCP field ('Traffic Class' field, in =
the case of IPv6) considering the exception listed below.
>>>>>>>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 =
and 7 of the IPv6 'Traffic Class' field) requires special treatment in =
order to avoid discarding indications of congestion [RFC3168]. If the =
'ECN' field contains a congestion indication codepoint (the value is =
'11', the Congestion Experienced (CE) codepoint), then ETR decapsulation =
MUST copy the 2-bit 'ECN' field from the stripped outer header to the =
surviving inner header that is used to forward the packet beyond the =
ETR.  These requirements preserve CE indications when a packet that uses =
ECN traverses a LISP tunnel and becomes marked with a CE indication due =
to congestion between the tunnel endpoints.
>>>>>>>>>=20
>>>>>>>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>>>>>>>=20
>>>>>>>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Text looks very good to me.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> Large part of this section is about control plane issues and =
as such should be put in 6833bis.
>>>>>>>>>>=20
>>>>>>>>>> What this section should state is that priority and weight =
are used to select the RLOC to use.
>>>>>>>>>> Only exception is gleaning where we have one single RLOC and =
we do not know neither priority nor weight.
>>>>>>>>>>=20
>>>>>>>>>> All the other operational discussion goes elsewhere, but not =
in this document.
>>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> Agree, I suggest moving it to 6833bis. What to leave in =
6830bis is less obvious, maybe something like (not final, just a couple =
of ideas):
>>>>>>>>>=20
>>>>>>>>> The data-plane must follow the state stored in the map-cache =
to encapsulate and decapsulate packets. The map-cache is populated using =
a control-plane, such as [6833bis]. ETRs encapsulate packets following =
the Priorities and Weights stored in the map-cache.
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Yes, this is what I meant.
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>> Actually we should merge this section with 'Routing Locator =
Hashing'
>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> I think is a good idea.
>>>>>>>>=20
>>>>>>>> [snip]
>>>>>>>>>> 13.  Changing the Contents of EID-to-RLOC Mappings
>>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>> This is a control plane issue, as such it has to go in =
6833bis, with two exception:
>>>>>>>>>> The very first paragraph stetting the problem, and the =
versioning subsection, because it is a data-plane mechanism.
>>>>>>>>>>=20
>>>>>>>>>> All of the rest 6833bis
>>>>>>>>>>=20
>>>>>>>>>> Actually I remember a suggestion about putting operations =
issues like this in an OAM document which would be a good idea.
>>>>>>>>>>=20
>>>>>>>>>>=20
>>>>>>>>>=20
>>>>>>>>> So you are suggesting that the LISP control-plane does not =
define any mechanism to update EID-to-RLOC mappings?
>>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> Not exactly. Control-plane should discuss how to change the =
mappings, but things like clock sweep is just management not a control =
plane mechanism, as such it does not really needs to be standardised =
because there are no interoperability issues, hence it make really sense =
 to put it elsewhere.
>>>>>>>>=20
>>>>>>>> Thanks
>>>>>>>>=20
>>>>>>>> Luigi
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>>=20
>>>>>>>> _______________________________________________
>>>>>>>> lisp mailing list
>>>>>>>> lisp@ietf.org
>>>>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>>>>>=20
>>>>>>=20
>>>>>=20
>>>>> _______________________________________________
>>>>> lisp mailing list
>>>>> lisp@ietf.org
>>>>> https://www.ietf.org/mailman/listinfo/lisp
>>>=20
>>=20
>=20


From nobody Mon Jan 15 01:56:27 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 29E9812D95F for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 01:56:25 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 9w6VQlzTI0P0 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 01:56:23 -0800 (PST)
Received: from mail-wm0-x233.google.com (mail-wm0-x233.google.com [IPv6:2a00:1450:400c:c09::233]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 3C8DD12D953 for <lisp@ietf.org>; Mon, 15 Jan 2018 01:56:23 -0800 (PST)
Received: by mail-wm0-x233.google.com with SMTP id r78so646757wme.0 for <lisp@ietf.org>; Mon, 15 Jan 2018 01:56:23 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=cKWrfFleEz+NG1u2Iw8I9hebubtKoIu7T6Umy+clg3g=; b=m3Dsp+zUn8Hg3LRrD36vQUbPEjX6iATYCwIKc0wrDmiQnMgd7Rvw5ttb8rML6oM3q8 4B+BKt8URRiq+wQd2hM05kj09L7ulKCKr0OJYHFU8rtpFKZtXNR+3KeTH3Gh2n6W/Mr1 R4lM9LFJm2Utzj96qjyX7LhAE0tDYf7G2m1LnjEY1e+QokCTCvLFn/CaGT9EavwrTLU0 S2bvQ0ZunnE/kNlJndSAj25W7OHA6tRgs2pyYBVfG6BNas8jBMPQTlwCEFL4rBaFZjWP Npx+THFZYlRCMUWcBW2Zem47s+sbyrHbZAoxgJOBCiPMIKnPItfkRObZ9+OHZ3fTgmP4 YifA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=cKWrfFleEz+NG1u2Iw8I9hebubtKoIu7T6Umy+clg3g=; b=uC1spUBpzgZcHbpGqb0pv3ukCUSJFCSi6uEq6LRWk7MZ20akejJ9s8fPwtmSh/CRmO N9pHgfEGWt9qzsnXKjVErIJkN4I82z3EOR3TRbtbMCHvx1hziau1OFGBVVTomt12URAh mzmU1aM9IHnG888zX/Je5ahciJySODDbb768wcipGeC5URaqPBqvGbV+PI+3c3PKQWWl fs9r40NfwKQnDfHAKU6BnFiwDSGYVvdusgmKygTM0vkmB1CuPfmmSdaVewn1IKqySmiy gfB1ymJ/M31u8KYTRLfoAAeJcE69519i3irNRucOFt2R5wuj8CUnyHdRkFpGbMItKzKf NrQQ==
X-Gm-Message-State: AKwxytesQDXE+8seQnRl+U2C0aC9E9bREOdg2Iq72xDhZV7ixlhFT+rQ yUYNGUKv5ncEsB0xtPw3UXz6DQ==
X-Google-Smtp-Source: ACJfBovi9h9L9R4FGiZfrmW/xlFXorz4OJL8GMgBiiJKCGO1dDL5iHo2O40BkKb79k8CmU2m39QtYQ==
X-Received: by 10.28.196.73 with SMTP id u70mr4669032wmf.116.1516010181582; Mon, 15 Jan 2018 01:56:21 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:d0b5:8585:845:497f? ([2001:660:330f:a4:d0b5:8585:845:497f]) by smtp.gmail.com with ESMTPSA id e127sm3908745wmg.10.2018.01.15.01.56.19 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 01:56:20 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com>
Date: Mon, 15 Jan 2018 10:56:16 +0100
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/5tCZZD-bDY3UgGxZtPc32KXBFiU>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 09:56:25 -0000

Should I review 09 or 08?

But please once you reply to this mail than you stick to the decision =
until I review the document.

L.


> On 13 Jan 2018, at 19:30, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
> Here is a -09 proposal to add your requested change C below. All the =
other points are still open for discussion.
>=20
> Dino
>=20
> <rfcdiff.html>
>=20
> <draft-ietf-lisp-rfc6830bis-09.txt>
>=20
>> On Jan 12, 2018, at 8:20 AM, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>=20
>> Hi all
>>=20
>> As editor of 6830bis I=C2=B4d like to confirm or deny the following =
changes which I believe have support.=20
>>=20
>> Please note that I have intentionally ignored minor/editorial changes =
to help sync all the participants. I hope that the list below captures =
the most relevant ones.
>>=20
>> Also note that I don=C2=B4t necessarily agree with all the changes =
listed below, but that=C2=B4s an opinion with a different hat.
>>=20
>> WG: Please CONFIRM or DENY:
>>=20
>> -------
>>=20
>> A.- Remove definitions of PA and PI
>>=20
>> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20
>>=20
>> C.- In section 5.3, change the description of the encap/decap =
operation concerning how to deal with ECN and DSCP bits to (new text =
needs to be validated by experts):
>>=20
>> When doing ITR/PITR encapsulation:
>>=20
>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' =
field.
>>=20
>> o  The outer-header 'Differentiated Services Code Point' (DSCP) field =
(or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied =
from the inner-header DSCP field ('Traffic Class' field, in the case of =
IPv6) considering the exception listed below.
>>=20
>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>=20
>> When doing ETR/PETR decapsulation:
>>=20
>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>=20
>> o  The inner-header 'Differentiated Services Code Point' (DSCP) field =
(or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied =
from the outer-header DSCP field ('Traffic Class' field, in the case of =
IPv6) considering the exception listed below.
>>=20
>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>=20
>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>=20
>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>=20
>> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 =
stating that the data-plane MUST follow what=C2=B4s stored in the =
map-cache (priorities and weights), the remaining text should go to an =
OAM document.
>>=20
>> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D =
considering the following changes:
>>=20
>> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) =
and Echo-Nonce
>> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3 =
(hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a =
response) and RLOC probing
>>=20
>>=20
>> F.- Move Solicit-Map-Request to 6833bis
>>=20
>> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement =
Considerations), 18 (Traceroute Consideration) to a new OAM document
>>=20
>>=20
>=20


From nobody Mon Jan 15 02:00:50 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 51F1712D96D for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 02:00:49 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id ncv9jn9G4IBc for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 02:00:48 -0800 (PST)
Received: from mail-wm0-x22f.google.com (mail-wm0-x22f.google.com [IPv6:2a00:1450:400c:c09::22f]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id D0EFF12D967 for <lisp@ietf.org>; Mon, 15 Jan 2018 02:00:47 -0800 (PST)
Received: by mail-wm0-x22f.google.com with SMTP id x4so11730127wmc.0 for <lisp@ietf.org>; Mon, 15 Jan 2018 02:00:47 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=xOm9dKa/wyJ3rDdXli/K1WUZ+a7C6GUlAcDncg6bAGg=; b=xLEluoAO2JAHL05aQpspjbSQrGAnnGwX7x/xknu7JBAfHCyK+YTjHXcoBmeLdw6mqo b7oMVPffnTkYA1rF9WzF1yCGxCPsO3KwBvjFBi4irigIbomTBlP+aIcz7LAO9GkDiHsQ wAN+d1uElK8W6FeQvh8BAXtcQ1dZq9g5TRDD31gC3F74wSWwmHxzD+x4wLQHvV3iJctN afJ5xizvuHUEqm5XvKMlqliDaWWbDIHpJ9f4Wg8cP1uNiZWkZ8kGylNfJ0O0phHUR6XF hokhKGMucgDWtC48I+dCdw/zNt67Y6NokLMHQT7mu1O9+JNduLZqwxZqEDi8xvsBoWG+ pNig==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=xOm9dKa/wyJ3rDdXli/K1WUZ+a7C6GUlAcDncg6bAGg=; b=Q5XiFSRHcYSNaWWi5E8vEJhE1yYyXbg98Xo7zfzAbjRKrciLK0fASz63CH61d04RxO oy0qE/E3CCbyWuZtvpbEz0l9c28Etx5DzLKE6orCqVcVRiaF3RfV0FRgXCBwwJKAAL/6 qHjhj2k9CWgkr2ut770wEVJSpIoczEXu2cCyz2LXsYggSEaobHbDIHCg71aGamucvmk3 +PUbE36oIlhPcDbQVxkyEniFOsWh2i4zyBaNrI2sxKJ04IZtI+gVYLKR16fDwXTZvLmC GPbvrqjerVeflPuGBa+ChIrz6qWu+jcRlNSPTTb1tWr4EuaVAgcMiThhQpZOAal4tTr7 O/mQ==
X-Gm-Message-State: AKwxytfr5tGz4SJWXfMu7BXbzdNgap4KpTSWJeBok6bxUZjIAhSjtCwi 6sSchEHu8yxk4nyCRO8AL5tsB/GAnQE=
X-Google-Smtp-Source: ACJfBosqcYHyUopCEbJ9+pbr1JUKAHUVZegZISPhVJBTRKb+h8Pb/lHNpM+xVeq3IYiRvAvoiaJ5og==
X-Received: by 10.80.129.225 with SMTP id 88mr17946043ede.19.1516010446319; Mon, 15 Jan 2018 02:00:46 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:d0b5:8585:845:497f? ([2001:660:330f:a4:d0b5:8585:845:497f]) by smtp.gmail.com with ESMTPSA id e56sm1151445edb.75.2018.01.15.02.00.44 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 02:00:44 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
Date: Mon, 15 Jan 2018 11:00:41 +0100
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <DBBD8CC0-E02D-41DA-ACFA-4D537B6DE2CA@gigix.net>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/G8E_Dkaf8yTmJXUegzsqQpsHdS4>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 10:00:49 -0000

Thanks for this Albert.

On 12 Jan 2018, at 17:20, Albert Cabellos <albert.cabellos@gmail.com> =
wrote:
>=20
> Hi all
>=20
> As editor of 6830bis I=C2=B4d like to confirm or deny the following =
changes which I believe have support.=20
>=20
> Please note that I have intentionally ignored minor/editorial changes =
to help sync all the participants. I hope that the list below captures =
the most relevant ones.
>=20
> Also note that I don=C2=B4t necessarily agree with all the changes =
listed below, but that=C2=B4s an opinion with a different hat.
>=20
> WG: Please CONFIRM or DENY:
>=20

<chair hat on>

Folks,

Albert did a very helpful thing by writing this summary.

Pleas ALL provide feedback!

Summary is short and to the point, so it will not take you days to read =
it.

Thank you all for the effort.

Ciao

L.

<chair hat off>=


From nobody Mon Jan 15 09:56:10 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id F280D12EADD for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 09:56:08 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id fX2cyjvckPj1 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 09:56:07 -0800 (PST)
Received: from mail-pf0-x236.google.com (mail-pf0-x236.google.com [IPv6:2607:f8b0:400e:c00::236]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 2E6BF12EABE for <lisp@ietf.org>; Mon, 15 Jan 2018 09:56:07 -0800 (PST)
Received: by mail-pf0-x236.google.com with SMTP id m26so8421696pfj.11 for <lisp@ietf.org>; Mon, 15 Jan 2018 09:56:07 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=R0lZGxethxh/sq0JJYkbdbPC9d7EPHXuct4ATD3rkLk=; b=PPfULLrnAAeMzdss4Zp1qU/EGHbk6B0ucdMCm6YuRNXAZQk2iehHQX1+ZMsCA0wv16 mUZgHuMDz4P12AXFRkvfTIFRVOb1jnYmp0tgi8CxyvgTpjccGbQ8vqE9Z3pxVO69Q0/K IYtDCCsPS3O3ovzOaG99CDX1UrJrKR0R6Ty/KLm8si8srmG0I4n2htNo8Fa2y4PI/m1W 9NHlAwv/twrDDU5Pq6de143fpRxMGgzG3y9a/oZ/8NMrPzUmO3+iSGWJZ/JJpzLu/t5X P2MIDtZkt4jzQkUhgaIEWTjM//Ef7+TStbP8Z5grhLHzGelf17Tbe4OuHDBpqrzoCEBk QXPg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=R0lZGxethxh/sq0JJYkbdbPC9d7EPHXuct4ATD3rkLk=; b=GUfujcdIXw/u1sfz/KAUx5RtHqKAWEzIXe2ZuvtkOgJwRFRRxsflifSrH9tLNTNNCp RTH2EoREB/IENfx9U32GZJNgiD5ym4zc78/I0zWinDXIHGG1HRz06QO5OFveS/iL3owg jxcMof0vfFhwP3imbAJs3bhRunOayH7uU39METJ+Vrf2ch4vLty+gqIJTX/Kj3exQiAJ Jmg07Yv8z6hLYh1oY7PG2mhuPRkPK5z6EO+LlofxqKVLddpVCJ3eCWj0gg2XxPZr4C80 P1tafuIM9rRtmQweorg7BhgqkEZ53V9aNP8hV0/KHa+QuliC/8lhN9lzXrM3Dp10crs+ QyWQ==
X-Gm-Message-State: AKGB3mIh8wRrSKbbWM2oKOhk1dQ6j/PwLCaDONJpKfIylLRfhXNCFvf/ wckwzG8xVpooRuyNHXAhA6M=
X-Google-Smtp-Source: ACJfBovlsyE2hdBDFX0v3UgShBRo2HtF7bG2mJhVuRYK1iHzWLyHZqh4H8NGIQhAd/Qz/VQa9P89hQ==
X-Received: by 10.101.64.4 with SMTP id f4mr27153512pgp.200.1516038966850; Mon, 15 Jan 2018 09:56:06 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id q67sm218184pfi.164.2018.01.15.09.56.05 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 09:56:06 -0800 (PST)
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net>
Date: Mon, 15 Jan 2018 09:55:38 -0800
Cc: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/xqS8bhYrGDVeczX_JjzPteIrnFk>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 17:56:09 -0000

> SMRs and RLOC-probes are control-plane features used by xTRs to be =
able to run the data-plane.

They are data-plane features that use control-plane messages. No other =
devices sends an RLOC-probe (or SMR) then an xTR. And the elements of =
operation are based on the map-cache. Any manipulation of the map-cache =
SHOULD NOT go in 6833bis.

Dino



From nobody Mon Jan 15 09:57:41 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 369B5126C0F for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 09:57:40 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 27seHmjUKX3F for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 09:57:38 -0800 (PST)
Received: from mail-pg0-x22c.google.com (mail-pg0-x22c.google.com [IPv6:2607:f8b0:400e:c05::22c]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 4CA7412EAB9 for <lisp@ietf.org>; Mon, 15 Jan 2018 09:57:38 -0800 (PST)
Received: by mail-pg0-x22c.google.com with SMTP id 136so7738812pgd.8 for <lisp@ietf.org>; Mon, 15 Jan 2018 09:57:38 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=iJMRJqkQ8IBZb9SAd+5/eiuJybi+YJTCpXd+izCbbdw=; b=Q/P8jBoDIKxi7nhwEBDqJ3lMk9Q/YdHGr0dedQqShV7UxYTRaR2lbJFQyCCd/RyA/E tf9AolbYRas4TKsILns8GfhnBNOqw5xp+dUPlhPSOt/FoybGPvMQVgbV6RawCqKD68Mc VSUxnq1eeyTmgLWJCivnwvg75l+gvaYaM4n0twC6s0wi8rhugaogjJzpzlIFoe1GxKvc eABGCUh1TfTvjAVJF1JsrlZROWIWRD++nV+3KU2IKuppeOgWkQKP6lEamAsewfz8Jyvr CfTcD/HyyU4baDTlxZZFV0LyNySI2TXj3prjrZxxhDVvAcuxVOahEy5/b7PpLJgGWQEf 3heQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=iJMRJqkQ8IBZb9SAd+5/eiuJybi+YJTCpXd+izCbbdw=; b=algJAW3EZ+WneoSnJZkVERcexx8NrMK0R1x962kCJB7BaBwOebi5x7qYLRLMYS3b8p w7J2NpDmd5ISM5tPFyXpOjfGWw/T2hNqzw/cF2dHfv2qAKbNTUNiBVfzl8TG/x9IGdxk YnUwbwwZq9TjpUFLG2hpGG80vp3SSOXMETw3BEXaMOY4bnVVdaZ50u+74yBnn1jsz7Ls HFrJFgh8abMnKo1ZWjAj6jm2iM/Md8T6mI5zar1oVG5xvStHTi/Brc8aAGulYaVZvYi8 oSUJHiH/cSMyyuP8nxF6x20iiUx6q8IgqY6O28tB8IUZWyc/iVpPVuYIA+tqbhkXtmhV 2uHA==
X-Gm-Message-State: AKwxytfYJvjlT+dfZjf6AD9+ALDjgZj9o2Mi06SN7Dpvj6D1lq45leAN EuhB5DsFlbdMsPeP99wHXO4=
X-Google-Smtp-Source: ACJfBouHi2uOj+HhDhmaBWeYu0UX+1OgbVzXL5FIcMNCmMGQE+kGVc1ZXFmlgBqjDL9B2MElncB+Ug==
X-Received: by 10.99.131.74 with SMTP id h71mr5485085pge.373.1516039057712; Mon, 15 Jan 2018 09:57:37 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id e190sm256982pfe.15.2018.01.15.09.57.36 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 09:57:37 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net>
Date: Mon, 15 Jan 2018 09:57:36 -0800
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/VJ_YLsWKJ7gOArfHGpNAwCkfn7M>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 17:57:40 -0000

> Should I review 09 or 08?

It would be better to do -09. If I had known comments were coming from =
you I would have waited to put in Albert=E2=80=99s text. What I did in =
-09 is simply cut-and-paste his text.

> But please once you reply to this mail than you stick to the decision =
until I review the document.

I won=E2=80=99t make any other changes until I see your comments.

Dino

>=20
> L.
>=20
>=20
>> On 13 Jan 2018, at 19:30, Dino Farinacci <farinacci@gmail.com> wrote:
>>=20
>> Here is a -09 proposal to add your requested change C below. All the =
other points are still open for discussion.
>>=20
>> Dino
>>=20
>> <rfcdiff.html>
>>=20
>> <draft-ietf-lisp-rfc6830bis-09.txt>
>>=20
>>> On Jan 12, 2018, at 8:20 AM, Albert Cabellos =
<albert.cabellos@gmail.com> wrote:
>>>=20
>>> Hi all
>>>=20
>>> As editor of 6830bis I=C2=B4d like to confirm or deny the following =
changes which I believe have support.=20
>>>=20
>>> Please note that I have intentionally ignored minor/editorial =
changes to help sync all the participants. I hope that the list below =
captures the most relevant ones.
>>>=20
>>> Also note that I don=C2=B4t necessarily agree with all the changes =
listed below, but that=C2=B4s an opinion with a different hat.
>>>=20
>>> WG: Please CONFIRM or DENY:
>>>=20
>>> -------
>>>=20
>>> A.- Remove definitions of PA and PI
>>>=20
>>> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20
>>>=20
>>> C.- In section 5.3, change the description of the encap/decap =
operation concerning how to deal with ECN and DSCP bits to (new text =
needs to be validated by experts):
>>>=20
>>> When doing ITR/PITR encapsulation:
>>>=20
>>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the inner-header 'Time to Live' =
field.
>>>=20
>>> o  The outer-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the inner-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>=20
>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. ITR =
encapsulation MUST copy the 2-bit 'ECN' field from the inner header to =
the outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from =
the stripped outer header to the new outer header.
>>>=20
>>> When doing ETR/PETR decapsulation:
>>>=20
>>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>>>=20
>>> o  The inner-header 'Differentiated Services Code Point' (DSCP) =
field (or the 'Traffic Class' field, in the case of IPv6) SHOULD be =
copied from the outer-header DSCP field ('Traffic Class' field, in the =
case of IPv6) considering the exception listed below.
>>>=20
>>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>>>=20
>>> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>>>=20
>>> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>>>=20
>>> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 =
stating that the data-plane MUST follow what=C2=B4s stored in the =
map-cache (priorities and weights), the remaining text should go to an =
OAM document.
>>>=20
>>> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D =
considering the following changes:
>>>=20
>>> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) =
and Echo-Nonce
>>> *    Move to 6833bis bullet point 2 (ICMP Network/Host =
Unreachable),3 (hints from BGP),4 (ICMP Port Unreachable),5 (receive a =
Map-Reply as a response) and RLOC probing
>>>=20
>>>=20
>>> F.- Move Solicit-Map-Request to 6833bis
>>>=20
>>> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement =
Considerations), 18 (Traceroute Consideration) to a new OAM document
>>>=20
>>>=20
>>=20
>=20


From nobody Mon Jan 15 10:10:56 2018
Return-Path: <jmh@joelhalpern.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 6FA5B12EAF7 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:10:54 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.72
X-Spam-Level: 
X-Spam-Status: No, score=-2.72 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_LOW=-0.7, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=joelhalpern.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 3g_0F7cmW3Rp for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:10:53 -0800 (PST)
Received: from mailb2.tigertech.net (mailb2.tigertech.net [208.80.4.154]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 21BE812EAF5 for <lisp@ietf.org>; Mon, 15 Jan 2018 10:10:53 -0800 (PST)
Received: from localhost (localhost [127.0.0.1]) by mailb2.tigertech.net (Postfix) with ESMTP id 0A11E4A1A09; Mon, 15 Jan 2018 10:10:53 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=joelhalpern.com; s=1.tigertech; t=1516039853; bh=c2qe/U+PPlDCvZPUzC780vUfW7MphGCdMgUUvqFLjDU=; h=Subject:To:Cc:References:From:Date:In-Reply-To:From; b=mL765WgxyjS4gE0rsLc/e1KdQroTiKiirVU+wivIjn7WyByXGNmJCAMgjzdcpqnxs /0d4jjOZDlq3XEUKPjZCdImS945M65x6aZvLz/ZsY4HNCVzUgSF3Db+4x+KOy8i/RD A6G/xd4vZbsCSNe1eMV3H6m0/WBIcpLVt+AmTJHk=
X-Virus-Scanned: Debian amavisd-new at b2.tigertech.net
Received: from Joels-MacBook-Pro.local (unknown [50.225.209.67]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by mailb2.tigertech.net (Postfix) with ESMTPSA id C5A101C02E5; Mon, 15 Jan 2018 10:10:51 -0800 (PST)
To: Dino Farinacci <farinacci@gmail.com>, Luigi Iannone <ggx@gigix.net>
Cc: "lisp@ietf.org list" <lisp@ietf.org>, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com>
From: "Joel M. Halpern" <jmh@joelhalpern.com>
Message-ID: <80b1523a-9396-ba8c-83b0-83812984bd1f@joelhalpern.com>
Date: Mon, 15 Jan 2018 13:10:50 -0500
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
In-Reply-To: <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 7bit
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/ohjht9S2P73y5tm8bMVDZWe0T-4>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 18:10:54 -0000

<chair hat on> Let's try to separate things.

1) The fact that the messages are used only between xTRs does not tell 
us whether it is control or data.
2) The manipulation of map-cache may well be control (for example, if we 
were using a push-based control mechanism then map-cache control would 
be largely control.

</chair hat on>

<chair hat off>
Personally, it looks to me like SMR is a control mechanism.  It is 
information to control the operation of the xTR.  It is not data plane 
behavior.  It is driven from and drives control behavior.

One could argue that RLOC-probes are more borderline in tha tthey 
themselves behave more like data packets.  Still, my own thought process 
is to think of them as control operations.

The actual argument that can be made is that the capabilities these 
provide could be provided by another mechanism when another data plane 
is used.  But the capability needs to exist.  Putting these mechanisms 
in the control plane document makes it much easier to have the 
discussion about the fact that the control plane needs these functions 
to be robust.
After all, there is no goal that these are completely separate and 
independent entities.  Even if it may turn out that with sufficient care 
the control plane can be used for other things.
</chair hat off>

<chair hat on>  (Yes, my hats are bouncing.)
I would really like to hear from other WG members about this.  It is the 
WGs document.  The chairs would prefer not to simply use their own 
judgment.  So to repeat Luigi's plea: speak up.
</chair hat on>

Yours,
Joel


On 1/15/18 12:55 PM, Dino Farinacci wrote:
>> SMRs and RLOC-probes are control-plane features used by xTRs to be able to run the data-plane.
> 
> They are data-plane features that use control-plane messages. No other devices sends an RLOC-probe (or SMR) then an xTR. And the elements of operation are based on the map-cache. Any manipulation of the map-cache SHOULD NOT go in 6833bis.
> 
> Dino
> 
> 
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
> 


From nobody Mon Jan 15 10:16:40 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id F3FD712EB06 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:16:38 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id FMQ05JKO7o0g for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:16:37 -0800 (PST)
Received: from mail-pf0-x229.google.com (mail-pf0-x229.google.com [IPv6:2607:f8b0:400e:c00::229]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id B0BEB12D863 for <lisp@ietf.org>; Mon, 15 Jan 2018 10:16:37 -0800 (PST)
Received: by mail-pf0-x229.google.com with SMTP id a88so6939934pfe.12 for <lisp@ietf.org>; Mon, 15 Jan 2018 10:16:37 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=UviVKNd1UCLeuE1Cv3f0DgA/H9xKQmmmPA5/PmsIelc=; b=aGTcqb7dcTT5a8d/erNqWO4Tp6ARlNQ4zLZQnmxR15meo9+dTOI0fbGRJgzCYlHCw3 AOakuZAmvLqmL6Ut0Ja83P1WSroD/oe7VDIyjslYoaYR3j3jsAjL7wZoPpa7o3ZASCle MmK57/ZvdKIGAx2mDZkxmFHyV/v3WZbq1hIvLzWoC2Bc+eXPeMX1LhsnlQEQMZOAtjX1 JI9FHE2qgMPK4Ma9NxMcPNN1vSSQDVhtB30xUuQo/E4H+eojMkAsLO1FPWv1UfcoVu4P 2V0WCrLMGLDIVYRfkvY3FXeXM/ln+m3heRxgY1m7x04RdIpA87vDt2IhA0YsGM/shx1l If7A==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=UviVKNd1UCLeuE1Cv3f0DgA/H9xKQmmmPA5/PmsIelc=; b=MgZpnx5WgRtk24OH7bwBRE5CgQwJ23LtfpI3rWhWViigW+2rkrRz12uLW0kfdifezI ezUW2iC301VdJ4L5MYw6+Nky4T9qhkjyNA0jZJgvWGC9GP6OatgXPtorA3eLnb83MYfa kwD3Wp2WWRjHHAHpmY4FXqTGUKQ184wcDc39jVFj8C7nYHeuVE6D5IY3QrAG1KCZE4G3 IJrKcp1H2rCN/E8D/CdmJQwjohsgPcRg5AXRWebJ/Jt73GLo87wfOYvCyzExNkFU4sVY /EsHm8PW1qz8jSqoT/yQ5zZxMX20BY5a+KEwc+vKyZ2lz9/2EYJRRl+DaBMlAjtHrow3 0u5Q==
X-Gm-Message-State: AKGB3mJ9kF4KDdGeXb3q/rZbYAoRWGeInG32W8MjEfMlM1GM5ktD7JcM UkkMjZcYA0rGD9Uogs8RNAo=
X-Google-Smtp-Source: ACJfBotnjrzbANVwgZrfB40w3oEfFezIcpPq7JbABXqKW+KHbr6OBXB7X7P3ABRupVRmUDTng9rStg==
X-Received: by 10.98.15.203 with SMTP id 72mr32349903pfp.104.1516040197246; Mon, 15 Jan 2018 10:16:37 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id q14sm216390pgt.53.2018.01.15.10.16.35 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 10:16:36 -0800 (PST)
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <80b1523a-9396-ba8c-83b0-83812984bd1f@joelhalpern.com>
Date: Mon, 15 Jan 2018 10:16:35 -0800
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
Content-Transfer-Encoding: quoted-printable
Message-Id: <9097FAFF-2D3D-4220-9F25-73D792A28EB5@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com> <80b1523a-9396-ba8c-83b0-83812984bd1f@joelhalpern.com>
To: "Joel M. Halpern" <jmh@joelhalpern.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/U41tHhT6Y9oreSIf2B-rVpJ83Fs>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 18:16:39 -0000

> <chair hat on>  (Yes, my hats are bouncing.)
> I would really like to hear from other WG members about this.  It is =
the WGs document.  The chairs would prefer not to simply use their own =
judgment.  So to repeat Luigi's plea: speak up.
> </chair hat on>

And if there is silence, then what?

Dino


From nobody Mon Jan 15 10:18:33 2018
Return-Path: <jmh@joelhalpern.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 12B1612EAF3 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:18:32 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.721
X-Spam-Level: 
X-Spam-Status: No, score=-2.721 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_LOW=-0.7, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=joelhalpern.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 3QfU6PDSf997 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:18:31 -0800 (PST)
Received: from mailb2.tigertech.net (mailb2.tigertech.net [208.80.4.154]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 56BBD12EADC for <lisp@ietf.org>; Mon, 15 Jan 2018 10:18:24 -0800 (PST)
Received: from localhost (localhost [127.0.0.1]) by mailb2.tigertech.net (Postfix) with ESMTP id 449CF523284; Mon, 15 Jan 2018 10:18:24 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=joelhalpern.com; s=1.tigertech; t=1516040304; bh=Ubhv9ffnXPt6+0cJ8BAwq16ojeNo7hNIxLbEe3hkPSA=; h=Subject:To:Cc:References:From:Date:In-Reply-To:From; b=fXs8VZ9BZ7Nn84CAysGUTMwibXyRBhipMViGdFemqdGjFPP5OIlHFIjOSvsejellM nWZYVUECRkszpywTMb/vJHdhIbDNiNrG/WHd9FslhZ2ORHKmGRuXlWWUTtzXNJ2Yps fHFfKJz0vXnKFUV4xYlGCDPWaD/k9TghJCB5Qcm0=
X-Virus-Scanned: Debian amavisd-new at b2.tigertech.net
Received: from Joels-MacBook-Pro.local (unknown [50.225.209.67]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by mailb2.tigertech.net (Postfix) with ESMTPSA id 9512B1C0213; Mon, 15 Jan 2018 10:18:23 -0800 (PST)
To: Dino Farinacci <farinacci@gmail.com>
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com> <80b1523a-9396-ba8c-83b0-83812984bd1f@joelhalpern.com> <9097FAFF-2D3D-4220-9F25-73D792A28EB5@gmail.com>
From: "Joel M. Halpern" <jmh@joelhalpern.com>
Message-ID: <52222fd9-b63c-72d8-d584-ea2588a9d522@joelhalpern.com>
Date: Mon, 15 Jan 2018 13:18:22 -0500
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
In-Reply-To: <9097FAFF-2D3D-4220-9F25-73D792A28EB5@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 7bit
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/9hIhbwNrlAHCIgUHeOf8TvH8QMA>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 18:18:32 -0000

If there is silence, the chairs will make their best judgment on behalf 
of the working group.  That is our job.

The other choice is that we block the document until there are enough 
voices.  I would prefer not to do that.

Yours,
Joel

On 1/15/18 1:16 PM, Dino Farinacci wrote:
>> <chair hat on>  (Yes, my hats are bouncing.)
>> I would really like to hear from other WG members about this.  It is the WGs document.  The chairs would prefer not to simply use their own judgment.  So to repeat Luigi's plea: speak up.
>> </chair hat on>
> 
> And if there is silence, then what?
> 
> Dino
> 


From nobody Mon Jan 15 10:33:07 2018
Return-Path: <rodrigueznatal@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 24FF712EB3F for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:33:05 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id BhhgUihGVMeB for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 10:33:03 -0800 (PST)
Received: from mail-io0-x230.google.com (mail-io0-x230.google.com [IPv6:2607:f8b0:4001:c06::230]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 3A48512EB35 for <lisp@ietf.org>; Mon, 15 Jan 2018 10:33:03 -0800 (PST)
Received: by mail-io0-x230.google.com with SMTP id c17so14049423iod.1 for <lisp@ietf.org>; Mon, 15 Jan 2018 10:33:03 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=tHnrPihc2LV+eODgdG+10vdiBdJFvrfnMZskyFK3NcE=; b=eoAF+FQBgyktwKoxRR0sBRoP68VLwjl+myYgVrq3QhRUZZG1VGyrJM0o+G5k6Vvqbk O9TshOL8DWdyCywe01kkV+yQGshQIew2v4cgMdTMQ558//dOacY7Yk93FOMdofcnCUrB t4Mav3ypSYKaYWwOQf2pJKPPFvgf+pAddRYGoLRa6reREqK3+l+9GM1q233uG4fwGoMV VnDwImeONTlTk0s5IBzOmwIRY6zkw34K1ZVmXr0w2K+f9RQzeE3DTugwAPjFTwzcNRbj FKa7MTXNsPw26lZ/jEymP8hGkTjUGL0ZAyyzh/MvGhSxuBGE3oqhyjOovVhdRYbWBS4V YeVw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=tHnrPihc2LV+eODgdG+10vdiBdJFvrfnMZskyFK3NcE=; b=oZILTAn+xE7DG9m6wHLxX4WkOrseQ1eC4bIZX74NoYX50P3V+Sk9+iV7RXvWQG5sHs a/9XKVVJj6phT7ANb+agK+xSaoh7FR40cgzwxn6nAoc0qBRviIGPW0Ahb5/JFj6PeVP+ H8CwcGLA4ANdjyqdu0sf7T9yu8XSOjviKpcxWkEf+EtVu0lLwTjGaIUnHCk9yz+7GY6J rWRmMV8YcqrwCtZAXaMniCDsJpAF6DVjSVxqdU8ZtGoV1cNSMdjRZamrQFLOlj64e3n+ TbPg0jhUKSiRerrhGcOgFFKGj5erzSPfJghUurYrmnxFOuVAuiR8kNqd2sgWiQidlhx/ wfOA==
X-Gm-Message-State: AKwxytcSainC6Tk/CQxWlZjFLC0u3LLBisFvbiGv9s2MjuYjE2PuGDNk /x2g6VCQtT30YFFStgR5cvvuZqosji4KlYGNuDQ=
X-Google-Smtp-Source: ACJfBouw47YJNTPGJUyHrB5jInTQ/DcbShEh8gu4vp8tqv/IEAW5J2EonAgVv/mNCqOZzZ/X9pCoWmwJe/C9V02/A+o=
X-Received: by 10.107.205.203 with SMTP id d194mr33521481iog.42.1516041182399;  Mon, 15 Jan 2018 10:33:02 -0800 (PST)
MIME-Version: 1.0
Received: by 10.107.181.65 with HTTP; Mon, 15 Jan 2018 10:32:41 -0800 (PST)
In-Reply-To: <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com>
From: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
Date: Mon, 15 Jan 2018 19:32:41 +0100
Message-ID: <CA+YHcKHEvE=CJZUYEUm9dm53oVnj8g7JNbrMdGkEu=mcRSBCQg@mail.gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Type: text/plain; charset="UTF-8"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/Bor1he8brGjoGADrU3G62n5MQqc>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 18:33:05 -0000

On Mon, Jan 15, 2018 at 6:55 PM, Dino Farinacci <farinacci@gmail.com> wrote:
>> SMRs and RLOC-probes are control-plane features used by xTRs to be able to run the data-plane.
>
> They are data-plane features that use control-plane messages. No other devices sends an RLOC-probe (or SMR) then an xTR.

IMHO I think that the SMR should go into the control-plane document. I
believe that there are many cases (specially from an SDN point of
view) where you may want to send SMRs from entities other than xTRs.

There's already a draft [1] that proposes that SMRs can also be sent
by MSMRs. That draft is documenting what has been implemented and
running on OpenDaylight for a while now.

Furthermore, lig-lispmob [2] supports sending SMRs on demand through a
CLI without running an xTR. I've found that capability useful on many
occasions.

Alberto

[1] https://tools.ietf.org/html/draft-rodrigueznatal-lisp-ms-smr-04
[2] https://github.com/LISPmob/lig-lispmob


From nobody Mon Jan 15 11:10:40 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id C780512D959 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 11:10:39 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id CQuauRRXglJ6 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 11:10:38 -0800 (PST)
Received: from mail-pl0-x22d.google.com (mail-pl0-x22d.google.com [IPv6:2607:f8b0:400e:c01::22d]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 0632B12EB78 for <lisp@ietf.org>; Mon, 15 Jan 2018 11:10:38 -0800 (PST)
Received: by mail-pl0-x22d.google.com with SMTP id 62so4345078pld.7 for <lisp@ietf.org>; Mon, 15 Jan 2018 11:10:38 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=VyZ+pGq7LDcOE6PeRz7amPAjKu321vFMmBlpHVCwqGU=; b=mgmOAtWSRnu7dZoqVY6pV4PRY21Cv6ERrElt6TFwz4eizaN2sUiuoFdOzLzO9m6J3u CHIOmZ741KjoQFj0XX1R4xFR2CQNwHj4Xiqd3QDgnonKA8EtIDfvg1VEkBkHJa52LUuZ OKwS61kLHPeXcQYcQ+4OjA4NcDjQicB0iMHEPRESxbtIlUEHF/KQzJnKMj5LRnvPLPmf wKdjnYzIeYsMuVjoqEy/qUdTJYqLnaeBCxufgntarXBLcMYZKBAeNs+jsP0t+MRRn6M0 J/bYyMYWegmHYucDuvY0ooXNmMeo1X1DyfGU9WwCtaHl/ksLpHKdx+YkNouk06rW8HHj EnPg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=VyZ+pGq7LDcOE6PeRz7amPAjKu321vFMmBlpHVCwqGU=; b=YuixqjGYbzBcQhmaTP0b84JYtDOtRCzj6hKWyIwZJkypFEqESFq6sKSvDShcmzT4Vn /Oea7P+4+En93E5VEh2qBEcufXQgx2kLRiA8nU+S/vm1FcfQupdpKuckcAhtfnmOG4Kx X4TN/kBC6PtAVrW6zFrco11r5rTcudnCTNDQlSEcqSD8HfGrBI/nxJuV4gx9lmCeiznP tO1G8G3RAQejY7iN+xFQ1OSbMxf1m7UNPsbVXurWKUv9w0W1yRk4bmkfOGxt/SYy1ERK PvhZO9moOI0uCOj+20YBzvc0Pnybt9UA54ih0KQ78gtxHGJ/n0yOqE1chmQ6bCI+acLf +dfw==
X-Gm-Message-State: AKGB3mKv2RSSpDfvMhrhpW1Rw5ZxVFgHOpdQINKuYKd3nmcBoEOMFUtL KBmuKwcOUqzmhxIlA9VAeD0=
X-Google-Smtp-Source: ACJfBos7fBBuVevhGaMR2/HgGzySbx8xSDsuqa5gHuGKWbb5TkuKeqLckatWIkcoNgJXqia9jcdXng==
X-Received: by 10.159.242.196 with SMTP id x4mr28168719plw.408.1516043437687;  Mon, 15 Jan 2018 11:10:37 -0800 (PST)
Received: from [10.197.31.157] (173-11-119-245-SFBA.hfc.comcastbusiness.net. [173.11.119.245]) by smtp.gmail.com with ESMTPSA id 26sm404402pfq.102.2018.01.15.11.10.36 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 15 Jan 2018 11:10:36 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <CA+YHcKHEvE=CJZUYEUm9dm53oVnj8g7JNbrMdGkEu=mcRSBCQg@mail.gmail.com>
Date: Mon, 15 Jan 2018 11:10:35 -0800
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: quoted-printable
Message-Id: <E625760A-292B-439A-BAEC-49BEDDBEF688@gmail.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com> <CA+YHcKHEvE=CJZUYEUm9dm53oVnj8g7JNbrMdGkEu=mcRSBCQg@mail.gmail.com>
To: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/ZEqrepYqVB6_wfilFFv0Wc61eyI>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 19:10:40 -0000

I=E2=80=99d be willing to make a deal.

SMRs go to 6833bis and RLOC-probes stay in 6830bis. Since RLOC-probes =
are connected (semantically) to echo-noncing which use bits in the LISP =
header.

Dino

> On Jan 15, 2018, at 10:32 AM, Alberto Rodriguez-Natal =
<rodrigueznatal@gmail.com> wrote:
>=20
> On Mon, Jan 15, 2018 at 6:55 PM, Dino Farinacci <farinacci@gmail.com> =
wrote:
>>> SMRs and RLOC-probes are control-plane features used by xTRs to be =
able to run the data-plane.
>>=20
>> They are data-plane features that use control-plane messages. No =
other devices sends an RLOC-probe (or SMR) then an xTR.
>=20
> IMHO I think that the SMR should go into the control-plane document. I
> believe that there are many cases (specially from an SDN point of
> view) where you may want to send SMRs from entities other than xTRs.
>=20
> There's already a draft [1] that proposes that SMRs can also be sent
> by MSMRs. That draft is documenting what has been implemented and
> running on OpenDaylight for a while now.
>=20
> Furthermore, lig-lispmob [2] supports sending SMRs on demand through a
> CLI without running an xTR. I've found that capability useful on many
> occasions.
>=20
> Alberto
>=20
> [1] https://tools.ietf.org/html/draft-rodrigueznatal-lisp-ms-smr-04
> [2] https://github.com/LISPmob/lig-lispmob


From nobody Mon Jan 15 11:57:49 2018
Return-Path: <rrahman@cisco.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 56ED312EBB9 for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 11:57:48 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -14.53
X-Spam-Level: 
X-Spam-Status: No, score=-14.53 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_HI=-5, RCVD_IN_MSPIKE_H4=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, URIBL_BLOCKED=0.001, USER_IN_DEF_DKIM_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=cisco.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id z7rhR2aq8_PW for <lisp@ietfa.amsl.com>; Mon, 15 Jan 2018 11:57:46 -0800 (PST)
Received: from alln-iport-1.cisco.com (alln-iport-1.cisco.com [173.37.142.88]) (using TLSv1.2 with cipher DHE-RSA-SEED-SHA (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 3BC1D12EBDC for <lisp@ietf.org>; Mon, 15 Jan 2018 11:57:42 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=@cisco.com; l=2492; q=dns/txt; s=iport; t=1516046262; x=1517255862; h=from:to:cc:subject:date:message-id:references: in-reply-to:content-id:content-transfer-encoding: mime-version; bh=gJN8Mqx6ldyxZRTl67lh8f+cuzS451Jkr9QxWdQkIJo=; b=ECHv46hG4aUMHw2sT4ts15QYoi4oUFt2fe3LOBxc+RV3tcc9zVoKUEfj tBsKJV5wwggICclAQFpqJiIh7r9flr+vnwzoNrzfyAFmLp49A2FVPHAPi 8cDNzwDfUc+tg/f9lEtaFK1bkU5qx9wZmw0lj56Gz2R/Rum4sCPXCueDx k=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0BZAQCFBl1a/4oNJK1cGQEBAQEBAQEBA?= =?us-ascii?q?QEBAQcBAQEBAYNBZnQnB4QMiiSOX4FbJ4kGjiaCFgoYC4UYAhqENz8YAQEBAQE?= =?us-ascii?q?BAQEBayiFIwEBAQMBAQEhEToLEAIBCBgCAiYCAgIfBgsVEAIEAQ0FihsDDQgQq?= =?us-ascii?q?QOCJ4c4DYIEAQEBAQEBAQEBAQEBAQEBAQEBAQEBGAWBD4VCgVeBaSkMgnmCa0Q?= =?us-ascii?q?BAQIBggWDADGCNAWjJz0CiAqIPYUClBCNPkCIegIRGQGBOwEfOYFQbxU9KgGBf?= =?us-ascii?q?4RXeIt1AYEWAQEB?=
X-IronPort-AV: E=Sophos;i="5.46,365,1511827200"; d="scan'208";a="56964168"
Received: from alln-core-5.cisco.com ([173.36.13.138]) by alln-iport-1.cisco.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 15 Jan 2018 19:57:41 +0000
Received: from XCH-ALN-002.cisco.com (xch-aln-002.cisco.com [173.36.7.12]) by alln-core-5.cisco.com (8.14.5/8.14.5) with ESMTP id w0FJvfoG008990 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=FAIL); Mon, 15 Jan 2018 19:57:41 GMT
Received: from xch-rcd-005.cisco.com (173.37.102.15) by XCH-ALN-002.cisco.com (173.36.7.12) with Microsoft SMTP Server (TLS) id 15.0.1320.4; Mon, 15 Jan 2018 13:57:40 -0600
Received: from xch-rcd-005.cisco.com ([173.37.102.15]) by XCH-RCD-005.cisco.com ([173.37.102.15]) with mapi id 15.00.1320.000; Mon, 15 Jan 2018 13:57:40 -0600
From: "Reshad Rahman (rrahman)" <rrahman@cisco.com>
To: Dino Farinacci <farinacci@gmail.com>, Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
CC: "lisp@ietf.org list" <lisp@ietf.org>
Thread-Topic: [lisp] 6830bis Review
Thread-Index: AQHTdYn4waOx1EJhKUiOK6AT86ziIKNW4xgAgBToqRuAAJOugIABDoqAgAB73wCAAV6gAIAAOj8AgAEgNQCAAG7tgIAENQ0AgACGtQCAAApagIAACpaAgAANLQA=
Date: Mon, 15 Jan 2018 19:57:40 +0000
Message-ID: <C34FFF1A-2994-4DE9-A24C-F65219E495B7@cisco.com>
References: <907CD955-B043-4728-ABD6-5AD96192EC5F@inria.fr> <4EAD1E98-E8E7-4A0A-8300-2D185B9109CC@gigix.net> <CAGE_QexqW=q51kXR9fo_8YDu6VVUHCBz-XrGt5iZ6FOTRxDLiA@mail.gmail.com> <49EE7D2D-FC59-42F1-A93A-B315D4D6420E@gigix.net> <98C25E20-BD78-462A-BDB4-572AA24C1A97@gigix.net> <829870A2-2D90-4967-983A-56F62E765796@gmail.com> <5754BC06-9CBD-4C52-9CD6-402610EAABF1@gigix.net> <DA85FB85-45B8-4BF8-B5BC-F544E11AB90A@gmail.com> <CA+YHcKHxEJjFqm4z-PCo4LN_gv7v=mqQ7R47qPepLHJQ+kp=7w@mail.gmail.com> <F1137329-DA1F-4E50-9B94-386AC0B2B62B@gmail.com> <0F4F11DF-07B6-407D-BE5F-BBF1777D1CF2@gigix.net> <232ACD23-F1E0-49B0-983F-D17F773A99CA@gmail.com> <2241290D-29C3-4ACB-9726-ACC6DD42E8CE@gigix.net> <29E4D891-E429-4A71-BFC3-276F730EA5C6@gmail.com> <CA+YHcKHEvE=CJZUYEUm9dm53oVnj8g7JNbrMdGkEu=mcRSBCQg@mail.gmail.com> <E625760A-292B-439A-BAEC-49BEDDBEF688@gmail.com>
In-Reply-To: <E625760A-292B-439A-BAEC-49BEDDBEF688@gmail.com>
Accept-Language: en-US
Content-Language: en-US
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
user-agent: Microsoft-MacOutlook/f.27.0.171010
x-ms-exchange-messagesentrepresentingtype: 1
x-ms-exchange-transport-fromentityheader: Hosted
x-originating-ip: [161.44.212.114]
Content-Type: text/plain; charset="utf-8"
Content-ID: <B2894505C8EC2D4EBF212EE8D0D7D26D@emea.cisco.com>
Content-Transfer-Encoding: base64
MIME-Version: 1.0
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/8Qhj30_CSUdarw5LxyDreiBHxt4>
Subject: Re: [lisp] 6830bis Review
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 15 Jan 2018 19:57:48 -0000

SSBhbHNvIGJlbGlldmUgU01ScyBzaG91bGQgYmUgaW4gdGhlIENQIGRvYy4gSSB3b3VsZCBzdXBw
b3J0IERpbm/igJlzICBwcm9wb3NhbCBiZWxvdy4NCg0KUmVnYXJkcywNClJlc2hhZC4NCg0KT24g
MjAxOC0wMS0xNSwgMjoxMCBQTSwgImxpc3Agb24gYmVoYWxmIG9mIERpbm8gRmFyaW5hY2NpIiA8
bGlzcC1ib3VuY2VzQGlldGYub3JnIG9uIGJlaGFsZiBvZiBmYXJpbmFjY2lAZ21haWwuY29tPiB3
cm90ZToNCg0KICAgIEnigJlkIGJlIHdpbGxpbmcgdG8gbWFrZSBhIGRlYWwuDQogICAgDQogICAg
U01ScyBnbyB0byA2ODMzYmlzIGFuZCBSTE9DLXByb2JlcyBzdGF5IGluIDY4MzBiaXMuIFNpbmNl
IFJMT0MtcHJvYmVzIGFyZSBjb25uZWN0ZWQgKHNlbWFudGljYWxseSkgdG8gZWNoby1ub25jaW5n
IHdoaWNoIHVzZSBiaXRzIGluIHRoZSBMSVNQIGhlYWRlci4NCiAgICANCiAgICBEaW5vDQogICAg
DQogICAgPiBPbiBKYW4gMTUsIDIwMTgsIGF0IDEwOjMyIEFNLCBBbGJlcnRvIFJvZHJpZ3Vlei1O
YXRhbCA8cm9kcmlndWV6bmF0YWxAZ21haWwuY29tPiB3cm90ZToNCiAgICA+IA0KICAgID4gT24g
TW9uLCBKYW4gMTUsIDIwMTggYXQgNjo1NSBQTSwgRGlubyBGYXJpbmFjY2kgPGZhcmluYWNjaUBn
bWFpbC5jb20+IHdyb3RlOg0KICAgID4+PiBTTVJzIGFuZCBSTE9DLXByb2JlcyBhcmUgY29udHJv
bC1wbGFuZSBmZWF0dXJlcyB1c2VkIGJ5IHhUUnMgdG8gYmUgYWJsZSB0byBydW4gdGhlIGRhdGEt
cGxhbmUuDQogICAgPj4gDQogICAgPj4gVGhleSBhcmUgZGF0YS1wbGFuZSBmZWF0dXJlcyB0aGF0
IHVzZSBjb250cm9sLXBsYW5lIG1lc3NhZ2VzLiBObyBvdGhlciBkZXZpY2VzIHNlbmRzIGFuIFJM
T0MtcHJvYmUgKG9yIFNNUikgdGhlbiBhbiB4VFIuDQogICAgPiANCiAgICA+IElNSE8gSSB0aGlu
ayB0aGF0IHRoZSBTTVIgc2hvdWxkIGdvIGludG8gdGhlIGNvbnRyb2wtcGxhbmUgZG9jdW1lbnQu
IEkNCiAgICA+IGJlbGlldmUgdGhhdCB0aGVyZSBhcmUgbWFueSBjYXNlcyAoc3BlY2lhbGx5IGZy
b20gYW4gU0ROIHBvaW50IG9mDQogICAgPiB2aWV3KSB3aGVyZSB5b3UgbWF5IHdhbnQgdG8gc2Vu
ZCBTTVJzIGZyb20gZW50aXRpZXMgb3RoZXIgdGhhbiB4VFJzLg0KICAgID4gDQogICAgPiBUaGVy
ZSdzIGFscmVhZHkgYSBkcmFmdCBbMV0gdGhhdCBwcm9wb3NlcyB0aGF0IFNNUnMgY2FuIGFsc28g
YmUgc2VudA0KICAgID4gYnkgTVNNUnMuIFRoYXQgZHJhZnQgaXMgZG9jdW1lbnRpbmcgd2hhdCBo
YXMgYmVlbiBpbXBsZW1lbnRlZCBhbmQNCiAgICA+IHJ1bm5pbmcgb24gT3BlbkRheWxpZ2h0IGZv
ciBhIHdoaWxlIG5vdy4NCiAgICA+IA0KICAgID4gRnVydGhlcm1vcmUsIGxpZy1saXNwbW9iIFsy
XSBzdXBwb3J0cyBzZW5kaW5nIFNNUnMgb24gZGVtYW5kIHRocm91Z2ggYQ0KICAgID4gQ0xJIHdp
dGhvdXQgcnVubmluZyBhbiB4VFIuIEkndmUgZm91bmQgdGhhdCBjYXBhYmlsaXR5IHVzZWZ1bCBv
biBtYW55DQogICAgPiBvY2Nhc2lvbnMuDQogICAgPiANCiAgICA+IEFsYmVydG8NCiAgICA+IA0K
ICAgID4gWzFdIGh0dHBzOi8vdG9vbHMuaWV0Zi5vcmcvaHRtbC9kcmFmdC1yb2RyaWd1ZXpuYXRh
bC1saXNwLW1zLXNtci0wNA0KICAgID4gWzJdIGh0dHBzOi8vZ2l0aHViLmNvbS9MSVNQbW9iL2xp
Zy1saXNwbW9iDQogICAgDQogICAgX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f
X19fX19fX19fX18NCiAgICBsaXNwIG1haWxpbmcgbGlzdA0KICAgIGxpc3BAaWV0Zi5vcmcNCiAg
ICBodHRwczovL3d3dy5pZXRmLm9yZy9tYWlsbWFuL2xpc3RpbmZvL2xpc3ANCiAgICANCg0K


From nobody Tue Jan 16 13:25:42 2018
Return-Path: <rodrigueznatal@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 87AD012EB31 for <lisp@ietfa.amsl.com>; Tue, 16 Jan 2018 13:25:40 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.7
X-Spam-Level: 
X-Spam-Status: No, score=-2.7 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id Pmdf0rwCK8MA for <lisp@ietfa.amsl.com>; Tue, 16 Jan 2018 13:25:38 -0800 (PST)
Received: from mail-it0-x22d.google.com (mail-it0-x22d.google.com [IPv6:2607:f8b0:4001:c0b::22d]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id BB15012E3AE for <lisp@ietf.org>; Tue, 16 Jan 2018 13:25:38 -0800 (PST)
Received: by mail-it0-x22d.google.com with SMTP id x42so6602068ita.4 for <lisp@ietf.org>; Tue, 16 Jan 2018 13:25:38 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc:content-transfer-encoding; bh=OefOSJllpQkr3G+rurxjHo9g1PXmA8fMxSQtEQdwhzw=; b=ursrI54iZ7QzUI43RN8IXCt7VQ677LzMiuJfeCYfOSXPlrKcsp0vhAdF1yc2BzcSaU UMYeBLQMGzkrXA0IjhpSRfiYOlNeW9bpMiV2b3e0VtQ/Z+Bz+SjtHThm77OjFJvYeXUH 9uiYnDzDAQMXS+jZJpYeel3WiczbzbjlyNm1wffkj/sMyzxVW2WpgbfvNVcPqVSBu2BW 8qttsCJa421FRlzsYSgc7kRccH1QOe3+DLA/7PlfFIqAHS5P7lIkd3NdSP1nn+JbyGS6 8hW2F+HMmuc8nm4rI29YtjyviR6gnVdz+2fZmQbdWawRYd+SyiNCOrni2IL4h3j6WfNY eyeA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc:content-transfer-encoding; bh=OefOSJllpQkr3G+rurxjHo9g1PXmA8fMxSQtEQdwhzw=; b=rg0rw3URlJQhB38icnre/PoWx57PaokJjNzzwawq+B0kc9p1HH5vec2/56x31i74Fg jS99rWGQYJVoWxwA9iRhlnszZ2Orjqjob0xSIhIrJOBC9gidk5cTl7As/MebFs4x/wRR 4P+2sLfKvBxIXTVKLWmbvgzLLH0VaFioml+sxnArnBBsWEd9x01MTznwrmIK4UZx1Em3 czCQo4FMcGepCwximiwiKS7somDpWeGTyoJyht8TitoatDQxyTJUrg6vKUm8Jn8qRFqr 76kUBV4M9R+i1cWjTc85VsRumPaEZ614QISYrLRy6QJT1zQkPitPs4qrTdOR/Kh92Qz8 bF9A==
X-Gm-Message-State: AKwxytejd0X0eKrvpucR/t2VchfoiJ1gdKT++xwys8t8UO3iTqlLuP8f 9pi35wQ1mEGlAuWF8mhYGcBCac6JG1mBAeiaGSU=
X-Google-Smtp-Source: ACJfBovSD3KzdWLg76ThhJYh6CUThhSq6w6rtW/JEgdSZkCao/xJJKMgOtGqnC6G7+Kr3KvOyVF1WcQQVDJY7x4RX18=
X-Received: by 10.36.243.7 with SMTP id t7mr19691374ith.139.1516137937931; Tue, 16 Jan 2018 13:25:37 -0800 (PST)
MIME-Version: 1.0
Received: by 10.107.181.65 with HTTP; Tue, 16 Jan 2018 13:25:17 -0800 (PST)
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
From: Alberto Rodriguez-Natal <rodrigueznatal@gmail.com>
Date: Tue, 16 Jan 2018 22:25:17 +0100
Message-ID: <CA+YHcKGO0BuMNPCcRdd3r9pmbR228Hu69RBzbO59LY=pKzmQ5Q@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/jpsyHQmlKdG8ebiUlnWMEWJqP5E>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 16 Jan 2018 21:25:40 -0000

Thanks for the summary Albert. I can confirm a few points but I prefer
to abstain on those I don't have a strong opinion. Answers and
comments inline.

Thanks,
Alberto

On Fri, Jan 12, 2018 at 5:20 PM, Albert Cabellos
<albert.cabellos@gmail.com> wrote:

> A.- Remove definitions of PA and PI

Confirm.

I'm fine with LISP not being so focused on the original Internet use-case.

> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the over=
lay=E2=80=99 and
> =E2=80=98identifier of the underlay=E2=80=99 respectively.

Abstain.

I'd prefer to avoid using "identifier" in anything regarding the
underlay but I could be fine with the proposed text.

> C.- In section 5.3, change the description of the encap/decap operation
> concerning how to deal with ECN and DSCP bits to (new text needs to be
> validated by experts):

Confirm.

The new text looks good to me.

> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stating t=
hat the data-plane
> MUST follow what=C2=B4s stored in the map-cache (priorities and weights),=
 the
> remaining text should go to an OAM document.

Abstain.

I see the value of an independent OAM document but I don't see it as a
requirement to advance 6830bis.

> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D consid=
ering the following
> changes:
>
> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) and
> Echo-Nonce
> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3 (hi=
nts
> from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a response)
> and RLOC probing

Abstain.

I'd personally prefer to move those mechanisms that rely on
control-plane messages (i.e. 5 - receive a MapReply) to the
control-plane document but I'd not oppose to keep them on the
data-plane doc.

> F.- Move Solicit-Map-Request to 6833bis

Confirm.

This is one of the major results I hope to see out of this discussion.

> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
> Considerations), 18 (Traceroute Consideration) to a new OAM document

Abstain.

Same comment as above regarding a separate OAM document.


From nobody Thu Jan 18 13:56:56 2018
Return-Path: <fmaino@cisco.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 66AF012946D for <lisp@ietfa.amsl.com>; Thu, 18 Jan 2018 13:56:53 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -14.53
X-Spam-Level: 
X-Spam-Status: No, score=-14.53 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_HI=-5, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, USER_IN_DEF_DKIM_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=cisco.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 2JcC6cWwA5dt for <lisp@ietfa.amsl.com>; Thu, 18 Jan 2018 13:56:50 -0800 (PST)
Received: from alln-iport-5.cisco.com (alln-iport-5.cisco.com [173.37.142.92]) (using TLSv1.2 with cipher DHE-RSA-SEED-SHA (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id D44EB126C83 for <lisp@ietf.org>; Thu, 18 Jan 2018 13:56:24 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=@cisco.com; l=16321; q=dns/txt; s=iport; t=1516312584; x=1517522184; h=subject:to:references:from:message-id:date:mime-version: in-reply-to; bh=Pu4v3BvbCHaFfMI2vKIaZrR4NwmDb7WThNaAvHdyAXc=; b=BpfebiW9c3YwgGBC06Khdp7c7DFdW/OlzzeTSMqSJ/NHgMxJNmj7eBjE DzNwQYJYmq27XvrBqRfdtbZmKILDRFVdKODQwObsvET/uLLu1tYF9Xbjj LCwFatlDh3WYwij0vroXAb24P/NijaMb00NlMK2Smadf/O9EUY/WP/4tT g=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0CGAgBDF2Fa/4kNJK1eGQEBAQEBAQEBA?= =?us-ascii?q?QEBAQcBAQEBAYNBZnQng12ZBIICkV+FUoIWChgBCoUYAoReQBcBAQEBAQEBAQF?= =?us-ascii?q?rKIUjAQEBAwEBASFIAxALCxgqAgInMBMGAgEBiicIEKpVgicmiSMBAQEBAQUBA?= =?us-ascii?q?QEBAQEBHAWGUYFXgWgpgwWDLwEBAoFJgz2CZQWTQ4Y4iXSMC4lLghmGHoNvh2+?= =?us-ascii?q?CB5UzgTwgATeBUDIaCBsVPYIqglQcggggN4owASUHgh0BAQE?=
X-IronPort-AV: E=Sophos; i="5.46,378,1511827200"; d="scan'208,217"; a="57978838"
Received: from alln-core-4.cisco.com ([173.36.13.137]) by alln-iport-5.cisco.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 18 Jan 2018 21:56:23 +0000
Received: from [10.157.21.133] ([10.157.21.133]) by alln-core-4.cisco.com (8.14.5/8.14.5) with ESMTP id w0ILuN3A013843 for <lisp@ietf.org>; Thu, 18 Jan 2018 21:56:23 GMT
To: lisp@ietf.org
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
From: Fabio Maino <fmaino@cisco.com>
Message-ID: <320d9eff-67ec-cf2d-b485-4e54a722bc45@cisco.com>
Date: Thu, 18 Jan 2018 13:56:24 -0800
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
Content-Type: multipart/alternative; boundary="------------131D96C858A6B205B0389EF5"
Content-Language: en-US
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/-6rv6kNygPxeZBSfPnuTjrRbiro>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 18 Jan 2018 21:56:55 -0000

This is a multi-part message in MIME format.
--------------131D96C858A6B205B0389EF5
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit

On 1/12/18 8:20 AM, Albert Cabellos wrote:
> Hi all
>
> As editor of 6830bis I´d like to confirm or deny the following changes 
> which I believe have support.
>
> Please note that I have intentionally ignored minor/editorial changes 
> to help sync all the participants. I hope that the list below captures 
> the most relevant ones.
>
> Also note that I don´t necessarily agree with all the changes listed 
> below, but that´s an opinion with a different hat.
>
> WG: Please CONFIRM or DENY:
>
> -------
>
> A.- Remove definitions of PA and PI
confirm.

I think one of the goals of the charter was to to open up to a broad set 
of use cases where that terminology might not be meaningful.

>
> B.- Change definitions of EID and RLOC as ‘identifier of the overlay’ 
> and ‘identifier of the underlay’ respectively.

personally, I'm not keen to this change of terminology.

EID and RLOC have become of common use, and well understood, even 
outside of the LISP circles. I've often assisted to conversations in 
non-LISP groups where people use the term LISP EID/RLOC to qualify IP 
addresses in the overlay/underlay.


>
> C.- In section 5.3, change the description of the encap/decap 
> operation concerning how to deal with ECN and DSCP bits to (new text 
> needs to be validated by experts):
>
>     When doing ITR/PITR encapsulation:
>
>     o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in
>     the case of IPv6) SHOULD be copied from the inner-header 'Time to
>     Live' field.
>
>     o  The outer-header 'Differentiated Services Code Point' (DSCP)
>     field (or the 'Traffic Class' field, in the case of IPv6) SHOULD
>     be copied from the inner-header DSCP field ('Traffic Class' field,
>     in the case of IPv6) considering the exception listed below.
>
>     o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and
>     7 of the IPv6 'Traffic Class' field) requires special treatment in
>     order to avoid discarding indications of congestion [RFC3168]. ITR
>     encapsulation MUST copy the 2-bit 'ECN' field from the inner
>     header to the outer header. Re-encapsulation MUST copy the 2-bit
>     'ECN' field from the stripped outer header to the new outer header.
>
>     When doing ETR/PETR decapsulation:
>
>      o  The inner-header 'Time to Live' field (or 'Hop Limit' field,
>     in the case of IPv6) SHOULD be copied from the outer-header 'Time
>     to Live' field, when the Time to Live value of the outer header is
>     less than the Time to Live value of the inner header.  Failing to
>     perform this check can cause the Time to Live of the inner header
>     to increment across encapsulation/decapsulation cycles.  This
>     check is also performed when doing initial encapsulation, when a
>     packet comes to an ITR or PITR destined for a LISP site.
>
>     o  The inner-header 'Differentiated Services Code Point' (DSCP)
>     field (or the 'Traffic Class' field, in the case of IPv6) SHOULD
>     be copied from the outer-header DSCP field ('Traffic Class' field,
>     in the case of IPv6) considering the exception listed below.
>
>     o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and
>     7 of the IPv6 'Traffic Class' field) requires special treatment in
>     order to avoid discarding indications of congestion [RFC3168]. If
>     the 'ECN' field contains a congestion indication codepoint (the
>     value is '11', the Congestion Experienced (CE) codepoint), then
>     ETR decapsulation MUST copy the 2-bit 'ECN' field from the
>     stripped outer header to the surviving inner header that is used
>     to forward the packet beyond the ETR.  These requirements preserve
>     CE indications when a packet that uses ECN traverses a LISP tunnel
>     and becomes marked with a CE indication due to congestion between
>     the tunnel endpoints.
>
>     Note that if an ETR/PETR is also an ITR/PITR and chooses to
>     re-encapsulate after decapsulating, the net effect of this is that
>     the new outer header will carry the same Time to Live as the old
>     outer header minus 1.
>
>     Copying the Time to Live (TTL) serves two purposes: first, it
>     preserves the distance the host intended the packet to travel;
>     second, and more importantly, it provides for suppression of
>     looping packets in the event there is a loop of concatenated
>     tunnels due to misconfiguration.  See Section 18.3 for TTL
>     exception handling for traceroute packets.
>
>
Confirm.


> D.- Simplify section ‘Router Locator Selection’ stating that the 
> data-plane MUST follow what´s stored in the map-cache (priorities and 
> weights), the remaining text should go to an OAM document.
Confirm on the section semplification.

Wrt putting the rest in a separate OAM document, I don't have a strong 
opinion. Probably not having a new document requires less work to be 
done that makes me lean toward NOT having a new OAM document.

>
> E.- Rewrite Section “Routing Locator Reachability” considering the 
> following changes:
>
>     *    Keep bullet point 1 (examine LSB), 6 (receiving a
>     data-packet) and Echo-Nonce
>     *    Move to 6833bis bullet point 2 (ICMP Network/Host
>     Unreachable),3 (hints from BGP),4 (ICMP Port Unreachable),5
>     (receive a Map-Reply as a response) and RLOC probing
>
>

Confirm.

>
> F.- Move Solicit-Map-Request to 6833bis

Confirm.
>
> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement 
> Considerations), 18 (Traceroute Consideration) to a new OAM document
>

I'm fine with both options. Probably not having a new document requires 
less work to be done that makes me lean toward NOT having a new OAM 
document.


Thanks,
Fabio

>
>
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp



--------------131D96C858A6B205B0389EF5
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: 8bit

<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    <div class="moz-cite-prefix">On 1/12/18 8:20 AM, Albert Cabellos
      wrote:<br>
    </div>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
      <div dir="ltr">Hi all<br>
        <br>
        As editor of 6830bis I´d like to confirm or deny the following
        changes which I believe have support. <br>
        <br>
        Please note that I have intentionally ignored minor/editorial
        changes to help sync all the participants. I hope that the list
        below captures the most relevant ones.
        <div><br>
        </div>
        <div>Also note that I don´t necessarily agree with all the
          changes listed below, but that´s an opinion with a different
          hat.<br>
          <br>
          WG: Please CONFIRM or DENY:
          <div><br>
          </div>
          <div>-------<br>
            <br>
            A.- Remove definitions of PA and PI<br>
          </div>
        </div>
      </div>
    </blockquote>
    confirm. <br>
    <br>
    I think one of the goals of the charter was to to open up to a broad
    set of use cases where that terminology might not be meaningful. <br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div><br>
            B.- Change definitions of EID and RLOC as ‘identifier of the
            overlay’ and ‘identifier of the underlay’ respectively. <br>
          </div>
        </div>
      </div>
    </blockquote>
    <br>
    personally, I'm not keen to this change of terminology. <br>
    <br>
    EID and RLOC have become of common use, and well understood, even
    outside of the LISP circles. I've often assisted to conversations in
    non-LISP groups where people use the term LISP EID/RLOC to qualify
    IP addresses in the overlay/underlay. <br>
    <br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div><br>
            C.- In section 5.3, change the description of the
            encap/decap operation concerning how to deal with ECN and
            DSCP bits to (new text needs to be validated by experts):<br>
            <br>
            <blockquote style="margin:0 0 0
              40px;border:none;padding:0px">When doing ITR/PITR
              encapsulation:<br>
              <br>
              o  The outer-header 'Time to Live' field (or 'Hop Limit'
              field, in the case of IPv6) SHOULD be copied from the
              inner-header 'Time to Live' field.<br>
              <br>
              o  The outer-header 'Differentiated Services Code Point'
              (DSCP) field (or the 'Traffic Class' field, in the case of
              IPv6) SHOULD be copied from the inner-header DSCP field
              ('Traffic Class' field, in the case of IPv6) considering
              the exception listed below.<br>
              <br>
              o  The 'Explicit Congestion Notification' (ECN) field
              (bits 6 and 7 of the IPv6 'Traffic Class' field) requires
              special treatment in order to avoid discarding indications
              of congestion [RFC3168]. ITR encapsulation MUST copy the
              2-bit 'ECN' field from the inner header to the outer
              header. Re-encapsulation MUST copy the 2-bit 'ECN' field
              from the stripped outer header to the new outer header.<br>
              <br>
              When doing ETR/PETR decapsulation:<br>
              <br>
               o  The inner-header 'Time to Live' field (or 'Hop Limit'
              field, in the case of IPv6) SHOULD be copied from the
              outer-header 'Time to Live' field, when the Time to Live
              value of the outer header is less than the Time to Live
              value of the inner header.  Failing to perform this check
              can cause the Time to Live of the inner header to
              increment across encapsulation/decapsulation cycles.  This
              check is also performed when doing initial encapsulation,
              when a packet comes to an ITR or PITR destined for a LISP
              site.<br>
              <br>
              o  The inner-header 'Differentiated Services Code Point'
              (DSCP) field (or the 'Traffic Class' field, in the case of
              IPv6) SHOULD be copied from the outer-header DSCP field
              ('Traffic Class' field, in the case of IPv6) considering
              the exception listed below.<br>
              <br>
              o  The 'Explicit Congestion Notification' (ECN) field
              (bits 6 and 7 of the IPv6 'Traffic Class' field) requires
              special treatment in order to avoid discarding indications
              of congestion [RFC3168]. If the 'ECN' field contains a
              congestion indication codepoint (the value is '11', the
              Congestion Experienced (CE) codepoint), then ETR
              decapsulation MUST copy the 2-bit 'ECN' field from the
              stripped outer header to the surviving inner header that
              is used to forward the packet beyond the ETR.  These
              requirements preserve CE indications when a packet that
              uses ECN traverses a LISP tunnel and becomes marked with a
              CE indication due to congestion between the tunnel
              endpoints.<br>
              <br>
              Note that if an ETR/PETR is also an ITR/PITR and chooses
              to re-encapsulate after decapsulating, the net effect of
              this is that the new outer header will carry the same Time
              to Live as the old outer header minus 1.<br>
              <br>
              Copying the Time to Live (TTL) serves two purposes: first,
              it preserves the distance the host intended the packet to
              travel; second, and more importantly, it provides for
              suppression of looping packets in the event there is a
              loop of concatenated tunnels due to misconfiguration.  See
              Section 18.3 for TTL exception handling for traceroute
              packets.</blockquote>
            <br>
          </div>
        </div>
      </div>
    </blockquote>
    Confirm. <br>
    <br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div>D.- Simplify section ‘Router Locator Selection’ stating
            that the data-plane MUST follow what´s stored in the
            map-cache (priorities and weights), the remaining text
            should go to an OAM document.<br>
          </div>
        </div>
      </div>
    </blockquote>
    Confirm on the section semplification. <br>
    <br>
    Wrt putting the rest in a separate OAM document, I don't have a
    strong opinion. Probably not having a new document requires less
    work to be done that makes me lean toward NOT having a new OAM
    document. <br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div><br>
            E.- Rewrite Section “Routing Locator Reachability”
            considering the following changes:<br>
            <br>
            <blockquote style="margin:0 0 0
              40px;border:none;padding:0px">*    Keep bullet point 1
              (examine LSB), 6 (receiving a data-packet) and Echo-Nonce<br>
              *    Move to 6833bis bullet point 2 (ICMP Network/Host
              Unreachable),3 (hints from BGP),4 (ICMP Port
              Unreachable),5 (receive a Map-Reply as a response) and
              RLOC probing</blockquote>
            <br>
          </div>
        </div>
      </div>
    </blockquote>
    <br>
    Confirm. <br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div><br>
            F.- Move Solicit-Map-Request to 6833bis<br>
          </div>
        </div>
      </div>
    </blockquote>
    <br>
    Confirm.<br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com">
      <div dir="ltr">
        <div>
          <div><br>
            G.- Move sections 16 (Mobility Considerations), 17 (xTR
            Placement Considerations), 18 (Traceroute Consideration) to
            a new OAM document<br>
            <br>
             </div>
        </div>
      </div>
    </blockquote>
    <br>
    I'm fine with both options. Probably not having a new document
    requires less work to be done that makes me lean toward NOT having a
    new OAM document. <br>
    <br>
    <br>
    Thanks,<br>
    Fabio<br>
    <br>
    <blockquote type="cite"
cite="mid:CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com"><br>
      <fieldset class="mimeAttachmentHeader"></fieldset>
      <br>
      <pre wrap="">_______________________________________________
lisp mailing list
<a class="moz-txt-link-abbreviated" href="mailto:lisp@ietf.org">lisp@ietf.org</a>
<a class="moz-txt-link-freetext" href="https://www.ietf.org/mailman/listinfo/lisp">https://www.ietf.org/mailman/listinfo/lisp</a>
</pre>
    </blockquote>
    <p><br>
    </p>
  </body>
</html>

--------------131D96C858A6B205B0389EF5--


From nobody Mon Jan 22 02:20:00 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 36BD11270AE for <lisp@ietfa.amsl.com>; Mon, 22 Jan 2018 02:19:59 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 7TziQ3jefAG3 for <lisp@ietfa.amsl.com>; Mon, 22 Jan 2018 02:19:57 -0800 (PST)
Received: from mail-wm0-x229.google.com (mail-wm0-x229.google.com [IPv6:2a00:1450:400c:c09::229]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 9DEF71243F6 for <lisp@ietf.org>; Mon, 22 Jan 2018 02:19:56 -0800 (PST)
Received: by mail-wm0-x229.google.com with SMTP id r78so15716905wme.0 for <lisp@ietf.org>; Mon, 22 Jan 2018 02:19:56 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=uX05bVNRPB6emAQOU8KkrmppWI2MpwTYb66g/y1x/uw=; b=U9VdBUtcFZs+vc3jsPE9p5MoiM5jFH9r6P0OnLP9Lw05sFlQ6VtdCZygs58/Rq6XBM UY/P5SZLCy5G+8iaMorX8iUJ34jzY/zMRqAIIjOCeX/joK/fe++KM/h6xrnBylQNyLe8 aYhfc2CpJBf2TykN+xnEG4XVCf5F6sIGao894Dx4awQOSlXAJp4LP6Dr8i4ImRdgIJW7 SjPmgedYe7PHYUR0rL1d2FsFz0oWjBJSy2N5tgCkN+wG5pdkGPdstTTLdyoRUEw79UI1 Hlw4wDjubA3mIZXGkhrNm0mcHfNNln+PRy5LrkD3qUFIh7ZXDgBLvSFcc1ZLKIcf4AZ5 d1dQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=uX05bVNRPB6emAQOU8KkrmppWI2MpwTYb66g/y1x/uw=; b=P7V+PnhOZ/gBk5CP5Ac5zl6yvLpK/Tic5B96Xq+jQZr/sKDufRrHAQfpyb1GTlcYr0 uVqDMI36Jg9qHhHHHetNSUD4r2UyuQqkrNqhyDYVOIMv3Fl9CDKVktjcNh4qzMKfyiAh HSIDO2evELxhCcyqt3kp/aUVliTmSiEJ+iJheIPPYvYuElKwGcAmLj/NldQ/LTtc2cGj a5MP0RzUSp2DpYnfQukPdRU3g91iPm1QQi0SpL6ni/qW1B1UAl2a3vQij/EiYr9Dxwu6 qNj4nP3Re/InsY1LOem/rcjZM94FFh5eGjp8HzkYw+teOMNsfpM+OvaxnhQgVwJyBI1n KA5w==
X-Gm-Message-State: AKwxytePc5XXBgiQbTfE6eIM6wOWXmu71kHAM0vwEGirRpGmVETQL9bR w4wschRdQBH3lZwq1w7KVTuL0R5QhXg=
X-Google-Smtp-Source: AH8x225QhneX39Sanqtwl3Dq+7gSsGfHI7TnKrdtV/CLeKY6Lr2wsk/VbH/27ozZ+O30oyuh9vTTYw==
X-Received: by 10.28.207.131 with SMTP id f125mr4316786wmg.32.1516616394577; Mon, 22 Jan 2018 02:19:54 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:c02:a843:8d38:b067? ([2001:660:330f:a4:c02:a843:8d38:b067]) by smtp.gmail.com with ESMTPSA id p32sm19211281wrc.9.2018.01.22.02.19.52 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 22 Jan 2018 02:19:53 -0800 (PST)
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <3fde0530-6c0d-6ad2-6739-fddc71bcb024@joelhalpern.com>
Date: Mon, 22 Jan 2018 11:20:12 +0100
Cc: lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <04F86451-44DE-448A-9684-113FC3877A61@gigix.net>
References: <151335440470.30447.859080782552191016@ietfa.amsl.com> <3fde0530-6c0d-6ad2-6739-fddc71bcb024@joelhalpern.com>
To: "lisp@ietf.org list" <lisp@ietf.org>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/NK-8KMppGXJxB92mpB8HRSpuACQ>
Subject: Re: [lisp] Adoption call: draft-lewis-lisp-gpe-04.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 22 Jan 2018 10:19:59 -0000

Hi All,

the call for adoption for this document is now closed.

On the mailing list there was quite a number of messages in support of =
the document, clearly showing a consensus for adoption.

Authors are invited to submit a new version of the document named: =
draft-ietf-lisp-gpe-00.txt

Thanks to all people that expressed their opinion.

Ciao

Luigi & Joel

> On 15 Dec 2017, at 17:23, Joel Halpern <jmh@joelhalpern.com> wrote:
>=20
> The authors of the lisp-gpe draft (below) have requested working group =
adoption for this document.
>=20
> This email starts a two week last call for working group adoption of =
this document.
>=20
> Please respond, positively or negatively.  Silence does NOT mean =
consent.  Please include explanation / motivation / reasoning for your =
view.
>=20
> Also remember that this is not a last call.  Once the document is =
adopted (assuming it is), we as a working group can make changes as =
needed.  The primary quesitonin this call is whether this is a good =
basis for work we want to do.
>=20
> Thank you,
> Joel (& Luigi)
>=20
>=20
> -------- Forwarded Message --------
> Subject: I-D Action: draft-lewis-lisp-gpe-04.txt
> Date: Fri, 15 Dec 2017 08:13:24 -0800
> From: internet-drafts@ietf.org
> Reply-To: internet-drafts@ietf.org
> To: i-d-announce@ietf.org
>=20
>=20
> A New Internet-Draft is available from the on-line Internet-Drafts =
directories.
>=20
>=20
>        Title           : LISP Generic Protocol Extension
>        Authors         : Darrel Lewis
>                          John Lemon
>                          Puneet Agarwal
>                          Larry Kreeger
>                          Paul Quinn
>                          Michael Smith
>                          Navindra Yadav
>                          Fabio Maino
> 	Filename        : draft-lewis-lisp-gpe-04.txt
> 	Pages           : 8
> 	Date            : 2017-12-15
>=20
> Abstract:
>   This draft describes extending the Locator/ID Separation Protocol
>   (LISP), via changes to the LISP header, to support multi-protocol
>   encapsulation.
>=20
>=20
> The IETF datatracker status page for this draft is:
> https://datatracker.ietf.org/doc/draft-lewis-lisp-gpe/
>=20
> There are also htmlized versions available at:
> https://tools.ietf.org/html/draft-lewis-lisp-gpe-04
> https://datatracker.ietf.org/doc/html/draft-lewis-lisp-gpe-04
>=20
> A diff from the previous version is available at:
> https://www.ietf.org/rfcdiff?url2=3Ddraft-lewis-lisp-gpe-04
>=20
>=20
> Please note that it may take a couple of minutes from the time of =
submission
> until the htmlized version and diff are available at tools.ietf.org.
>=20
> Internet-Drafts are also available by anonymous FTP at:
> ftp://ftp.ietf.org/internet-drafts/
>=20
> _______________________________________________
> I-D-Announce mailing list
> I-D-Announce@ietf.org
> https://www.ietf.org/mailman/listinfo/i-d-announce
> Internet-Draft directories: http://www.ietf.org/shadow.html
> or ftp://ftp.ietf.org/ietf/1shadow-sites.txt
>=20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


From nobody Mon Jan 22 19:17:55 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 418511205D3 for <lisp@ietfa.amsl.com>; Mon, 22 Jan 2018 19:17:53 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -0.597
X-Spam-Level: 
X-Spam-Status: No, score=-0.597 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_COMMENT_SAVED_URL=1.391, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, T_HTML_ATTACH=0.01, URIBL_BLOCKED=0.001] autolearn=no autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id kmssU2gbkWq1 for <lisp@ietfa.amsl.com>; Mon, 22 Jan 2018 19:17:50 -0800 (PST)
Received: from mail-qt0-x236.google.com (mail-qt0-x236.google.com [IPv6:2607:f8b0:400d:c0d::236]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 9CCC312D948 for <lisp@ietf.org>; Mon, 22 Jan 2018 19:17:32 -0800 (PST)
Received: by mail-qt0-x236.google.com with SMTP id d8so17810435qtm.0 for <lisp@ietf.org>; Mon, 22 Jan 2018 19:17:32 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=from:mime-version:subject:message-id:date:to; bh=duwE179hWvSFbIPMJ9QBNe0EVdTycEw0FsUPkJ5Ew+E=; b=pmK7Hrq8yf4o6MlTZ+jv0L6Nq54NDoQ7mZLot2XRq9Wa9stvI3nKQNj5hseZQr7z7Z 2K1k+zpAP+c9RC5ujZCwRx+MruvmTHUp76yZT0JTVSTuXOSv+al+Ow8XQWYkriBOutsY xcZNGQgUqzK+7Nzl6r0xmqgHRWN3fuYpX0tb1sKCn7YHdJHVJuFEK2NNrjaa6azxBcUi 42D4MfpvgrdLgyVwSZ13eu2SPKGBrSaiQC+xObPyceHeDz9hljQUDJaH5NqhcaFIlg9t LMHv7KwnJYEs4GZ3QXy9LmUSqhTJnoDphjrJqiieKprDfRpwo7qu9h9aVWc+X5E0nlGg ff/Q==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:mime-version:subject:message-id:date:to; bh=duwE179hWvSFbIPMJ9QBNe0EVdTycEw0FsUPkJ5Ew+E=; b=a7NzQrAVM2BbcPoXFVyWPnNzCD1CzmTy1OnKnH4fYA30FJhRgS88MEbByoaWqvLfKa 5CmiaDQilsg1H/y/EontchN6UgluT7s0427XvBJ4Mbs4wRBxGmwePcvngBPD6gXLZoDX dSfC4vrDSqzNFaAzQwqORxSBxw/G8YHpEmR7nnhp42VQJUujNzelAiOIM3wBrS6mcudk lVCII2Dn3RxHzOM+bFUrEhisvQXOCY10KI/I7/+6iGSN7QvaXYAGQclAD595w24da8ka htq2/EmmzEQm2sTKOPgjw4GJHP3LovtRx5XtFqo1pHtU6/jneZLgrwuOmjd3Gh7pjTV9 ZdOQ==
X-Gm-Message-State: AKwxytcb2ORU5TTcjxiLPfa8slvCaU4Fn3EeApBIHj/e8/EgE8C7leNB JgKMtB4I0TjpLdAQcRuWSRhzDlGn
X-Google-Smtp-Source: AH8x225rXI7RJHW0Kj9XZjCDGMvwDQOpblQzCwBGAlo62CCN84zu8znASremRlr8SIt/yph9O+F45A==
X-Received: by 10.55.144.2 with SMTP id s2mr1468473qkd.257.1516677451544; Mon, 22 Jan 2018 19:17:31 -0800 (PST)
Received: from [172.20.3.135] (107-0-203-189-ip-static.hfc.comcastbusiness.net. [107.0.203.189]) by smtp.gmail.com with ESMTPSA id w33sm12414500qtj.10.2018.01.22.19.17.28 for <lisp@ietf.org> (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 22 Jan 2018 19:17:28 -0800 (PST)
From: Dino Farinacci <farinacci@gmail.com>
Content-Type: multipart/mixed; boundary="Apple-Mail=_AD9BA9A4-7E6E-43EF-8C91-A49FDC240FDC"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Message-Id: <E320AF13-7B4E-4097-A5AE-2FAAAB66C267@gmail.com>
Date: Mon, 22 Jan 2018 19:17:28 -0800
To: "lisp@ietf.org list" <lisp@ietf.org>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/gHuzw72-mMuG6Y67yj1ZUF0dhag>
Subject: [lisp] Okay to publish this?
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Jan 2018 03:17:53 -0000

--Apple-Mail=_AD9BA9A4-7E6E-43EF-8C91-A49FDC240FDC
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

It=E2=80=99s been 10 days.

Dino


--Apple-Mail=_AD9BA9A4-7E6E-43EF-8C91-A49FDC240FDC
Content-Disposition: attachment;
	filename=rfcdiff.html
Content-Type: text/html;
	x-unix-mode=0644;
	name="rfcdiff.html"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" =
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- saved from url=3D(0030)https://tools.ietf.org/rfcdiff -->
<html xmlns=3D"http://www.w3.org/1999/xhtml"><head><meta =
http-equiv=3D"Content-Type" content=3D"text/html; charset=3DUTF-8">=20
  =20
  <meta http-equiv=3D"Content-Style-Type" content=3D"text/css">=20
  <title>Diff: draft-ietf-lisp-rfc6830bis-08.txt - =
draft-ietf-lisp-rfc6830bis-09.txt</title>=20
  <style type=3D"text/css">=20
    body    { margin: 0.4ex; margin-right: auto; }=20
    tr      { }=20
    td      { white-space: pre; font-family: monospace; vertical-align: =
top; font-size: 0.86em;}=20
    th      { font-size: 0.86em; }=20
    .small  { font-size: 0.6em; font-style: italic; font-family: =
Verdana, Helvetica, sans-serif; }=20
    .left   { background-color: #EEE; }=20
    .right  { background-color: #FFF; }=20
    .diff   { background-color: #CCF; }=20
    .lblock { background-color: #BFB; }=20
    .rblock { background-color: #FF8; }=20
    .insert { background-color: #8FF; }=20
    .delete { background-color: #ACF; }=20
    .void   { background-color: #FFB; }=20
    .cont   { background-color: #EEE; }=20
    .linebr { background-color: #AAA; }=20
    .lineno { color: red; background-color: #FFF; font-size: 0.7em; =
text-align: right; padding: 0 2px; }=20
    .elipsis{ background-color: #AAA; }=20
    .left .cont { background-color: #DDD; }=20
    .right .cont { background-color: #EEE; }=20
    .lblock .cont { background-color: #9D9; }=20
    .rblock .cont { background-color: #DD6; }=20
    .insert .cont { background-color: #0DD; }=20
    .delete .cont { background-color: #8AD; }=20
    .stats, .stats td, .stats th { background-color: #EEE; padding: 2px =
0; }=20
    span.hide { display: none; color: #aaa;}    a:hover span { display: =
inline; }    tr.change { background-color: gray; }=20
    tr.change a { text-decoration: none; color: black }=20
  </style>=20
     <script>
var chunk_index =3D 0;
var old_chunk =3D null;

function format_chunk(index) {
    var prefix =3D "diff";
    var str =3D index.toString();
    for (x=3D0; x<(4-str.length); ++x) {
        prefix+=3D'0';
    }
    return prefix + str;
}

function find_chunk(n){
    return document.querySelector('tr[id$=3D"' + n + '"]');
}

function change_chunk(offset) {
    var index =3D chunk_index + offset;
    var new_str;
    var new_chunk;

    new_str =3D format_chunk(index);
    new_chunk =3D find_chunk(new_str);
    if (!new_chunk) {
        return;
    }
    if (old_chunk) {
        old_chunk.style.outline =3D "";
    }
    old_chunk =3D new_chunk;
    old_chunk.style.outline =3D "1px solid red";
    window.location.replace("#" + new_str)
    window.scrollBy(0,-100);
    chunk_index =3D index;
}

document.onkeydown =3D function(e) {
    switch (e.keyCode) {
    case 78:
        change_chunk(1);
        break;
    case 80:
        change_chunk(-1);
        break;
    }
};
   </script>=20
</head>=20
<body style=3D"">=20
  <table border=3D"0" cellpadding=3D"0" cellspacing=3D"0">=20
  <tbody><tr id=3D"part-1" bgcolor=3D"orange"><th></th><th><a =
href=3D"https://tools.ietf.org/rfcdiff?url2=3Ddraft-ietf-lisp-rfc6830bis-0=
8.txt" style=3D"color:#008; text-decoration:none;">&lt;</a>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-08.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-08.txt</a>&nbsp;</th><th> =
</th><th>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-09.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-09.txt</a>&nbsp;<a =
href=3D"https://tools.ietf.org/rfcdiff?url1=3Ddraft-ietf-lisp-rfc6830bis-0=
9.txt" style=3D"color:#008; =
text-decoration:none;">&gt;</a></th><th></th></tr>=20
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Network Working =
Group                                       D. Farinacci</td><td> =
</td><td class=3D"right">Network Working Group                           =
            D. Farinacci</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Internet-Draft    =
                                             V. Fuller</td><td> </td><td =
class=3D"right">Internet-Draft                                           =
      V. Fuller</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Intended status: =
Standards Track                                D. Meyer</td><td> =
</td><td class=3D"right">Intended status: Standards Track                =
                D. Meyer</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0001"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">Expires: July =
1<span class=3D"delete">3</span>, 2018                                   =
       D. Lewis</td><td> </td><td class=3D"rblock">Expires: July 1<span =
class=3D"insert">6</span>, 2018                                          =
D. Lewis</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                         Cisco Systems</td><td> </td><td =
class=3D"right">                                                         =
  Cisco Systems</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     A. Cabellos (Ed.)</td><td> </td><td =
class=3D"right">                                                       =
A. Cabellos (Ed.)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     UPC/BarcelonaTech</td><td> </td><td =
class=3D"right">                                                       =
UPC/BarcelonaTech</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0002"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                        <span class=3D"delete"> January =
9</span>, 2018</td><td> </td><td class=3D"rblock">                       =
                                 <span class=3D"insert">January =
12</span>, 2018</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">               =
The Locator/ID Separation Protocol (LISP)</td><td> </td><td =
class=3D"right">               The Locator/ID Separation Protocol =
(LISP)</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0003"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
     draft-ietf-lisp-rfc6830bis-0<span class=3D"delete">8</span></td><td> =
</td><td class=3D"rblock">                     =
draft-ietf-lisp-rfc6830bis-0<span class=3D"insert">9</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Abstract</td><td> =
</td><td class=3D"right">Abstract</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the data-plane protocol for the Locator/ID</td><td> </td><td =
class=3D"right">   This document describes the data-plane protocol for =
the Locator/ID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Separation =
Protocol (LISP).  LISP defines two namespaces, End-point</td><td> =
</td><td class=3D"right">   Separation Protocol (LISP).  LISP defines =
two namespaces, End-point</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs) that identify end-hosts and Routing Locators</td><td> </td><td =
class=3D"right">   Identifiers (EIDs) that identify end-hosts and =
Routing Locators</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (RLOCs) that =
identify network attachment points.  With this, LISP</td><td> </td><td =
class=3D"right">   (RLOCs) that identify network attachment points.  =
With this, LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   effectively =
separates control from data, and allows routers to create</td><td> =
</td><td class=3D"right">   effectively separates control from data, and =
allows routers to create</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   overlay =
networks.  LISP-capable routers exchange encapsulated packets</td><td> =
</td><td class=3D"right">   overlay networks.  LISP-capable routers =
exchange encapsulated packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   according to =
EID-to-RLOC mappings stored in a local map-cache.</td><td> </td><td =
class=3D"right">   according to EID-to-RLOC mappings stored in a local =
map-cache.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-2" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> =
page 1, line 44<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> page 1, line 44<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are working documents of the Internet =
Engineering</td><td> </td><td class=3D"right">   Internet-Drafts are =
working documents of the Internet Engineering</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Task Force =
(IETF).  Note that other groups may also distribute</td><td> </td><td =
class=3D"right">   Task Force (IETF).  Note that other groups may also =
distribute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   working =
documents as Internet-Drafts.  The list of current Internet-</td><td> =
</td><td class=3D"right">   working documents as Internet-Drafts.  The =
list of current Internet-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td> </td><td =
class=3D"right">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are draft documents valid for a maximum of six =
months</td><td> </td><td class=3D"right">   Internet-Drafts are draft =
documents valid for a maximum of six months</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and may be =
updated, replaced, or obsoleted by other documents at any</td><td> =
</td><td class=3D"right">   and may be updated, replaced, or obsoleted =
by other documents at any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   time.  It is =
inappropriate to use Internet-Drafts as reference</td><td> </td><td =
class=3D"right">   time.  It is inappropriate to use Internet-Drafts as =
reference</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   material or to =
cite them other than as "work in progress."</td><td> </td><td =
class=3D"right">   material or to cite them other than as "work in =
progress."</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0004"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   This =
Internet-Draft will expire on July 1<span class=3D"delete">3</span>, =
2018.</td><td> </td><td class=3D"rblock">   This Internet-Draft will =
expire on July 1<span class=3D"insert">6</span>, 2018.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Copyright =
Notice</td><td> </td><td class=3D"right">Copyright Notice</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copyright (c) =
2018 IETF Trust and the persons identified as the</td><td> </td><td =
class=3D"right">   Copyright (c) 2018 IETF Trust and the persons =
identified as the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document =
authors.  All rights reserved.</td><td> </td><td class=3D"right">   =
document authors.  All rights reserved.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
is subject to BCP 78 and the IETF Trust's Legal</td><td> </td><td =
class=3D"right">   This document is subject to BCP 78 and the IETF =
Trust's Legal</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Provisions =
Relating to IETF Documents</td><td> </td><td class=3D"right">   =
Provisions Relating to IETF Documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
(https://trustee.ietf.org/license-info) in effect on the date =
of</td><td> </td><td class=3D"right">   =
(https://trustee.ietf.org/license-info) in effect on the date of</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   publication of =
this document.  Please review these documents</td><td> </td><td =
class=3D"right">   publication of this document.  Please review these =
documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-3" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> =
page 2, line 31<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> page 2, line 31<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   =
3</td><td> </td><td class=3D"right">   1.  Introduction  . . . . . . . . =
. . . . . . . . . . . . . . . .   3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  =
Requirements Notation . . . . . . . . . . . . . . . . . . . .   =
4</td><td> </td><td class=3D"right">   2.  Requirements Notation . . . . =
. . . . . . . . . . . . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Definition =
of Terms . . . . . . . . . . . . . . . . . . . . .   4</td><td> </td><td =
class=3D"right">   3.  Definition of Terms . . . . . . . . . . . . . . . =
. . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   4.  Basic =
Overview  . . . . . . . . . . . . . . . . . . . . . . .   9</td><td> =
</td><td class=3D"right">   4.  Basic Overview  . . . . . . . . . . . . =
. . . . . . . . . . .   9</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     4.1.  Packet =
Flow Sequence  . . . . . . . . . . . . . . . . . .  11</td><td> </td><td =
class=3D"right">     4.1.  Packet Flow Sequence  . . . . . . . . . . . . =
. . . . . .  11</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   5.  LISP =
Encapsulation Details  . . . . . . . . . . . . . . . . .  13</td><td> =
</td><td class=3D"right">   5.  LISP Encapsulation Details  . . . . . . =
. . . . . . . . . . .  13</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.1.  LISP =
IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  13</td><td> =
</td><td class=3D"right">     5.1.  LISP IPv4-in-IPv4 Header Format . . =
. . . . . . . . . . .  13</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.2.  LISP =
IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  14</td><td> =
</td><td class=3D"right">     5.2.  LISP IPv6-in-IPv6 Header Format . . =
. . . . . . . . . . .  14</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.3.  Tunnel =
Header Field Descriptions  . . . . . . . . . . . .  15</td><td> </td><td =
class=3D"right">     5.3.  Tunnel Header Field Descriptions  . . . . . . =
. . . . . .  15</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0005"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   6.  LISP =
EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">19</span></td><td> </td><td class=3D"rblock">   6.  =
LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">20</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  Dealing =
with Large Encapsulated Packets . . . . . . . . . . .  20</td><td> =
</td><td class=3D"right">   7.  Dealing with Large Encapsulated Packets =
. . . . . . . . . . .  20</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0006"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.1.  A =
Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"delete">20</span></td><td> </td><td class=3D"rblock">     7.1.  =
A Stateless Solution to MTU Handling  . . . . . . . . . .  <span =
class=3D"insert">21</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     7.2.  A =
Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"delete">21</span></td><td> </td><td class=3D"rblock">     7.2.  =
A Stateful Solution to MTU Handling . . . . . . . . . . .  <span =
class=3D"insert">22</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   8.  Using =
Virtualization and Segmentation with LISP . . . . . . .  22</td><td> =
</td><td class=3D"right">   8.  Using Virtualization and Segmentation =
with LISP . . . . . . .  22</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  Routing =
Locator Selection . . . . . . . . . . . . . . . . . .  23</td><td> =
</td><td class=3D"right">   9.  Routing Locator Selection . . . . . . . =
. . . . . . . . . . .  23</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   10. Routing =
Locator Reachability  . . . . . . . . . . . . . . . .  24</td><td> =
</td><td class=3D"right">   10. Routing Locator Reachability  . . . . . =
. . . . . . . . . . .  24</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.1.  Echo =
Nonce Algorithm . . . . . . . . . . . . . . . . . .  27</td><td> =
</td><td class=3D"right">     10.1.  Echo Nonce Algorithm . . . . . . . =
. . . . . . . . . . .  27</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.2.  =
RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28</td><td> =
</td><td class=3D"right">     10.2.  RLOC-Probing Algorithm . . . . . . =
. . . . . . . . . . .  28</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   11. EID =
Reachability within a LISP Site . . . . . . . . . . . . .  29</td><td> =
</td><td class=3D"right">   11. EID Reachability within a LISP Site . . =
. . . . . . . . . . .  29</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0007"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   12. Routing =
Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">29</span></td><td> </td><td class=3D"rblock">   12. =
Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">30</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   13. Changing =
the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"delete">30</span></td><td> </td><td class=3D"rblock">   13. =
Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  <span =
class=3D"insert">31</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.1.  =
Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">31</span></td><td> </td><td class=3D"rblock">     13.1. =
 Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">32</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     13.2.  =
Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  32</td><td> =
</td><td class=3D"right">     13.2.  Solicit-Map-Request (SMR)  . . . . =
. . . . . . . . . . .  32</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0008"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.3.  =
Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">33</span></td><td> </td><td class=3D"rblock">     13.3. =
 Database Map-Versioning  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">34</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">34</span></td><td> </td><td class=3D"rblock">   14. =
Multicast Considerations  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">35</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   15. Router =
Performance Considerations . . . . . . . . . . . . . .  35</td><td> =
</td><td class=3D"right">   15. Router Performance Considerations . . . =
. . . . . . . . . . .  35</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0009"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   16. Mobility =
Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"delete">5</span></td><td> </td><td class=3D"rblock">   16. =
Mobility Considerations . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"insert">6</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.1.  Slow =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.1.  Slow Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.2.  Fast =
Mobility  . . . . . . . . . . . . . . . . . . . . .  36</td><td> =
</td><td class=3D"right">     16.2.  Fast Mobility  . . . . . . . . . . =
. . . . . . . . . . .  36</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     16.3.  LISP =
Mobile Node Mobility  . . . . . . . . . . . . . . .  37</td><td> =
</td><td class=3D"right">     16.3.  LISP Mobile Node Mobility  . . . . =
. . . . . . . . . . .  37</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0010"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   17. LISP xTR =
Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"delete">37</span></td><td> </td><td class=3D"rblock">   17. =
LISP xTR Placement and Encapsulation Methods  . . . . . . . .  <span =
class=3D"insert">38</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.1.  =
First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">38</span></td><td> </td><td class=3D"rblock">     17.1. =
 First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">39</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.2.  =
Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  39</td><td> =
</td><td class=3D"right">     17.2.  Border/Edge xTRs . . . . . . . . . =
. . . . . . . . . . .  39</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0011"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.3.  ISP =
Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"delete">39</span></td><td> </td><td class=3D"rblock">     17.3. =
 ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  <span =
class=3D"insert">40</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.4.  LISP =
Functionality with Conventional NATs  . . . . . . .  40</td><td> =
</td><td class=3D"right">     17.4.  LISP Functionality with =
Conventional NATs  . . . . . . .  40</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0012"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.5.  =
Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"delete">40</span></td><td> </td><td class=3D"rblock">     17.5. =
 Packets Egressing a LISP Site  . . . . . . . . . . . . .  <span =
class=3D"insert">41</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">40</span></td><td> </td><td class=3D"rblock">   18. =
Traceroute Considerations . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">41</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.1.  =
IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">41</span></td><td> </td><td class=3D"rblock">     18.1. =
 IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">42</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     18.2.  IPv4 =
Traceroute  . . . . . . . . . . . . . . . . . . . .  42</td><td> =
</td><td class=3D"right">     18.2.  IPv4 Traceroute  . . . . . . . . . =
. . . . . . . . . . .  42</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0013"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"delete">2</span></td><td> </td><td class=3D"rblock">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  4<span =
class=3D"insert">3</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   19. Security =
Considerations . . . . . . . . . . . . . . . . . . .  43</td><td> =
</td><td class=3D"right">   19. Security Considerations . . . . . . . . =
. . . . . . . . . . .  43</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0014"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   20. Network =
Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"delete">3</span></td><td> </td><td class=3D"rblock">   20. =
Network Management Considerations . . . . . . . . . . . . . .  4<span =
class=3D"insert">4</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   21. IANA =
Considerations . . . . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">   21. IANA Considerations . . . . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     21.1.  LISP =
UDP Port Numbers  . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     21.1.  LISP UDP Port Numbers  . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   22. References =
 . . . . . . . . . . . . . . . . . . . . . . . . .  44</td><td> </td><td =
class=3D"right">   22. References  . . . . . . . . . . . . . . . . . . . =
. . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     22.1.  =
Normative References . . . . . . . . . . . . . . . . . .  44</td><td> =
</td><td class=3D"right">     22.1.  Normative References . . . . . . . =
. . . . . . . . . . .  44</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0015"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     22.2.  =
Informative References . . . . . . . . . . . . . . . . .  4<span =
class=3D"delete">5</span></td><td> </td><td class=3D"rblock">     22.2.  =
Informative References . . . . . . . . . . . . . . . . .  4<span =
class=3D"insert">6</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Appendix A.  =
Acknowledgments  . . . . . . . . . . . . . . . . . .  50</td><td> =
</td><td class=3D"right">   Appendix A.  Acknowledgments  . . . . . . . =
. . . . . . . . . . .  50</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Appendix B.  =
Document Change Log  . . . . . . . . . . . . . . . .  50</td><td> =
</td><td class=3D"right">   Appendix B.  Document Change Log  . . . . . =
. . . . . . . . . . .  50</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0016"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.1.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-08</span>  =
. . . . . . . .  51</td><td> </td><td class=3D"rblock">     B.1.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-09</span>  =
. . . . . . . .  51</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.2.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-07</span>  =
. . . . . . . .  51</td><td> </td><td class=3D"rblock">     B.2.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span>  =
. . . . . . . .  51</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.3.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  51</td><td> </td><td class=3D"rblock">     B.3.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-07</span>  =
. . . . . . . .  51</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.4.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-05</span>  =
. . . . . . . .  51</td><td> </td><td class=3D"rblock">     B.4.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  51</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.5.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-04</span>  =
. . . . . . . .  52</td><td> </td><td class=3D"rblock">     B.5.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-05</span>  =
. . . . . . . .  52</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.6.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-03</span>  =
. . . . . . . .  52</td><td> </td><td class=3D"rblock">     B.6.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-04</span>  =
. . . . . . . .  52</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.7.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-02</span>  =
. . . . . . . .  52</td><td> </td><td class=3D"rblock">     B.7.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-03</span>  =
. . . . . . . .  52</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.8.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-01</span>  =
. . . . . . . .  52</td><td> </td><td class=3D"rblock">     B.8.  =
Changes to <span class=3D"insert">draft-ietf-lisp-rfc6830bis-02</span>  =
. . . . . . . .  52</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.9.  =
Changes to draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52</td><td> =
</td><td class=3D"rblock">     B.9.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  =
52</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Authors' =
Addresses  . . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">52</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.10. Changes to</span> =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   Authors' Addresses  . . . . . . . . . . . . =
. . . . . . . . . . .  <span class=3D"insert">53</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">1.  =
Introduction</td><td> </td><td class=3D"right">1.  Introduction</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the Locator/Identifier Separation Protocol</td><td> </td><td =
class=3D"right">   This document describes the Locator/Identifier =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (LISP).  LISP =
is an encapsulation protocol built around the</td><td> </td><td =
class=3D"right">   (LISP).  LISP is an encapsulation protocol built =
around the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fundamental =
idea of separating the topological location of a network</td><td> =
</td><td class=3D"right">   fundamental idea of separating the =
topological location of a network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
point from the node's identity [CHIAPPA].  As a result</td><td> </td><td =
class=3D"right">   attachment point from the node's identity [CHIAPPA].  =
As a result</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP creates =
two namespaces: Endpoint Identifiers (EIDs), that are</td><td> </td><td =
class=3D"right">   LISP creates two namespaces: Endpoint Identifiers =
(EIDs), that are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   used to =
identify end-hosts (e.g., nodes or Virtual Machines) and</td><td> =
</td><td class=3D"right">   used to identify end-hosts (e.g., nodes or =
Virtual Machines) and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   routable =
Routing Locators (RLOCs), used to identify network</td><td> </td><td =
class=3D"right">   routable Routing Locators (RLOCs), used to identify =
network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-4" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> =
page 18, line 42<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> page 18, line =
42<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that the =
inner-header source EID address matches.  If the LSB for</td><td> =
</td><td class=3D"right">      that the inner-header source EID address =
matches.  If the LSB for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      an anycast =
Locator is set to 1, then there is at least one RLOC</td><td> </td><td =
class=3D"right">      an anycast Locator is set to 1, then there is at =
least one RLOC</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      with that =
address, and the ETR is considered 'up'.</td><td> </td><td =
class=3D"right">      with that address, and the ETR is considered =
'up'.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When doing =
ITR/PITR encapsulation:</td><td> </td><td class=3D"right">   When doing =
ITR/PITR encapsulation:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
outer-header 'Time to Live' field (or 'Hop Limit' field, in</td><td> =
</td><td class=3D"right">   o  The outer-header 'Time to Live' field (or =
'Hop Limit' field, in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the case of =
IPv6) SHOULD be copied from the inner-header 'Time to</td><td> </td><td =
class=3D"right">      the case of IPv6) SHOULD be copied from the =
inner-header 'Time to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Live' =
field.</td><td> </td><td class=3D"right">      Live' field.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0017"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  The =
outer-header <span class=3D"delete">'Type of Service'</span> field (or =
the 'Traffic Class'</td><td> </td><td class=3D"rblock">   o  The =
outer-header <span class=3D"insert">'Differentiated Services Code Point' =
(DSCP)</span> field</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      field, in =
the case of IPv6) SHOULD be copied from the inner-header</td><td> =
</td><td class=3D"rblock">      (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">'Type</span> of <span class=3D"delete">Service'</span> =
field <span class=3D"delete">(with one exception; see =
below).</span></td><td> </td><td class=3D"rblock">      copied from the =
inner-header <span class=3D"insert">DSCP field ('Traffic Class' field, =
in</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the case</span> =
of <span class=3D"insert">IPv6) considering the exception listed =
below.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  The 'Explicit =
Congestion Notification' (ECN)</span> field <span class=3D"insert">(bits =
6 and 7</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of the IPv6 =
'Traffic Class' field) requires special treatment in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      order to avoid =
discarding indications of congestion [RFC3168].</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      ITR encapsulation =
MUST copy the 2-bit 'ECN' field from the inner</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header to the =
outer header.  Re-encapsulation MUST copy the 2-bit</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      'ECN' field from =
the stripped outer header to the new outer</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
header.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When doing =
ETR/PETR decapsulation:</td><td> </td><td class=3D"right">   When doing =
ETR/PETR decapsulation:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
inner-header 'Time to Live' field (or 'Hop Limit' field, in</td><td> =
</td><td class=3D"right">   o  The inner-header 'Time to Live' field (or =
'Hop Limit' field, in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the case of =
IPv6) SHOULD be copied from the outer-header 'Time to</td><td> </td><td =
class=3D"right">      the case of IPv6) SHOULD be copied from the =
outer-header 'Time to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Live' =
field, when the Time to Live value of the outer header is</td><td> =
</td><td class=3D"right">      Live' field, when the Time to Live value =
of the outer header is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      less than =
the Time to Live value of the inner header.  Failing to</td><td> =
</td><td class=3D"right">      less than the Time to Live value of the =
inner header.  Failing to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      perform =
this check can cause the Time to Live of the inner header</td><td> =
</td><td class=3D"right">      perform this check can cause the Time to =
Live of the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to =
increment across encapsulation/decapsulation cycles.  This</td><td> =
</td><td class=3D"right">      to increment across =
encapsulation/decapsulation cycles.  This</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      check is =
also performed when doing initial encapsulation, when a</td><td> =
</td><td class=3D"right">      check is also performed when doing =
initial encapsulation, when a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      packet =
comes to an ITR or PITR destined for a LISP site.</td><td> </td><td =
class=3D"right">      packet comes to an ITR or PITR destined for a LISP =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0018"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  The =
inner-header <span class=3D"delete">'Type of Service'</span> field (or =
the 'Traffic Class'</td><td> </td><td class=3D"rblock">   o  The =
inner-header <span class=3D"insert">'Differentiated Services Code Point' =
(DSCP)</span> field</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      field, in =
the case of IPv6) SHOULD be copied from the outer-header</td><td> =
</td><td class=3D"rblock">      (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">'Type</span> of <span class=3D"delete">Service'</span> =
field <span class=3D"delete">(with one exception; see =
below).</span></td><td> </td><td class=3D"rblock">      copied from the =
outer-header <span class=3D"insert">DSCP field ('Traffic Class' field, =
in</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the case of IPv6) =
considering the exception listed below.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  The 'Explicit =
Congestion Notification' (ECN) field (bits 6 and 7</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of the IPv6 =
'Traffic Class' field) requires special treatment in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      order to avoid =
discarding indications</span> of <span class=3D"insert">congestion =
[RFC3168].  If</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the 'ECN' field =
contains a congestion indication codepoint (the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      value is '11', =
the Congestion Experienced (CE) codepoint), then</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      ETR decapsulation =
MUST copy the 2-bit 'ECN'</span> field <span class=3D"insert">from =
the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      stripped outer =
header to the surviving inner header that is used</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      to forward the =
packet beyond the ETR.  These requirements preserve</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      CE indications =
when a packet that uses ECN traverses a LISP tunnel</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      and becomes =
marked with a CE indication due to congestion between</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the tunnel =
endpoints.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Note that if =
an ETR/PETR is also an ITR/PITR and chooses to re-</td><td> </td><td =
class=3D"right">   Note that if an ETR/PETR is also an ITR/PITR and =
chooses to re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   encapsulate =
after decapsulating, the net effect of this is that the</td><td> =
</td><td class=3D"right">   encapsulate after decapsulating, the net =
effect of this is that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   new outer =
header will carry the same Time to Live as the old outer</td><td> =
</td><td class=3D"right">   new outer header will carry the same Time to =
Live as the old outer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header minus =
1.</td><td> </td><td class=3D"right">   header minus 1.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copying the =
Time to Live (TTL) serves two purposes: first, it</td><td> </td><td =
class=3D"right">   Copying the Time to Live (TTL) serves two purposes: =
first, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   preserves the =
distance the host intended the packet to travel;</td><td> </td><td =
class=3D"right">   preserves the distance the host intended the packet =
to travel;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   second, and =
more importantly, it provides for suppression of looping</td><td> =
</td><td class=3D"right">   second, and more importantly, it provides =
for suppression of looping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets in the =
event there is a loop of concatenated tunnels due to</td><td> </td><td =
class=3D"right">   packets in the event there is a loop of concatenated =
tunnels due to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-5" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> =
page 51, line 5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> page 51, line 5<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The LISP =
working group would like to give a special thanks to Jari</td><td> =
</td><td class=3D"right">   The LISP working group would like to give a =
special thanks to Jari</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Arkko, the =
Internet Area AD at the time that the set of LISP</td><td> </td><td =
class=3D"right">   Arkko, the Internet Area AD at the time that the set =
of LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   documents were =
being prepared for IESG last call, and for his</td><td> </td><td =
class=3D"right">   documents were being prepared for IESG last call, and =
for his</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   meticulous =
reviews and detailed commentaries on the 7 working group</td><td> =
</td><td class=3D"right">   meticulous reviews and detailed commentaries =
on the 7 working group</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   last call =
documents progressing toward standards-track RFCs.</td><td> </td><td =
class=3D"right">   last call documents progressing toward =
standards-track RFCs.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix B.  =
Document Change Log</td><td> </td><td class=3D"right">Appendix B.  =
Document Change Log</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC Editor: =
Please delete this section on publication as RFC.]</td><td> </td><td =
class=3D"right">   [RFC Editor: Please delete this section on =
publication as RFC.]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0019"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.1.  Changes =
to draft-ietf-lisp-rfc6830bis-08</td><td> </td><td class=3D"rblock">B.1. =
 Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-09</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Posted January =
2018.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Add more details =
in section 5.3 about DSCP processing during</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      encapsulation and =
decapsulation.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">B.2.  Changes to</span> =
draft-ietf-lisp-rfc6830bis-08</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
January 2018.</td><td> </td><td class=3D"right">   o  Posted January =
2018.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to research work for any protocol mechanisms.</td><td> =
</td><td class=3D"right">   o  Remove references to research work for =
any protocol mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Document =
scanned to make sure it is RFC 2119 compliant.</td><td> </td><td =
class=3D"right">   o  Document scanned to make sure it is RFC 2119 =
compliant.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Made =
changes to reflect comments from document WG shepherd Luigi</td><td> =
</td><td class=3D"right">   o  Made changes to reflect comments from =
document WG shepherd Luigi</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Iannone.</td><td> </td><td class=3D"right">      Iannone.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Ran IDNITs =
on the document.</td><td> </td><td class=3D"right">   o  Ran IDNITs on =
the document.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0020"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">2</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-07</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-07</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
November 2017.</td><td> </td><td class=3D"right">   o  Posted November =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rephrase =
how Instance-IDs are used and don't refer to [RFC1918]</td><td> </td><td =
class=3D"right">   o  Rephrase how Instance-IDs are used and don't refer =
to [RFC1918]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
addresses.</td><td> </td><td class=3D"right">      addresses.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0021"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
October 2017.</td><td> </td><td class=3D"right">   o  Posted October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Put RTR =
definition before it is used.</td><td> </td><td class=3D"right">   o  =
Put RTR definition before it is used.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rename =
references that are now working group drafts.</td><td> </td><td =
class=3D"right">   o  Rename references that are now working group =
drafts.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
"EIDs MUST NOT be used as used by a host to refer to other</td><td> =
</td><td class=3D"right">   o  Remove "EIDs MUST NOT be used as used by =
a host to refer to other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hosts.  =
Note that EID blocks MAY LISP RLOCs".</td><td> </td><td class=3D"right"> =
     hosts.  Note that EID blocks MAY LISP RLOCs".</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-6" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> =
page 51, line 48<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> page 52, line 7<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  ETRs may, =
rather than will, be the ones to send Map-Replies.</td><td> </td><td =
class=3D"right">   o  ETRs may, rather than will, be the ones to send =
Map-Replies.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recommend, =
rather than mandate, max encapsulation headers to 2.</td><td> </td><td =
class=3D"right">   o  Recommend, rather than mandate, max encapsulation =
headers to 2.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reference =
VPN draft when introducing Instance-ID.</td><td> </td><td class=3D"right">=
   o  Reference VPN draft when introducing Instance-ID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that SMRs can be sent when ITR/ETR are in the same node.</td><td> =
</td><td class=3D"right">   o  Indicate that SMRs can be sent when =
ITR/ETR are in the same node.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarify =
when private addreses can be used.</td><td> </td><td class=3D"right">   =
o  Clarify when private addreses can be used.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0022"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
August 2017.</td><td> </td><td class=3D"right">   o  Posted August =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Make it =
clear that a Reencapsulating Tunnel Router is an RTR.</td><td> </td><td =
class=3D"right">   o  Make it clear that a Reencapsulating Tunnel Router =
is an RTR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0023"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted July =
2017.</td><td> </td><td class=3D"right">   o  Posted July 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Changed =
reference of IPv6 RFC2460 to RFC8200.</td><td> </td><td class=3D"right"> =
  o  Changed reference of IPv6 RFC2460 to RFC8200.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that the applicability statement for UDP zero checksums</td><td> =
</td><td class=3D"right">   o  Indicate that the applicability statement =
for UDP zero checksums</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      over IPv6 =
adheres to RFC6936.</td><td> </td><td class=3D"right">      over IPv6 =
adheres to RFC6936.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0024"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted May =
2017.</td><td> </td><td class=3D"right">   o  Posted May 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Move the =
control-plane related codepoints in the IANA</td><td> </td><td =
class=3D"right">   o  Move the control-plane related codepoints in the =
IANA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Considerations section to RFC6833bis.</td><td> </td><td class=3D"right"> =
     Considerations section to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0025"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
April 2017.</td><td> </td><td class=3D"right">   o  Posted April =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reflect =
some editorial comments from Damien Sausez.</td><td> </td><td =
class=3D"right">   o  Reflect some editorial comments from Damien =
Sausez.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0026"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
March 2017.</td><td> </td><td class=3D"right">   o  Posted March =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Include =
references to new RFCs published.</td><td> </td><td class=3D"right">   o =
 Include references to new RFCs published.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Change =
references from RFC6833 to RFC6833bis.</td><td> </td><td class=3D"right"> =
  o  Change references from RFC6833 to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarified =
LCAF text in the IANA section.</td><td> </td><td class=3D"right">   o  =
Clarified LCAF text in the IANA section.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to "experimental".</td><td> </td><td class=3D"right">   o  =
Remove references to "experimental".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0027"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">10</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
December 2016.</td><td> </td><td class=3D"right">   o  Posted December =
2016.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Created =
working group document from draft-farinacci-lisp</td><td> </td><td =
class=3D"right">   o  Created working group document from =
draft-farinacci-lisp</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      -rfc6830-00 =
individual submission.  No other changes made.</td><td> </td><td =
class=3D"right">      -rfc6830-00 individual submission.  No other =
changes made.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Authors' =
Addresses</td><td> </td><td class=3D"right">Authors' Addresses</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0028"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">                        =
                                                 </span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dino =
Farinacci</td><td> </td><td class=3D"right">   Dino Farinacci</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
farinacci@gmail.com</td><td> </td><td class=3D"right">   EMail: =
farinacci@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Vince =
Fuller</td><td> </td><td class=3D"right">   Vince Fuller</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>

     <tr><td></td><td class=3D"left"></td><td> </td><td =
class=3D"right"></td><td></td></tr>
     <tr id=3D"end" bgcolor=3D"gray"><th colspan=3D"5" =
align=3D"center">&nbsp;End of changes. 28 change blocks.&nbsp;</th></tr>
     <tr class=3D"stats"><td></td><th><i>47 lines changed or =
deleted</i></th><th><i> </i></th><th><i>78 lines changed or =
added</i></th><td></td></tr>
     <tr><td colspan=3D"5" align=3D"center" class=3D"small"><br>This =
html diff was produced by rfcdiff 1.46. The latest version is available =
from <a =
href=3D"http://www.tools.ietf.org/tools/rfcdiff/">http://tools.ietf.org/to=
ols/rfcdiff/</a> </td></tr>
   </tbody></table>
  =20
  =20
</body></html>=

--Apple-Mail=_AD9BA9A4-7E6E-43EF-8C91-A49FDC240FDC--


From nobody Tue Jan 23 01:54:56 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 59F2212DA12 for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 01:54:55 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id qTxPqb9DF4qS for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 01:54:53 -0800 (PST)
Received: from mail-wm0-x236.google.com (mail-wm0-x236.google.com [IPv6:2a00:1450:400c:c09::236]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 5B90E12DA0C for <lisp@ietf.org>; Tue, 23 Jan 2018 01:54:53 -0800 (PST)
Received: by mail-wm0-x236.google.com with SMTP id f3so634491wmc.1 for <lisp@ietf.org>; Tue, 23 Jan 2018 01:54:53 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=DNODYKs64Gi7svkvHiPrOqAhYq+2cDzNo+Cd3jP2lpQ=; b=13jr+EnIfLGo3Cse+KWdMZS5pKuuS5kBWW/owS7CisVUQSKfnK7wFAp06Ueuyjhd7c jlBEYDGs1V2Tn5OKX1QeKGSDWeUiYuqIGQXHPV12AkSoFrVbrCHTiTiXdAfJLS1+dV3s MUopLflYThB94r5ENB7EYzqdxAQsci6OM7EzCoRxKUZrgX1LFyWIqoM1L1M3G0hst7MP O8LQQEx4Un0NHe+b+O0TypDNVjR7FLDwHTOQmryXLuSveob4U1RQwV4v72d8jFPS4CuY T/k/ZHH2vsVeiiTT7lx1DlfTB4rYa2Pr0mCS+sb2FEmelvhk/1SdMRbozOZVUmW+NpM5 ZV4g==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=DNODYKs64Gi7svkvHiPrOqAhYq+2cDzNo+Cd3jP2lpQ=; b=MBswQNgUmu0+BmdciZS+VVBRoER04isLsg6fHq06KQ92Ej+nMMBzdeFxXMZv7wx/ef CeyvGbv7OBMekzV6nH2RrY7x6k0Vdf0AiRGT9sJ6CUf/81BzyrbwaLNui5h8RJtAnvQ4 FLnY7CT1DMApqP9XZPc0+BpynJvARd5kNWnpD8stbJsieKSe8JxZAsSPAdYhrMFDQQaQ 0mNahcvgdECDpSNWIvaxvt8+TD68RyvQcz2MGWUU9puoEOyP9cXFa37gdqwMAuN9pTu4 e6N1wtXI3/9HxTapPtUE0TzjVSTNlEPJoc+GSJWmu+cshyuALxUWoW4rdWOpcbv0pQ4B 6chw==
X-Gm-Message-State: AKwxytfdTJME9FUm6cuFZr7CszjRW1rHmaLhSeaLA3Y808L8O7QR5LlT /8t9amTs4j51ov2AHQEx1UL/3g==
X-Google-Smtp-Source: AH8x227S6QM7O4p1neq2tSV+EAdXpA5i1KPlVocWnAJRP/2GiC3QNHqfdergmd/oN0ocSxox4S2kVw==
X-Received: by 10.28.153.147 with SMTP id b141mr1311955wme.47.1516701291603; Tue, 23 Jan 2018 01:54:51 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:e17e:79fa:b6db:457b? ([2001:660:330f:a4:e17e:79fa:b6db:457b]) by smtp.gmail.com with ESMTPSA id m6sm3188251wmb.6.2018.01.23.01.54.50 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 23 Jan 2018 01:54:50 -0800 (PST)
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <E320AF13-7B4E-4097-A5AE-2FAAAB66C267@gmail.com>
Date: Tue, 23 Jan 2018 10:54:49 +0100
Cc: "lisp@ietf.org list" <lisp@ietf.org>
Content-Transfer-Encoding: 7bit
Message-Id: <55E64A73-6152-4FD8-BDBF-D874432E06C8@gigix.net>
References: <E320AF13-7B4E-4097-A5AE-2FAAAB66C267@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/IeZY3FmDaxzmUD85Z8J2oLhW7DY>
Subject: Re: [lisp] Okay to publish this?
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Jan 2018 09:54:55 -0000

You will have my review today. Please hold on.

L.


> On 23 Jan 2018, at 04:17, Dino Farinacci <farinacci@gmail.com> wrote:
> 
> <rfcdiff.html>


From nobody Tue Jan 23 03:21:30 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id F0A1B1205D3 for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 03:21:27 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.599
X-Spam-Level: 
X-Spam-Status: No, score=-2.599 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 5WWdCbpkwqfL for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 03:21:25 -0800 (PST)
Received: from mail-wm0-x22c.google.com (mail-wm0-x22c.google.com [IPv6:2a00:1450:400c:c09::22c]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id A59B01200F1 for <lisp@ietf.org>; Tue, 23 Jan 2018 03:21:24 -0800 (PST)
Received: by mail-wm0-x22c.google.com with SMTP id 143so1076340wma.5 for <lisp@ietf.org>; Tue, 23 Jan 2018 03:21:24 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=wkljVw9t2+Wpln4E9w21htl2RgjxC2CyXkCm+EIlztU=; b=t9ZqNv8H51jQY9o6J/FwUS0IQi73VR8Onrlv0A0JRyERDDCACRapQROBr1djXOKKNW 7jdTs2hPcjZoF0bqvQ4OjHoSJO74V5/E/lsM7B25kE6phF8ku5Gjrr0uM0hkN0cJr2jV iuc6EfSlupJ3FnVSra069F57um/OEBNmOrZcbyGfFvDIyjfN7pRjZrOMGpERgbXJbVsM Ole6VFcjK27uZA+IMFnule3REtO/jZdddK0h11z/0MC3FyeqMplDFzA1fPHPHljf5eps 7LpTqbUcXuds/MQDUTT7w4QQnEa0G7g+DIREdyYJ+3hrWc7RrY0u/UkJpgwvYOqehmF5 Q5Dg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=wkljVw9t2+Wpln4E9w21htl2RgjxC2CyXkCm+EIlztU=; b=GaqMOgDifR1No4ZYgPHRq8ZAP1PQsvIMS65pP+OVKzy/m3C0IanmRxFxoQ31ebzbJg i34VfqXsSkGHep16dLB2fYNxd6bWt5AKvcumImoPQYkxzgu5gTjJjchs3hMfEGxlao0e fgoZ2G/4AsFnSVR7Y2QPVokCh7vB73y7rlv7gleLcQDq3YCoImR4Lr5Ab0btekg3Jkwm j2IIKMsB1SekfnVfyAnyZbhgGBRDRdSZnc80TNnsDnmwVrZxhuTJbrwyStYnImoc1R5T LUvzudI/3G+QgC+ZgwLSz/8TiRDNrOB3EFLaOjp4I0zx6tcbMEHf/6o40ErmB2sWgC4o UqJQ==
X-Gm-Message-State: AKwxytdBOvrefpG8vMHRpG+sxoCpfEo/FYxZ426us0s2EFya1GKzBjn/ POPrq4rRZ5ytzb782oSKcob+LqtwzmY=
X-Google-Smtp-Source: AH8x226fftwA7bjdB0fI5o72fHeoPIawJ0lB7MOIJ1rVWRZ/qYtX/x9F7XACTiCLuAFJeT67ixsnXw==
X-Received: by 10.28.126.133 with SMTP id z127mr1699436wmc.64.1516706482991; Tue, 23 Jan 2018 03:21:22 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:e17e:79fa:b6db:457b? ([2001:660:330f:a4:e17e:79fa:b6db:457b]) by smtp.gmail.com with ESMTPSA id q13sm215722wrg.3.2018.01.23.03.21.21 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 23 Jan 2018 03:21:21 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Message-Id: <327012BF-6840-4019-A9FE-39279032459D@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_87057BFB-6DD2-4161-81E7-E3AFEF2E3E39"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Tue, 23 Jan 2018 12:21:19 +0100
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
To: Albert Cabellos <albert.cabellos@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/KX3WcZnHi0_MzniOLQ-l9QNAEUM>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Jan 2018 11:21:28 -0000

--Apple-Mail=_87057BFB-6DD2-4161-81E7-E3AFEF2E3E39
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Hi Albert ,

you find my comments inline.

Thanks again for your work.

Ciao

L.


> On 12 Jan 2018, at 17:20, Albert Cabellos <albert.cabellos@gmail.com> =
wrote:
>=20
> Hi all
>=20
> As editor of 6830bis I=C2=B4d like to confirm or deny the following =
changes which I believe have support.=20
>=20
> Please note that I have intentionally ignored minor/editorial changes =
to help sync all the participants. I hope that the list below captures =
the most relevant ones.
>=20
> Also note that I don=C2=B4t necessarily agree with all the changes =
listed below, but that=C2=B4s an opinion with a different hat.
>=20
> WG: Please CONFIRM or DENY:
>=20
> -------
>=20
> A.- Remove definitions of PA and PI

Agree.

>=20
> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20

For the RLOC I would put modify the definition as follows:

Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
      [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
      the output of an EID-to-RLOC mapping lookup.  An EID maps to one
      or more RLOCs.  Typically, RLOCs are numbered from address blocks=20=

     assigned to a site at each point to which it attaches to the =
underlay=20
     network, as such they represent the identifiers of the underlay.
      Multiple RLOCs can be assigned to the same ETR device or to=20
      multiple ETR devices at a site.

>=20
> C.- In section 5.3, change the description of the encap/decap =
operation concerning how to deal with ECN and DSCP bits to (new text =
needs to be validated by experts):

Agree.=20

>=20
> When doing ITR/PITR encapsulation:
>=20
> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the =
case of IPv6) SHOULD be copied from the inner-header 'Time to Live' =
field.
>=20
> o  The outer-header 'Differentiated Services Code Point' (DSCP) field =
(or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied =
from the inner-header DSCP field ('Traffic Class' field, in the case of =
IPv6) considering the exception listed below.
>=20
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of =
the IPv6 'Traffic Class' field) requires special treatment in order to =
avoid discarding indications of congestion [RFC3168]. ITR encapsulation =
MUST copy the 2-bit 'ECN' field from the inner header to the outer =
header. Re-encapsulation MUST copy the 2-bit 'ECN' field from the =
stripped outer header to the new outer header.
>=20
> When doing ETR/PETR decapsulation:
>=20
>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in =
the case of IPv6) SHOULD be copied from the outer-header 'Time to Live' =
field, when the Time to Live value of the outer header is less than the =
Time to Live value of the inner header.  Failing to perform this check =
can cause the Time to Live of the inner header to increment across =
encapsulation/decapsulation cycles.  This check is also performed when =
doing initial encapsulation, when a packet comes to an ITR or PITR =
destined for a LISP site.
>=20
> o  The inner-header 'Differentiated Services Code Point' (DSCP) field =
(or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied =
from the outer-header DSCP field ('Traffic Class' field, in the case of =
IPv6) considering the exception listed below.
>=20
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of =
the IPv6 'Traffic Class' field) requires special treatment in order to =
avoid discarding indications of congestion [RFC3168]. If the 'ECN' field =
contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.  These =
requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.
>=20
> Note that if an ETR/PETR is also an ITR/PITR and chooses to =
re-encapsulate after decapsulating, the net effect of this is that the =
new outer header will carry the same Time to Live as the old outer =
header minus 1.
>=20
> Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, =
and more importantly, it provides for suppression of looping packets in =
the event there is a loop of concatenated tunnels due to =
misconfiguration.  See Section 18.3 for TTL exception handling for =
traceroute packets.
>=20
> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 =
stating that the data-plane MUST follow what=C2=B4s stored in the =
map-cache (priorities and weights), the remaining text should go to an =
OAM document.

Agree

>=20
> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D =
considering the following changes:
>=20
> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) =
and Echo-Nonce
> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3 =
(hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a =
response) and RLOC probing

Agree

>=20
>=20
> F.- Move Solicit-Map-Request to 6833bis

Agree

>=20
> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement =
Considerations), 18 (Traceroute Consideration) to a new OAM document

Agree



I would like to add a _personal_ opinion about the OAM document.
Looks like OAM is a good idea but concern has been expressed on whether =
adding a document would slow down the progress.

I do not think this will happen. OAM is just a cut&paste of existing =
text on which no technical comments on the content itself has been made.
As such creating OAM is a one hour job and since the content is stable =
text that has been reviewed extensively I do not see any issue in =
adopting the document right away (ideally in parallel with last call of =
6830bis).
After such step we check consistency with 6833bis and we last call both =
6833bis and AOM in parallel.

So no additional time.

Again, this is my personal view but I believe that is definitively =
doable.

Ciao





>=20
> =20
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp


--Apple-Mail=_87057BFB-6DD2-4161-81E7-E3AFEF2E3E39
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D"">Hi =
Albert ,<div class=3D""><br class=3D""></div><div class=3D"">you find my =
comments inline.</div><div class=3D""><br class=3D""></div><div =
class=3D"">Thanks again for your work.</div><div class=3D""><br =
class=3D""></div><div class=3D"">Ciao</div><div class=3D""><br =
class=3D""></div><div class=3D"">L.</div><div class=3D""><br =
class=3D""><div><br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D"">On 12 Jan 2018, at 17:20, Albert Cabellos &lt;<a =
href=3D"mailto:albert.cabellos@gmail.com" =
class=3D"">albert.cabellos@gmail.com</a>&gt; wrote:</div><br =
class=3D"Apple-interchange-newline"><div class=3D""><div dir=3D"ltr" =
class=3D"">Hi all<br class=3D""><br class=3D"">As editor of 6830bis I=C2=B4=
d like to confirm or deny the following changes which I believe have =
support. <br class=3D""><br class=3D"">Please note that I have =
intentionally ignored minor/editorial changes to help sync all the =
participants. I hope that the list below captures the most relevant =
ones.<div class=3D""><br class=3D""></div><div class=3D"">Also note that =
I don=C2=B4t necessarily agree with all the changes listed below, but =
that=C2=B4s an opinion with a different hat.<br class=3D""><br =
class=3D"">WG: Please CONFIRM or DENY:<div class=3D""><br =
class=3D""></div><div class=3D"">-------<br class=3D""><br class=3D"">A.- =
Remove definitions of PA and PI<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree.</div><br class=3D""><blockquote type=3D"cite"=
 class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D"">B.- Change definitions of EID =
and RLOC as =E2=80=98identifier of the overlay=E2=80=99 and =
=E2=80=98identifier of the underlay=E2=80=99 respectively.&nbsp;<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>For the RLOC I would put modify the definition as =
follows:</div><div><br class=3D""></div><div><div class=3D"">Routing =
Locator (RLOC): &nbsp; An RLOC is an IPv4 [RFC0791] or IPv6</div><div =
class=3D"">&nbsp; &nbsp; &nbsp; [RFC8200] address of an Egress Tunnel =
Router (ETR). &nbsp;An RLOC is</div><div class=3D"">&nbsp; &nbsp; &nbsp; =
the output of an EID-to-RLOC mapping lookup. &nbsp;An EID maps to =
one</div><div class=3D"">&nbsp; &nbsp; &nbsp; or more RLOCs. =
&nbsp;Typically, RLOCs are numbered from address blocks&nbsp;</div><div =
class=3D"">&nbsp; &nbsp; &nbsp;assigned to a site at each point to which =
it attaches to the underlay&nbsp;</div><div class=3D"">&nbsp; &nbsp; =
&nbsp;network, as such they represent the identifiers of the =
underlay.</div><div class=3D"">&nbsp; &nbsp; &nbsp; Multiple RLOCs can =
be assigned to the same ETR device or to&nbsp;</div><div class=3D"">&nbsp;=
 &nbsp; &nbsp; multiple ETR devices at a site.</div></div><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><div =
dir=3D"ltr" class=3D""><div class=3D""><div class=3D""><br class=3D"">C.- =
In section 5.3, change the description of the encap/decap operation =
concerning how to deal with ECN and DSCP bits to (new text needs to be =
validated by experts):<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree.&nbsp;</div><br class=3D""><blockquote =
type=3D"cite" class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D""><blockquote style=3D"margin:0 =
0 0 40px;border:none;padding:0px" class=3D"">When doing ITR/PITR =
encapsulation:<br class=3D""><br class=3D"">o &nbsp;The outer-header =
'Time to Live' field (or 'Hop Limit' field, in the case of IPv6) SHOULD =
be copied from the inner-header 'Time to Live' field.<br class=3D""><br =
class=3D"">o &nbsp;The outer-header 'Differentiated Services Code Point' =
(DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHOULD =
be copied from the inner-header DSCP field ('Traffic Class' field, in =
the case of IPv6) considering the exception listed below.<br =
class=3D""><br class=3D"">o &nbsp;The 'Explicit Congestion Notification' =
(ECN) field (bits 6 and 7 of the IPv6 'Traffic Class' field) requires =
special treatment in order to avoid discarding indications of congestion =
[RFC3168]. ITR encapsulation MUST copy the 2-bit 'ECN' field from the =
inner header to the outer header. Re-encapsulation MUST copy the 2-bit =
'ECN' field from the stripped outer header to the new outer header.<br =
class=3D""><br class=3D"">When doing ETR/PETR decapsulation:<br =
class=3D""><br class=3D"">&nbsp;o &nbsp;The inner-header 'Time to Live' =
field (or 'Hop Limit' field, in the case of IPv6) SHOULD be copied from =
the outer-header 'Time to Live' field, when the Time to Live value of =
the outer header is less than the Time to Live value of the inner =
header.&nbsp; Failing to perform this check can cause the Time to Live =
of the inner header to increment across encapsulation/decapsulation =
cycles.&nbsp; This check is also performed when doing initial =
encapsulation, when a packet comes to an ITR or PITR destined for a LISP =
site.<br class=3D""><br class=3D"">o &nbsp;The inner-header =
'Differentiated Services Code Point' (DSCP) field (or the 'Traffic =
Class' field, in the case of IPv6) SHOULD be copied from the =
outer-header DSCP field ('Traffic Class' field, in the case of IPv6) =
considering the exception listed below.<br class=3D""><br class=3D"">o =
&nbsp;The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 =
of the IPv6 'Traffic Class' field) requires special treatment in order =
to avoid discarding indications of congestion [RFC3168]. If the 'ECN' =
field contains a congestion indication codepoint (the value is '11', the =
Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy =
the 2-bit 'ECN' field from the stripped outer header to the surviving =
inner header that is used to forward the packet beyond the ETR.&nbsp; =
These requirements preserve CE indications when a packet that uses ECN =
traverses a LISP tunnel and becomes marked with a CE indication due to =
congestion between the tunnel endpoints.<br class=3D""><br class=3D"">Note=
 that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate =
after decapsulating, the net effect of this is that the new outer header =
will carry the same Time to Live as the old outer header minus 1.<br =
class=3D""><br class=3D"">Copying the Time to Live (TTL) serves two =
purposes: first, it preserves the distance the host intended the packet =
to travel; second, and more importantly, it provides for suppression of =
looping packets in the event there is a loop of concatenated tunnels due =
to misconfiguration.&nbsp; See Section 18.3 for TTL exception handling =
for traceroute packets.</blockquote><br class=3D"">D.- Simplify section =
=E2=80=98Router Locator Selection=E2=80=99 stating that the data-plane =
MUST follow what=C2=B4s stored in the map-cache (priorities and =
weights), the remaining text should go to an OAM document.<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree</div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D"">E.- Rewrite Section =E2=80=9CRou=
ting Locator Reachability=E2=80=9D considering the following changes:<br =
class=3D""><br class=3D""><blockquote style=3D"margin:0 0 0 =
40px;border:none;padding:0px" class=3D"">*&nbsp; &nbsp; Keep bullet =
point 1 (examine LSB), 6 (receiving a data-packet) and Echo-Nonce<br =
class=3D"">*&nbsp; &nbsp; Move to 6833bis bullet point 2 (ICMP =
Network/Host Unreachable),3 (hints from BGP),4 (ICMP Port Unreachable),5 =
(receive a Map-Reply as a response) and RLOC =
probing</blockquote></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree</div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D""><br class=3D"">F.- Move =
Solicit-Map-Request to 6833bis<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree</div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><div dir=3D"ltr" class=3D""><div =
class=3D""><div class=3D""><br class=3D"">G.- Move sections 16 (Mobility =
Considerations), 17 (xTR Placement Considerations), 18 (Traceroute =
Consideration) to a new OAM document<br =
class=3D""></div></div></div></div></blockquote><div><br =
class=3D""></div><div>Agree</div><div><br class=3D""></div><div><br =
class=3D""></div><div><br class=3D""></div><div>I would like to add a =
_personal_ opinion about the OAM document.</div><div>Looks like OAM is a =
good idea but concern has been expressed on whether adding a document =
would slow down the progress.</div><div><br class=3D""></div><div>I do =
not think this will happen. OAM is just a cut&amp;paste of existing text =
on which no technical comments on the content itself has been =
made.</div><div>As such creating OAM is a one hour job and since the =
content is stable text that has been reviewed extensively I do not see =
any issue in adopting the document right away (ideally in parallel with =
last call of 6830bis).</div><div>After such step we check consistency =
with 6833bis and we last call both 6833bis and AOM in =
parallel.</div><div><br class=3D""></div><div>So no additional =
time.</div><div><br class=3D""></div><div>Again, this is my personal =
view but I believe that is definitively doable.</div><div><br =
class=3D""></div><div>Ciao</div><div><br class=3D""></div><div><br =
class=3D""></div><div><br class=3D""></div><div><br class=3D""></div><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><div =
dir=3D"ltr" class=3D""><div class=3D""><div class=3D""><br =
class=3D"">&nbsp;</div></div></div>
_______________________________________________<br class=3D"">lisp =
mailing list<br class=3D""><a href=3D"mailto:lisp@ietf.org" =
class=3D"">lisp@ietf.org</a><br =
class=3D"">https://www.ietf.org/mailman/listinfo/lisp<br =
class=3D""></div></blockquote></div><br class=3D""></div></body></html>=

--Apple-Mail=_87057BFB-6DD2-4161-81E7-E3AFEF2E3E39--


From nobody Tue Jan 23 03:21:43 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 1802A12025C for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 03:21:41 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 3.101
X-Spam-Level: ***
X-Spam-Status: No, score=3.101 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, GB_SUMOF=5, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=no autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id bhIqVXewAzIV for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 03:21:23 -0800 (PST)
Received: from mail-wr0-x234.google.com (mail-wr0-x234.google.com [IPv6:2a00:1450:400c:c0c::234]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 759601200B9 for <lisp@ietf.org>; Tue, 23 Jan 2018 03:21:22 -0800 (PST)
Received: by mail-wr0-x234.google.com with SMTP id 100so141776wrb.7 for <lisp@ietf.org>; Tue, 23 Jan 2018 03:21:22 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=from:mime-version:subject:message-id:date:cc:to; bh=Mdxry1vWe75jZlJyzxU0Y9FyoekOXhBrGWmOR9hYnVg=; b=FERP+ns9wiagnaIdHxLka0nFb9hA1MXlB0Kc2y0OryKuWVNJv7EYMZmuBNVw17x0/O Er+nmCJeAU3ng8TY/Q/oTS7Bi7t+JPMUHw1Nv0tjxUET5Z/0ok2XXkvQVE/LJ39p55UB yEW5F/UPr9r5RZ4y5H3dh3YCS1IBqtG8qcbc6kk+Pfp/TqCPEr8bNPO4icv2Ao4MQMDP L5Tykqw18sPuX0Jll9BMxpR53xGkXv1yfpqLjDr1HrM60kO6uMnfvwh4JVvihMEYILMT Da2OvZQ7NXzYlT0MPEvI6I/IRtvClRLz28LYBuJCpEMELrFFdJC+l/bykR9Phxv+218P XiLA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:mime-version:subject:message-id:date:cc:to; bh=Mdxry1vWe75jZlJyzxU0Y9FyoekOXhBrGWmOR9hYnVg=; b=UEbIf6ECPBcPU+79k5COeQXILS+CtwDFSCcm70KyoN+8YEthxjYj8p+/eRrxZZsWFi tmNO6a4HnuE2AF/dny5/bsLIggoVc41ahtvhYLxzlEmU4Pu+U7MsFDiN2DdlPDcHiymJ jhzglPo/PbLju5/B8nnSb1TcR3dq1nzXQamcNhDTBpB1ACnUINLJYfiIOr78B15AUpOT RsVlXu7RMPIxH9z7DHbxBRPm0MeT5fE1FEmorZvdddB+1Z715AH6czOrbh6bOQGbWN0G MgwzikHu4p96AesmWrhrV1Om8omgkEWO25gkARMMP0rh4LUeNRDLQP4rEZ5K8eZWa+ox kZTg==
X-Gm-Message-State: AKwxyteDgu4uBUlDUmnGm+YMBGl7DXzNQIwzLqy900bJI0gWZvJeucD+ RQr4Gm5Rhl13MPRM5gioxD7X2B2acnU=
X-Google-Smtp-Source: AH8x226g4O/hWzEOjV3Gf5eEVUwdgyaPxgUpSwuk++J5g8vynC9jqNl7Yg0YjpMQ1NghhEebH3vjtQ==
X-Received: by 10.223.175.56 with SMTP id z53mr2145392wrc.9.1516706479711; Tue, 23 Jan 2018 03:21:19 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:e17e:79fa:b6db:457b? ([2001:660:330f:a4:e17e:79fa:b6db:457b]) by smtp.gmail.com with ESMTPSA id q13sm215722wrg.3.2018.01.23.03.21.18 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 23 Jan 2018 03:21:18 -0800 (PST)
From: Luigi Iannone <ggx@gigix.net>
Content-Type: multipart/alternative; boundary="Apple-Mail=_51FE3D12-393C-4C91-8721-43E1FAF44168"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Message-Id: <B46B68D9-21F9-4A34-9B41-6C30B7CDD053@gigix.net>
Date: Tue, 23 Jan 2018 12:21:17 +0100
Cc: lisp-chairs@tools.ietf.org
To: "lisp@ietf.org list" <lisp@ietf.org>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/RPStK7IT7NUfjagO4EMxRia0ba4>
Subject: [lisp] Review 6830bis -08/-09
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Jan 2018 11:21:41 -0000

--Apple-Mail=_51FE3D12-393C-4C91-8721-43E1FAF44168
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Hi,

this is my review of -08 (and -09 since one single change has been =
proposed in -09, more inline).

The number of comments is not enormous so I expect that they are all =
tracked.

Thanks

Luigi=20

> =20
>=20
>=20
>=20
>=20
>=20
> Network Working Group                                       D. =
Farinacci
> Internet-Draft                                                 V. =
Fuller
> Intended status: Standards Track                                D. =
Meyer
> Expires: July 13, 2018                                          D. =
Lewis
>                                                            Cisco =
Systems
>                                                        A. Cabellos =
(Ed.)
>                                                        =
UPC/BarcelonaTech
>                                                          January 9, =
2018
>=20
>=20
>                The Locator/ID Separation Protocol (LISP)
>                      draft-ietf-lisp-rfc6830bis-08
>=20
> Abstract
>=20
>    This document describes the data-plane protocol for the Locator/ID
>    Separation Protocol (LISP).  LISP defines two namespaces, End-point
>    Identifiers (EIDs) that identify end-hosts and Routing Locators
>    (RLOCs) that 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.
>=20
>    LISP requires no change to either host protocol stacks or to =
underlay
>    routers and offers Traffic Engineering, multihoming and mobility,
>    among other features.
>=20
> Status of This Memo
>=20
>    This Internet-Draft is submitted in full conformance with the
>    provisions of BCP 78 and BCP 79.
>=20
>    Internet-Drafts are working documents of the Internet Engineering
>    Task Force (IETF).  Note that other groups may also distribute
>    working documents as Internet-Drafts.  The list of current =
Internet-
>    Drafts is at https://datatracker.ietf.org/drafts/current/.
>=20
>    Internet-Drafts are draft documents valid for a maximum of six =
months
>    and may be updated, replaced, or obsoleted by other documents at =
any
>    time.  It is inappropriate to use Internet-Drafts as reference
>    material or to cite them other than as "work in progress."
>=20
>    This Internet-Draft will expire on July 13, 2018.
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
1]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> Copyright Notice
>=20
>    Copyright (c) 2018 IETF Trust and the persons identified as the
>    document authors.  All rights reserved.
>=20
>    This document is subject to BCP 78 and the IETF Trust's Legal
>    Provisions Relating to IETF Documents
>    (https://trustee.ietf.org/license-info) in effect on the date of
>    publication of this document.  Please review these documents
>    carefully, as they describe your rights and restrictions with =
respect
>    to this document.  Code Components extracted from this document =
must
>    include Simplified BSD License text as described in Section 4.e of
>    the Trust Legal Provisions and are provided without warranty as
>    described in the Simplified BSD License.
>=20
> Table of Contents
>=20
>    1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   =
3
>    2.  Requirements Notation . . . . . . . . . . . . . . . . . . . .   =
4
>    3.  Definition of Terms . . . . . . . . . . . . . . . . . . . . .   =
4
>    4.  Basic Overview  . . . . . . . . . . . . . . . . . . . . . . .   =
9
>      4.1.  Packet Flow Sequence  . . . . . . . . . . . . . . . . . .  =
11
>    5.  LISP Encapsulation Details  . . . . . . . . . . . . . . . . .  =
13
>      5.1.  LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  =
13
>      5.2.  LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  =
14
>      5.3.  Tunnel Header Field Descriptions  . . . . . . . . . . . .  =
15
>    6.  LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  =
19
>    7.  Dealing with Large Encapsulated Packets . . . . . . . . . . .  =
20
>      7.1.  A Stateless Solution to MTU Handling  . . . . . . . . . .  =
20
>      7.2.  A Stateful Solution to MTU Handling . . . . . . . . . . .  =
21
>    8.  Using Virtualization and Segmentation with LISP . . . . . . .  =
22
>    9.  Routing Locator Selection . . . . . . . . . . . . . . . . . .  =
23
>    10. Routing Locator Reachability  . . . . . . . . . . . . . . . .  =
24
>      10.1.  Echo Nonce Algorithm . . . . . . . . . . . . . . . . . .  =
27
>      10.2.  RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  =
28
>    11. EID Reachability within a LISP Site . . . . . . . . . . . . .  =
29
>    12. Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  =
29
>    13. Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  =
30
>      13.1.  Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  =
31
>      13.2.  Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  =
32
>      13.3.  Database Map-Versioning  . . . . . . . . . . . . . . . .  =
33
>    14. Multicast Considerations  . . . . . . . . . . . . . . . . . .  =
34
>    15. Router Performance Considerations . . . . . . . . . . . . . .  =
35
>    16. Mobility Considerations . . . . . . . . . . . . . . . . . . .  =
35
>      16.1.  Slow Mobility  . . . . . . . . . . . . . . . . . . . . .  =
36
>      16.2.  Fast Mobility  . . . . . . . . . . . . . . . . . . . . .  =
36
>      16.3.  LISP Mobile Node Mobility  . . . . . . . . . . . . . . .  =
37
>    17. LISP xTR Placement and Encapsulation Methods  . . . . . . . .  =
37
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
2]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>      17.1.  First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  =
38
>      17.2.  Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  =
39
>      17.3.  ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  =
39
>      17.4.  LISP Functionality with Conventional NATs  . . . . . . .  =
40
>      17.5.  Packets Egressing a LISP Site  . . . . . . . . . . . . .  =
40
>    18. Traceroute Considerations . . . . . . . . . . . . . . . . . .  =
40
>      18.1.  IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  =
41
>      18.2.  IPv4 Traceroute  . . . . . . . . . . . . . . . . . . . .  =
42
>      18.3.  Traceroute Using Mixed Locators  . . . . . . . . . . . .  =
42
>    19. Security Considerations . . . . . . . . . . . . . . . . . . .  =
43
>    20. Network Management Considerations . . . . . . . . . . . . . .  =
43
>    21. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  =
44
>      21.1.  LISP UDP Port Numbers  . . . . . . . . . . . . . . . . .  =
44
>    22. References  . . . . . . . . . . . . . . . . . . . . . . . . .  =
44
>      22.1.  Normative References . . . . . . . . . . . . . . . . . .  =
44
>      22.2.  Informative References . . . . . . . . . . . . . . . . .  =
45
>    Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  =
50
>    Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  =
50
>      B.1.  Changes to draft-ietf-lisp-rfc6830bis-08  . . . . . . . .  =
51
>      B.2.  Changes to draft-ietf-lisp-rfc6830bis-07  . . . . . . . .  =
51
>      B.3.  Changes to draft-ietf-lisp-rfc6830bis-06  . . . . . . . .  =
51
>      B.4.  Changes to draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  =
51
>      B.5.  Changes to draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  =
52
>      B.6.  Changes to draft-ietf-lisp-rfc6830bis-03  . . . . . . . .  =
52
>      B.7.  Changes to draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  =
52
>      B.8.  Changes to draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  =
52
>      B.9.  Changes to draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  =
52
>    Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  =
52
>=20
> 1.  Introduction
>=20
>    This document describes the Locator/Identifier Separation Protocol
>    (LISP).  LISP is an encapsulation protocol built around the
>    fundamental idea of separating the topological location of a =
network
>    attachment point from the node's identity [CHIAPPA].  As a result
>    LISP creates two namespaces: Endpoint Identifiers (EIDs), that are
>    used to identify end-hosts (e.g., nodes or Virtual Machines) and
>    routable Routing Locators (RLOCs), used to identify network
>    attachment points.  LISP then defines functions for mapping between
>    the two namespaces and for encapsulating traffic originated by
>    devices using non-routable EIDs for transport across a network
>    infrastructure that routes and forwards using RLOCs.  LISP
>    encapsulation uses a dynamic form of tunneling where no static
>    provisioning is required or necessary.
>=20
>    LISP is an overlay protocol that separates control from data-plane,
>    this document specifies the data-plane, how LISP-capable routers
>    (Tunnel Routers) exchange packets by encapsulating them to the
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
3]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    appropriate location.  Tunnel routers are equipped with a cache,
>    called map-cache, that contains EID-to-RLOC mappings.  The =
map-cache
>    is populated using the LISP Control-Plane protocol
>    [I-D.ietf-lisp-rfc6833bis].
>=20
>    LISP does not require changes to either host protocol stack or to
>    underlay routers.  By separating the EID from the RLOC space, LISP
>    offers native Traffic Engineering, multihoming and mobility, among
>    other features.
>=20
>    Creation of LISP was initially motivated by discussions during the
>    IAB-sponsored Routing and Addressing Workshop held in Amsterdam in
>    October 2006 (see [RFC4984])
>=20
>    This document specifies the LISP data-plane encapsulation and other
>    LISP forwarding node functionality while [I-D.ietf-lisp-rfc6833bis]
>    specifies the LISP control plane.  LISP deployment guidelines can =
be
>    found in [RFC7215] and [RFC6835] describes considerations for =
network
>    operational management.  Finally, [I-D.ietf-lisp-introduction]
>    describes the LISP architecture.
>=20
> 2.  Requirements Notation
>=20
>    The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
>    "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in =
this
>    document are to be interpreted as described in [RFC2119].
>=20
> 3.  Definition of Terms
>    Address Family Identifier (AFI):   AFI is a term used to describe =
an
>       address encoding in a packet.  An address family that pertains =
to
>       the data-plane.  See [AFN] and [RFC3232] for details.  An AFI
>       value of 0 used in this specification indicates an unspecified
>       encoded address where the length of the address is 0 octets
>       following the 16-bit AFI value of 0.
>=20
>    Anycast Address:  Anycast Address is a term used in this document =
to
>       refer to the same IPv4 or IPv6 address configured and used on
>       multiple systems at the same time.  An EID or RLOC can be an
>       anycast address in each of their own address spaces.
>=20
>    Client-side:  Client-side is a term used in this document to =
indicate
>       a connection initiation attempt by an EID. =20
[Luigi]
As stated for -07.
Following sentence not needed here. (it is specified in the operation =
part of the document)
> The ITR(s) at the LISP
>       site are the first to get involved in forwarding a packet from =
the
>       source EID.
>=20
>    Data-Probe:   A Data-Probe is a LISP-encapsulated data packet where
>       the inner-header destination address equals the outer-header
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
4]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       destination address used to trigger a Map-Reply by a =
decapsulating
>       ETR.  In addition, the original packet is decapsulated and
>       delivered to the destination host if the destination EID is in =
the
>       EID-Prefix range configured on the ETR.  Otherwise, the packet =
is
>       discarded.  A Data-Probe is used in some of the mapping database
>       designs to "probe" or request a Map-Reply from an ETR; in other
>       cases, Map-Requests are used.  See each mapping database design
>       for details.  When using Data-Probes, by sending Map-Requests on
>       the underlying routing system, EID-Prefixes must be advertised.
>=20
>    Egress Tunnel Router (ETR):   An ETR is a router that accepts an IP
>       packet where the destination address in the "outer" IP header is
>       one of its own RLOCs.  The router strips the "outer" header and
>       forwards the packet based on the next IP header found.  In
>       general, an ETR receives LISP-encapsulated IP packets from the
>       Internet on one side and sends decapsulated IP packets to site
>       end-systems on the other side.  ETR functionality does not have =
to
>       be limited to a router device.  A server host can be the =
endpoint
>       of a LISP tunnel as well.
>=20
>    EID-to-RLOC Database:   The EID-to-RLOC Database is a global
>       distributed database that contains all known EID-Prefix-to-RLOC
>       mappings.  Each potential ETR typically contains a small piece =
of
>       the database: the EID-to-RLOC mappings for the EID-Prefixes
>       "behind" the router.  These map to one of the router's own
>       globally visible IP addresses.  Note that there MAY be transient
>       conditions when the EID-Prefix for the site and Locator-Set for
>       each EID-Prefix may not be the same on all ETRs.  This has no
>       negative implications, since a partial set of Locators can be
>       used.
>=20
>    EID-to-RLOC Map-Cache:   The EID-to-RLOC map-cache is generally
>       short-lived, on-demand table in an ITR that stores, tracks, and =
is
>       responsible for timing out and otherwise validating EID-to-RLOC
>       mappings.  This cache is distinct from the full "database" of =
EID-
>       to-RLOC mappings; it is dynamic, local to the ITR(s), and
>       relatively small, while the database is distributed, relatively
>       static, and much more global in scope.
>=20
>    EID-Prefix:   An EID-Prefix is a power-of-two block of EIDs that =
are
>       allocated to a site by an address allocation authority.  EID-
>       Prefixes are associated with a set of RLOC addresses.  =
EID-Prefix
>       allocations can be broken up into smaller blocks when an RLOC =
set
>       is to be associated with the larger EID-Prefix block.
>=20
>    End-System:   An end-system is an IPv4 or IPv6 device that =
originates
>       packets with a single IPv4 or IPv6 header.  The end-system
>       supplies an EID value for the destination address field of the =
IP
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
5]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       header when communicating globally (i.e., outside of its routing
>       domain).  An end-system can be a host computer, a switch or =
router
>       device, or any network appliance.
>=20
>    Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
>       IPv6) value used in the source and destination address fields of
>       the first (most inner) LISP header of a packet.  The host =
obtains
>       a destination EID the same way it obtains a destination address
>       today, for example, through a Domain Name System (DNS) [RFC1034]
>       lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
>       The source EID is obtained via existing mechanisms used to set a
>       host's "local" IP address.  An EID used on the public Internet
>       must have the same properties as any other IP address used in =
that
>       manner; this means, among other things, that it must be globally
>       unique.  An EID is allocated to a host from an EID-Prefix block
>       associated with the site where the host is located.  An EID can =
be
>       used by a host to refer to other hosts.  Note that EID blocks =
MAY
>       be assigned in a hierarchical manner, independent of the network
>       topology, to facilitate scaling of the mapping database.  In
>       addition, an EID block assigned to a site MAY have site-local
>       structure (subnetting) for routing within the site; this =
structure
>       is not visible to the global routing system.  In theory, the bit
>       string that represents an EID for one device can represent an =
RLOC
>       for a different device.  When used in discussions with other
>       Locator/ID separation proposals, a LISP EID will be called an
>       "LEID".  Throughout this document, any references to "EID" refer
>       to an LEID.
>=20
>    Ingress Tunnel Router (ITR):   An ITR is a router that resides in a
>       LISP site.  Packets sent by sources inside of the LISP site to
>       destinations outside of the site are candidates for =
encapsulation
>       by the ITR.  The ITR treats the IP destination address as an EID
>       and performs an EID-to-RLOC mapping lookup.  The router then
>       prepends an "outer" IP header with one of its routable RLOCs (in
>       the RLOC space) in the source address field and the result of =
the
>       mapping lookup in the destination address field.  Note that this
>       destination RLOC MAY be an intermediate, proxy device that has
>       better knowledge of the EID-to-RLOC mapping closer to the
>       destination EID.  In general, an ITR receives IP packets from =
site
>       end-systems on one side and sends LISP-encapsulated IP packets
>       toward the Internet on the other side.
>=20
>       Specifically, when a service provider prepends a LISP header for
>       Traffic Engineering purposes, the router that does this is also
>       regarded as an ITR.  The outer RLOC the ISP ITR uses can be =
based
>       on the outer destination address (the originating ITR's supplied
>       RLOC) or the inner destination address (the originating host's
>       supplied EID).
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
6]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    LISP Header:   LISP header is a term used in this document to refer
>       to the outer IPv4 or IPv6 header, a UDP header, and a LISP-
>       specific 8-octet header that follow the UDP header and that an =
ITR
>       prepends or an ETR strips.
>=20
>    LISP Router:   A LISP router is a router that performs the =
functions
>       of any or all of the following: ITR, ETR, RTR, Proxy-ITR (PITR),
>       or Proxy-ETR (PETR).
>=20
>    LISP Site:  LISP site is a set of routers in an edge network that =
are
>       under a single technical administration.  LISP routers that =
reside
>       in the edge network are the demarcation points to separate the
>       edge network from the core network.
>=20
>    Locator-Status-Bits (LSBs):  Locator-Status-Bits are present in the
>       LISP header.  They are used by ITRs to inform ETRs about the up/
>       down status of all ETRs at the local site.  These bits are used =
as
>       a hint to convey up/down router status and not path reachability
>       status.  The LSBs can be verified by use of one of the Locator
>       reachability algorithms described in Section 10.
>=20
>    Negative Mapping Entry:   A negative mapping entry, also known as a
>       negative cache entry, is an EID-to-RLOC entry where an =
EID-Prefix
>       is advertised or stored with no RLOCs.  That is, the Locator-Set
>       for the EID-to-RLOC entry is empty or has an encoded Locator =
count
>       of 0.  This type of entry could be used to describe a prefix =
from
>       a non-LISP site, which is explicitly not in the mapping =
database.
>       There are a set of well-defined actions that are encoded in a
>       Negative Map-Reply.
>=20
>    Provider-Assigned (PA) Addresses:   PA addresses are an address =
block
>       assigned to a site by each service provider to which a site
>       connects.  Typically, each block is a sub-block of a service
>       provider Classless Inter-Domain Routing (CIDR) [RFC4632] block =
and
>       is aggregated into the larger block before being advertised into
>       the underlay network.  Traditionally, IP multihoming has been
>       implemented by each multihomed site acquiring its own globally
>       visible prefix.
>=20
>    Provider-Independent (PI) Addresses:   PI addresses are an address
>       block assigned from a pool where blocks are not associated with
>       any particular location in the network (e.g., from a particular
>       service provider) and are therefore not topologically =
aggregatable
>       in the routing system.
>=20
>    Proxy-ETR (PETR):   A PETR is defined and described in [RFC6832].  =
A
>       PETR acts like an ETR but does so on behalf of LISP sites that
>       send packets to destinations at non-LISP sites.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
7]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    Proxy-ITR (PITR):   A PITR is defined and described in [RFC6832].  =
A
>       PITR acts like an ITR but does so on behalf of non-LISP sites =
that
>       send packets to destinations at LISP sites.
>=20
>    Recursive Tunneling:   Recursive Tunneling occurs when a packet has
>       more than one LISP IP header.  Additional layers of tunneling =
MAY
>       be employed to implement Traffic Engineering or other re-routing
>       as needed.  When this is done, an additional "outer" LISP header
>       is added, and the original RLOCs are preserved in the "inner"
>       header.
>=20
>    Re-Encapsulating Tunneling Router (RTR):   An RTR acts like an ETR =
to
>       remove a LISP header, then acts as an ITR to prepend a new LISP
>       header.  This is known as Re-encapsulating Tunneling.  Doing =
this
>       allows a packet to be re-routed by the RTR without adding the
>       overhead of additional tunnel headers. =20
[Luigi]
As stated for -07.
Following sentence not needed here. (it is specified in the operation =
part of the document)
Delete from here:
> Any references to tunnels
>       in this specification refer to dynamic encapsulating tunnels; =
they
>       are never statically configured.=20
to here.
>  When using multiple mapping
>       database systems, care must be taken to not create re-
>       encapsulation loops through misconfiguration.
>=20
>    Route-Returnability:  Route-returnability is an assumption that the
>       underlying routing system will deliver packets to the =
destination.
>       When combined with a nonce that is provided by a sender and
>       returned by a receiver, this limits off-path data insertion.  A
>       route-returnability check is verified when a message is sent =
with
>       a nonce, another message is returned with the same nonce, and =
the
>       destination of the original message appears as the source of the
>       returned message.
>=20
>    Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
>       [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
>       the output of an EID-to-RLOC mapping lookup.  An EID maps to one
>       or more RLOCs.  Typically, RLOCs are numbered from aggregatable
>       blocks=20
remove =E2=80=9CAgregatable"

> that are assigned to a site at each point to which it
>       attaches to the underlay network; where the topology is defined =
by
>       the connectivity of provider networks.  Multiple RLOCs can be
>       assigned to the same ETR device or to multiple ETR devices at a
>       site.
>=20
>    Server-side:  Server-side is a term used in this document to =
indicate
>       that a connection initiation attempt is being accepted for a
>       destination EID.
>=20
>    TE-ETR:   A TE-ETR is an ETR that is deployed in a service provider
>       network that strips an outer LISP header for Traffic Engineering
>       purposes.
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
8]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    TE-ITR:   A TE-ITR is an ITR that is deployed in a service provider
>       network that prepends an additional LISP header for Traffic
>       Engineering purposes.
>=20
>    xTR:   An xTR is a reference to an ITR or ETR when direction of =
data
>       flow is not part of the context description.  "xTR" refers to =
the
>       router that is the tunnel endpoint and is used synonymously with
>       the term "Tunnel Router".  For example, "An xTR can be located =
at
>       the Customer Edge (CE) router" indicates both ITR and ETR
>       functionality at the CE router.
>=20
> 4.  Basic Overview
>=20
>    One key concept of LISP is that end-systems operate the same way =
they
>    do today.  The IP addresses that hosts use for tracking sockets and
>    connections, and for sending and receiving packets, do not change.
>    In LISP terminology, these IP addresses are called Endpoint
>    Identifiers (EIDs).
>=20
>    Routers continue to forward packets based on IP destination
>    addresses.  When a packet is LISP encapsulated, these addresses are
>    referred to as Routing Locators (RLOCs).  Most routers along a path
>    between two hosts will not change; they continue to perform =
routing/
>    forwarding lookups on the destination addresses.  For routers =
between
>    the source host and the ITR as well as routers from the ETR to the
>    destination host, the destination address is an EID.  For the =
routers
>    between the ITR and the ETR, the destination address is an RLOC.
>=20
>    Another key LISP concept is the "Tunnel Router".  A Tunnel Router
>    prepends LISP headers on host-originated packets and strips them
>    prior to final delivery to their destination.  The IP addresses in
>    this "outer header" are RLOCs.  During end-to-end packet exchange
>    between two Internet hosts, an ITR prepends a new LISP header to =
each
>    packet, and an ETR strips the new header.  The ITR performs EID-to-
>    RLOC lookups to determine the routing path to the ETR, which has =
the
>    RLOC as one of its IP addresses.
>=20
>    Some basic rules governing LISP are:
>=20
>    o  End-systems only send to addresses that are EIDs.  They don't =
know
>       that addresses are EIDs versus RLOCs but assume that packets get
>       to their intended destinations.  In a system where LISP is
>       deployed, LISP routers intercept EID-addressed packets and =
assist
>       in delivering them across the network core where EIDs cannot be
>       routed.  The procedure a host uses to send IP packets does not
>       change.
>=20
>    o  EIDs are typically IP addresses assigned to hosts.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                 [Page =
9]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    o  Other types of EID are supported by LISP, see [RFC8060] for
>       further information.

[Luigi]
As stated for -07 and discussed later: merge the three bullets above so =
to simplify the flow.
Here is the proposed single-bullet text:

o    End-systems only send to addresses that are EIDs.  EIDs are =
typically=20
      IP addresses assigned to hosts (other types of EID are supported =
by LISP,=20
      see [RFC8060] for further information). End-systems don't know
      that addresses are EIDs versus RLOCs but assume that packets get
      to their intended destinations.  In a system where LISP is
      deployed, LISP routers intercept EID-addressed packets and assist
      in delivering them across the network core where EIDs cannot be
      routed.  The procedure a host uses to send IP packets does not
      change.
>=20
>    o  LISP routers mostly deal with Routing Locator addresses.  See
>       details in Section 4.1 to clarify what is meant by "mostly".
>=20
>    o  RLOCs are always IP addresses assigned to routers, preferably
>       topologically oriented addresses from provider CIDR (Classless
>       Inter-Domain Routing) blocks.
>=20
>    o  When a router originates packets, it MAY use as a source address
>       either an EID or RLOC.  When acting as a host (e.g., when
>       terminating a transport session such as Secure SHell (SSH),
>       TELNET, or the Simple Network Management Protocol (SNMP)), it =
MAY
>       use an EID that is explicitly assigned for that purpose.  An EID
>       that identifies the router as a host MUST NOT be used as an =
RLOC;
>       an EID is only routable within the scope of a site.  A typical =
BGP
>       configuration might demonstrate this "hybrid" EID/RLOC usage =
where
>       a router could use its "host-like" EID to terminate iBGP =
sessions
>       to other routers in a site while at the same time using RLOCs to
>       terminate eBGP sessions to routers outside the site.
>=20
>    o  Packets with EIDs in them are not expected to be delivered =
end-to-
>       end in the absence of an EID-to-RLOC mapping operation.  They =
are
>       expected to be used locally for intra-site communication or to =
be
>       encapsulated for inter-site communication.
>=20
>    o  EID-Prefixes are likely to be hierarchically assigned in a =
manner
>       that is optimized for administrative convenience and to =
facilitate
>       scaling of the EID-to-RLOC mapping database.
[Luigi]
As stated for -07 the above bullet (even if modified compare to -07) is =
about scalability and should be removed.
>=20
>    o  EIDs MAY also be structured (subnetted) in a manner suitable for
>       local routing within an Autonomous System (AS).
>=20
>    An additional LISP header MAY be prepended to packets by a TE-ITR
>    when re-routing of the path for a packet is desired.  A potential
>    use-case for this would be an ISP router that needs to perform
>    Traffic Engineering for packets flowing through its network.  In =
such
>    a situation, termed "Recursive Tunneling", an ISP transit acts as =
an
>    additional ITR, and the RLOC it uses for the new prepended header
>    would be either a TE-ETR within the ISP (along an intra-ISP traffic
>    engineered path) or a TE-ETR within another ISP (an inter-ISP =
traffic
>    engineered path, where an agreement to build such a path exists).
>=20
>    In order to avoid excessive packet overhead as well as possible
>    encapsulation loops, this document recommends that a maximum of two
>    LISP headers can be prepended to a packet.  For initial LISP
>    deployments, it is assumed that two headers is sufficient, where =
the
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
10]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    first prepended header is used at a site for Location/Identity
>    separation and the second prepended header is used inside a service
>    provider for Traffic Engineering purposes.
>=20
>    Tunnel Routers can be placed fairly flexibly in a multi-AS =
topology.
>    For example, the ITR for a particular end-to-end packet exchange
>    might be the first-hop or default router within a site for the =
source
>    host.  Similarly, the ETR might be the last-hop router directly
>    connected to the destination host.  Another example, perhaps for a
>    VPN service outsourced to an ISP by a site, the ITR could be the
>    site's border router at the service provider attachment point.
>    Mixing and matching of site-operated, ISP-operated, and other =
Tunnel
>    Routers is allowed for maximum flexibility.
>=20
> 4.1.  Packet Flow Sequence
>=20
>    This section provides an example of the unicast packet flow,
>    including also control-plane information as specified in
>    [I-D.ietf-lisp-rfc6833bis].  The example also assumes the following
>    conditions:
>=20
>    o  Source host "host1.abc.example.com" is sending a packet to
>       "host2.xyz.example.com", exactly what host1 would do if the site
>       was not using LISP.
>=20
>    o  Each site is multihomed, so each Tunnel Router has an address
>       (RLOC) assigned from the service provider address block for each
>       provider to which that particular Tunnel Router is attached.
>=20
>    o  The ITR(s) and ETR(s) are directly connected to the source and
>       destination, respectively, but the source and destination can be
>       located anywhere in the LISP site.
>=20
>    o  A Map-Request is sent for an external destination when the
>       destination is not found in the forwarding table or matches a
>       default route.  Map-Requests are sent to the mapping database
>       system by using the LISP control-plane protocol documented in
>       [I-D.ietf-lisp-rfc6833bis].
>=20
>    o  Map-Replies are sent on the underlying routing system topology
>       using the [I-D.ietf-lisp-rfc6833bis] control-plane protocol.
>=20
>    Client host1.abc.example.com wants to communicate with server
>    host2.xyz.example.com:
>=20
>    1.  host1.abc.example.com wants to open a TCP connection to
>        host2.xyz.example.com.  It does a DNS lookup on
>        host2.xyz.example.com.  An A/AAAA record is returned.  This
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
11]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>        address is the destination EID.  The locally assigned address =
of
>        host1.abc.example.com is used as the source EID.  An IPv4 or =
IPv6
>        packet is built and forwarded through the LISP site as a normal
>        IP packet until it reaches a LISP ITR.
>=20
>    2.  The LISP ITR must be able to map the destination EID to an RLOC
>        of one of the ETRs at the destination site.  The specific =
method
>        used to do this is not described in this example.  See
>        [I-D.ietf-lisp-rfc6833bis] for further information.
>=20
>    3.  The ITR sends a LISP Map-Request as specified in
>        [I-D.ietf-lisp-rfc6833bis].  Map-Requests SHOULD be =
rate-limited.
>=20
>    4.  The mapping system helps forwarding the Map-Request to the
>        corresponding ETR.  When the Map-Request arrives at one of the
>        ETRs at the destination site, it will process the packet as a
>        control message.
>=20
>    5.  The ETR looks at the destination EID of the Map-Request and
>        matches it against the prefixes in the ETR's configured EID-to-
>        RLOC mapping database.  This is the list of EID-Prefixes the =
ETR
>        is supporting for the site it resides in.  If there is no =
match,
>        the Map-Request is dropped.  Otherwise, a LISP Map-Reply is
>        returned to the ITR.
>=20
>    6.  The ITR receives the Map-Reply message, parses the message (to
>        check for format validity), and stores the mapping information
>        from the packet.  This information is stored in the ITR's =
EID-to-
>        RLOC map-cache.  Note that the map-cache is an on-demand cache.
>        An ITR will manage its map-cache in such a way that optimizes =
for
>        its resource constraints.
>=20
>    7.  Subsequent packets from host1.abc.example.com to
>        host2.xyz.example.com will have a LISP header prepended by the
>        ITR using the appropriate RLOC as the LISP header destination
>        address learned from the ETR.  Note that the packet MAY be sent
>        to a different ETR than the one that returned the Map-Reply due
>        to the source site's hashing policy or the destination site's
>        Locator-Set policy.
>=20
>    8.  The ETR receives these packets directly (since the destination
>        address is one of its assigned IP addresses), checks the =
validity
>        of the addresses, strips the LISP header, and forwards packets =
to
>        the attached destination host.
>=20
>    9.  In order to defer the need for a mapping lookup in the reverse
>        direction, an ETR can OPTIONALLY create a cache entry that maps
>        the source EID (inner-header source IP address) to the source
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
12]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>        RLOC (outer-header source IP address) in a received LISP =
packet.
>        Such a cache entry is termed a "gleaned" mapping and only
>        contains a single RLOC for the EID in question.  More complete
>        information about additional RLOCs SHOULD be verified by =
sending
>        a LISP Map-Request for that EID.  Both the ITR and the ETR MAY
>        also influence the decision the other makes in selecting an =
RLOC.
>=20
> 5.  LISP Encapsulation Details
>=20
>    Since additional tunnel headers are prepended, the packet becomes
>    larger and can exceed the MTU of any link traversed from the ITR to
>    the ETR.  It is RECOMMENDED in IPv4 that packets do not get
>    fragmented as they are encapsulated by the ITR.  Instead, the =
packet
>    is dropped and an ICMP Unreachable/Fragmentation-Needed message is
>    returned to the source.
>=20
>    In the case when fragmentation is needed, this specification
>    RECOMMENDS that implementations provide support for one of the
>    proposed fragmentation and reassembly schemes.  Two existing =
schemes
>    are detailed in Section 7.
>=20
>    Since IPv4 or IPv6 addresses can be either EIDs or RLOCs, the LISP
>    architecture supports IPv4 EIDs with IPv6 RLOCs (where the inner
>    header is in IPv4 packet format and the outer header is in IPv6
>    packet format) or IPv6 EIDs with IPv4 RLOCs (where the inner header
>    is in IPv6 packet format and the outer header is in IPv4 packet
>    format).  The next sub-sections illustrate packet formats for the
>    homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4
>    combinations MUST be supported.  Additional types of EIDs are =
defined
>    in [RFC8060].
>=20
> 5.1.  LISP IPv4-in-IPv4 Header Format
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
13]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>         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
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |Version|  IHL  |    DSCP   |ECN|          Total Length         =
|
>     /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    |   |         Identification        |Flags|      Fragment Offset    =
|
>    |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    OH  |  Time to Live | Protocol =3D 17 |         Header Checksum     =
  |
>    |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    |   |                    Source Routing Locator                     =
|
>     \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      \ |                 Destination Routing Locator                   =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |       Source Port =3D xxxx      |       Dest Port =3D 4341    =
    |
>    UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      \ |           UDP Length          |        UDP Checksum           =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|
>    I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    S / |                 Instance ID/Locator-Status-Bits               =
|
>    P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |Version|  IHL  |    DSCP   |ECN|          Total Length         =
|
>     /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    |   |         Identification        |Flags|      Fragment Offset    =
|
>    |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    IH  |  Time to Live |    Protocol   |         Header Checksum       =
|
>    |   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    |   |                           Source EID                          =
|
>     \  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      \ |                         Destination EID                       =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>=20
>        IHL =3D IP-Header-Length
>=20
> 5.2.  LISP IPv6-in-IPv6 Header Format
>=20
>         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
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |Version|    DSCP   |ECN|           Flow Label                  =
|
>     /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    |   |         Payload Length        | Next Header=3D17|   Hop Limit =
  |
>    v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>        |                                                               =
|
>    O   +                                                               =
+
>    u   |                                                               =
|
>    t   +                     Source Routing Locator                    =
+
>    e   |                                                               =
|
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
14]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    r   +                                                               =
+
>        |                                                               =
|
>    H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    d   |                                                               =
|
>    r   +                                                               =
+
>        |                                                               =
|
>    ^   +                  Destination Routing Locator                  =
+
>    |   |                                                               =
|
>     \  +                                                               =
+
>      \ |                                                               =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |       Source Port =3D xxxx      |       Dest Port =3D 4341    =
    |
>    UDP =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      \ |           UDP Length          |        UDP Checksum           =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|
>    I \ =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    S / |                 Instance ID/Locator-Status-Bits               =
|
>    P   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>      / |Version|    DSCP   |ECN|           Flow Label                  =
|
>     /  =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    /   |         Payload Length        |  Next Header  |   Hop Limit   =
|
>    v   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>        |                                                               =
|
>    I   +                                                               =
+
>    n   |                                                               =
|
>    n   +                          Source EID                           =
+
>    e   |                                                               =
|
>    r   +                                                               =
+
>        |                                                               =
|
>    H   =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>    d   |                                                               =
|
>    r   +                                                               =
+
>        |                                                               =
|
>    ^   +                        Destination EID                        =
+
>    \   |                                                               =
|
>     \  +                                                               =
+
>      \ |                                                               =
|
>        =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>=20
> 5.3.  Tunnel Header Field Descriptions
>=20
>    Inner Header           (IH):  The inner header is the header on the
>       datagram received from the originating host [RFC0791] [RFC8200]
>       [RFC2474].  The source and destination IP addresses are EIDs.
>=20
>    Outer Header: (OH)  The outer header is a new header prepended by =
an
>       ITR.  The address fields contain RLOCs obtained from the ingress
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
15]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       router's EID-to-RLOC Cache.  The IP protocol number is "UDP =
(17)"
>       from [RFC0768].  The setting of the Don't Fragment (DF) bit
>       'Flags' field is according to rules listed in Sections 7.1 and
>       7.2.
>=20
>    UDP Header:  The UDP header contains an ITR selected source port =
when
>       encapsulating a packet.  See Section 12 for details on the hash
>       algorithm used to select a source port based on the 5-tuple of =
the
>       inner header.  The destination port MUST be set to the =
well-known
>       IANA-assigned port value 4341.
>=20
>    UDP Checksum:  The 'UDP Checksum' field SHOULD be transmitted as =
zero
>       by an ITR for either IPv4 [RFC0768] and IPv6 encapsulation
>       [RFC6935] [RFC6936].  When a packet with a zero UDP checksum is
>       received by an ETR, the ETR MUST accept the packet for
>       decapsulation.  When an ITR transmits a non-zero value for the =
UDP
>       checksum, it MUST send a correctly computed value in this field.
>       When an ETR receives a packet with a non-zero UDP checksum, it =
MAY
>       choose to verify the checksum value.  If it chooses to perform
>       such verification, and the verification fails, the packet MUST =
be
>       silently dropped.  If the ETR chooses not to perform the
>       verification, or performs the verification successfully, the
>       packet MUST be accepted for decapsulation.  The handling of UDP
>       zero checksums over IPv6 for all tunneling protocols, including
>       LISP, is subject to the applicability statement in [RFC6936].
>=20
>    UDP Length:  The 'UDP Length' field is set for an IPv4-encapsulated
>       packet to be the sum of the inner-header IPv4 Total Length plus
>       the UDP and LISP header lengths.  For an IPv6-encapsulated =
packet,
>       the 'UDP Length' field is the sum of the inner-header IPv6 =
Payload
>       Length, the size of the IPv6 header (40 octets), and the size of
>       the UDP and LISP headers.
>=20
>    N: The N-bit is the nonce-present bit.  When this bit is set to 1,
>       the low-order 24 bits of the first 32 bits of the LISP header
>       contain a Nonce.  See Section 10.1 for details.  Both N- and
>       V-bits MUST NOT be set in the same packet.  If they are, a
>       decapsulating ETR MUST treat the 'Nonce/Map-Version' field as
>       having a Nonce value present.
>=20
>    L: The L-bit is the 'Locator-Status-Bits' field enabled bit.  When
>       this bit is set to 1, the Locator-Status-Bits in the second
>       32 bits of the LISP header are in use.
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
16]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>      x 1 x x 0 x x x
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |                      Locator-Status-Bits                      |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>=20
>    E: The E-bit is the echo-nonce-request bit.  This bit MUST be =
ignored
>       and has no meaning when the N-bit is set to 0.  When the N-bit =
is
>       set to 1 and this bit is set to 1, an ITR is requesting that the
>       nonce value in the 'Nonce' field be echoed back in LISP-
>       encapsulated packets when the ITR is also an ETR.  See
>       Section 10.1 for details.
>=20
>    V: The V-bit is the Map-Version present bit.  When this bit is set =
to
>       1, the N-bit MUST be 0.  Refer to Section 13.3 for more details.
>       This bit indicates that the LISP header is encoded in this
>       case as:
>=20
>      0 x 0 1 x x x x
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |N|L|E|V|I|R|K|K|  Source Map-Version   |   Dest Map-Version    |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |                 Instance ID/Locator-Status-Bits               |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>=20
>    I: The I-bit is the Instance ID bit.  See Section 8 for more =
details.
>       When this bit is set to 1, the 'Locator-Status-Bits' field is
>       reduced to 8 bits and the high-order 24 bits are used as an
>       Instance ID.  If the L-bit is set to 0, then the low-order 8 =
bits
>       are transmitted as zero and ignored on receipt.  The format of =
the
>       LISP header would look like this:
>=20
>      x x x x 1 x x x
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>     |                 Instance ID                   |     LSBs      |
>     +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
>=20
>    R: The R-bit is a Reserved bit for future use.  It MUST be set to 0
>       on transmit and MUST be ignored on receipt.
>=20
>    KK:  The KK-bits are a 2-bit field used when encapsualted packets =
are
>       encrypted.  The field is set to 00 when the packet is not
>       encrypted.  See [RFC8061] for further information.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
17]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    LISP Nonce:  The LISP 'Nonce' field is a 24-bit value that is
>       randomly generated by an ITR when the N-bit is set to 1.  Nonce
>       generation algorithms are an implementation matter but are
>       required to generate different nonces when sending to different
>       destinations. =20
[Luigi]
As stated for -07: What is a destination? Should be different RLOCs, for =
clarity.
> However, the same nonce can be used for a period of
>       time to the same destination.  The nonce is also used when the
>       E-bit is set to request the nonce value to be echoed by the =
other
>       side when packets are returned.  When the E-bit is clear but the
>       N-bit is set, a remote ITR is either echoing a previously
>       requested echo-nonce or providing a random nonce.  See
>       Section 10.1 for more details.
>=20
>    LISP Locator-Status-Bits (LSBs):  When the L-bit is also set, the
>       'Locator-Status-Bits' field in the LISP header is set by an ITR =
to
>       indicate to an ETR the up/down status of the Locators in the
>       source site.  Each RLOC in a Map-Reply is assigned an ordinal
>       value from 0 to n-1 (when there are n RLOCs in a mapping entry).
>       The Locator-Status-Bits are numbered from 0 to n-1 from the =
least
>       significant bit of the field.  The field is 32 bits when the =
I-bit
>       is set to 0 and is 8 bits when the I-bit is set to 1.  When a
>       Locator-Status-Bit is set to 1, the ITR is indicating to the ETR
>       that the RLOC associated with the bit ordinal has up status.  =
See
>       Section 10 for details on how an ITR can determine the status of
>       the ETRs at the same site.  When a site has multiple =
EID-Prefixes
>       that result in multiple mappings (where each could have a
>       different Locator-Set), the Locator-Status-Bits setting in an
>       encapsulated packet MUST reflect the mapping for the EID-Prefix
>       that the inner-header source EID address matches.  If the LSB =
for
>       an anycast Locator is set to 1, then there is at least one RLOC
>       with that address, and the ETR is considered 'up'.
>=20

[Luigi]
The following part is the ECN part and as afar as I cans is the only =
change proposed in -09
(09 includes the text proposed by Albert)


>    When doing ITR/PITR encapsulation:
>=20
>    o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in
>       the case of IPv6) SHOULD be copied from the inner-header 'Time =
to
>       Live' field.
>=20
>    o  The outer-header 'Type of Service' field (or the 'Traffic Class'
>       field, in the case of IPv6) SHOULD be copied from the =
inner-header
>       'Type of Service' field (with one exception; see below).
>=20
>    When doing ETR/PETR decapsulation:
>=20
>    o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in
>       the case of IPv6) SHOULD be copied from the outer-header 'Time =
to
>       Live' field, when the Time to Live value of the outer header is
>       less than the Time to Live value of the inner header.  Failing =
to
>       perform this check can cause the Time to Live of the inner =
header
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
18]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       to increment across encapsulation/decapsulation cycles.  This
>       check is also performed when doing initial encapsulation, when a
>       packet comes to an ITR or PITR destined for a LISP site.
>=20
>    o  The inner-header 'Type of Service' field (or the 'Traffic Class'
>       field, in the case of IPv6) SHOULD be copied from the =
outer-header
>       'Type of Service' field (with one exception; see below).
>=20
>    Note that if an ETR/PETR is also an ITR/PITR and chooses to re-
>    encapsulate after decapsulating, the net effect of this is that the
>    new outer header will carry the same Time to Live as the old outer
>    header minus 1.
>=20
>    Copying the Time to Live (TTL) serves two purposes: first, it
>    preserves the distance the host intended the packet to travel;
>    second, and more importantly, it provides for suppression of =
looping
>    packets in the event there is a loop of concatenated tunnels due to
>    misconfiguration.  See Section 18.3 for TTL exception handling for
>    traceroute packets.
>=20
>    The Explicit Congestion Notification ('ECN') field occupies bits 6
>    and 7 of both the IPv4 'Type of Service' field and the IPv6 =
'Traffic
>    Class' field [RFC3168].  The 'ECN' field requires special treatment
>    in order to avoid discarding indications of congestion [RFC3168].  =
An
>    ITR/PITR encapsulation MUST copy the 2-bit 'ECN' field from the =
inner
>    header to the outer header.  Re-encapsulation MUST copy the 2-bit
>    'ECN' field from the stripped outer header to the new outer header.
>    If the 'ECN' field contains a congestion indication codepoint (the
>    value is '11', the Congestion Experienced (CE) codepoint), then =
ETR/
>    PETR decapsulation MUST copy the 2-bit 'ECN' field from the =
stripped
>    outer header to the surviving inner header that is used to forward
>    the packet beyond the ETR.  These requirements preserve CE
>    indications when a packet that uses ECN traverses a LISP tunnel and
>    becomes marked with a CE indication due to congestion between the
>    tunnel endpoints.
>=20
> 6.  LISP EID-to-RLOC Map-Cache
>=20
>    ITRs and PITRs maintain an on-demand cache, referred as LISP =
EID-to-
>    RLOC Map-Cache, that contains mappings from EID-prefixes to locator
>    sets.  The cache is used to encapsulate packets from the EID space =
to
>    the corresponding RLOC network attachment point.
>=20
>    When an ITR/PITR receives a packet from inside of the LISP site to
>    destinations outside of the site a longest-prefix match lookup of =
the
>    EID is done to the map-cache.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
19]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    When the lookup succeeds, the locator-set retrieved from the map-
>    cache is used to send the packet to the EID's topological location.
>=20
>    If the lookup fails, the ITR/PITR needs to retrieve the mapping =
using
>    the LISP control-plane protocol [I-D.ietf-lisp-rfc6833bis].  The
>    mapping is then stored in the local map-cache to forward subsequent
>    packets addressed to the same EID-prefix.
>=20
>    The map-cache is a local cache of mappings, entries are expired =
based
>    on the associated Time to live.  In addition, entries can be =
updated
>    with more current information, see Section 13 for further =
information
>    on this.  Finally, the map-cache also contains reachability
>    information about EIDs and RLOCs, and uses LISP reachability
>    information mechanisms to determine the reachability of RLOCs, see
>    Section 10 for the specific mechanisms.
>=20
> 7.  Dealing with Large Encapsulated Packets
>=20
>    This section proposes two mechanisms to deal with packets that =
exceed
>    the path MTU between the ITR and ETR.
>=20
>    It is left to the implementor to decide if the stateless or =
stateful
>    mechanism SHOULD be implemented.  Both or neither can be used, =
since
>    it is a local decision in the ITR regarding how to deal with MTU
>    issues, and sites can interoperate with differing mechanisms.
>=20
>    Both stateless and stateful mechanisms also apply to =
Re-encapsulating
>    and Recursive Tunneling, so any actions below referring to an ITR
>    also apply to a TE-ITR.
>=20
> 7.1.  A Stateless Solution to MTU Handling
>=20
>    An ITR stateless solution to handle MTU issues is described as
>    follows:
>=20
>    1.  Define H to be the size, in octets, of the outer header an ITR
>        prepends to a packet.  This includes the UDP and LISP header
>        lengths.
>=20
>    2.  Define L to be the size, in octets, of the maximum-sized packet
>        an ITR can send to an ETR without the need for the ITR or any
>        intermediate routers to fragment the packet.
>=20
>    3.  Define an architectural constant S for the maximum size of a
>        packet, in octets, an ITR MUST receive from the source so the
>        effective MTU can be met.  That is, L =3D S + H.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
20]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    When an ITR receives a packet from a site-facing interface and adds =
H
>    octets worth of encapsulation to yield a packet size greater than L
>    octets (meaning the received packet size was greater than S octets
>    from the source), it resolves the MTU issue by first splitting the
>    original packet into 2 equal-sized fragments.  A LISP header is =
then
>    prepended to each fragment.  The size of the encapsulated fragments
>    is then (S/2 + H), which is less than the ITR's estimate of the =
path
>    MTU between the ITR and its correspondent ETR.
>=20
>    When an ETR receives encapsulated fragments, it treats them as two
>    individually encapsulated packets.  It strips the LISP headers and
>    then forwards each fragment to the destination host of the
>    destination site.  The two fragments are reassembled at the
>    destination host into the single IP datagram that was originated by
>    the source host.  Note that reassembly can happen at the ETR if the
>    encapsulated packet was fragmented at or after the ITR.
>=20
>    This behavior is performed by the ITR when the source host =
originates
>    a packet with the 'DF' field of the IP header set to 0.  When the
>    'DF' field of the IP header is set to 1, or the packet is an IPv6
>    packet originated by the source host, the ITR will drop the packet
>    when the size is greater than L and send an ICMP Unreachable/
>    Fragmentation-Needed message to the source with a value of S, where =
S
>    is (L - H).
>=20
>    When the outer-header encapsulation uses an IPv4 header, an
>    implementation SHOULD set the DF bit to 1 so ETR fragment =
reassembly
>    can be avoided.  An implementation MAY set the DF bit in such =
headers
>    to 0 if it has good reason to believe there are unresolvable path =
MTU
>    issues between the sending ITR and the receiving ETR.
>=20
>    This specification RECOMMENDS that L be defined as 1500.
>=20
> 7.2.  A Stateful Solution to MTU Handling
>=20
>    An ITR stateful solution to handle MTU issues is described as =
follows
>    and was first introduced in [OPENLISP]:
>=20
>    1.  The ITR will keep state of the effective MTU for each Locator =
per
>        Map-Cache entry.  The effective MTU is what the core network =
can
>        deliver along the path between the ITR and ETR.
>=20
>    2.  When an IPv6-encapsulated packet, or an IPv4-encapsulated =
packet
>        with the DF bit set to 1, exceeds what the core network can
>        deliver, one of the intermediate routers on the path will send =
an
>        ICMP Unreachable/Fragmentation-Needed message to the ITR.  The
>        ITR will parse the ICMP message to determine which Locator is
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
21]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>        affected by the effective MTU change and then record the new
>        effective MTU value in the Map-Cache entry.
>=20
>    3.  When a packet is received by the ITR from a source inside of =
the
>        site and the size of the packet is greater than the effective =
MTU
>        stored with the Map-Cache entry associated with the destination
>        EID the packet is for, the ITR will send an ICMP Unreachable/
>        Fragmentation-Needed message back to the source.  The packet =
size
>        advertised by the ITR in the ICMP Unreachable/Fragmentation-
>        Needed message is the effective MTU minus the LISP =
encapsulation
>        length.
>=20
>    Even though this mechanism is stateful, it has advantages over the
>    stateless IP fragmentation mechanism, by not involving the
>    destination host with reassembly of ITR fragmented packets.
>=20
> 8.  Using Virtualization and Segmentation with LISP
>=20
>    There are several cases where segregation is needed at the EID =
level.
>    For instance, this is the case for deployments containing =
overlapping
>    addresses, traffic isolation policies or multi-tenant =
virtualization.
>    For these and other scenarios where segregation is needed, Instance
>    IDs are used.
>=20
>    An Instance ID can be carried in a LISP-encapsulated packet.  An =
ITR
>    that prepends a LISP header will copy a 24-bit value used by the =
LISP
>    router to uniquely identify the address space.  The value is copied
>    to the 'Instance ID' field of the LISP header, and the I-bit is set
>    to 1.
>=20
>    When an ETR decapsulates a packet, the Instance ID from the LISP
>    header is used as a table identifier to locate the forwarding table
>    to use for the inner destination EID lookup.
>=20
>    For example, an 802.1Q VLAN tag or VPN identifier could be used as =
a
>    24-bit Instance ID.  See [I-D.ietf-lisp-vpn] for LISP VPN use-case
>    details.
>=20
>    The Instance ID that is stored in the mapping database when =
LISP-DDT
>    [RFC8111] is used is 32 bits in length.  That means the =
control-plane
>    can store more instances than a given data-plane can use.  Multiple
>    data-planes can use the same 32-bit space as long as the low-order =
24
>    bits don't overlap among xTRs.
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
22]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> 9.  Routing Locator Selection=20
[Luigi]
As stated for -07:

Large part of this section is about control plane issues and as such =
should be put in 6833bis.

What this section should state is that priority and weight are used to =
select the RLOC to use.
Only exception is gleaning where we have one single RLOC and we do not =
know neither priority nor weight.

All the other operational discussion goes elsewhere, but not in this =
document.


>    Both the client-side and server-side MAY need control over the
>    selection of RLOCs for conversations between them.  This control is
>    achieved by manipulating the 'Priority' and 'Weight' fields in EID-
>    to-RLOC Map-Reply messages.  Alternatively, RLOC information MAY be
>    gleaned from received tunneled packets or EID-to-RLOC Map-Request
>    messages.
>=20
>    The following are different scenarios for choosing RLOCs and the
>    controls that are available:
>=20
>    o  The server-side returns one RLOC.  The client-side can only use
>       one RLOC.  The server-side has complete control of the =
selection.
>=20
>    o  The server-side returns a list of RLOCs where a subset of the =
list
>       has the same best Priority.  The client can only use the subset
>       list according to the weighting assigned by the server-side.  In
>       this case, the server-side controls both the subset list and =
load-
>       splitting across its members.  The client-side can use RLOCs
>       outside of the subset list if it determines that the subset list
>       is unreachable (unless RLOCs are set to a Priority of 255).  =
Some
>       sharing of control exists: the server-side determines the
>       destination RLOC list and load distribution while the =
client-side
>       has the option of using alternatives to this list if RLOCs in =
the
>       list are unreachable.
>=20
>    o  The server-side sets a Weight of 0 for the RLOC subset list.  In
>       this case, the client-side can choose how the traffic load is
>       spread across the subset list.  Control is shared by the server-
>       side determining the list and the client determining load
>       distribution.  Again, the client can use alternative RLOCs if =
the
>       server-provided list of RLOCs is unreachable.
>=20
>    o  Either side (more likely the server-side ETR) decides not to =
send
>       a Map-Request.  For example, if the server-side ETR does not =
send
>       Map-Requests, it gleans RLOCs from the client-side ITR, giving =
the
>       client-side ITR responsibility for bidirectional RLOC =
reachability
>       and preferability.  Server-side ETR gleaning of the client-side
>       ITR RLOC is done by caching the inner-header source EID and the
>       outer-header source RLOC of received packets.  The client-side =
ITR
>       controls how traffic is returned and can alternate using an =
outer-
>       header source RLOC, which then can be added to the list the
>       server-side ETR uses to return traffic.  Since no Priority or
>       Weights are provided using this method, the server-side ETR MUST
>       assume that each client-side ITR RLOC uses the same best =
Priority
>       with a Weight of zero.  In addition, since EID-Prefix encoding
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
23]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       cannot be conveyed in data packets, the EID-to-RLOC Cache on
>       Tunnel Routers can grow to be very large.
>=20
>    o  A "gleaned" Map-Cache entry, one learned from the source RLOC of =
a
>       received encapsulated packet, is only stored and used for a few
>       seconds, pending verification.  Verification is performed by
>       sending a Map-Request to the source EID (the inner-header IP
>       source address) of the received encapsulated packet.  A reply to
>       this "verifying Map-Request" is used to fully populate the Map-
>       Cache entry for the "gleaned" EID and is stored and used for the
>       time indicated from the 'TTL' field of a received Map-Reply.  =
When
>       a verified Map-Cache entry is stored, data gleaning no longer
>       occurs for subsequent packets that have a source EID that =
matches
>       the EID-Prefix of the verified entry.  This "gleaning" mechanism
>       is OPTIONAL.
>=20
>    RLOCs that appear in EID-to-RLOC Map-Reply messages are assumed to =
be
>    reachable when the R-bit for the Locator record is set to 1.  When
>    the R-bit is set to 0, an ITR or PITR MUST NOT encapsulate to the
>    RLOC.  Neither the information contained in a Map-Reply nor that
>    stored in the mapping database system provides reachability
>    information for RLOCs.  Note that reachability is not part of the
>    mapping system and is determined using one or more of the Routing
>    Locator reachability algorithms described in the next section.
>=20
> 10.  Routing Locator Reachability
>=20
>    Several mechanisms for determining RLOC reachability are currently
>    defined:
[Luigi]
As stated for -07:

There exists data-plane based reachability mechanisms and control plane =
reachability mechanisms.
We have to keep here only the data plane based mechanism and move the =
other in 6833bis.

We need to keep: 1, 6, Echo-Nonce,=20

We need to move: 2, 3, 4, 5,  RLOC-Probing


>=20
>    1.  An ETR MAY examine the Locator-Status-Bits in the LISP header =
of
>        an encapsulated data packet received from an ITR.  If the ETR =
is
>        also acting as an ITR and has traffic to return to the original
>        ITR site, it can use this status information to help select an
>        RLOC.
>=20
>    2.  An ITR MAY receive an ICMP Network Unreachable or Host
>        Unreachable message for an RLOC it is using.  This indicates =
that
>        the RLOC is likely down.  Note that trusting ICMP messages may
>        not be desirable, but neither is ignoring them completely.
>        Implementations are encouraged to follow current best practices
>        in treating these conditions.
>=20
>    3.  An ITR that participates in the global routing system can
>        determine that an RLOC is down if no BGP Routing Information =
Base
>        (RIB) route exists that matches the RLOC IP address.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
24]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    4.  An ITR MAY receive an ICMP Port Unreachable message from a
>        destination host.  This occurs if an ITR attempts to use
>        interworking [RFC6832] and LISP-encapsulated data is sent to a
>        non-LISP-capable site.
>=20
>    5.  An ITR MAY receive a Map-Reply from an ETR in response to a
>        previously sent Map-Request.  The RLOC source of the Map-Reply =
is
>        likely up, since the ETR was able to send the Map-Reply to the
>        ITR.
>=20
>    6.  When an ETR receives an encapsulated packet from an ITR, the
>        source RLOC from the outer header of the packet is likely up.
>=20
>    7.  An ITR/ETR pair can use the Locator reachability algorithms
>        described in this section, namely Echo-Noncing or RLOC-Probing.
>=20
>    When determining Locator up/down reachability by examining the
>    Locator-Status-Bits from the LISP-encapsulated data packet, an ETR
>    will receive up-to-date status from an encapsulating ITR about
>    reachability for all ETRs at the site.  CE-based ITRs at the source
>    site can determine reachability relative to each other using the =
site
>    IGP as follows:
>=20
>    o  Under normal circumstances, each ITR will advertise a default
>       route into the site IGP.
>=20
>    o  If an ITR fails or if the upstream link to its PE fails, its
>       default route will either time out or be withdrawn.
>=20
>    Each ITR can thus observe the presence or lack of a default route
>    originated by the others to determine the Locator-Status-Bits it =
sets
>    for them.
>=20
>    RLOCs listed in a Map-Reply are numbered with ordinals 0 to n-1.  =
The
>    Locator-Status-Bits in a LISP-encapsulated packet are numbered from =
0
>    to n-1 starting with the least significant bit.  For example, if an
>    RLOC listed in the 3rd position of the Map-Reply goes down (ordinal
>    value 2), then all ITRs at the site will clear the 3rd least
>    significant bit (xxxx x0xx) of the 'Locator-Status-Bits' field for
>    the packets they encapsulate.
>=20
>    When an ETR decapsulates a packet, it will check for any change in
>    the 'Locator-Status-Bits' field.  When a bit goes from 1 to 0, the
>    ETR, if acting also as an ITR, will refrain from encapsulating
>    packets to an RLOC that is indicated as down.  It will only resume
>    using that RLOC if the corresponding Locator-Status-Bit returns to =
a
>    value of 1.  Locator-Status-Bits are associated with a Locator-Set
>    per EID-Prefix.  Therefore, when a Locator becomes unreachable, the
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
25]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    Locator-Status-Bit that corresponds to that Locator's position in =
the
>    list returned by the last Map-Reply will be set to zero for that
>    particular EID-Prefix.  Refer to Section 19 for security related
>    issues regarding Locator-Status-Bits.
>=20
>    When ITRs at the site are not deployed in CE routers, the IGP can
>    still be used to determine the reachability of Locators, provided
>    they are injected into the IGP.  This is typically done when a /32
>    address is configured on a loopback interface.
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.


>    When ITRs receive ICMP Network Unreachable or Host Unreachable
>    messages as a method to determine unreachability, they will refrain
>    from using Locators that are described in Locator lists of Map-
>    Replies.  However, using this approach is unreliable because many
>    network operators turn off generation of ICMP Destination =
Unreachable
>    messages.
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>    If an ITR does receive an ICMP Network Unreachable or Host
>    Unreachable message, it MAY originate its own ICMP Destination
>    Unreachable message destined for the host that originated the data
>    packet the ITR encapsulated.
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>    Also, BGP-enabled ITRs can unilaterally examine the RIB to see if a
>    locator address from a Locator-Set in a mapping entry matches a
>    prefix.  If it does not find one and BGP is running in the Default-
>    Free Zone (DFZ), it can decide to not use the Locator even though =
the
>    Locator-Status-Bits indicate that the Locator is up.  In this case,
>    the path from the ITR to the ETR that is assigned the Locator is =
not
>    available.  More details are in [I-D.meyer-loc-id-implications].
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>    Optionally, an ITR can send a Map-Request to a Locator, and if a =
Map-
>    Reply is returned, reachability of the Locator has been determined.
>    Obviously, sending such probes increases the number of control
>    messages originated by Tunnel Routers for active flows, so Locators
>    are assumed to be reachable when they are advertised.
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>    This assumption does create a dependency: Locator unreachability is
>    detected by the receipt of ICMP Host Unreachable messages.  When a
>    Locator has been determined to be unreachable, it is not used for
>    active traffic; this is the same as if it were listed in a =
Map-Reply
>    with Priority 255.
>=20
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>    The ITR can test the reachability of the unreachable Locator by
>    sending periodic Requests.  Both Requests and Replies MUST be rate-
>    limited.  Locator reachability testing is never done with data
>    packets, since that increases the risk of packet loss for =
end-to-end
>    sessions.
[Luigi]
As stated for -07: The above paragraph has to move to 6833bis.

>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
26]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    When an ETR decapsulates a packet, it knows that it is reachable =
from
>    the encapsulating ITR because that is how the packet arrived.  In
>    most cases, the ETR can also reach the ITR but cannot assume this =
to
>    be true, due to the possibility of path asymmetry.  In the presence
>    of unidirectional traffic flow from an ITR to an ETR, the ITR =
SHOULD
>    NOT use the lack of return traffic as an indication that the ETR is
>    unreachable.  Instead, it MUST use an alternate mechanism to
>    determine reachability.
>=20
> 10.1.  Echo Nonce Algorithm
>=20
>    When data flows bidirectionally between Locators from different
>    sites, a data-plane mechanism called "nonce echoing" can be used to
>    determine reachability between an ITR and ETR.  When an ITR wants =
to
>    solicit a nonce echo, it sets the N- and E-bits and places a 24-bit
>    nonce [RFC4086] in the LISP header of the next encapsulated data
>    packet.
>=20
>    When this packet is received by the ETR, the encapsulated packet is
>    forwarded as normal.  When the ETR next sends a data packet to the
>    ITR, it includes the nonce received earlier with the N-bit set and
>    E-bit cleared.  The ITR sees this "echoed nonce" and knows that the
>    path to and from the ETR is up.
>=20
>    The ITR will set the E-bit and N-bit for every packet it sends =
while
>    in the echo-nonce-request state.  The time the ITR waits to process
>    the echoed nonce before it determines the path is unreachable is
>    variable and is a choice left for the implementation.
>=20
>    If the ITR is receiving packets from the ETR but does not see the
>    nonce echoed while being in the echo-nonce-request state, then the
>    path to the ETR is unreachable.  This decision MAY be overridden by
>    other Locator reachability algorithms.  Once the ITR determines =
that
>    the path to the ETR is down, it can switch to another Locator for
>    that EID-Prefix.
>=20
>    Note that "ITR" and "ETR" are relative terms here.  Both devices =
MUST
>    be implementing both ITR and ETR functionality for the echo nonce
>    mechanism to operate.
>=20
>    The ITR and ETR MAY both go into the echo-nonce-request state at =
the
>    same time.  The number of packets sent or the time during which =
echo
>    nonce requests are sent is an implementation-specific setting.
>    However, when an ITR is in the echo-nonce-request state, it can =
echo
>    the ETR's nonce in the next set of packets that it encapsulates and
>    subsequently continue sending echo-nonce-request packets.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
27]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    This mechanism does not completely solve the forward path
>    reachability problem, as traffic may be unidirectional.  That is, =
the
>    ETR receiving traffic at a site MAY not be the same device as an =
ITR
>    that transmits traffic from that site, or the site-to-site traffic =
is
>    unidirectional so there is no ITR returning traffic.
>=20
>    The echo-nonce algorithm is bilateral.  That is, if one side sets =
the
>    E-bit and the other side is not enabled for echo-noncing, then the
>    echoing of the nonce does not occur and the requesting side may
>    erroneously consider the Locator unreachable.  An ITR SHOULD only =
set
>    the E-bit in an encapsulated data packet when it knows the ETR is
>    enabled for echo-noncing.  This is conveyed by the E-bit in the =
RLOC-
>    probe Map-Reply message.
>=20
>    Note other Locator Reachability mechanisms can be used to =
compliment
>    or even override the echo nonce algorithm.  See the next section =
for
>    an example of control-plane probing.
>=20
> 10.2.  RLOC-Probing Algorithm

[Luigi]
As stated for -07: This whole section has to go to 6833bis..

The fact that (P)ITRs use this mechanism does make it a data-plane =
mechanism. is the LISP control plane running on (P)ITRs that does it, =
using control plane messages.
>=20
>    RLOC-Probing is a method that an ITR or PITR can use to determine =
the
>    reachability status of one or more Locators that it has cached in a
>    Map-Cache entry.  The probe-bit of the Map-Request and Map-Reply
>    messages is used for RLOC-Probing.
>=20
>    RLOC-Probing is done in the control plane on a timer basis, where =
an
>    ITR or PITR will originate a Map-Request destined to a locator
>    address from one of its own locator addresses.  A Map-Request used =
as
>    an RLOC-probe is NOT encapsulated and NOT sent to a Map-Server or =
to
>    the mapping database system as one would when soliciting mapping
>    data.  The EID record encoded in the Map-Request is the EID-Prefix =
of
>    the Map-Cache entry cached by the ITR or PITR.  The ITR MAY include =
a
>    mapping data record for its own database mapping information that
>    contains the local EID-Prefixes and RLOCs for its site.  =
RLOC-probes
>    are sent periodically using a jittered timer interval.
>=20
>    When an ETR receives a Map-Request message with the probe-bit set, =
it
>    returns a Map-Reply with the probe-bit set.  The source address of
>    the Map-Reply is set according to the procedure described in
>    [I-D.ietf-lisp-rfc6833bis].  The Map-Reply SHOULD contain mapping
>    data for the EID-Prefix contained in the Map-Request.  This =
provides
>    the opportunity for the ITR or PITR that sent the RLOC-probe to get
>    mapping updates if there were changes to the ETR's database mapping
>    entries.
>=20
>    There are advantages and disadvantages of RLOC-Probing.  The =
greatest
>    benefit of RLOC-Probing is that it can handle many failure =
scenarios
>    allowing the ITR to determine when the path to a specific Locator =
is
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
28]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    reachable or has become unreachable, thus providing a robust
>    mechanism for switching to using another Locator from the cached
>    Locator.  RLOC-Probing can also provide rough Round-Trip Time (RTT)
>    estimates between a pair of Locators, which can be useful for =
network
>    management purposes as well as for selecting low delay paths.  The
>    major disadvantage of RLOC-Probing is in the number of control
>    messages required and the amount of bandwidth used to obtain those
>    benefits, especially if the requirement for failure detection times
>    is very small.
>=20
> 11.  EID Reachability within a LISP Site
>=20
>    A site MAY be multihomed using two or more ETRs.  The hosts and
>    infrastructure within a site will be addressed using one or more =
EID-
>    Prefixes that are mapped to the RLOCs of the relevant ETRs in the
>    mapping system.  One possible failure mode is for an ETR to lose
>    reachability to one or more of the EID-Prefixes within its own =
site.
>    When this occurs when the ETR sends Map-Replies, it can clear the
>    R-bit associated with its own Locator.  And when the ETR is also an
>    ITR, it can clear its Locator-Status-Bit in the encapsulation data
>    header.
>=20
>    It is recognized that there are no simple solutions to the site
>    partitioning problem because it is hard to know which part of the
>    EID-Prefix range is partitioned and which Locators can reach any =
sub-
>    ranges of the EID-Prefixes.  Note that this is not a new problem
>    introduced by the LISP architecture.  The problem exists today when =
a
>    multihomed site uses BGP to advertise its reachability upstream.
>=20
> 12.  Routing Locator Hashing
>=20
>    When an ETR provides an EID-to-RLOC mapping in a Map-Reply message
>    that is stored in the map-cache of a requesting ITR, the =
Locator-Set
>    for the EID-Prefix MAY contain different Priority and Weight values
>    for each locator address.  When more than one best Priority Locator
>    exists, the ITR can decide how to load-share traffic against the
>    corresponding Locators.
>=20
>    The following hash algorithm MAY be used by an ITR to select a
>    Locator for a packet destined to an EID for the EID-to-RLOC =
mapping:
>=20
>    1.  Either a source and destination address hash or the traditional
>        5-tuple hash can be used.  The traditional 5-tuple hash =
includes
>        the source and destination addresses; source and destination =
TCP,
>        UDP, or Stream Control Transmission Protocol (SCTP) port =
numbers;
>        and the IP protocol number field or IPv6 next-protocol fields =
of
>        a packet that a host originates from within a LISP site.  When =
a
>        packet is not a TCP, UDP, or SCTP packet, the source and
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
29]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>        destination addresses only from the header are used to compute
>        the hash.
>=20
>    2.  Take the hash value and divide it by the number of Locators
>        stored in the Locator-Set for the EID-to-RLOC mapping.
>=20
>    3.  The remainder will yield a value of 0 to "number of Locators
>        minus 1".  Use the remainder to select the Locator in the
>        Locator-Set.
>=20
>    Note that when a packet is LISP encapsulated, the source port =
number
>    in the outer UDP header needs to be set.  Selecting a hashed value
>    allows core routers that are attached to Link Aggregation Groups
>    (LAGs) to load-split the encapsulated packets across member links =
of
>    such LAGs.  Otherwise, core routers would see a single flow, since
>    packets have a source address of the ITR, for packets that are
>    originated by different EIDs at the source site.  A suggested =
setting
>    for the source port number computed by an ITR is a 5-tuple hash
>    function on the inner header, as described above.
>=20
>    Many core router implementations use a 5-tuple hash to decide how =
to
>    balance packet load across members of a LAG.  The 5-tuple hash
>    includes the source and destination addresses of the packet and the
>    source and destination ports when the protocol number in the packet
>    is TCP or UDP.  For this reason, UDP encoding is used for LISP
>    encapsulation.
>=20
> 13.  Changing the Contents of EID-to-RLOC Mappings
[Luigi]
As stated for -07:

This is a control plane issue, as such it has to go in 6833bis, with two =
exception:
The very first paragraph stetting the problem, and the versioning =
subsection, because it is a data-plane mechanism.
>=20
>    Since the LISP architecture uses a caching scheme to retrieve and
>    store EID-to-RLOC mappings, the only way an ITR can get a more =
up-to-
>    date mapping is to re-request the mapping.  However, the ITRs do =
not
>    know when the mappings change, and the ETRs do not keep track of
>    which ITRs requested its mappings.  For scalability reasons, it is
>    desirable to maintain this approach but need to provide a way for
>    ETRs to change their mappings and inform the sites that are =
currently
>    communicating with the ETR site using such mappings.
>=20
>    When adding a new Locator record in lexicographic order to the end =
of
>    a Locator-Set, it is easy to update mappings.  We assume that new
>    mappings will maintain the same Locator ordering as the old mapping
>    but will just have new Locators appended to the end of the list.  =
So,
>    some ITRs can have a new mapping while other ITRs have only an old
>    mapping that is used until they time out.  When an ITR has only an
>    old mapping but detects bits set in the Locator-Status-Bits that
>    correspond to Locators beyond the list it has cached, it simply
>    ignores them.  However, this can only happen for locator addresses
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
30]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    that are lexicographically greater than the locator addresses in =
the
>    existing Locator-Set.
>=20
>    When a Locator record is inserted in the middle of a Locator-Set, =
to
>    maintain lexicographic order, the SMR procedure in Section 13.2 is
>    used to inform ITRs and PITRs of the new Locator-Status-Bit =
mappings.
>=20
>    When a Locator record is removed from a Locator-Set, ITRs that have
>    the mapping cached will not use the removed Locator because the =
xTRs
>    will set the Locator-Status-Bit to 0.  So, even if the Locator is =
in
>    the list, it will not be used.  For new mapping requests, the xTRs
>    can set the Locator AFI to 0 (indicating an unspecified address), =
as
>    well as setting the corresponding Locator-Status-Bit to 0.  This
>    forces ITRs with old or new mappings to avoid using the removed
>    Locator.
>=20
>    If many changes occur to a mapping over a long period of time, one
>    will find empty record slots in the middle of the Locator-Set and =
new
>    records appended to the Locator-Set. At some point, it would be
>    useful to compact the Locator-Set so the Locator-Status-Bit =
settings
>    can be efficiently packed.
>=20
>    We propose here three approaches for Locator-Set compaction: one
>    operational mechanism and two protocol mechanisms.  The operational
>    approach uses a clock sweep method.  The protocol approaches use =
the
>    concept of Solicit-Map-Requests and Map-Versioning.
>=20
> 13.1.  Clock Sweep
>=20
>    The clock sweep approach uses planning in advance and the use of
>    count-down TTLs to time out mappings that have already been cached.
>    The default setting for an EID-to-RLOC mapping TTL is 24 hours.  =
So,
>    there is a 24-hour window to time out old mappings.  The following
>    clock sweep procedure is used:
>=20
>    1.  24 hours before a mapping change is to take effect, a network
>        administrator configures the ETRs at a site to start the clock
>        sweep window.
>=20
>    2.  During the clock sweep window, ETRs continue to send Map-Reply
>        messages with the current (unchanged) mapping records.  The TTL
>        for these mappings is set to 1 hour.
>=20
>    3.  24 hours later, all previous cache entries will have timed out,
>        and any active cache entries will time out within 1 hour.  =
During
>        this 1-hour window, the ETRs continue to send Map-Reply =
messages
>        with the current (unchanged) mapping records with the TTL set =
to
>        1 minute.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
31]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    4.  At the end of the 1-hour window, the ETRs will send Map-Reply
>        messages with the new (changed) mapping records.  So, any =
active
>        caches can get the new mapping contents right away if not =
cached,
>        or in 1 minute if they had the mapping cached.  The new =
mappings
>        are cached with a TTL equal to the TTL in the Map-Reply.
>=20
> 13.2.  Solicit-Map-Request (SMR)
>=20
>    Soliciting a Map-Request is a selective way for ETRs, at the site
>    where mappings change, to control the rate they receive requests =
for
>    Map-Reply messages.  SMRs are also used to tell remote ITRs to =
update
>    the mappings they have cached.
>=20
>    Since the ETRs don't keep track of remote ITRs that have cached =
their
>    mappings, they do not know which ITRs need to have their mappings
>    updated.  As a result, an ETR will solicit Map-Requests (called an
>    SMR message) from those sites to which it has been sending
>    encapsulated data for the last minute.  In particular, an ETR will
>    send an SMR to an ITR to which it has recently sent encapsulated
>    data.  This can only occur when both ITR and ETR functionality =
reside
>    in the same router.
>=20
>    An SMR message is simply a bit set in a Map-Request message.  An =
ITR
>    or PITR will send a Map-Request when they receive an SMR message.
>    Both the SMR sender and the Map-Request responder MUST rate-limit
>    these messages.  Rate-limiting can be implemented as a global rate-
>    limiter or one rate-limiter per SMR destination.
>=20
>    The following procedure shows how an SMR exchange occurs when a =
site
>    is doing Locator-Set compaction for an EID-to-RLOC mapping:
>=20
>    1.  When the database mappings in an ETR change, the ETRs at the =
site
>        begin to send Map-Requests with the SMR bit set for each =
Locator
>        in each Map-Cache entry the ETR caches.
>=20
>    2.  A remote ITR that receives the SMR message will schedule =
sending
>        a Map-Request message to the source locator address of the SMR
>        message or to the mapping database system.  A newly allocated
>        random nonce is selected, and the EID-Prefix used is the one
>        copied from the SMR message.  If the source Locator is the only
>        Locator in the cached Locator-Set, the remote ITR SHOULD send a
>        Map-Request to the database mapping system just in case the
>        single Locator has changed and may no longer be reachable to
>        accept the Map-Request.
>=20
>    3.  The remote ITR MUST rate-limit the Map-Request until it gets a
>        Map-Reply while continuing to use the cached mapping.  When
>        Map-Versioning as described in Section 13.3 is used, an SMR
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
32]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>        sender can detect if an ITR is using the most up-to-date =
database
>        mapping.
>=20
>    4.  The ETRs at the site with the changed mapping will reply to the
>        Map-Request with a Map-Reply message that has a nonce from the
>        SMR-invoked Map-Request.  The Map-Reply messages SHOULD be =
rate-
>        limited.  This is important to avoid Map-Reply implosion.
>=20
>    5.  The ETRs at the site with the changed mapping record the fact
>        that the site that sent the Map-Request has received the new
>        mapping data in the Map-Cache entry for the remote site so the
>        Locator-Status-Bits are reflective of the new mapping for =
packets
>        going to the remote site.  The ETR then stops sending SMR
>        messages.
>=20
>    For security reasons, an ITR MUST NOT process unsolicited Map-
>    Replies.  To avoid Map-Cache entry corruption by a third party, a
>    sender of an SMR-based Map-Request MUST be verified.  If an ITR
>    receives an SMR-based Map-Request and the source is not in the
>    Locator-Set for the stored Map-Cache entry, then the responding =
Map-
>    Request MUST be sent with an EID destination to the mapping =
database
>    system.  Since the mapping database system is a more secure way to
>    reach an authoritative ETR, it will deliver the Map-Request to the
>    authoritative source of the mapping data.
>=20
>    When an ITR receives an SMR-based Map-Request for which it does not
>    have a cached mapping for the EID in the SMR message, it may not =
send
>    an SMR-invoked Map-Request.  This scenario can occur when an ETR
>    sends SMR messages to all Locators in the Locator-Set it has stored
>    in its map-cache but the remote ITRs that receive the SMR may not =
be
>    sending packets to the site.  There is no point in updating the =
ITRs
>    until they need to send, in which case they will send Map-Requests =
to
>    obtain a Map-Cache entry.
>=20
> 13.3.  Database Map-Versioning
>=20
>    When there is unidirectional packet flow between an ITR and ETR, =
and
>    the EID-to-RLOC mappings change on the ETR, it needs to inform the
>    ITR so encapsulation to a removed Locator can stop and can instead =
be
>    started to a new Locator in the Locator-Set.
>=20
>    An ETR, when it sends Map-Reply messages, conveys its own =
Map-Version
>    Number.  This is known as the Destination Map-Version Number.  ITRs
>    include the Destination Map-Version Number in packets they
>    encapsulate to the site.  When an ETR decapsulates a packet and
>    detects that the Destination Map-Version Number is less than the
>    current version for its mapping, the SMR procedure described in
>    Section 13.2 occurs.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
33]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    An ITR, when it encapsulates packets to ETRs, can convey its own =
Map-
>    Version Number.  This is known as the Source Map-Version Number.
>    When an ETR decapsulates a packet and detects that the Source Map-
>    Version Number is greater than the last Map-Version Number sent in =
a
>    Map-Reply from the ITR's site, the ETR will send a Map-Request to =
one
>    of the ETRs for the source site.
>=20
>    A Map-Version Number is used as a sequence number per EID-Prefix, =
so
>    values that are greater are considered to be more recent.  A value =
of
>    0 for the Source Map-Version Number or the Destination Map-Version
>    Number conveys no versioning information, and an ITR does no
>    comparison with previously received Map-Version Numbers.
>=20
>    A Map-Version Number can be included in Map-Register messages as
>    well.  This is a good way for the Map-Server to assure that all =
ETRs
>    for a site registering to it will be synchronized according to Map-
>    Version Number.
>=20
>    See [RFC6834] for a more detailed analysis and description of
>    Database Map-Versioning.
>=20
> 14.  Multicast Considerations
>=20
>    A multicast group address, as defined in the original Internet
>    architecture, is an identifier of a grouping of topologically
>    independent receiver host locations.  The address encoding itself
>    does not determine the location of the receiver(s).  The multicast
>    routing protocol, and the network-based state the protocol creates,
>    determine where the receivers are located.
>=20
>    In the context of LISP, a multicast group address is both an EID =
and
>    a Routing Locator.  Therefore, no specific semantic or action needs
>    to be taken for a destination address, as it would appear in an IP
>    header.  Therefore, a group address that appears in an inner IP
>    header built by a source host will be used as the destination EID.
>    The outer IP header (the destination Routing Locator address),
>    prepended by a LISP router, can use the same group address as the
>    destination Routing Locator, use a multicast or unicast Routing
>    Locator obtained from a Mapping System lookup, or use other means =
to
>    determine the group address mapping.
>=20
>    With respect to the source Routing Locator address, the ITR =
prepends
>    its own IP address as the source address of the outer IP header.
>    Just like it would if the destination EID was a unicast address.
>    This source Routing Locator address, like any other Routing Locator
>    address, MUST be globally routable.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
34]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    There are two approaches for LISP-Multicast, one that uses native
>    multicast routing in the underlay with no support from the Mapping
>    System and the other that uses only unicast routing in the underlay
>    with support from the Mapping System.  See [RFC6831] and
>    [I-D.ietf-lisp-signal-free-multicast], respectively, for details.
>    Details for LISP-Multicast and interworking with non-LISP sites are
>    described in [RFC6831] and [RFC6832].
>=20
> 15.  Router Performance Considerations
>=20
>    LISP is designed to be very "hardware-based forwarding friendly".  =
A
>    few implementation techniques can be used to incrementally =
implement
>    LISP:
>=20
>    o  When a tunnel-encapsulated packet is received by an ETR, the =
outer
>       destination address may not be the address of the router.  This
>       makes it challenging for the control plane to get packets from =
the
>       hardware.  This may be mitigated by creating special Forwarding
>       Information Base (FIB) entries for the EID-Prefixes of EIDs =
served
>       by the ETR (those for which the router provides an RLOC
>       translation).  These FIB entries are marked with a flag =
indicating
>       that control-plane processing SHOULD be performed.  The =
forwarding
>       logic of testing for particular IP protocol number values is not
>       necessary.  There are a few proven cases where no changes to
>       existing deployed hardware were needed to support the LISP data-
>       plane.
>=20
>    o  On an ITR, prepending a new IP header consists of adding more
>       octets to a MAC rewrite string and prepending the string as part
>       of the outgoing encapsulation procedure.  Routers that support
>       Generic Routing Encapsulation (GRE) tunneling [RFC2784] or 6to4
>       tunneling [RFC3056] may already support this action.
>=20
>    o  A packet's source address or interface the packet was received =
on
>       can be used to select VRF (Virtual Routing/Forwarding).  The =
VRF's
>       routing table can be used to find EID-to-RLOC mappings.
>=20
>    For performance issues related to map-cache management, see
>    Section 19.
>=20
> 16.  Mobility Considerations

[Luigi]
As stated for -07:

Move it out. Mobility is equivalent to mapping change, it is a CP issue.

move it in an OAM document.

>=20
>    There are several kinds of mobility, of which only some might be of
>    concern to LISP.  Essentially, they are as follows.
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
35]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> 16.1.  Slow Mobility
>=20
>    A site wishes to change its attachment points to the Internet, and
>    its LISP Tunnel Routers will have new RLOCs when it changes =
upstream
>    providers.  Changes in EID-to-RLOC mappings for sites are expected =
to
>    be handled by configuration, outside of LISP.
>=20
>    An individual endpoint wishes to move but is not concerned about
>    maintaining session continuity.  Renumbering is involved.  LISP can
>    help with the issues surrounding renumbering [RFC4192] [LISA96] by
>    decoupling the address space used by a site from the address spaces
>    used by its ISPs [RFC4984].
>=20
> 16.2.  Fast Mobility
>=20
>    Fast endpoint mobility occurs when an endpoint moves relatively
>    rapidly, changing its IP-layer network attachment point.  =
Maintenance
>    of session continuity is a goal.  This is where the Mobile IPv4
>    [RFC5944] and Mobile IPv6 [RFC6275] [RFC4866] mechanisms are used =
and
>    primarily where interactions with LISP need to be explored, such as
>    the mechanisms in [I-D.ietf-lisp-eid-mobility] when the EID moves =
but
>    the RLOC is in the network infrastructure.
>=20
>    In LISP, one possibility is to "glean" information.  When a packet
>    arrives, the ETR could examine the EID-to-RLOC mapping and use that
>    mapping for all outgoing traffic to that EID.  It can do this after
>    performing a route-returnability check, to ensure that the new
>    network location does have an internal route to that endpoint.
>    However, this does not cover the case where an ITR (the node =
assigned
>    the RLOC) at the mobile-node location has been compromised.
>=20
>    Mobile IP packet exchange is designed for an environment in which =
all
>    routing information is disseminated before packets can be =
forwarded.
>    In order to allow the Internet to grow to support expected future
>    use, we are moving to an environment where some information may =
have
>    to be obtained after packets are in flight.  Modifications to IP
>    mobility should be considered in order to optimize the behavior of
>    the overall system.  Anything that decreases the number of new EID-
>    to-RLOC mappings needed when a node moves, or maintains the =
validity
>    of an EID-to-RLOC mapping for a longer time, is useful.
>=20
>    In addition to endpoints, a network can be mobile, possibly =
changing
>    xTRs.  A "network" can be as small as a single router and as large =
as
>    a whole site.  This is different from site mobility in that it is
>    fast and possibly short-lived, but different from endpoint mobility
>    in that a whole prefix is changing RLOCs.  However, the mechanisms
>    are the same, and there is no new overhead in LISP.  A map request
>    for any endpoint will return a binding for the entire mobile =
prefix.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
36]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    If mobile networks become a more common occurrence, it may be =
useful
>    to revisit the design of the mapping service and allow for dynamic
>    updates of the database.
>=20
>    The issue of interactions between mobility and LISP needs to be
>    explored further.  Specific improvements to the entire system will
>    depend on the details of mapping mechanisms.  Mapping mechanisms
>    should be evaluated on how well they support session continuity for
>    mobile nodes.  See [I-D.ietf-lisp-predictive-rlocs] for more recent
>    mechanisms which can provide near-zero packet loss during handoffs.
>=20
> 16.3.  LISP Mobile Node Mobility
>=20
>    A mobile device can use the LISP infrastructure to achieve mobility
>    by implementing the LISP encapsulation and decapsulation functions
>    and acting as a simple ITR/ETR.  By doing this, such a "LISP mobile
>    node" can use topologically independent EID IP addresses that are =
not
>    advertised into and do not impose a cost on the global routing
>    system.  These EIDs are maintained at the edges of the mapping =
system
>    in LISP Map-Servers and Map-Resolvers) and are provided on demand =
to
>    only the correspondents of the LISP mobile node.
>=20
>    Refer to [I-D.ietf-lisp-mn] for more details for when the EID and
>    RLOC are co-located in the roaming node.
>=20
> 17.  LISP xTR Placement and Encapsulation Methods
Luigi]
As stated for -07:

This ia an OAM issue and has to be moved out of the document.

>=20
>    This section will explore how and where ITRs and ETRs can be placed
>    in the network and will discuss the pros and cons of each scenario.
>    For a more detailed networkd design deployment recommendation, =
refer
>    to [RFC7215].
>=20
>    There are two basic deployment tradeoffs to consider: centralized
>    versus distributed caches; and flat, Recursive, or Re-encapsulating
>    Tunneling.  When deciding on centralized versus distributed =
caching,
>    the following issues SHOULD be considered:
>=20
>    o  Are the xTRs spread out so that the caches are spread across all
>       the memories of each router?  A centralized cache is when an ITR
>       keeps a cache for all the EIDs it is encapsulating to.  The =
packet
>       takes a direct path to the destination Locator.  A distributed
>       cache is when an ITR needs help from other Re-Encapsulating =
Tunnel
>       Routers (RTRs) because it does not store all the cache entries =
for
>       the EIDs it is encapsulating to.  So, the packet takes a path
>       through RTRs that have a different set of cache entries.
>=20
>    o  Should management "touch points" be minimized by only choosing a
>       few xTRs, just enough for redundancy?
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
37]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    o  In general, using more ITRs doesn't increase management load,
>       since caches are built and stored dynamically.  On the other =
hand,
>       using more ETRs does require more management, since =
EID-Prefix-to-
>       RLOC mappings need to be explicitly configured.
>=20
>    When deciding on flat, Recursive, or Re-Encapsulating Tunneling, =
the
>    following issues SHOULD be considered:
>=20
>    o  Flat tunneling implements a single encapsulation path between =
the
>       source site and destination site.  This generally offers better
>       paths between sources and destinations with a single =
encapsulation
>       path.
>=20
>    o  Recursive Tunneling is when encapsulated traffic is again =
further
>       encapsulated in another tunnel, either to implement VPNs or to
>       perform Traffic Engineering.  When doing VPN-based tunneling, =
the
>       site has some control, since the site is prepending a new
>       encapsulation header.  In the case of TE-based tunneling, the =
site
>       MAY have control if it is prepending a new tunnel header, but if
>       the site's ISP is doing the TE, then the site has no control.
>       Recursive Tunneling generally will result in suboptimal paths =
but
>       with the benefit of steering traffic to parts of the network =
that
>       have more resources available.
>=20
>    o  The technique of Re-Encapsulation ensures that packets only
>       require one encapsulation header.  So, if a packet needs to be =
re-
>       routed, it is first decapsulated by the RTR and then Re-
>       Encapsulated with a new encapsulation header using a new RLOC.
>=20
>    The next sub-sections will examine where xTRs and RTRs can reside =
in
>    the network.
>=20
> 17.1.  First-Hop/Last-Hop xTRs
>=20
>    By locating xTRs close to hosts, the EID-Prefix set is at the
>    granularity of an IP subnet.  So, at the expense of more =
EID-Prefix-
>    to-RLOC sets for the site, the caches in each xTR can remain
>    relatively small.  But caches always depend on the number of non-
>    aggregated EID destination flows active through these xTRs.
>=20
>    With more xTRs doing encapsulation, the increase in control traffic
>    grows as well: since the EID granularity is greater, more Map-
>    Requests and Map-Replies are traveling between more routers.
>=20
>    The advantage of placing the caches and databases at these stub
>    routers is that the products deployed in this part of the network
>    have better price-memory ratios than their core router =
counterparts.
>    Memory is typically less expensive in these devices, and fewer =
routes
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
38]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    are stored (only IGP routes).  These devices tend to have excess
>    capacity, both for forwarding and routing states.
>=20
>    LISP functionality can also be deployed in edge switches.  These
>    devices generally have layer-2 ports facing hosts and layer-3 ports
>    facing the Internet.  Spare capacity is also often available in =
these
>    devices.
>=20
> 17.2.  Border/Edge xTRs
>=20
>    Using Customer Edge (CE) routers for xTR placement allows the EID
>    space associated with a site to be reachable via a small set of =
RLOCs
>    assigned to the CE-based xTRs for that site.
>=20
>    This offers the opposite benefit of the first-hop/last-hop xTR
>    scenario: the number of mapping entries and network management =
touch
>    points is reduced, allowing better scaling.
>=20
>    One disadvantage is that fewer network resources are used to reach
>    host endpoints, thereby centralizing the point-of-failure domain =
and
>    creating network choke points at the CE xTR.
>=20
>    Note that more than one CE xTR at a site can be configured with the
>    same IP address.  In this case, an RLOC is an anycast address.  =
This
>    allows resilience between the CE xTRs.  That is, if a CE xTR fails,
>    traffic is automatically routed to the other xTRs using the same
>    anycast address.  However, this comes with the disadvantage where =
the
>    site cannot control the entrance point when the anycast route is
>    advertised out from all border routers.  Another disadvantage of
>    using anycast Locators is the limited advertisement scope of /32 =
(or
>    /128 for IPv6) routes.
>=20
> 17.3.  ISP Provider Edge (PE) xTRs
>=20
>    The use of ISP PE routers as xTRs is not the typical deployment
>    scenario envisioned in this specification.  This section attempts =
to
>    capture some of the reasoning behind this preference for =
implementing
>    LISP on CE routers.
>=20
>    The use of ISP PE routers for xTR placement gives an ISP, rather =
than
>    a site, control over the location of the ETRs.  That is, the ISP =
can
>    decide whether the xTRs are in the destination site (in either CE
>    xTRs or last-hop xTRs within a site) or at other PE edges.  The
>    advantage of this case is that two encapsulation headers can be
>    avoided.  By having the PE be the first router on the path to
>    encapsulate, it can choose a TE path first, and the ETR can
>    decapsulate and Re-Encapsulate for a new encapsuluation path to the
>    destination end site.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
39]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    An obvious disadvantage is that the end site has no control over
>    where its packets flow or over the RLOCs used.  Other disadvantages
>    include difficulty in synchronizing path liveness updates between =
CE
>    and PE routers.
>=20
>    As mentioned in earlier sections, a combination of these scenarios =
is
>    possible at the expense of extra packet header overhead; if both =
site
>    and provider want control, then Recursive or Re-Encapsulating =
Tunnels
>    are used.
>=20
> 17.4.  LISP Functionality with Conventional NATs
>=20
>    LISP routers can be deployed behind Network Address Translator =
(NAT)
>    devices to provide the same set of packet services hosts have today
>    when they are addressed out of private address space.
>=20
>    It is important to note that a locator address in any LISP control
>    message MUST be a routable address and therefore [RFC1918] =
addresses
>    SHOULD only be presence when running in a local environment.  When =
a
>    LISP xTR is configured with private RLOC addresses and resides =
behind
>    a NAT device and desires to communicate on the Internet, the =
private
>    addresses MUST be used only in the outer IP header so the NAT =
device
>    can translate properly.  Otherwise, EID addresses MUST be =
translated
>    before encapsulation is performed when LISP VPNs are not in use.
>    Both NAT translation and LISP encapsulation functions could be co-
>    located in the same device.
>=20
> 17.5.  Packets Egressing a LISP Site
>=20
>    When a LISP site is using two ITRs for redundancy, the failure of =
one
>    ITR will likely shift outbound traffic to the second.  This second
>    ITR's cache MAY not be populated with the same EID-to-RLOC mapping
>    entries as the first.  If this second ITR does not have these
>    mappings, traffic will be dropped while the mappings are retrieved
>    from the mapping system.  The retrieval of these messages may
>    increase the load of requests being sent into the mapping system.
>=20
> 18.  Traceroute Considerations
[Luigi]
As stated for -07:

I consider traceroute again an OAM issue.
>=20
>    When a source host in a LISP site initiates a traceroute to a
>    destination host in another LISP site, it is highly desirable for =
it
>    to see the entire path.  Since packets are encapsulated from the =
ITR
>    to the ETR, the hop across the tunnel could be viewed as a single
>    hop.  However, LISP traceroute will provide the entire path so the
>    user can see 3 distinct segments of the path from a source LISP =
host
>    to a destination LISP host:
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
40]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>       Segment 1 (in source LISP site based on EIDs):
>=20
>           source host ---> first hop ... next hop ---> ITR
>=20
>       Segment 2 (in the core network based on RLOCs):
>=20
>           ITR ---> next hop ... next hop ---> ETR
>=20
>       Segment 3 (in the destination LISP site based on EIDs):
>=20
>           ETR ---> next hop ... last hop ---> destination host
>=20
>    For segment 1 of the path, ICMP Time Exceeded messages are returned
>    in the normal manner as they are today.  The ITR performs a TTL
>    decrement and tests for 0 before encapsulating.  Therefore, the =
ITR's
>    hop is seen by the traceroute source as having an EID address (the
>    address of the site-facing interface).
>=20
>    For segment 2 of the path, ICMP Time Exceeded messages are returned
>    to the ITR because the TTL decrement to 0 is done on the outer
>    header, so the destinations of the ICMP messages are the ITR RLOC
>    address and the source RLOC address of the encapsulated traceroute
>    packet.  The ITR looks inside of the ICMP payload to inspect the
>    traceroute source so it can return the ICMP message to the address =
of
>    the traceroute client and also retain the core router IP address in
>    the ICMP message.  This is so the traceroute client can display the
>    core router address (the RLOC address) in the traceroute output.  =
The
>    ETR returns its RLOC address and responds to the TTL decrement to =
0,
>    as the previous core routers did.
>=20
>    For segment 3, the next-hop router downstream from the ETR will be
>    decrementing the TTL for the packet that was encapsulated, sent =
into
>    the core, decapsulated by the ETR, and forwarded because it isn't =
the
>    final destination.  If the TTL is decremented to 0, any router on =
the
>    path to the destination of the traceroute, including the next-hop
>    router or destination, will send an ICMP Time Exceeded message to =
the
>    source EID of the traceroute client.  The ICMP message will be
>    encapsulated by the local ITR and sent back to the ETR in the
>    originated traceroute source site, where the packet will be =
delivered
>    to the host.
>=20
> 18.1.  IPv6 Traceroute
>=20
>    IPv6 traceroute follows the procedure described above, since the
>    entire traceroute data packet is included in the ICMP Time Exceeded
>    message payload.  Therefore, only the ITR needs to pay special
>    attention to forwarding ICMP messages back to the traceroute =
source.
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
41]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> 18.2.  IPv4 Traceroute
>=20
>    For IPv4 traceroute, we cannot follow the above procedure, since =
IPv4
>    ICMP Time Exceeded messages only include the invoking IP header and
>    8 octets that follow the IP header.  Therefore, when a core router
>    sends an IPv4 Time Exceeded message to an ITR, all the ITR has in =
the
>    ICMP payload is the encapsulated header it prepended, followed by a
>    UDP header.  The original invoking IP header, and therefore the
>    identity of the traceroute source, is lost.
>=20
>    The solution we propose to solve this problem is to cache =
traceroute
>    IPv4 headers in the ITR and to match them up with corresponding =
IPv4
>    Time Exceeded messages received from core routers and the ETR.  The
>    ITR will use a circular buffer for caching the IPv4 and UDP headers
>    of traceroute packets.  It will select a 16-bit number as a key to
>    find them later when the IPv4 Time Exceeded messages are received.
>    When an ITR encapsulates an IPv4 traceroute packet, it will use the
>    16-bit number as the UDP source port in the encapsulating header.
>    When the ICMP Time Exceeded message is returned to the ITR, the UDP
>    header of the encapsulating header is present in the ICMP payload,
>    thereby allowing the ITR to find the cached headers for the
>    traceroute source.  The ITR puts the cached headers in the payload
>    and sends the ICMP Time Exceeded message to the traceroute source
>    retaining the source address of the original ICMP Time Exceeded
>    message (a core router or the ETR of the site of the traceroute
>    destination).
>=20
>    The signature of a traceroute packet comes in two forms.  The first
>    form is encoded as a UDP message where the destination port is
>    inspected for a range of values.  The second form is encoded as an
>    ICMP message where the IP identification field is inspected for a
>    well-known value.
>=20
> 18.3.  Traceroute Using Mixed Locators
>=20
>    When either an IPv4 traceroute or IPv6 traceroute is originated and
>    the ITR encapsulates it in the other address family header, one
>    cannot get all 3 segments of the traceroute.  Segment 2 of the
>    traceroute cannot be conveyed to the traceroute source, since it is
>    expecting addresses from intermediate hops in the same address =
format
>    for the type of traceroute it originated.  Therefore, in this case,
>    segment 2 will make the tunnel look like one hop.  All the ITR has =
to
>    do to make this work is to not copy the inner TTL to the outer,
>    encapsulating header's TTL when a traceroute packet is encapsulated
>    using an RLOC from a different address family.  This will cause no
>    TTL decrement to 0 to occur in core routers between the ITR and =
ETR.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
42]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> 19.  Security Considerations
>=20
>    Security considerations for LISP are discussed in [RFC7833], in
>    addition [I-D.ietf-lisp-sec] provides authentication and integrity =
to
>    LISP mappings.
[Luigi]
As stated for -07:

lisp-sec is control-plane has to be referenced in 6833bis.

authentication and integrity of mappings is a control plane issue.

>=20
>    A complete LISP threat analysis can be found in [RFC7835], in what
>    follows we provide a summary.
>=20
>    The optional mechanisms of gleaning is offered to directly obtain a
>    mapping from the LISP encapsulated packets.  Specifically, an xTR =
can
>    learn the EID-to-RLOC mapping by inspecting the source RLOC and
>    source EID of an encapsulated packet, and insert this new mapping
>    into its map-cache.  An off-path attacker can spoof the source EID
>    address to divert the traffic sent to the victim's spoofed EID.  If
>    the attacker spoofs the source RLOC, it can mount a DoS attack by
>    redirecting traffic to the spoofed victim;s RLOC, potentially
>    overloading it.
>=20
>    The LISP Data-Plane defines several mechanisms to monitor RLOC =
data-
>    plane reachability, in this context Locator-Status Bits, Nonce-
>    Present and Echo-Nonce bits of the LISP encapsulation header can be
>    manipulated by an attacker to mount a DoS attack.  An off-path
>    attacker able to spoof the RLOC of a victim's xTR can manipulate =
such
>    mechanisms to declare a set of RLOCs unreachable.  This can be used
>    also, for instance, to declare only one RLOC reachable with the aim
>    of overload it.
>=20
>    Map-Versioning is a data-plane mechanism used to signal a peering =
xTR
>    that a local EID-to-RLOC mapping has been updated, so that the
>    peering xTR uses LISP Control-Plane signaling message to retrieve a
>    fresh mapping.  This can be used by an attacker to forge the map-
>    versioning field of a LISP encapsulated header and force an =
excessive
>    amount of signaling between xTRs that may overload them.
>=20
>    Most of the attack vectors can be mitigated with careful deployment
>    and configuration, information learned opportunistically (such as =
LSB
>    or gleaning) SHOULD be verified with other reachability mechanisms.
>    In addition, systematic rate-limitation and filtering is an =
effective
>    technique to mitigate attacks that aim to overload the =
control-plane.
>=20
> 20.  Network Management Considerations
>=20
>    Considerations for network management tools exist so the LISP
>    protocol suite can be operationally managed.  These mechanisms can =
be
>    found in [RFC7052] and [RFC6835].
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
43]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> 21.  IANA Considerations
>=20
>    This section provides guidance to the Internet Assigned Numbers
>    Authority (IANA) regarding registration of values related to this
>    data-plane LISP specification, in accordance with BCP 26 [RFC8126].
>=20
> 21.1.  LISP UDP Port Numbers
>=20
>    The IANA registry has allocated UDP port numbers 4341 and 4342 for
>    lisp-data and lisp-control operation, respectively.  IANA has =
updated
>    the description for UDP ports 4341 and 4342 as follows:
>=20
>        lisp-data      4341 udp    LISP Data Packets
>        lisp-control   4342 udp    LISP Control Packets
[Luigi]
As stated for -07:

4342 is control-plane and MUST be requested to IANA in the 6833bis =
document.

>=20
> 22.  References
>=20
> 22.1.  Normative References
>=20
>    [I-D.ietf-lisp-rfc6833bis]
>               Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,
>               "Locator/ID Separation Protocol (LISP) Control-Plane",
>               draft-ietf-lisp-rfc6833bis-07 (work in progress), =
December
>               2017.
>=20
>    [RFC0768]  Postel, J., "User Datagram Protocol", STD 6, RFC 768,
>               DOI 10.17487/RFC0768, August 1980,
>               <https://www.rfc-editor.org/info/rfc768>.
>=20
>    [RFC0791]  Postel, J., "Internet Protocol", STD 5, RFC 791,
>               DOI 10.17487/RFC0791, September 1981,
>               <https://www.rfc-editor.org/info/rfc791>.
>=20
>    [RFC1918]  Rekhter, Y., Moskowitz, B., Karrenberg, D., de Groot, =
G.,
>               and E. Lear, "Address Allocation for Private Internets",
>               BCP 5, RFC 1918, DOI 10.17487/RFC1918, February 1996,
>               <https://www.rfc-editor.org/info/rfc1918>.
>=20
>    [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
>               Requirement Levels", BCP 14, RFC 2119,
>               DOI 10.17487/RFC2119, March 1997,
>               <https://www.rfc-editor.org/info/rfc2119>.
>=20
>    [RFC2474]  Nichols, K., Blake, S., Baker, F., and D. Black,
>               "Definition of the Differentiated Services Field (DS
>               Field) in the IPv4 and IPv6 Headers", RFC 2474,
>               DOI 10.17487/RFC2474, December 1998,
>               <https://www.rfc-editor.org/info/rfc2474>.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
44]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    [RFC3168]  Ramakrishnan, K., Floyd, S., and D. Black, "The Addition
>               of Explicit Congestion Notification (ECN) to IP",
>               RFC 3168, DOI 10.17487/RFC3168, September 2001,
>               <https://www.rfc-editor.org/info/rfc3168>.
>=20
>    [RFC4086]  Eastlake 3rd, D., Schiller, J., and S. Crocker,
>               "Randomness Requirements for Security", BCP 106, RFC =
4086,
>               DOI 10.17487/RFC4086, June 2005,
>               <https://www.rfc-editor.org/info/rfc4086>.
>=20
>    [RFC4632]  Fuller, V. and T. Li, "Classless Inter-domain Routing
>               (CIDR): The Internet Address Assignment and Aggregation
>               Plan", BCP 122, RFC 4632, DOI 10.17487/RFC4632, August
>               2006, <https://www.rfc-editor.org/info/rfc4632>.
>=20
>    [RFC5944]  Perkins, C., Ed., "IP Mobility Support for IPv4, =
Revised",
>               RFC 5944, DOI 10.17487/RFC5944, November 2010,
>               <https://www.rfc-editor.org/info/rfc5944>.
>=20
>    [RFC6275]  Perkins, C., Ed., Johnson, D., and J. Arkko, "Mobility
>               Support in IPv6", RFC 6275, DOI 10.17487/RFC6275, July
>               2011, <https://www.rfc-editor.org/info/rfc6275>.
>=20
>    [RFC7833]  Howlett, J., Hartman, S., and A. Perez-Mendez, Ed., "A
>               RADIUS Attribute, Binding, Profiles, Name Identifier
>               Format, and Confirmation Methods for the Security
>               Assertion Markup Language (SAML)", RFC 7833,
>               DOI 10.17487/RFC7833, May 2016,
>               <https://www.rfc-editor.org/info/rfc7833>.
>=20
>    [RFC8126]  Cotton, M., Leiba, B., and T. Narten, "Guidelines for
>               Writing an IANA Considerations Section in RFCs", BCP 26,
>               RFC 8126, DOI 10.17487/RFC8126, June 2017,
>               <https://www.rfc-editor.org/info/rfc8126>.
>=20
>    [RFC8200]  Deering, S. and R. Hinden, "Internet Protocol, Version 6
>               (IPv6) Specification", STD 86, RFC 8200,
>               DOI 10.17487/RFC8200, July 2017,
>               <https://www.rfc-editor.org/info/rfc8200>.
>=20
> 22.2.  Informative References
>=20
>    [AFN]      IANA, "Address Family Numbers", August 2016,
>               =
<http://www.iana.org/assignments/address-family-numbers>.
>=20
>    [CHIAPPA]  Chiappa, J., "Endpoints and Endpoint names: A Proposed",
>               1999,
>               <http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt>.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
45]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    [I-D.ietf-lisp-eid-mobility]
>               Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,
>               F., and D. Farinacci, "LISP L2/L3 EID Mobility Using a
>               Unified Control Plane", draft-ietf-lisp-eid-mobility-01
>               (work in progress), November 2017.
>=20
>    [I-D.ietf-lisp-introduction]
>               Cabellos-Aparicio, A. and D. Saucez, "An Architectural
>               Introduction to the Locator/ID Separation Protocol
>               (LISP)", draft-ietf-lisp-introduction-13 (work in
>               progress), April 2015.
>=20
>    [I-D.ietf-lisp-mn]
>               Farinacci, D., Lewis, D., Meyer, D., and C. White, "LISP
>               Mobile Node", draft-ietf-lisp-mn-01 (work in progress),
>               October 2017.
>=20
>    [I-D.ietf-lisp-predictive-rlocs]
>               Farinacci, D. and P. Pillay-Esnault, "LISP Predictive
>               RLOCs", draft-ietf-lisp-predictive-rlocs-01 (work in
>               progress), November 2017.
>=20
>    [I-D.ietf-lisp-sec]
>               Maino, F., Ermagan, V., Cabellos-Aparicio, A., and D.
>               Saucez, "LISP-Security (LISP-SEC)", =
draft-ietf-lisp-sec-14
>               (work in progress), October 2017.
>=20
>    [I-D.ietf-lisp-signal-free-multicast]
>               Moreno, V. and D. Farinacci, "Signal-Free LISP =
Multicast",
>               draft-ietf-lisp-signal-free-multicast-07 (work in
>               progress), November 2017.
>=20
>    [I-D.ietf-lisp-vpn]
>               Moreno, V. and D. Farinacci, "LISP Virtual Private
>               Networks (VPNs)", draft-ietf-lisp-vpn-01 (work in
>               progress), November 2017.
>=20
>    [I-D.meyer-loc-id-implications]
>               Meyer, D. and D. Lewis, "Architectural Implications of
>               Locator/ID Separation", =
draft-meyer-loc-id-implications-01
>               (work in progress), January 2009.
>=20
>    [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. Coffin,
>               "Renumbering: Threat or Menace?", Usenix Tenth System
>               Administration Conference (LISA 96), October 1996.
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
46]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    [OPENLISP]
>               Iannone, L., Saucez, D., and O. Bonaventure, "OpenLISP
>               Implementation Report", Work in Progress, July 2008.
>=20
>    [RFC1034]  Mockapetris, P., "Domain names - concepts and =
facilities",
>               STD 13, RFC 1034, DOI 10.17487/RFC1034, November 1987,
>               <https://www.rfc-editor.org/info/rfc1034>.
>=20
>    [RFC2784]  Farinacci, D., Li, T., Hanks, S., Meyer, D., and P.
>               Traina, "Generic Routing Encapsulation (GRE)", RFC 2784,
>               DOI 10.17487/RFC2784, March 2000,
>               <https://www.rfc-editor.org/info/rfc2784>.
>=20
>    [RFC3056]  Carpenter, B. and K. Moore, "Connection of IPv6 Domains
>               via IPv4 Clouds", RFC 3056, DOI 10.17487/RFC3056, =
February
>               2001, <https://www.rfc-editor.org/info/rfc3056>.
>=20
>    [RFC3232]  Reynolds, J., Ed., "Assigned Numbers: RFC 1700 is =
Replaced
>               by an On-line Database", RFC 3232, DOI 10.17487/RFC3232,
>               January 2002, <https://www.rfc-editor.org/info/rfc3232>.
>=20
>    [RFC3261]  Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston,
>               A., Peterson, J., Sparks, R., Handley, M., and E.
>               Schooler, "SIP: Session Initiation Protocol", RFC 3261,
>               DOI 10.17487/RFC3261, June 2002,
>               <https://www.rfc-editor.org/info/rfc3261>.
>=20
>    [RFC4192]  Baker, F., Lear, E., and R. Droms, "Procedures for
>               Renumbering an IPv6 Network without a Flag Day", RFC =
4192,
>               DOI 10.17487/RFC4192, September 2005,
>               <https://www.rfc-editor.org/info/rfc4192>.
>=20
>    [RFC4866]  Arkko, J., Vogt, C., and W. Haddad, "Enhanced Route
>               Optimization for Mobile IPv6", RFC 4866,
>               DOI 10.17487/RFC4866, May 2007,
>               <https://www.rfc-editor.org/info/rfc4866>.
>=20
>    [RFC4984]  Meyer, D., Ed., Zhang, L., Ed., and K. Fall, Ed., =
"Report
>               from the IAB Workshop on Routing and Addressing",
>               RFC 4984, DOI 10.17487/RFC4984, September 2007,
>               <https://www.rfc-editor.org/info/rfc4984>.
>=20
>    [RFC6831]  Farinacci, D., Meyer, D., Zwiebel, J., and S. Venaas, =
"The
>               Locator/ID Separation Protocol (LISP) for Multicast
>               Environments", RFC 6831, DOI 10.17487/RFC6831, January
>               2013, <https://www.rfc-editor.org/info/rfc6831>.
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
47]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    [RFC6832]  Lewis, D., Meyer, D., Farinacci, D., and V. Fuller,
>               "Interworking between Locator/ID Separation Protocol
>               (LISP) and Non-LISP Sites", RFC 6832,
>               DOI 10.17487/RFC6832, January 2013,
>               <https://www.rfc-editor.org/info/rfc6832>.
>=20
>    [RFC6834]  Iannone, L., Saucez, D., and O. Bonaventure, "Locator/ID
>               Separation Protocol (LISP) Map-Versioning", RFC 6834,
>               DOI 10.17487/RFC6834, January 2013,
>               <https://www.rfc-editor.org/info/rfc6834>.
>=20
>    [RFC6835]  Farinacci, D. and D. Meyer, "The Locator/ID Separation
>               Protocol Internet Groper (LIG)", RFC 6835,
>               DOI 10.17487/RFC6835, January 2013,
>               <https://www.rfc-editor.org/info/rfc6835>.
>=20
>    [RFC6935]  Eubanks, M., Chimento, P., and M. Westerlund, "IPv6 and
>               UDP Checksums for Tunneled Packets", RFC 6935,
>               DOI 10.17487/RFC6935, April 2013,
>               <https://www.rfc-editor.org/info/rfc6935>.
>=20
>    [RFC6936]  Fairhurst, G. and M. Westerlund, "Applicability =
Statement
>               for the Use of IPv6 UDP Datagrams with Zero Checksums",
>               RFC 6936, DOI 10.17487/RFC6936, April 2013,
>               <https://www.rfc-editor.org/info/rfc6936>.
>=20
>    [RFC7052]  Schudel, G., Jain, A., and V. Moreno, "Locator/ID
>               Separation Protocol (LISP) MIB", RFC 7052,
>               DOI 10.17487/RFC7052, October 2013,
>               <https://www.rfc-editor.org/info/rfc7052>.
>=20
>    [RFC7215]  Jakab, L., Cabellos-Aparicio, A., Coras, F., Domingo-
>               Pascual, J., and D. Lewis, "Locator/Identifier =
Separation
>               Protocol (LISP) Network Element Deployment
>               Considerations", RFC 7215, DOI 10.17487/RFC7215, April
>               2014, <https://www.rfc-editor.org/info/rfc7215>.
>=20
>    [RFC7835]  Saucez, D., Iannone, L., and O. Bonaventure, "Locator/ID
>               Separation Protocol (LISP) Threat Analysis", RFC 7835,
>               DOI 10.17487/RFC7835, April 2016,
>               <https://www.rfc-editor.org/info/rfc7835>.
>=20
>    [RFC8060]  Farinacci, D., Meyer, D., and J. Snijders, "LISP =
Canonical
>               Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,
>               February 2017, =
<https://www.rfc-editor.org/info/rfc8060>.
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
48]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    [RFC8061]  Farinacci, D. and B. Weis, "Locator/ID Separation =
Protocol
>               (LISP) Data-Plane Confidentiality", RFC 8061,
>               DOI 10.17487/RFC8061, February 2017,
>               <https://www.rfc-editor.org/info/rfc8061>.
>=20
>    [RFC8111]  Fuller, V., Lewis, D., Ermagan, V., Jain, A., and A.
>               Smirnov, "Locator/ID Separation Protocol Delegated
>               Database Tree (LISP-DDT)", RFC 8111, DOI =
10.17487/RFC8111,
>               May 2017, <https://www.rfc-editor.org/info/rfc8111>.
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
49]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> Appendix A.  Acknowledgments
>=20
>    An initial thank you goes to Dave Oran for planting the seeds for =
the
>    initial ideas for LISP.  His consultation continues to provide =
value
>    to the LISP authors.
>=20
>    A special and appreciative thank you goes to Noel Chiappa for
>    providing architectural impetus over the past decades on separation
>    of location and identity, as well as detailed reviews of the LISP
>    architecture and documents, coupled with enthusiasm for making LISP =
a
>    practical and incremental transition for the Internet.
>=20
>    The authors would like to gratefully acknowledge many people who =
have
>    contributed discussions and ideas to the making of this proposal.
>    They include Scott Brim, Andrew Partan, John Zwiebel, Jason =
Schiller,
>    Lixia Zhang, Dorian Kim, Peter Schoenmaker, Vijay Gill, Geoff =
Huston,
>    David Conrad, Mark Handley, Ron Bonica, Ted Seely, Mark Townsley,
>    Chris Morrow, Brian Weis, Dave McGrew, Peter Lothberg, Dave Thaler,
>    Eliot Lear, Shane Amante, Ved Kafle, Olivier Bonaventure, Luigi
>    Iannone, Robin Whittle, Brian Carpenter, Joel Halpern, Terry
>    Manderson, Roger Jorgensen, Ran Atkinson, Stig Venaas, Iljitsch van
>    Beijnum, Roland Bless, Dana Blair, Bill Lynch, Marc Woolward, =
Damien
>    Saucez, Damian Lezama, Attilla De Groot, Parantap Lahiri, David
>    Black, Roque Gagliano, Isidor Kouvelas, Jesper Skriver, Fred =
Templin,
>    Margaret Wasserman, Sam Hartman, Michael Hofling, Pedro Marques, =
Jari
>    Arkko, Gregg Schudel, Srinivas Subramanian, Amit Jain, Xu Xiaohu,
>    Dhirendra Trivedi, Yakov Rekhter, John Scudder, John Drake, Dimitri
>    Papadimitriou, Ross Callon, Selina Heimlich, Job Snijders, Vina
>    Ermagan, Fabio Maino, Victor Moreno, Chris White, Clarence =
Filsfils,
>    Alia Atlas, Florin Coras and Alberto Rodriguez.
>=20
>    This work originated in the Routing Research Group (RRG) of the =
IRTF.
>    An individual submission was converted into the IETF LISP working
>    group document that became this RFC.
>=20
>    The LISP working group would like to give a special thanks to Jari
>    Arkko, the Internet Area AD at the time that the set of LISP
>    documents were being prepared for IESG last call, and for his
>    meticulous reviews and detailed commentaries on the 7 working group
>    last call documents progressing toward standards-track RFCs.
>=20
> Appendix B.  Document Change Log
>=20
>    [RFC Editor: Please delete this section on publication as RFC.]
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
50]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> B.1.  Changes to draft-ietf-lisp-rfc6830bis-08
>=20
>    o  Posted January 2018.
>=20
>    o  Remove references to research work for any protocol mechanisms.
>=20
>    o  Document scanned to make sure it is RFC 2119 compliant.
>=20
>    o  Made changes to reflect comments from document WG shepherd Luigi
>       Iannone.
>=20
>    o  Ran IDNITs on the document.
>=20
> B.2.  Changes to draft-ietf-lisp-rfc6830bis-07
>=20
>    o  Posted November 2017.
>=20
>    o  Rephrase how Instance-IDs are used and don't refer to [RFC1918]
>       addresses.
>=20
> B.3.  Changes to draft-ietf-lisp-rfc6830bis-06
>=20
>    o  Posted October 2017.
>=20
>    o  Put RTR definition before it is used.
>=20
>    o  Rename references that are now working group drafts.
>=20
>    o  Remove "EIDs MUST NOT be used as used by a host to refer to =
other
>       hosts.  Note that EID blocks MAY LISP RLOCs".
>=20
>    o  Indicate what address-family can appear in data packets.
>=20
>    o  ETRs may, rather than will, be the ones to send Map-Replies.
>=20
>    o  Recommend, rather than mandate, max encapsulation headers to 2.
>=20
>    o  Reference VPN draft when introducing Instance-ID.
>=20
>    o  Indicate that SMRs can be sent when ITR/ETR are in the same =
node.
>=20
>    o  Clarify when private addreses can be used.
>=20
> B.4.  Changes to draft-ietf-lisp-rfc6830bis-05
>=20
>    o  Posted August 2017.
>=20
>    o  Make it clear that a Reencapsulating Tunnel Router is an RTR.
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
51]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
> B.5.  Changes to draft-ietf-lisp-rfc6830bis-04
>=20
>    o  Posted July 2017.
>=20
>    o  Changed reference of IPv6 RFC2460 to RFC8200.
>=20
>    o  Indicate that the applicability statement for UDP zero checksums
>       over IPv6 adheres to RFC6936.
>=20
> B.6.  Changes to draft-ietf-lisp-rfc6830bis-03
>=20
>    o  Posted May 2017.
>=20
>    o  Move the control-plane related codepoints in the IANA
>       Considerations section to RFC6833bis.
>=20
> B.7.  Changes to draft-ietf-lisp-rfc6830bis-02
>=20
>    o  Posted April 2017.
>=20
>    o  Reflect some editorial comments from Damien Sausez.
>=20
> B.8.  Changes to draft-ietf-lisp-rfc6830bis-01
>=20
>    o  Posted March 2017.
>=20
>    o  Include references to new RFCs published.
>=20
>    o  Change references from RFC6833 to RFC6833bis.
>=20
>    o  Clarified LCAF text in the IANA section.
>=20
>    o  Remove references to "experimental".
>=20
> B.9.  Changes to draft-ietf-lisp-rfc6830bis-00
>=20
>    o  Posted December 2016.
>=20
>    o  Created working group document from draft-farinacci-lisp
>       -rfc6830-00 individual submission.  No other changes made.
>=20
> Authors' Addresses
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
52]
> =0C
> Internet-Draft                    LISP                      January =
2018
>=20
>=20
>    Dino Farinacci
>    Cisco Systems
>    Tasman Drive
>    San Jose, CA  95134
>    USA
>=20
>    EMail: farinacci@gmail.com
>=20
>=20
>    Vince Fuller
>    Cisco Systems
>    Tasman Drive
>    San Jose, CA  95134
>    USA
>=20
>    EMail: vince.fuller@gmail.com
>=20
>=20
>    Dave Meyer
>    Cisco Systems
>    170 Tasman Drive
>    San Jose, CA
>    USA
>=20
>    EMail: dmm@1-4-5.net
>=20
>=20
>    Darrel Lewis
>    Cisco Systems
>    170 Tasman Drive
>    San Jose, CA
>    USA
>=20
>    EMail: darlewis@cisco.com
>=20
>=20
>    Albert Cabellos
>    UPC/BarcelonaTech
>    Campus Nord, C. Jordi Girona 1-3
>    Barcelona, Catalunya
>    Spain
>=20
>    EMail: acabello@ac.upc.edu
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
> Farinacci, et al.         Expires July 13, 2018                [Page =
53]


--Apple-Mail=_51FE3D12-393C-4C91-8721-43E1FAF44168
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"Content-Type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;" class=3D""><div =
class=3D""></div><div class=3D""><div class=3D"">Hi,</div></div><div =
class=3D""><br class=3D""></div><div class=3D"">this is my review of -08 =
(and -09 since one single change has been proposed in -09, more =
inline).</div><div class=3D""><br class=3D""></div><div class=3D"">The =
number of comments is not enormous so I expect that they are all =
tracked.</div><div class=3D""><br class=3D""></div><div =
class=3D"">Thanks</div><div class=3D""><br class=3D""></div><div =
class=3D"">Luigi&nbsp;</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div =
class=3D"">&nbsp;</div><div class=3D""><br class=3D""></div><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">



Network Working Group                                       D. Farinacci
Internet-Draft                                                 V. Fuller
Intended status: Standards Track                                D. Meyer
Expires: July 13, 2018                                          D. Lewis
                                                           Cisco Systems
                                                       A. Cabellos (Ed.)
                                                       UPC/BarcelonaTech
                                                         January 9, 2018


               The Locator/ID Separation Protocol (LISP)
                     draft-ietf-lisp-rfc6830bis-08

Abstract

   This document describes the data-plane protocol for the Locator/ID
   Separation Protocol (LISP).  LISP defines two namespaces, End-point
   Identifiers (EIDs) that identify end-hosts and Routing Locators
   (RLOCs) that 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.

   LISP requires no change to either host protocol stacks or to underlay
   routers and offers Traffic Engineering, multihoming and mobility,
   among other features.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at <a href=3D"https://datatracker.ietf.org/drafts/current/" =
class=3D"">https://datatracker.ietf.org/drafts/current/</a>.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on July 13, 2018.








Farinacci, et al.         Expires July 13, 2018                 [Page 1]
=0C
Internet-Draft                    LISP                      January 2018


Copyright Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (<a href=3D"https://trustee.ietf.org/license-info" =
class=3D"">https://trustee.ietf.org/license-info</a>) in effect on the =
date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Requirements Notation . . . . . . . . . . . . . . . . . . . .   4
   3.  Definition of Terms . . . . . . . . . . . . . . . . . . . . .   4
   4.  Basic Overview  . . . . . . . . . . . . . . . . . . . . . . .   9
     4.1.  Packet Flow Sequence  . . . . . . . . . . . . . . . . . .  11
   5.  LISP Encapsulation Details  . . . . . . . . . . . . . . . . .  13
     5.1.  LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  13
     5.2.  LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  14
     5.3.  Tunnel Header Field Descriptions  . . . . . . . . . . . .  15
   6.  LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  19
   7.  Dealing with Large Encapsulated Packets . . . . . . . . . . .  20
     7.1.  A Stateless Solution to MTU Handling  . . . . . . . . . .  20
     7.2.  A Stateful Solution to MTU Handling . . . . . . . . . . .  21
   8.  Using Virtualization and Segmentation with LISP . . . . . . .  22
   9.  Routing Locator Selection . . . . . . . . . . . . . . . . . .  23
   10. Routing Locator Reachability  . . . . . . . . . . . . . . . .  24
     10.1.  Echo Nonce Algorithm . . . . . . . . . . . . . . . . . .  27
     10.2.  RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28
   11. EID Reachability within a LISP Site . . . . . . . . . . . . .  29
   12. Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  29
   13. Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  30
     13.1.  Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  31
     13.2.  Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  32
     13.3.  Database Map-Versioning  . . . . . . . . . . . . . . . .  33
   14. Multicast Considerations  . . . . . . . . . . . . . . . . . .  34
   15. Router Performance Considerations . . . . . . . . . . . . . .  35
   16. Mobility Considerations . . . . . . . . . . . . . . . . . . .  35
     16.1.  Slow Mobility  . . . . . . . . . . . . . . . . . . . . .  36
     16.2.  Fast Mobility  . . . . . . . . . . . . . . . . . . . . .  36
     16.3.  LISP Mobile Node Mobility  . . . . . . . . . . . . . . .  37
   17. LISP xTR Placement and Encapsulation Methods  . . . . . . . .  37



Farinacci, et al.         Expires July 13, 2018                 [Page 2]
=0C
Internet-Draft                    LISP                      January 2018


     17.1.  First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  38
     17.2.  Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  39
     17.3.  ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  39
     17.4.  LISP Functionality with Conventional NATs  . . . . . . .  40
     17.5.  Packets Egressing a LISP Site  . . . . . . . . . . . . .  40
   18. Traceroute Considerations . . . . . . . . . . . . . . . . . .  40
     18.1.  IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  41
     18.2.  IPv4 Traceroute  . . . . . . . . . . . . . . . . . . . .  42
     18.3.  Traceroute Using Mixed Locators  . . . . . . . . . . . .  42
   19. Security Considerations . . . . . . . . . . . . . . . . . . .  43
   20. Network Management Considerations . . . . . . . . . . . . . .  43
   21. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  44
     21.1.  LISP UDP Port Numbers  . . . . . . . . . . . . . . . . .  44
   22. References  . . . . . . . . . . . . . . . . . . . . . . . . .  44
     22.1.  Normative References . . . . . . . . . . . . . . . . . .  44
     22.2.  Informative References . . . . . . . . . . . . . . . . .  45
   Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  50
   Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  50
     B.1.  Changes to draft-ietf-lisp-rfc6830bis-08  . . . . . . . .  51
     B.2.  Changes to draft-ietf-lisp-rfc6830bis-07  . . . . . . . .  51
     B.3.  Changes to draft-ietf-lisp-rfc6830bis-06  . . . . . . . .  51
     B.4.  Changes to draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  51
     B.5.  Changes to draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  52
     B.6.  Changes to draft-ietf-lisp-rfc6830bis-03  . . . . . . . .  52
     B.7.  Changes to draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  52
     B.8.  Changes to draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  52
     B.9.  Changes to draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  52

1.  Introduction

   This document describes the Locator/Identifier Separation Protocol
   (LISP).  LISP is an encapsulation protocol built around the
   fundamental idea of separating the topological location of a network
   attachment point from the node's identity [CHIAPPA].  As a result
   LISP creates two namespaces: Endpoint Identifiers (EIDs), that are
   used to identify end-hosts (e.g., nodes or Virtual Machines) and
   routable Routing Locators (RLOCs), used to identify network
   attachment points.  LISP then defines functions for mapping between
   the two namespaces and for encapsulating traffic originated by
   devices using non-routable EIDs for transport across a network
   infrastructure that routes and forwards using RLOCs.  LISP
   encapsulation uses a dynamic form of tunneling where no static
   provisioning is required or necessary.

   LISP is an overlay protocol that separates control from data-plane,
   this document specifies the data-plane, how LISP-capable routers
   (Tunnel Routers) exchange packets by encapsulating them to the



Farinacci, et al.         Expires July 13, 2018                 [Page 3]
=0C
Internet-Draft                    LISP                      January 2018


   appropriate location.  Tunnel routers are equipped with a cache,
   called map-cache, that contains EID-to-RLOC mappings.  The map-cache
   is populated using the LISP Control-Plane protocol
   [I-D.ietf-lisp-rfc6833bis].

   LISP does not require changes to either host protocol stack or to
   underlay routers.  By separating the EID from the RLOC space, LISP
   offers native Traffic Engineering, multihoming and mobility, among
   other features.

   Creation of LISP was initially motivated by discussions during the
   IAB-sponsored Routing and Addressing Workshop held in Amsterdam in
   October 2006 (see [RFC4984])

   This document specifies the LISP data-plane encapsulation and other
   LISP forwarding node functionality while [I-D.ietf-lisp-rfc6833bis]
   specifies the LISP control plane.  LISP deployment guidelines can be
   found in [RFC7215] and [RFC6835] describes considerations for network
   operational management.  Finally, [I-D.ietf-lisp-introduction]
   describes the LISP architecture.

2.  Requirements Notation

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in [RFC2119].

3.  Definition of Terms</pre><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">   Address Family Identifier (AFI):   =
AFI is a term used to describe an</pre></div></blockquote><blockquote =
type=3D"cite" class=3D""><div class=3D""><pre style=3D"word-wrap: =
break-word; white-space: pre-wrap;" class=3D"">      address encoding in =
a packet.  An address family that pertains to
      the data-plane.  See [AFN] and [RFC3232] for details.  An AFI
      value of 0 used in this specification indicates an unspecified
      encoded address where the length of the address is 0 octets
      following the 16-bit AFI value of 0.

   Anycast Address:  Anycast Address is a term used in this document to
      refer to the same IPv4 or IPv6 address configured and used on
      multiple systems at the same time.  An EID or RLOC can be an
      anycast address in each of their own address spaces.

   Client-side:  Client-side is a term used in this document to indicate
      a connection initiation attempt by an EID.  =
</pre></div></blockquote>[Luigi]<div class=3D"">As stated for =
-07.</div><div class=3D"">Following sentence not needed here. (it is =
specified in the operation part of the document)<br class=3D""><blockquote=
 type=3D"cite" class=3D""><div class=3D""><pre style=3D"word-wrap: =
break-word; white-space: pre-wrap;" class=3D"">The ITR(s) at the LISP
      site are the first to get involved in forwarding a packet from the
      source EID.

   Data-Probe:   A Data-Probe is a LISP-encapsulated data packet where
      the inner-header destination address equals the outer-header



Farinacci, et al.         Expires July 13, 2018                 [Page 4]
=0C
Internet-Draft                    LISP                      January 2018


      destination address used to trigger a Map-Reply by a decapsulating
      ETR.  In addition, the original packet is decapsulated and
      delivered to the destination host if the destination EID is in the
      EID-Prefix range configured on the ETR.  Otherwise, the packet is
      discarded.  A Data-Probe is used in some of the mapping database
      designs to "probe" or request a Map-Reply from an ETR; in other
      cases, Map-Requests are used.  See each mapping database design
      for details.  When using Data-Probes, by sending Map-Requests on
      the underlying routing system, EID-Prefixes must be advertised.

   Egress Tunnel Router (ETR):   An ETR is a router that accepts an IP
      packet where the destination address in the "outer" IP header is
      one of its own RLOCs.  The router strips the "outer" header and
      forwards the packet based on the next IP header found.  In
      general, an ETR receives LISP-encapsulated IP packets from the
      Internet on one side and sends decapsulated IP packets to site
      end-systems on the other side.  ETR functionality does not have to
      be limited to a router device.  A server host can be the endpoint
      of a LISP tunnel as well.

   EID-to-RLOC Database:   The EID-to-RLOC Database is a global
      distributed database that contains all known EID-Prefix-to-RLOC
      mappings.  Each potential ETR typically contains a small piece of
      the database: the EID-to-RLOC mappings for the EID-Prefixes
      "behind" the router.  These map to one of the router's own
      globally visible IP addresses.  Note that there MAY be transient
      conditions when the EID-Prefix for the site and Locator-Set for
      each EID-Prefix may not be the same on all ETRs.  This has no
      negative implications, since a partial set of Locators can be
      used.

   EID-to-RLOC Map-Cache:   The EID-to-RLOC map-cache is generally
      short-lived, on-demand table in an ITR that stores, tracks, and is
      responsible for timing out and otherwise validating EID-to-RLOC
      mappings.  This cache is distinct from the full "database" of EID-
      to-RLOC mappings; it is dynamic, local to the ITR(s), and
      relatively small, while the database is distributed, relatively
      static, and much more global in scope.

   EID-Prefix:   An EID-Prefix is a power-of-two block of EIDs that are
      allocated to a site by an address allocation authority.  EID-
      Prefixes are associated with a set of RLOC addresses.  EID-Prefix
      allocations can be broken up into smaller blocks when an RLOC set
      is to be associated with the larger EID-Prefix block.

   End-System:   An end-system is an IPv4 or IPv6 device that originates
      packets with a single IPv4 or IPv6 header.  The end-system
      supplies an EID value for the destination address field of the IP



Farinacci, et al.         Expires July 13, 2018                 [Page 5]
=0C
Internet-Draft                    LISP                      January 2018


      header when communicating globally (i.e., outside of its routing
      domain).  An end-system can be a host computer, a switch or router
      device, or any network appliance.

   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
      IPv6) value used in the source and destination address fields of
      the first (most inner) LISP header of a packet.  The host obtains
      a destination EID the same way it obtains a destination address
      today, for example, through a Domain Name System (DNS) [RFC1034]
      lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
      The source EID is obtained via existing mechanisms used to set a
      host's "local" IP address.  An EID used on the public Internet
      must have the same properties as any other IP address used in that
      manner; this means, among other things, that it must be globally
      unique.  An EID is allocated to a host from an EID-Prefix block
      associated with the site where the host is located.  An EID can be
      used by a host to refer to other hosts.  Note that EID blocks MAY
      be assigned in a hierarchical manner, independent of the network
      topology, to facilitate scaling of the mapping database.  In
      addition, an EID block assigned to a site MAY have site-local
      structure (subnetting) for routing within the site; this structure
      is not visible to the global routing system.  In theory, the bit
      string that represents an EID for one device can represent an RLOC
      for a different device.  When used in discussions with other
      Locator/ID separation proposals, a LISP EID will be called an
      "LEID".  Throughout this document, any references to "EID" refer
      to an LEID.

   Ingress Tunnel Router (ITR):   An ITR is a router that resides in a
      LISP site.  Packets sent by sources inside of the LISP site to
      destinations outside of the site are candidates for encapsulation
      by the ITR.  The ITR treats the IP destination address as an EID
      and performs an EID-to-RLOC mapping lookup.  The router then
      prepends an "outer" IP header with one of its routable RLOCs (in
      the RLOC space) in the source address field and the result of the
      mapping lookup in the destination address field.  Note that this
      destination RLOC MAY be an intermediate, proxy device that has
      better knowledge of the EID-to-RLOC mapping closer to the
      destination EID.  In general, an ITR receives IP packets from site
      end-systems on one side and sends LISP-encapsulated IP packets
      toward the Internet on the other side.

      Specifically, when a service provider prepends a LISP header for
      Traffic Engineering purposes, the router that does this is also
      regarded as an ITR.  The outer RLOC the ISP ITR uses can be based
      on the outer destination address (the originating ITR's supplied
      RLOC) or the inner destination address (the originating host's
      supplied EID).



Farinacci, et al.         Expires July 13, 2018                 [Page 6]
=0C
Internet-Draft                    LISP                      January 2018


   LISP Header:   LISP header is a term used in this document to refer
      to the outer IPv4 or IPv6 header, a UDP header, and a LISP-
      specific 8-octet header that follow the UDP header and that an ITR
      prepends or an ETR strips.

   LISP Router:   A LISP router is a router that performs the functions
      of any or all of the following: ITR, ETR, RTR, Proxy-ITR (PITR),
      or Proxy-ETR (PETR).

   LISP Site:  LISP site is a set of routers in an edge network that are
      under a single technical administration.  LISP routers that reside
      in the edge network are the demarcation points to separate the
      edge network from the core network.

   Locator-Status-Bits (LSBs):  Locator-Status-Bits are present in the
      LISP header.  They are used by ITRs to inform ETRs about the up/
      down status of all ETRs at the local site.  These bits are used as
      a hint to convey up/down router status and not path reachability
      status.  The LSBs can be verified by use of one of the Locator
      reachability algorithms described in Section 10.

   Negative Mapping Entry:   A negative mapping entry, also known as a
      negative cache entry, is an EID-to-RLOC entry where an EID-Prefix
      is advertised or stored with no RLOCs.  That is, the Locator-Set
      for the EID-to-RLOC entry is empty or has an encoded Locator count
      of 0.  This type of entry could be used to describe a prefix from
      a non-LISP site, which is explicitly not in the mapping database.
      There are a set of well-defined actions that are encoded in a
      Negative Map-Reply.

   Provider-Assigned (PA) Addresses:   PA addresses are an address block
      assigned to a site by each service provider to which a site
      connects.  Typically, each block is a sub-block of a service
      provider Classless Inter-Domain Routing (CIDR) [RFC4632] block and
      is aggregated into the larger block before being advertised into
      the underlay network.  Traditionally, IP multihoming has been
      implemented by each multihomed site acquiring its own globally
      visible prefix.

   Provider-Independent (PI) Addresses:   PI addresses are an address
      block assigned from a pool where blocks are not associated with
      any particular location in the network (e.g., from a particular
      service provider) and are therefore not topologically aggregatable
      in the routing system.

   Proxy-ETR (PETR):   A PETR is defined and described in [RFC6832].  A
      PETR acts like an ETR but does so on behalf of LISP sites that
      send packets to destinations at non-LISP sites.



Farinacci, et al.         Expires July 13, 2018                 [Page 7]
=0C
Internet-Draft                    LISP                      January 2018


   Proxy-ITR (PITR):   A PITR is defined and described in [RFC6832].  A
      PITR acts like an ITR but does so on behalf of non-LISP sites that
      send packets to destinations at LISP sites.

   Recursive Tunneling:   Recursive Tunneling occurs when a packet has
      more than one LISP IP header.  Additional layers of tunneling MAY
      be employed to implement Traffic Engineering or other re-routing
      as needed.  When this is done, an additional "outer" LISP header
      is added, and the original RLOCs are preserved in the "inner"
      header.

   Re-Encapsulating Tunneling Router (RTR):   An RTR acts like an ETR to
      remove a LISP header, then acts as an ITR to prepend a new LISP
      header.  This is known as Re-encapsulating Tunneling.  Doing this
      allows a packet to be re-routed by the RTR without adding the
      overhead of additional tunnel headers.  =
</pre></div></blockquote>[Luigi]<div class=3D"">As stated for =
-07.</div><div class=3D"">Following sentence not needed here. (it is =
specified in the operation part of the document)</div><div =
class=3D"">Delete from here:</div><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">Any references to tunnels
      in this specification refer to dynamic encapsulating tunnels; they
      are never statically configured. </pre></div></blockquote>to =
here.<br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D""> When using multiple mapping
      database systems, care must be taken to not create re-
      encapsulation loops through misconfiguration.

   Route-Returnability:  Route-returnability is an assumption that the
      underlying routing system will deliver packets to the destination.
      When combined with a nonce that is provided by a sender and
      returned by a receiver, this limits off-path data insertion.  A
      route-returnability check is verified when a message is sent with
      a nonce, another message is returned with the same nonce, and the
      destination of the original message appears as the source of the
      returned message.

   Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
      [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
      the output of an EID-to-RLOC mapping lookup.  An EID maps to one
      or more RLOCs.  Typically, RLOCs are numbered from aggregatable
      blocks </pre></div></blockquote><div class=3D"">remove =
=E2=80=9CAgregatable"</div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">that are assigned to a site at each =
point to which it
      attaches to the underlay network; where the topology is defined by
      the connectivity of provider networks.  Multiple RLOCs can be
      assigned to the same ETR device or to multiple ETR devices at a
      site.

   Server-side:  Server-side is a term used in this document to indicate
      that a connection initiation attempt is being accepted for a
      destination EID.

   TE-ETR:   A TE-ETR is an ETR that is deployed in a service provider
      network that strips an outer LISP header for Traffic Engineering
      purposes.




Farinacci, et al.         Expires July 13, 2018                 [Page 8]
=0C
Internet-Draft                    LISP                      January 2018


   TE-ITR:   A TE-ITR is an ITR that is deployed in a service provider
      network that prepends an additional LISP header for Traffic
      Engineering purposes.

   xTR:   An xTR is a reference to an ITR or ETR when direction of data
      flow is not part of the context description.  "xTR" refers to the
      router that is the tunnel endpoint and is used synonymously with
      the term "Tunnel Router".  For example, "An xTR can be located at
      the Customer Edge (CE) router" indicates both ITR and ETR
      functionality at the CE router.

4.  Basic Overview

   One key concept of LISP is that end-systems operate the same way they
   do today.  The IP addresses that hosts use for tracking sockets and
   connections, and for sending and receiving packets, do not change.
   In LISP terminology, these IP addresses are called Endpoint
   Identifiers (EIDs).

   Routers continue to forward packets based on IP destination
   addresses.  When a packet is LISP encapsulated, these addresses are
   referred to as Routing Locators (RLOCs).  Most routers along a path
   between two hosts will not change; they continue to perform routing/
   forwarding lookups on the destination addresses.  For routers between
   the source host and the ITR as well as routers from the ETR to the
   destination host, the destination address is an EID.  For the routers
   between the ITR and the ETR, the destination address is an RLOC.

   Another key LISP concept is the "Tunnel Router".  A Tunnel Router
   prepends LISP headers on host-originated packets and strips them
   prior to final delivery to their destination.  The IP addresses in
   this "outer header" are RLOCs.  During end-to-end packet exchange
   between two Internet hosts, an ITR prepends a new LISP header to each
   packet, and an ETR strips the new header.  The ITR performs EID-to-
   RLOC lookups to determine the routing path to the ETR, which has the
   RLOC as one of its IP addresses.

   Some basic rules governing LISP are:

   o  End-systems only send to addresses that are EIDs.  They don't know
      that addresses are EIDs versus RLOCs but assume that packets get
      to their intended destinations.  In a system where LISP is
      deployed, LISP routers intercept EID-addressed packets and assist
      in delivering them across the network core where EIDs cannot be
      routed.  The procedure a host uses to send IP packets does not
      change.

   o  EIDs are typically IP addresses assigned to hosts.



Farinacci, et al.         Expires July 13, 2018                 [Page 9]
=0C
Internet-Draft                    LISP                      January 2018


   o  Other types of EID are supported by LISP, see [RFC8060] for
      further information.
</pre></div></blockquote><div class=3D""><br class=3D""></div><div =
class=3D"">[Luigi]<div class=3D"">As stated for -07 and discussed later: =
merge the three bullets above so to simplify the flow.</div><div =
class=3D"">Here is the proposed single-bullet text:</div><div =
class=3D""><br class=3D""></div></div><div class=3D""><div class=3D"">o =
&nbsp; &nbsp;End-systems only send to addresses that are EIDs. =
&nbsp;EIDs are typically&nbsp;</div><div class=3D"">&nbsp; &nbsp; &nbsp; =
IP addresses assigned to hosts (other types of EID are supported by =
LISP,&nbsp;</div><div class=3D"">&nbsp; &nbsp; &nbsp; see [RFC8060] for =
further information). End-systems don't know</div><div class=3D"">&nbsp; =
&nbsp; &nbsp; that addresses are EIDs versus RLOCs but assume that =
packets get</div><div class=3D"">&nbsp; &nbsp; &nbsp; to their intended =
destinations. &nbsp;In a system where LISP is</div><div class=3D"">&nbsp; =
&nbsp; &nbsp; deployed, LISP routers intercept EID-addressed packets and =
assist</div><div class=3D"">&nbsp; &nbsp; &nbsp; in delivering them =
across the network core where EIDs cannot be</div><div class=3D"">&nbsp; =
&nbsp; &nbsp; routed. &nbsp;The procedure a host uses to send IP packets =
does not</div><div class=3D"">&nbsp; &nbsp; &nbsp; =
change.</div></div><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">
   o  LISP routers mostly deal with Routing Locator addresses.  See
      details in Section 4.1 to clarify what is meant by "mostly".

   o  RLOCs are always IP addresses assigned to routers, preferably
      topologically oriented addresses from provider CIDR (Classless
      Inter-Domain Routing) blocks.

   o  When a router originates packets, it MAY use as a source address
      either an EID or RLOC.  When acting as a host (e.g., when
      terminating a transport session such as Secure SHell (SSH),
      TELNET, or the Simple Network Management Protocol (SNMP)), it MAY
      use an EID that is explicitly assigned for that purpose.  An EID
      that identifies the router as a host MUST NOT be used as an RLOC;
      an EID is only routable within the scope of a site.  A typical BGP
      configuration might demonstrate this "hybrid" EID/RLOC usage where
      a router could use its "host-like" EID to terminate iBGP sessions
      to other routers in a site while at the same time using RLOCs to
      terminate eBGP sessions to routers outside the site.

   o  Packets with EIDs in them are not expected to be delivered end-to-
      end in the absence of an EID-to-RLOC mapping operation.  They are
      expected to be used locally for intra-site communication or to be
      encapsulated for inter-site communication.

   o  EID-Prefixes are likely to be hierarchically assigned in a manner
      that is optimized for administrative convenience and to facilitate
      scaling of the EID-to-RLOC mapping database.
</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07 the above bullet (even if modified compare to -07) is =
about scalability and should be removed.</div></div><blockquote =
type=3D"cite" class=3D""><div class=3D""><pre style=3D"word-wrap: =
break-word; white-space: pre-wrap;" class=3D"">
   o  EIDs MAY also be structured (subnetted) in a manner suitable for
      local routing within an Autonomous System (AS).

   An additional LISP header MAY be prepended to packets by a TE-ITR
   when re-routing of the path for a packet is desired.  A potential
   use-case for this would be an ISP router that needs to perform
   Traffic Engineering for packets flowing through its network.  In such
   a situation, termed "Recursive Tunneling", an ISP transit acts as an
   additional ITR, and the RLOC it uses for the new prepended header
   would be either a TE-ETR within the ISP (along an intra-ISP traffic
   engineered path) or a TE-ETR within another ISP (an inter-ISP traffic
   engineered path, where an agreement to build such a path exists).

   In order to avoid excessive packet overhead as well as possible
   encapsulation loops, this document recommends that a maximum of two
   LISP headers can be prepended to a packet.  For initial LISP
   deployments, it is assumed that two headers is sufficient, where the



Farinacci, et al.         Expires July 13, 2018                [Page 10]
=0C
Internet-Draft                    LISP                      January 2018


   first prepended header is used at a site for Location/Identity
   separation and the second prepended header is used inside a service
   provider for Traffic Engineering purposes.

   Tunnel Routers can be placed fairly flexibly in a multi-AS topology.
   For example, the ITR for a particular end-to-end packet exchange
   might be the first-hop or default router within a site for the source
   host.  Similarly, the ETR might be the last-hop router directly
   connected to the destination host.  Another example, perhaps for a
   VPN service outsourced to an ISP by a site, the ITR could be the
   site's border router at the service provider attachment point.
   Mixing and matching of site-operated, ISP-operated, and other Tunnel
   Routers is allowed for maximum flexibility.

4.1.  Packet Flow Sequence

   This section provides an example of the unicast packet flow,
   including also control-plane information as specified in
   [I-D.ietf-lisp-rfc6833bis].  The example also assumes the following
   conditions:

   o  Source host "<a href=3D"http://host1.abc.example.com" =
class=3D"">host1.abc.example.com</a>" is sending a packet to
      "<a href=3D"http://host2.xyz.example.com" =
class=3D"">host2.xyz.example.com</a>", exactly what host1 would do if =
the site
      was not using LISP.

   o  Each site is multihomed, so each Tunnel Router has an address
      (RLOC) assigned from the service provider address block for each
      provider to which that particular Tunnel Router is attached.

   o  The ITR(s) and ETR(s) are directly connected to the source and
      destination, respectively, but the source and destination can be
      located anywhere in the LISP site.

   o  A Map-Request is sent for an external destination when the
      destination is not found in the forwarding table or matches a
      default route.  Map-Requests are sent to the mapping database
      system by using the LISP control-plane protocol documented in
      [I-D.ietf-lisp-rfc6833bis].

   o  Map-Replies are sent on the underlying routing system topology
      using the [I-D.ietf-lisp-rfc6833bis] control-plane protocol.

   Client <a href=3D"http://host1.abc.example.com" =
class=3D"">host1.abc.example.com</a> wants to communicate with server
   <a href=3D"http://host2.xyz.example.com" =
class=3D"">host2.xyz.example.com</a>:

   1.  <a href=3D"http://host1.abc.example.com" =
class=3D"">host1.abc.example.com</a> wants to open a TCP connection to
       <a href=3D"http://host2.xyz.example.com" =
class=3D"">host2.xyz.example.com</a>.  It does a DNS lookup on
       <a href=3D"http://host2.xyz.example.com" =
class=3D"">host2.xyz.example.com</a>.  An A/AAAA record is returned.  =
This



Farinacci, et al.         Expires July 13, 2018                [Page 11]
=0C
Internet-Draft                    LISP                      January 2018


       address is the destination EID.  The locally assigned address of
       <a href=3D"http://host1.abc.example.com" =
class=3D"">host1.abc.example.com</a> is used as the source EID.  An IPv4 =
or IPv6
       packet is built and forwarded through the LISP site as a normal
       IP packet until it reaches a LISP ITR.

   2.  The LISP ITR must be able to map the destination EID to an RLOC
       of one of the ETRs at the destination site.  The specific method
       used to do this is not described in this example.  See
       [I-D.ietf-lisp-rfc6833bis] for further information.

   3.  The ITR sends a LISP Map-Request as specified in
       [I-D.ietf-lisp-rfc6833bis].  Map-Requests SHOULD be rate-limited.

   4.  The mapping system helps forwarding the Map-Request to the
       corresponding ETR.  When the Map-Request arrives at one of the
       ETRs at the destination site, it will process the packet as a
       control message.

   5.  The ETR looks at the destination EID of the Map-Request and
       matches it against the prefixes in the ETR's configured EID-to-
       RLOC mapping database.  This is the list of EID-Prefixes the ETR
       is supporting for the site it resides in.  If there is no match,
       the Map-Request is dropped.  Otherwise, a LISP Map-Reply is
       returned to the ITR.

   6.  The ITR receives the Map-Reply message, parses the message (to
       check for format validity), and stores the mapping information
       from the packet.  This information is stored in the ITR's EID-to-
       RLOC map-cache.  Note that the map-cache is an on-demand cache.
       An ITR will manage its map-cache in such a way that optimizes for
       its resource constraints.

   7.  Subsequent packets from <a href=3D"http://host1.abc.example.com" =
class=3D"">host1.abc.example.com</a> to
       <a href=3D"http://host2.xyz.example.com" =
class=3D"">host2.xyz.example.com</a> will have a LISP header prepended =
by the
       ITR using the appropriate RLOC as the LISP header destination
       address learned from the ETR.  Note that the packet MAY be sent
       to a different ETR than the one that returned the Map-Reply due
       to the source site's hashing policy or the destination site's
       Locator-Set policy.

   8.  The ETR receives these packets directly (since the destination
       address is one of its assigned IP addresses), checks the validity
       of the addresses, strips the LISP header, and forwards packets to
       the attached destination host.

   9.  In order to defer the need for a mapping lookup in the reverse
       direction, an ETR can OPTIONALLY create a cache entry that maps
       the source EID (inner-header source IP address) to the source



Farinacci, et al.         Expires July 13, 2018                [Page 12]
=0C
Internet-Draft                    LISP                      January 2018


       RLOC (outer-header source IP address) in a received LISP packet.
       Such a cache entry is termed a "gleaned" mapping and only
       contains a single RLOC for the EID in question.  More complete
       information about additional RLOCs SHOULD be verified by sending
       a LISP Map-Request for that EID.  Both the ITR and the ETR MAY
       also influence the decision the other makes in selecting an RLOC.

5.  LISP Encapsulation Details

   Since additional tunnel headers are prepended, the packet becomes
   larger and can exceed the MTU of any link traversed from the ITR to
   the ETR.  It is RECOMMENDED in IPv4 that packets do not get
   fragmented as they are encapsulated by the ITR.  Instead, the packet
   is dropped and an ICMP Unreachable/Fragmentation-Needed message is
   returned to the source.

   In the case when fragmentation is needed, this specification
   RECOMMENDS that implementations provide support for one of the
   proposed fragmentation and reassembly schemes.  Two existing schemes
   are detailed in Section 7.

   Since IPv4 or IPv6 addresses can be either EIDs or RLOCs, the LISP
   architecture supports IPv4 EIDs with IPv6 RLOCs (where the inner
   header is in IPv4 packet format and the outer header is in IPv6
   packet format) or IPv6 EIDs with IPv4 RLOCs (where the inner header
   is in IPv6 packet format and the outer header is in IPv4 packet
   format).  The next sub-sections illustrate packet formats for the
   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4
   combinations MUST be supported.  Additional types of EIDs are defined
   in [RFC8060].

5.1.  LISP IPv4-in-IPv4 Header Format



















Farinacci, et al.         Expires July 13, 2018                [Page 13]
=0C
Internet-Draft                    LISP                      January 2018


        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
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|  IHL  |    DSCP   |ECN|          Total Length         |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Identification        |Flags|      Fragment Offset    |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   OH  |  Time to Live | Protocol =3D 17 |         Header Checksum       =
|
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |                    Source Routing Locator                     |
    \  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |                 Destination Routing Locator                   |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |       Source Port =3D xxxx      |       Dest Port =3D 4341      =
  |
   UDP +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |           UDP Length          |        UDP Checksum           |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
   I \ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   S / |                 Instance ID/Locator-Status-Bits               |
   P   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|  IHL  |    DSCP   |ECN|          Total Length         |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Identification        |Flags|      Fragment Offset    |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   IH  |  Time to Live |    Protocol   |         Header Checksum       |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |                           Source EID                          |
    \  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |                         Destination EID                       |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

       IHL =3D IP-Header-Length

5.2.  LISP IPv6-in-IPv6 Header Format

        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
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|    DSCP   |ECN|           Flow Label                  |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Payload Length        | Next Header=3D17|   Hop Limit   =
|
   v   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
       |                                                               |
   O   +                                                               +
   u   |                                                               |
   t   +                     Source Routing Locator                    +
   e   |                                                               |



Farinacci, et al.         Expires July 13, 2018                [Page 14]
=0C
Internet-Draft                    LISP                      January 2018


   r   +                                                               +
       |                                                               |
   H   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   d   |                                                               |
   r   +                                                               +
       |                                                               |
   ^   +                  Destination Routing Locator                  +
   |   |                                                               |
    \  +                                                               +
     \ |                                                               |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |       Source Port =3D xxxx      |       Dest Port =3D 4341      =
  |
   UDP +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |           UDP Length          |        UDP Checksum           |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
   I \ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   S / |                 Instance ID/Locator-Status-Bits               |
   P   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|    DSCP   |ECN|           Flow Label                  |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   /   |         Payload Length        |  Next Header  |   Hop Limit   |
   v   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
       |                                                               |
   I   +                                                               +
   n   |                                                               |
   n   +                          Source EID                           +
   e   |                                                               |
   r   +                                                               +
       |                                                               |
   H   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   d   |                                                               |
   r   +                                                               +
       |                                                               |
   ^   +                        Destination EID                        +
   \   |                                                               |
    \  +                                                               +
     \ |                                                               |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

5.3.  Tunnel Header Field Descriptions

   Inner Header           (IH):  The inner header is the header on the
      datagram received from the originating host [RFC0791] [RFC8200]
      [RFC2474].  The source and destination IP addresses are EIDs.

   Outer Header: (OH)  The outer header is a new header prepended by an
      ITR.  The address fields contain RLOCs obtained from the ingress



Farinacci, et al.         Expires July 13, 2018                [Page 15]
=0C
Internet-Draft                    LISP                      January 2018


      router's EID-to-RLOC Cache.  The IP protocol number is "UDP (17)"
      from [RFC0768].  The setting of the Don't Fragment (DF) bit
      'Flags' field is according to rules listed in Sections 7.1 and
      7.2.

   UDP Header:  The UDP header contains an ITR selected source port when
      encapsulating a packet.  See Section 12 for details on the hash
      algorithm used to select a source port based on the 5-tuple of the
      inner header.  The destination port MUST be set to the well-known
      IANA-assigned port value 4341.

   UDP Checksum:  The 'UDP Checksum' field SHOULD be transmitted as zero
      by an ITR for either IPv4 [RFC0768] and IPv6 encapsulation
      [RFC6935] [RFC6936].  When a packet with a zero UDP checksum is
      received by an ETR, the ETR MUST accept the packet for
      decapsulation.  When an ITR transmits a non-zero value for the UDP
      checksum, it MUST send a correctly computed value in this field.
      When an ETR receives a packet with a non-zero UDP checksum, it MAY
      choose to verify the checksum value.  If it chooses to perform
      such verification, and the verification fails, the packet MUST be
      silently dropped.  If the ETR chooses not to perform the
      verification, or performs the verification successfully, the
      packet MUST be accepted for decapsulation.  The handling of UDP
      zero checksums over IPv6 for all tunneling protocols, including
      LISP, is subject to the applicability statement in [RFC6936].

   UDP Length:  The 'UDP Length' field is set for an IPv4-encapsulated
      packet to be the sum of the inner-header IPv4 Total Length plus
      the UDP and LISP header lengths.  For an IPv6-encapsulated packet,
      the 'UDP Length' field is the sum of the inner-header IPv6 Payload
      Length, the size of the IPv6 header (40 octets), and the size of
      the UDP and LISP headers.

   N: The N-bit is the nonce-present bit.  When this bit is set to 1,
      the low-order 24 bits of the first 32 bits of the LISP header
      contain a Nonce.  See Section 10.1 for details.  Both N- and
      V-bits MUST NOT be set in the same packet.  If they are, a
      decapsulating ETR MUST treat the 'Nonce/Map-Version' field as
      having a Nonce value present.

   L: The L-bit is the 'Locator-Status-Bits' field enabled bit.  When
      this bit is set to 1, the Locator-Status-Bits in the second
      32 bits of the LISP header are in use.








Farinacci, et al.         Expires July 13, 2018                [Page 16]
=0C
Internet-Draft                    LISP                      January 2018


     x 1 x x 0 x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                      Locator-Status-Bits                      |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   E: The E-bit is the echo-nonce-request bit.  This bit MUST be ignored
      and has no meaning when the N-bit is set to 0.  When the N-bit is
      set to 1 and this bit is set to 1, an ITR is requesting that the
      nonce value in the 'Nonce' field be echoed back in LISP-
      encapsulated packets when the ITR is also an ETR.  See
      Section 10.1 for details.

   V: The V-bit is the Map-Version present bit.  When this bit is set to
      1, the N-bit MUST be 0.  Refer to Section 13.3 for more details.
      This bit indicates that the LISP header is encoded in this
      case as:

     0 x 0 1 x x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|  Source Map-Version   |   Dest Map-Version    |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                 Instance ID/Locator-Status-Bits               |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   I: The I-bit is the Instance ID bit.  See Section 8 for more details.
      When this bit is set to 1, the 'Locator-Status-Bits' field is
      reduced to 8 bits and the high-order 24 bits are used as an
      Instance ID.  If the L-bit is set to 0, then the low-order 8 bits
      are transmitted as zero and ignored on receipt.  The format of the
      LISP header would look like this:

     x x x x 1 x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                 Instance ID                   |     LSBs      |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   R: The R-bit is a Reserved bit for future use.  It MUST be set to 0
      on transmit and MUST be ignored on receipt.

   KK:  The KK-bits are a 2-bit field used when encapsualted packets are
      encrypted.  The field is set to 00 when the packet is not
      encrypted.  See [RFC8061] for further information.





Farinacci, et al.         Expires July 13, 2018                [Page 17]
=0C
Internet-Draft                    LISP                      January 2018


   LISP Nonce:  The LISP 'Nonce' field is a 24-bit value that is
      randomly generated by an ITR when the N-bit is set to 1.  Nonce
      generation algorithms are an implementation matter but are
      required to generate different nonces when sending to different
      destinations.  </pre></div></blockquote>[Luigi]<div class=3D"">As =
stated for -07: What is a destination? Should be different RLOCs, for =
clarity.</div><blockquote type=3D"cite" class=3D""><div class=3D""><pre =
style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">However, the same nonce can be used for a period of
      time to the same destination.  The nonce is also used when the
      E-bit is set to request the nonce value to be echoed by the other
      side when packets are returned.  When the E-bit is clear but the
      N-bit is set, a remote ITR is either echoing a previously
      requested echo-nonce or providing a random nonce.  See
      Section 10.1 for more details.

   LISP Locator-Status-Bits (LSBs):  When the L-bit is also set, the
      'Locator-Status-Bits' field in the LISP header is set by an ITR to
      indicate to an ETR the up/down status of the Locators in the
      source site.  Each RLOC in a Map-Reply is assigned an ordinal
      value from 0 to n-1 (when there are n RLOCs in a mapping entry).
      The Locator-Status-Bits are numbered from 0 to n-1 from the least
      significant bit of the field.  The field is 32 bits when the I-bit
      is set to 0 and is 8 bits when the I-bit is set to 1.  When a
      Locator-Status-Bit is set to 1, the ITR is indicating to the ETR
      that the RLOC associated with the bit ordinal has up status.  See
      Section 10 for details on how an ITR can determine the status of
      the ETRs at the same site.  When a site has multiple EID-Prefixes
      that result in multiple mappings (where each could have a
      different Locator-Set), the Locator-Status-Bits setting in an
      encapsulated packet MUST reflect the mapping for the EID-Prefix
      that the inner-header source EID address matches.  If the LSB for
      an anycast Locator is set to 1, then there is at least one RLOC
      with that address, and the ETR is considered 'up'.

</pre></div></blockquote><div class=3D""><br class=3D""></div><div =
class=3D"">[Luigi]</div><div class=3D"">The following part is the ECN =
part and as afar as I cans is the only change proposed in -09</div><div =
class=3D"">(09 includes the text proposed by Albert)</div><div =
class=3D""><br class=3D""></div><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word;" =
class=3D""><span style=3D"white-space: pre-wrap;" class=3D"">   When =
doing ITR/PITR encapsulation:

   o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in
      the case of IPv6) SHOULD be copied from the inner-header 'Time to
      Live' field.

   o  The outer-header 'Type of Service' field (or the 'Traffic Class'
      field, in the case of IPv6) SHOULD be copied from the inner-header
      'Type of Service' field (with one exception; see below).

   When doing ETR/PETR decapsulation:

   o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in
      the case of IPv6) SHOULD be copied from the outer-header 'Time to
      Live' field, when the Time to Live value of the outer header is
      less than the Time to Live value of the inner header.  Failing to
      perform this check can cause the Time to Live of the inner header



Farinacci, et al.         Expires July 13, 2018                [Page 18]
=0C
Internet-Draft                    LISP                      January 2018


      to increment across encapsulation/decapsulation cycles.  This
      check is also performed when doing initial encapsulation, when a
      packet comes to an ITR or PITR destined for a LISP site.

   o  The inner-header 'Type of Service' field (or the 'Traffic Class'
      field, in the case of IPv6) SHOULD be copied from the outer-header
      'Type of Service' field (with one exception; see below).

   Note that if an ETR/PETR is also an ITR/PITR and chooses to re-
   encapsulate after decapsulating, the net effect of this is that the
   new outer header will carry the same Time to Live as the old outer
   header minus 1.

   Copying the Time to Live (TTL) serves two purposes: first, it
   preserves the distance the host intended the packet to travel;
   second, and more importantly, it provides for suppression of looping
   packets in the event there is a loop of concatenated tunnels due to
   misconfiguration.  See Section 18.3 for TTL exception handling for
   traceroute packets.

   The Explicit Congestion Notification ('ECN') field occupies bits 6
   and 7 of both the IPv4 'Type of Service' field and the IPv6 'Traffic
   Class' field [RFC3168].  The 'ECN' field requires special treatment
   in order to avoid discarding indications of congestion [RFC3168].  An
   ITR/PITR encapsulation MUST copy the 2-bit 'ECN' field from the inner
   header to the outer header.  Re-encapsulation MUST copy the 2-bit
   'ECN' field from the stripped outer header to the new outer header.
   If the 'ECN' field contains a congestion indication codepoint (the
   value is '11', the Congestion Experienced (CE) codepoint), then ETR/
   PETR decapsulation MUST copy the 2-bit 'ECN' field from the stripped
   outer header to the surviving inner header that is used to forward
   the packet beyond the ETR.  These requirements preserve CE
   indications when a packet that uses ECN traverses a LISP tunnel and
   becomes marked with a CE indication due to congestion between the
   tunnel endpoints.

6.  LISP EID-to-RLOC Map-Cache

   ITRs and PITRs maintain an on-demand cache, referred as LISP EID-to-
   RLOC Map-Cache, that contains mappings from EID-prefixes to locator
   sets.  The cache is used to encapsulate packets from the EID space to
   the corresponding RLOC network attachment point.

   When an ITR/PITR receives a packet from inside of the LISP site to
   destinations outside of the site a longest-prefix match lookup of the
   EID is done to the map-cache.





Farinacci, et al.         Expires July 13, 2018                [Page 19]
=0C
Internet-Draft                    LISP                      January 2018


   When the lookup succeeds, the locator-set retrieved from the map-
   cache is used to send the packet to the EID's topological location.

   If the lookup fails, the ITR/PITR needs to retrieve the mapping using
   the LISP control-plane protocol [I-D.ietf-lisp-rfc6833bis].  The
   mapping is then stored in the local map-cache to forward subsequent
   packets addressed to the same EID-prefix.

   The map-cache is a local cache of mappings, entries are expired based
   on the associated Time to live.  In addition, entries can be updated
   with more current information, see Section 13 for further information
   on this.  Finally, the map-cache also contains reachability
   information about EIDs and RLOCs, and uses LISP reachability
   information mechanisms to determine the reachability of RLOCs, see
   Section 10 for the specific mechanisms.

7.  Dealing with Large Encapsulated Packets

   This section proposes two mechanisms to deal with packets that exceed
   the path MTU between the ITR and ETR.

   It is left to the implementor to decide if the stateless or stateful
   mechanism SHOULD be implemented.  Both or neither can be used, since
   it is a local decision in the ITR regarding how to deal with MTU
   issues, and sites can interoperate with differing mechanisms.

   Both stateless and stateful mechanisms also apply to Re-encapsulating
   and Recursive Tunneling, so any actions below referring to an ITR
   also apply to a TE-ITR.

7.1.  A Stateless Solution to MTU Handling

   An ITR stateless solution to handle MTU issues is described as
   follows:

   1.  Define H to be the size, in octets, of the outer header an ITR
       prepends to a packet.  This includes the UDP and LISP header
       lengths.

   2.  Define L to be the size, in octets, of the maximum-sized packet
       an ITR can send to an ETR without the need for the ITR or any
       intermediate routers to fragment the packet.

   3.  Define an architectural constant S for the maximum size of a
       packet, in octets, an ITR MUST receive from the source so the
       effective MTU can be met.  That is, L =3D S + H.





Farinacci, et al.         Expires July 13, 2018                [Page 20]
=0C
Internet-Draft                    LISP                      January 2018


   When an ITR receives a packet from a site-facing interface and adds H
   octets worth of encapsulation to yield a packet size greater than L
   octets (meaning the received packet size was greater than S octets
   from the source), it resolves the MTU issue by first splitting the
   original packet into 2 equal-sized fragments.  A LISP header is then
   prepended to each fragment.  The size of the encapsulated fragments
   is then (S/2 + H), which is less than the ITR's estimate of the path
   MTU between the ITR and its correspondent ETR.

   When an ETR receives encapsulated fragments, it treats them as two
   individually encapsulated packets.  It strips the LISP headers and
   then forwards each fragment to the destination host of the
   destination site.  The two fragments are reassembled at the
   destination host into the single IP datagram that was originated by
   the source host.  Note that reassembly can happen at the ETR if the
   encapsulated packet was fragmented at or after the ITR.

   This behavior is performed by the ITR when the source host originates
   a packet with the 'DF' field of the IP header set to 0.  When the
   'DF' field of the IP header is set to 1, or the packet is an IPv6
   packet originated by the source host, the ITR will drop the packet
   when the size is greater than L and send an ICMP Unreachable/
   Fragmentation-Needed message to the source with a value of S, where S
   is (L - H).

   When the outer-header encapsulation uses an IPv4 header, an
   implementation SHOULD set the DF bit to 1 so ETR fragment reassembly
   can be avoided.  An implementation MAY set the DF bit in such headers
   to 0 if it has good reason to believe there are unresolvable path MTU
   issues between the sending ITR and the receiving ETR.

   This specification RECOMMENDS that L be defined as 1500.

7.2.  A Stateful Solution to MTU Handling

   An ITR stateful solution to handle MTU issues is described as follows
   and was first introduced in [OPENLISP]:

   1.  The ITR will keep state of the effective MTU for each Locator per
       Map-Cache entry.  The effective MTU is what the core network can
       deliver along the path between the ITR and ETR.

   2.  When an IPv6-encapsulated packet, or an IPv4-encapsulated packet
       with the DF bit set to 1, exceeds what the core network can
       deliver, one of the intermediate routers on the path will send an
       ICMP Unreachable/Fragmentation-Needed message to the ITR.  The
       ITR will parse the ICMP message to determine which Locator is




Farinacci, et al.         Expires July 13, 2018                [Page 21]
=0C
Internet-Draft                    LISP                      January 2018


       affected by the effective MTU change and then record the new
       effective MTU value in the Map-Cache entry.

   3.  When a packet is received by the ITR from a source inside of the
       site and the size of the packet is greater than the effective MTU
       stored with the Map-Cache entry associated with the destination
       EID the packet is for, the ITR will send an ICMP Unreachable/
       Fragmentation-Needed message back to the source.  The packet size
       advertised by the ITR in the ICMP Unreachable/Fragmentation-
       Needed message is the effective MTU minus the LISP encapsulation
       length.

   Even though this mechanism is stateful, it has advantages over the
   stateless IP fragmentation mechanism, by not involving the
   destination host with reassembly of ITR fragmented packets.

8.  Using Virtualization and Segmentation with LISP

   There are several cases where segregation is needed at the EID level.
   For instance, this is the case for deployments containing overlapping
   addresses, traffic isolation policies or multi-tenant virtualization.
   For these and other scenarios where segregation is needed, Instance
   IDs are used.

   An Instance ID can be carried in a LISP-encapsulated packet.  An ITR
   that prepends a LISP header will copy a 24-bit value used by the LISP
   router to uniquely identify the address space.  The value is copied
   to the 'Instance ID' field of the LISP header, and the I-bit is set
   to 1.

   When an ETR decapsulates a packet, the Instance ID from the LISP
   header is used as a table identifier to locate the forwarding table
   to use for the inner destination EID lookup.

   For example, an 802.1Q VLAN tag or VPN identifier could be used as a
   24-bit Instance ID.  See [I-D.ietf-lisp-vpn] for LISP VPN use-case
   details.

   The Instance ID that is stored in the mapping database when LISP-DDT
   [RFC8111] is used is 32 bits in length.  That means the control-plane
   can store more instances than a given data-plane can use.  Multiple
   data-planes can use the same 32-bit space as long as the low-order 24
   bits don't overlap among xTRs.








Farinacci, et al.         Expires July 13, 2018                [Page 22]
=0C
Internet-Draft                    LISP                      January 2018


9.  Routing Locator Selection&nbsp;</span><font color=3D"#000000" =
face=3D"Helvetica" class=3D""><span style=3D"white-space: normal;" =
class=3D"">
</span></font></pre></div></blockquote>[Luigi]<div class=3D"">As stated =
for -07:</div><div class=3D""><br class=3D""></div><div class=3D"">Large =
part of this section is about control plane issues and as such should be =
put in 6833bis.<br class=3D""><br class=3D"">What this section should =
state is that priority and weight are used to select the RLOC to use.<br =
class=3D"">Only exception is gleaning where we have one single RLOC and =
we do not know neither priority nor weight.<br class=3D""><br =
class=3D"">All the other operational discussion goes elsewhere, but not =
in this document.</div><div class=3D""><br class=3D""></div><br =
class=3D""><blockquote type=3D"cite" class=3D""><div class=3D""><pre =
style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
Both the client-side and server-side MAY need control over the
   selection of RLOCs for conversations between them.  This control is
   achieved by manipulating the 'Priority' and 'Weight' fields in EID-
   to-RLOC Map-Reply messages.  Alternatively, RLOC information MAY be
   gleaned from received tunneled packets or EID-to-RLOC Map-Request
   messages.

   The following are different scenarios for choosing RLOCs and the
   controls that are available:

   o  The server-side returns one RLOC.  The client-side can only use
      one RLOC.  The server-side has complete control of the selection.

   o  The server-side returns a list of RLOCs where a subset of the list
      has the same best Priority.  The client can only use the subset
      list according to the weighting assigned by the server-side.  In
      this case, the server-side controls both the subset list and load-
      splitting across its members.  The client-side can use RLOCs
      outside of the subset list if it determines that the subset list
      is unreachable (unless RLOCs are set to a Priority of 255).  Some
      sharing of control exists: the server-side determines the
      destination RLOC list and load distribution while the client-side
      has the option of using alternatives to this list if RLOCs in the
      list are unreachable.

   o  The server-side sets a Weight of 0 for the RLOC subset list.  In
      this case, the client-side can choose how the traffic load is
      spread across the subset list.  Control is shared by the server-
      side determining the list and the client determining load
      distribution.  Again, the client can use alternative RLOCs if the
      server-provided list of RLOCs is unreachable.

   o  Either side (more likely the server-side ETR) decides not to send
      a Map-Request.  For example, if the server-side ETR does not send
      Map-Requests, it gleans RLOCs from the client-side ITR, giving the
      client-side ITR responsibility for bidirectional RLOC reachability
      and preferability.  Server-side ETR gleaning of the client-side
      ITR RLOC is done by caching the inner-header source EID and the
      outer-header source RLOC of received packets.  The client-side ITR
      controls how traffic is returned and can alternate using an outer-
      header source RLOC, which then can be added to the list the
      server-side ETR uses to return traffic.  Since no Priority or
      Weights are provided using this method, the server-side ETR MUST
      assume that each client-side ITR RLOC uses the same best Priority
      with a Weight of zero.  In addition, since EID-Prefix encoding




Farinacci, et al.         Expires July 13, 2018                [Page 23]
=0C
Internet-Draft                    LISP                      January 2018


      cannot be conveyed in data packets, the EID-to-RLOC Cache on
      Tunnel Routers can grow to be very large.

   o  A "gleaned" Map-Cache entry, one learned from the source RLOC of a
      received encapsulated packet, is only stored and used for a few
      seconds, pending verification.  Verification is performed by
      sending a Map-Request to the source EID (the inner-header IP
      source address) of the received encapsulated packet.  A reply to
      this "verifying Map-Request" is used to fully populate the Map-
      Cache entry for the "gleaned" EID and is stored and used for the
      time indicated from the 'TTL' field of a received Map-Reply.  When
      a verified Map-Cache entry is stored, data gleaning no longer
      occurs for subsequent packets that have a source EID that matches
      the EID-Prefix of the verified entry.  This "gleaning" mechanism
      is OPTIONAL.

   RLOCs that appear in EID-to-RLOC Map-Reply messages are assumed to be
   reachable when the R-bit for the Locator record is set to 1.  When
   the R-bit is set to 0, an ITR or PITR MUST NOT encapsulate to the
   RLOC.  Neither the information contained in a Map-Reply nor that
   stored in the mapping database system provides reachability
   information for RLOCs.  Note that reachability is not part of the
   mapping system and is determined using one or more of the Routing
   Locator reachability algorithms described in the next section.

10.  Routing Locator Reachability

   Several mechanisms for determining RLOC reachability are currently
   defined:
</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07:</div></div><div class=3D""><br class=3D""></div><div =
class=3D"">There exists data-plane based reachability mechanisms and =
control plane reachability mechanisms.<br class=3D"">We have to keep =
here only the data plane based mechanism and move the other in =
6833bis.<br class=3D""><br class=3D"">We need to keep: 1, 6, =
Echo-Nonce,&nbsp;<br class=3D""><br class=3D"">We need to move: 2, 3, 4, =
5, &nbsp;RLOC-Probing<br class=3D""></div><div class=3D""><br =
class=3D""></div><br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">
   1.  An ETR MAY examine the Locator-Status-Bits in the LISP header of
       an encapsulated data packet received from an ITR.  If the ETR is
       also acting as an ITR and has traffic to return to the original
       ITR site, it can use this status information to help select an
       RLOC.

   2.  An ITR MAY receive an ICMP Network Unreachable or Host
       Unreachable message for an RLOC it is using.  This indicates that
       the RLOC is likely down.  Note that trusting ICMP messages may
       not be desirable, but neither is ignoring them completely.
       Implementations are encouraged to follow current best practices
       in treating these conditions.

   3.  An ITR that participates in the global routing system can
       determine that an RLOC is down if no BGP Routing Information Base
       (RIB) route exists that matches the RLOC IP address.





Farinacci, et al.         Expires July 13, 2018                [Page 24]
=0C
Internet-Draft                    LISP                      January 2018


   4.  An ITR MAY receive an ICMP Port Unreachable message from a
       destination host.  This occurs if an ITR attempts to use
       interworking [RFC6832] and LISP-encapsulated data is sent to a
       non-LISP-capable site.

   5.  An ITR MAY receive a Map-Reply from an ETR in response to a
       previously sent Map-Request.  The RLOC source of the Map-Reply is
       likely up, since the ETR was able to send the Map-Reply to the
       ITR.

   6.  When an ETR receives an encapsulated packet from an ITR, the
       source RLOC from the outer header of the packet is likely up.

   7.  An ITR/ETR pair can use the Locator reachability algorithms
       described in this section, namely Echo-Noncing or RLOC-Probing.

   When determining Locator up/down reachability by examining the
   Locator-Status-Bits from the LISP-encapsulated data packet, an ETR
   will receive up-to-date status from an encapsulating ITR about
   reachability for all ETRs at the site.  CE-based ITRs at the source
   site can determine reachability relative to each other using the site
   IGP as follows:

   o  Under normal circumstances, each ITR will advertise a default
      route into the site IGP.

   o  If an ITR fails or if the upstream link to its PE fails, its
      default route will either time out or be withdrawn.

   Each ITR can thus observe the presence or lack of a default route
   originated by the others to determine the Locator-Status-Bits it sets
   for them.

   RLOCs listed in a Map-Reply are numbered with ordinals 0 to n-1.  The
   Locator-Status-Bits in a LISP-encapsulated packet are numbered from 0
   to n-1 starting with the least significant bit.  For example, if an
   RLOC listed in the 3rd position of the Map-Reply goes down (ordinal
   value 2), then all ITRs at the site will clear the 3rd least
   significant bit (xxxx x0xx) of the 'Locator-Status-Bits' field for
   the packets they encapsulate.

   When an ETR decapsulates a packet, it will check for any change in
   the 'Locator-Status-Bits' field.  When a bit goes from 1 to 0, the
   ETR, if acting also as an ITR, will refrain from encapsulating
   packets to an RLOC that is indicated as down.  It will only resume
   using that RLOC if the corresponding Locator-Status-Bit returns to a
   value of 1.  Locator-Status-Bits are associated with a Locator-Set
   per EID-Prefix.  Therefore, when a Locator becomes unreachable, the



Farinacci, et al.         Expires July 13, 2018                [Page 25]
=0C
Internet-Draft                    LISP                      January 2018


   Locator-Status-Bit that corresponds to that Locator's position in the
   list returned by the last Map-Reply will be set to zero for that
   particular EID-Prefix.  Refer to Section 19 for security related
   issues regarding Locator-Status-Bits.

   When ITRs at the site are not deployed in CE routers, the IGP can
   still be used to determine the reachability of Locators, provided
   they are injected into the IGP.  This is typically done when a /32
   address is configured on a loopback interface.

</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07: The above paragraph has to move to 6833bis.</div><div =
class=3D""><br class=3D""></div></div><br class=3D""><blockquote =
type=3D"cite" class=3D""><div class=3D""><pre style=3D"word-wrap: =
break-word; white-space: pre-wrap;" class=3D"">   When ITRs receive ICMP =
Network Unreachable or Host Unreachable
   messages as a method to determine unreachability, they will refrain
   from using Locators that are described in Locator lists of Map-
   Replies.  However, using this approach is unreliable because many
   network operators turn off generation of ICMP Destination Unreachable
   messages.

</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
If an ITR does receive an ICMP Network Unreachable or Host
   Unreachable message, it MAY originate its own ICMP Destination
   Unreachable message destined for the host that originated the data
   packet the ITR encapsulated.

</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
Also, BGP-enabled ITRs can unilaterally examine the RIB to see if a
   locator address from a Locator-Set in a mapping entry matches a
   prefix.  If it does not find one and BGP is running in the Default-
   Free Zone (DFZ), it can decide to not use the Locator even though the
   Locator-Status-Bits indicate that the Locator is up.  In this case,
   the path from the ITR to the ETR that is assigned the Locator is not
   available.  More details are in [I-D.meyer-loc-id-implications].

</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
Optionally, an ITR can send a Map-Request to a Locator, and if a Map-
   Reply is returned, reachability of the Locator has been determined.
   Obviously, sending such probes increases the number of control
   messages originated by Tunnel Routers for active flows, so Locators
   are assumed to be reachable when they are advertised.

</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
This assumption does create a dependency: Locator unreachability is
   detected by the receipt of ICMP Host Unreachable messages.  When a
   Locator has been determined to be unreachable, it is not used for
   active traffic; this is the same as if it were listed in a Map-Reply
   with Priority 255.

</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">   =
The ITR can test the reachability of the unreachable Locator by
   sending periodic Requests.  Both Requests and Replies MUST be rate-
   limited.  Locator reachability testing is never done with data
   packets, since that increases the risk of packet loss for end-to-end
   sessions.
</pre></div></blockquote>[Luigi]<div class=3D"">As stated for -07: The =
above paragraph has to move to 6833bis.</div><div class=3D""><br =
class=3D""></div><blockquote type=3D"cite" class=3D""><div class=3D""><pre=
 style=3D"word-wrap: break-word; white-space: pre-wrap;" class=3D"">



Farinacci, et al.         Expires July 13, 2018                [Page 26]
=0C
Internet-Draft                    LISP                      January 2018


   When an ETR decapsulates a packet, it knows that it is reachable from
   the encapsulating ITR because that is how the packet arrived.  In
   most cases, the ETR can also reach the ITR but cannot assume this to
   be true, due to the possibility of path asymmetry.  In the presence
   of unidirectional traffic flow from an ITR to an ETR, the ITR SHOULD
   NOT use the lack of return traffic as an indication that the ETR is
   unreachable.  Instead, it MUST use an alternate mechanism to
   determine reachability.

10.1.  Echo Nonce Algorithm

   When data flows bidirectionally between Locators from different
   sites, a data-plane mechanism called "nonce echoing" can be used to
   determine reachability between an ITR and ETR.  When an ITR wants to
   solicit a nonce echo, it sets the N- and E-bits and places a 24-bit
   nonce [RFC4086] in the LISP header of the next encapsulated data
   packet.

   When this packet is received by the ETR, the encapsulated packet is
   forwarded as normal.  When the ETR next sends a data packet to the
   ITR, it includes the nonce received earlier with the N-bit set and
   E-bit cleared.  The ITR sees this "echoed nonce" and knows that the
   path to and from the ETR is up.

   The ITR will set the E-bit and N-bit for every packet it sends while
   in the echo-nonce-request state.  The time the ITR waits to process
   the echoed nonce before it determines the path is unreachable is
   variable and is a choice left for the implementation.

   If the ITR is receiving packets from the ETR but does not see the
   nonce echoed while being in the echo-nonce-request state, then the
   path to the ETR is unreachable.  This decision MAY be overridden by
   other Locator reachability algorithms.  Once the ITR determines that
   the path to the ETR is down, it can switch to another Locator for
   that EID-Prefix.

   Note that "ITR" and "ETR" are relative terms here.  Both devices MUST
   be implementing both ITR and ETR functionality for the echo nonce
   mechanism to operate.

   The ITR and ETR MAY both go into the echo-nonce-request state at the
   same time.  The number of packets sent or the time during which echo
   nonce requests are sent is an implementation-specific setting.
   However, when an ITR is in the echo-nonce-request state, it can echo
   the ETR's nonce in the next set of packets that it encapsulates and
   subsequently continue sending echo-nonce-request packets.





Farinacci, et al.         Expires July 13, 2018                [Page 27]
=0C
Internet-Draft                    LISP                      January 2018


   This mechanism does not completely solve the forward path
   reachability problem, as traffic may be unidirectional.  That is, the
   ETR receiving traffic at a site MAY not be the same device as an ITR
   that transmits traffic from that site, or the site-to-site traffic is
   unidirectional so there is no ITR returning traffic.

   The echo-nonce algorithm is bilateral.  That is, if one side sets the
   E-bit and the other side is not enabled for echo-noncing, then the
   echoing of the nonce does not occur and the requesting side may
   erroneously consider the Locator unreachable.  An ITR SHOULD only set
   the E-bit in an encapsulated data packet when it knows the ETR is
   enabled for echo-noncing.  This is conveyed by the E-bit in the RLOC-
   probe Map-Reply message.

   Note other Locator Reachability mechanisms can be used to compliment
   or even override the echo nonce algorithm.  See the next section for
   an example of control-plane probing.

10.2.  RLOC-Probing Algorithm
</pre></div></blockquote><div class=3D""><br class=3D""></div>[Luigi]<div =
class=3D"">As stated for -07:&nbsp;This whole section has to go to =
6833bis..</div><div class=3D""><br class=3D""></div><div class=3D"">The =
fact that (P)ITRs use this mechanism does make it a data-plane =
mechanism. is the LISP control plane running on (P)ITRs that does it, =
using control plane messages.</div><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">
   RLOC-Probing is a method that an ITR or PITR can use to determine the
   reachability status of one or more Locators that it has cached in a
   Map-Cache entry.  The probe-bit of the Map-Request and Map-Reply
   messages is used for RLOC-Probing.

   RLOC-Probing is done in the control plane on a timer basis, where an
   ITR or PITR will originate a Map-Request destined to a locator
   address from one of its own locator addresses.  A Map-Request used as
   an RLOC-probe is NOT encapsulated and NOT sent to a Map-Server or to
   the mapping database system as one would when soliciting mapping
   data.  The EID record encoded in the Map-Request is the EID-Prefix of
   the Map-Cache entry cached by the ITR or PITR.  The ITR MAY include a
   mapping data record for its own database mapping information that
   contains the local EID-Prefixes and RLOCs for its site.  RLOC-probes
   are sent periodically using a jittered timer interval.

   When an ETR receives a Map-Request message with the probe-bit set, it
   returns a Map-Reply with the probe-bit set.  The source address of
   the Map-Reply is set according to the procedure described in
   [I-D.ietf-lisp-rfc6833bis].  The Map-Reply SHOULD contain mapping
   data for the EID-Prefix contained in the Map-Request.  This provides
   the opportunity for the ITR or PITR that sent the RLOC-probe to get
   mapping updates if there were changes to the ETR's database mapping
   entries.

   There are advantages and disadvantages of RLOC-Probing.  The greatest
   benefit of RLOC-Probing is that it can handle many failure scenarios
   allowing the ITR to determine when the path to a specific Locator is



Farinacci, et al.         Expires July 13, 2018                [Page 28]
=0C
Internet-Draft                    LISP                      January 2018


   reachable or has become unreachable, thus providing a robust
   mechanism for switching to using another Locator from the cached
   Locator.  RLOC-Probing can also provide rough Round-Trip Time (RTT)
   estimates between a pair of Locators, which can be useful for network
   management purposes as well as for selecting low delay paths.  The
   major disadvantage of RLOC-Probing is in the number of control
   messages required and the amount of bandwidth used to obtain those
   benefits, especially if the requirement for failure detection times
   is very small.

11.  EID Reachability within a LISP Site

   A site MAY be multihomed using two or more ETRs.  The hosts and
   infrastructure within a site will be addressed using one or more EID-
   Prefixes that are mapped to the RLOCs of the relevant ETRs in the
   mapping system.  One possible failure mode is for an ETR to lose
   reachability to one or more of the EID-Prefixes within its own site.
   When this occurs when the ETR sends Map-Replies, it can clear the
   R-bit associated with its own Locator.  And when the ETR is also an
   ITR, it can clear its Locator-Status-Bit in the encapsulation data
   header.

   It is recognized that there are no simple solutions to the site
   partitioning problem because it is hard to know which part of the
   EID-Prefix range is partitioned and which Locators can reach any sub-
   ranges of the EID-Prefixes.  Note that this is not a new problem
   introduced by the LISP architecture.  The problem exists today when a
   multihomed site uses BGP to advertise its reachability upstream.

12.  Routing Locator Hashing

   When an ETR provides an EID-to-RLOC mapping in a Map-Reply message
   that is stored in the map-cache of a requesting ITR, the Locator-Set
   for the EID-Prefix MAY contain different Priority and Weight values
   for each locator address.  When more than one best Priority Locator
   exists, the ITR can decide how to load-share traffic against the
   corresponding Locators.

   The following hash algorithm MAY be used by an ITR to select a
   Locator for a packet destined to an EID for the EID-to-RLOC mapping:

   1.  Either a source and destination address hash or the traditional
       5-tuple hash can be used.  The traditional 5-tuple hash includes
       the source and destination addresses; source and destination TCP,
       UDP, or Stream Control Transmission Protocol (SCTP) port numbers;
       and the IP protocol number field or IPv6 next-protocol fields of
       a packet that a host originates from within a LISP site.  When a
       packet is not a TCP, UDP, or SCTP packet, the source and



Farinacci, et al.         Expires July 13, 2018                [Page 29]
=0C
Internet-Draft                    LISP                      January 2018


       destination addresses only from the header are used to compute
       the hash.

   2.  Take the hash value and divide it by the number of Locators
       stored in the Locator-Set for the EID-to-RLOC mapping.

   3.  The remainder will yield a value of 0 to "number of Locators
       minus 1".  Use the remainder to select the Locator in the
       Locator-Set.

   Note that when a packet is LISP encapsulated, the source port number
   in the outer UDP header needs to be set.  Selecting a hashed value
   allows core routers that are attached to Link Aggregation Groups
   (LAGs) to load-split the encapsulated packets across member links of
   such LAGs.  Otherwise, core routers would see a single flow, since
   packets have a source address of the ITR, for packets that are
   originated by different EIDs at the source site.  A suggested setting
   for the source port number computed by an ITR is a 5-tuple hash
   function on the inner header, as described above.

   Many core router implementations use a 5-tuple hash to decide how to
   balance packet load across members of a LAG.  The 5-tuple hash
   includes the source and destination addresses of the packet and the
   source and destination ports when the protocol number in the packet
   is TCP or UDP.  For this reason, UDP encoding is used for LISP
   encapsulation.

13.  Changing the Contents of EID-to-RLOC Mappings
</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07:</div></div><div class=3D""><br class=3D""></div><div =
class=3D"">This is a control plane issue, as such it has to go in =
6833bis, with two exception:<br class=3D"">The very first paragraph =
stetting the problem, and the versioning subsection, because it is a =
data-plane mechanism.</div><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">
   Since the LISP architecture uses a caching scheme to retrieve and
   store EID-to-RLOC mappings, the only way an ITR can get a more up-to-
   date mapping is to re-request the mapping.  However, the ITRs do not
   know when the mappings change, and the ETRs do not keep track of
   which ITRs requested its mappings.  For scalability reasons, it is
   desirable to maintain this approach but need to provide a way for
   ETRs to change their mappings and inform the sites that are currently
   communicating with the ETR site using such mappings.

   When adding a new Locator record in lexicographic order to the end of
   a Locator-Set, it is easy to update mappings.  We assume that new
   mappings will maintain the same Locator ordering as the old mapping
   but will just have new Locators appended to the end of the list.  So,
   some ITRs can have a new mapping while other ITRs have only an old
   mapping that is used until they time out.  When an ITR has only an
   old mapping but detects bits set in the Locator-Status-Bits that
   correspond to Locators beyond the list it has cached, it simply
   ignores them.  However, this can only happen for locator addresses




Farinacci, et al.         Expires July 13, 2018                [Page 30]
=0C
Internet-Draft                    LISP                      January 2018


   that are lexicographically greater than the locator addresses in the
   existing Locator-Set.

   When a Locator record is inserted in the middle of a Locator-Set, to
   maintain lexicographic order, the SMR procedure in Section 13.2 is
   used to inform ITRs and PITRs of the new Locator-Status-Bit mappings.

   When a Locator record is removed from a Locator-Set, ITRs that have
   the mapping cached will not use the removed Locator because the xTRs
   will set the Locator-Status-Bit to 0.  So, even if the Locator is in
   the list, it will not be used.  For new mapping requests, the xTRs
   can set the Locator AFI to 0 (indicating an unspecified address), as
   well as setting the corresponding Locator-Status-Bit to 0.  This
   forces ITRs with old or new mappings to avoid using the removed
   Locator.

   If many changes occur to a mapping over a long period of time, one
   will find empty record slots in the middle of the Locator-Set and new
   records appended to the Locator-Set. At some point, it would be
   useful to compact the Locator-Set so the Locator-Status-Bit settings
   can be efficiently packed.

   We propose here three approaches for Locator-Set compaction: one
   operational mechanism and two protocol mechanisms.  The operational
   approach uses a clock sweep method.  The protocol approaches use the
   concept of Solicit-Map-Requests and Map-Versioning.

13.1.  Clock Sweep

   The clock sweep approach uses planning in advance and the use of
   count-down TTLs to time out mappings that have already been cached.
   The default setting for an EID-to-RLOC mapping TTL is 24 hours.  So,
   there is a 24-hour window to time out old mappings.  The following
   clock sweep procedure is used:

   1.  24 hours before a mapping change is to take effect, a network
       administrator configures the ETRs at a site to start the clock
       sweep window.

   2.  During the clock sweep window, ETRs continue to send Map-Reply
       messages with the current (unchanged) mapping records.  The TTL
       for these mappings is set to 1 hour.

   3.  24 hours later, all previous cache entries will have timed out,
       and any active cache entries will time out within 1 hour.  During
       this 1-hour window, the ETRs continue to send Map-Reply messages
       with the current (unchanged) mapping records with the TTL set to
       1 minute.



Farinacci, et al.         Expires July 13, 2018                [Page 31]
=0C
Internet-Draft                    LISP                      January 2018


   4.  At the end of the 1-hour window, the ETRs will send Map-Reply
       messages with the new (changed) mapping records.  So, any active
       caches can get the new mapping contents right away if not cached,
       or in 1 minute if they had the mapping cached.  The new mappings
       are cached with a TTL equal to the TTL in the Map-Reply.

13.2.  Solicit-Map-Request (SMR)

   Soliciting a Map-Request is a selective way for ETRs, at the site
   where mappings change, to control the rate they receive requests for
   Map-Reply messages.  SMRs are also used to tell remote ITRs to update
   the mappings they have cached.

   Since the ETRs don't keep track of remote ITRs that have cached their
   mappings, they do not know which ITRs need to have their mappings
   updated.  As a result, an ETR will solicit Map-Requests (called an
   SMR message) from those sites to which it has been sending
   encapsulated data for the last minute.  In particular, an ETR will
   send an SMR to an ITR to which it has recently sent encapsulated
   data.  This can only occur when both ITR and ETR functionality reside
   in the same router.

   An SMR message is simply a bit set in a Map-Request message.  An ITR
   or PITR will send a Map-Request when they receive an SMR message.
   Both the SMR sender and the Map-Request responder MUST rate-limit
   these messages.  Rate-limiting can be implemented as a global rate-
   limiter or one rate-limiter per SMR destination.

   The following procedure shows how an SMR exchange occurs when a site
   is doing Locator-Set compaction for an EID-to-RLOC mapping:

   1.  When the database mappings in an ETR change, the ETRs at the site
       begin to send Map-Requests with the SMR bit set for each Locator
       in each Map-Cache entry the ETR caches.

   2.  A remote ITR that receives the SMR message will schedule sending
       a Map-Request message to the source locator address of the SMR
       message or to the mapping database system.  A newly allocated
       random nonce is selected, and the EID-Prefix used is the one
       copied from the SMR message.  If the source Locator is the only
       Locator in the cached Locator-Set, the remote ITR SHOULD send a
       Map-Request to the database mapping system just in case the
       single Locator has changed and may no longer be reachable to
       accept the Map-Request.

   3.  The remote ITR MUST rate-limit the Map-Request until it gets a
       Map-Reply while continuing to use the cached mapping.  When
       Map-Versioning as described in Section 13.3 is used, an SMR



Farinacci, et al.         Expires July 13, 2018                [Page 32]
=0C
Internet-Draft                    LISP                      January 2018


       sender can detect if an ITR is using the most up-to-date database
       mapping.

   4.  The ETRs at the site with the changed mapping will reply to the
       Map-Request with a Map-Reply message that has a nonce from the
       SMR-invoked Map-Request.  The Map-Reply messages SHOULD be rate-
       limited.  This is important to avoid Map-Reply implosion.

   5.  The ETRs at the site with the changed mapping record the fact
       that the site that sent the Map-Request has received the new
       mapping data in the Map-Cache entry for the remote site so the
       Locator-Status-Bits are reflective of the new mapping for packets
       going to the remote site.  The ETR then stops sending SMR
       messages.

   For security reasons, an ITR MUST NOT process unsolicited Map-
   Replies.  To avoid Map-Cache entry corruption by a third party, a
   sender of an SMR-based Map-Request MUST be verified.  If an ITR
   receives an SMR-based Map-Request and the source is not in the
   Locator-Set for the stored Map-Cache entry, then the responding Map-
   Request MUST be sent with an EID destination to the mapping database
   system.  Since the mapping database system is a more secure way to
   reach an authoritative ETR, it will deliver the Map-Request to the
   authoritative source of the mapping data.

   When an ITR receives an SMR-based Map-Request for which it does not
   have a cached mapping for the EID in the SMR message, it may not send
   an SMR-invoked Map-Request.  This scenario can occur when an ETR
   sends SMR messages to all Locators in the Locator-Set it has stored
   in its map-cache but the remote ITRs that receive the SMR may not be
   sending packets to the site.  There is no point in updating the ITRs
   until they need to send, in which case they will send Map-Requests to
   obtain a Map-Cache entry.

13.3.  Database Map-Versioning

   When there is unidirectional packet flow between an ITR and ETR, and
   the EID-to-RLOC mappings change on the ETR, it needs to inform the
   ITR so encapsulation to a removed Locator can stop and can instead be
   started to a new Locator in the Locator-Set.

   An ETR, when it sends Map-Reply messages, conveys its own Map-Version
   Number.  This is known as the Destination Map-Version Number.  ITRs
   include the Destination Map-Version Number in packets they
   encapsulate to the site.  When an ETR decapsulates a packet and
   detects that the Destination Map-Version Number is less than the
   current version for its mapping, the SMR procedure described in
   Section 13.2 occurs.



Farinacci, et al.         Expires July 13, 2018                [Page 33]
=0C
Internet-Draft                    LISP                      January 2018


   An ITR, when it encapsulates packets to ETRs, can convey its own Map-
   Version Number.  This is known as the Source Map-Version Number.
   When an ETR decapsulates a packet and detects that the Source Map-
   Version Number is greater than the last Map-Version Number sent in a
   Map-Reply from the ITR's site, the ETR will send a Map-Request to one
   of the ETRs for the source site.

   A Map-Version Number is used as a sequence number per EID-Prefix, so
   values that are greater are considered to be more recent.  A value of
   0 for the Source Map-Version Number or the Destination Map-Version
   Number conveys no versioning information, and an ITR does no
   comparison with previously received Map-Version Numbers.

   A Map-Version Number can be included in Map-Register messages as
   well.  This is a good way for the Map-Server to assure that all ETRs
   for a site registering to it will be synchronized according to Map-
   Version Number.

   See [RFC6834] for a more detailed analysis and description of
   Database Map-Versioning.

14.  Multicast Considerations

   A multicast group address, as defined in the original Internet
   architecture, is an identifier of a grouping of topologically
   independent receiver host locations.  The address encoding itself
   does not determine the location of the receiver(s).  The multicast
   routing protocol, and the network-based state the protocol creates,
   determine where the receivers are located.

   In the context of LISP, a multicast group address is both an EID and
   a Routing Locator.  Therefore, no specific semantic or action needs
   to be taken for a destination address, as it would appear in an IP
   header.  Therefore, a group address that appears in an inner IP
   header built by a source host will be used as the destination EID.
   The outer IP header (the destination Routing Locator address),
   prepended by a LISP router, can use the same group address as the
   destination Routing Locator, use a multicast or unicast Routing
   Locator obtained from a Mapping System lookup, or use other means to
   determine the group address mapping.

   With respect to the source Routing Locator address, the ITR prepends
   its own IP address as the source address of the outer IP header.
   Just like it would if the destination EID was a unicast address.
   This source Routing Locator address, like any other Routing Locator
   address, MUST be globally routable.





Farinacci, et al.         Expires July 13, 2018                [Page 34]
=0C
Internet-Draft                    LISP                      January 2018


   There are two approaches for LISP-Multicast, one that uses native
   multicast routing in the underlay with no support from the Mapping
   System and the other that uses only unicast routing in the underlay
   with support from the Mapping System.  See [RFC6831] and
   [I-D.ietf-lisp-signal-free-multicast], respectively, for details.
   Details for LISP-Multicast and interworking with non-LISP sites are
   described in [RFC6831] and [RFC6832].

15.  Router Performance Considerations

   LISP is designed to be very "hardware-based forwarding friendly".  A
   few implementation techniques can be used to incrementally implement
   LISP:

   o  When a tunnel-encapsulated packet is received by an ETR, the outer
      destination address may not be the address of the router.  This
      makes it challenging for the control plane to get packets from the
      hardware.  This may be mitigated by creating special Forwarding
      Information Base (FIB) entries for the EID-Prefixes of EIDs served
      by the ETR (those for which the router provides an RLOC
      translation).  These FIB entries are marked with a flag indicating
      that control-plane processing SHOULD be performed.  The forwarding
      logic of testing for particular IP protocol number values is not
      necessary.  There are a few proven cases where no changes to
      existing deployed hardware were needed to support the LISP data-
      plane.

   o  On an ITR, prepending a new IP header consists of adding more
      octets to a MAC rewrite string and prepending the string as part
      of the outgoing encapsulation procedure.  Routers that support
      Generic Routing Encapsulation (GRE) tunneling [RFC2784] or 6to4
      tunneling [RFC3056] may already support this action.

   o  A packet's source address or interface the packet was received on
      can be used to select VRF (Virtual Routing/Forwarding).  The VRF's
      routing table can be used to find EID-to-RLOC mappings.

   For performance issues related to map-cache management, see
   Section 19.

16.  Mobility Considerations
</pre></div></blockquote><div class=3D""><br class=3D""></div><div =
class=3D"">[Luigi]<div class=3D"">As stated for -07:</div></div><div =
class=3D""><br class=3D""></div><div class=3D""><div class=3D"">Move it =
out. Mobility is equivalent to mapping change, it is a CP issue.<br =
class=3D""><br class=3D"">move it in an OAM document.</div></div><div =
class=3D""><br class=3D""></div><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">
   There are several kinds of mobility, of which only some might be of
   concern to LISP.  Essentially, they are as follows.







Farinacci, et al.         Expires July 13, 2018                [Page 35]
=0C
Internet-Draft                    LISP                      January 2018


16.1.  Slow Mobility

   A site wishes to change its attachment points to the Internet, and
   its LISP Tunnel Routers will have new RLOCs when it changes upstream
   providers.  Changes in EID-to-RLOC mappings for sites are expected to
   be handled by configuration, outside of LISP.

   An individual endpoint wishes to move but is not concerned about
   maintaining session continuity.  Renumbering is involved.  LISP can
   help with the issues surrounding renumbering [RFC4192] [LISA96] by
   decoupling the address space used by a site from the address spaces
   used by its ISPs [RFC4984].

16.2.  Fast Mobility

   Fast endpoint mobility occurs when an endpoint moves relatively
   rapidly, changing its IP-layer network attachment point.  Maintenance
   of session continuity is a goal.  This is where the Mobile IPv4
   [RFC5944] and Mobile IPv6 [RFC6275] [RFC4866] mechanisms are used and
   primarily where interactions with LISP need to be explored, such as
   the mechanisms in [I-D.ietf-lisp-eid-mobility] when the EID moves but
   the RLOC is in the network infrastructure.

   In LISP, one possibility is to "glean" information.  When a packet
   arrives, the ETR could examine the EID-to-RLOC mapping and use that
   mapping for all outgoing traffic to that EID.  It can do this after
   performing a route-returnability check, to ensure that the new
   network location does have an internal route to that endpoint.
   However, this does not cover the case where an ITR (the node assigned
   the RLOC) at the mobile-node location has been compromised.

   Mobile IP packet exchange is designed for an environment in which all
   routing information is disseminated before packets can be forwarded.
   In order to allow the Internet to grow to support expected future
   use, we are moving to an environment where some information may have
   to be obtained after packets are in flight.  Modifications to IP
   mobility should be considered in order to optimize the behavior of
   the overall system.  Anything that decreases the number of new EID-
   to-RLOC mappings needed when a node moves, or maintains the validity
   of an EID-to-RLOC mapping for a longer time, is useful.

   In addition to endpoints, a network can be mobile, possibly changing
   xTRs.  A "network" can be as small as a single router and as large as
   a whole site.  This is different from site mobility in that it is
   fast and possibly short-lived, but different from endpoint mobility
   in that a whole prefix is changing RLOCs.  However, the mechanisms
   are the same, and there is no new overhead in LISP.  A map request
   for any endpoint will return a binding for the entire mobile prefix.



Farinacci, et al.         Expires July 13, 2018                [Page 36]
=0C
Internet-Draft                    LISP                      January 2018


   If mobile networks become a more common occurrence, it may be useful
   to revisit the design of the mapping service and allow for dynamic
   updates of the database.

   The issue of interactions between mobility and LISP needs to be
   explored further.  Specific improvements to the entire system will
   depend on the details of mapping mechanisms.  Mapping mechanisms
   should be evaluated on how well they support session continuity for
   mobile nodes.  See [I-D.ietf-lisp-predictive-rlocs] for more recent
   mechanisms which can provide near-zero packet loss during handoffs.

16.3.  LISP Mobile Node Mobility

   A mobile device can use the LISP infrastructure to achieve mobility
   by implementing the LISP encapsulation and decapsulation functions
   and acting as a simple ITR/ETR.  By doing this, such a "LISP mobile
   node" can use topologically independent EID IP addresses that are not
   advertised into and do not impose a cost on the global routing
   system.  These EIDs are maintained at the edges of the mapping system
   in LISP Map-Servers and Map-Resolvers) and are provided on demand to
   only the correspondents of the LISP mobile node.

   Refer to [I-D.ietf-lisp-mn] for more details for when the EID and
   RLOC are co-located in the roaming node.

17.  LISP xTR Placement and Encapsulation Methods
</pre></div></blockquote>Luigi]<div class=3D"">As stated for =
-07:</div><div class=3D""><br class=3D""></div><div class=3D"">This ia =
an OAM issue and has to be moved out of the document.<br =
class=3D""></div><div class=3D""><br class=3D""></div><blockquote =
type=3D"cite" class=3D""><div class=3D""><pre style=3D"word-wrap: =
break-word; white-space: pre-wrap;" class=3D"">
   This section will explore how and where ITRs and ETRs can be placed
   in the network and will discuss the pros and cons of each scenario.
   For a more detailed networkd design deployment recommendation, refer
   to [RFC7215].

   There are two basic deployment tradeoffs to consider: centralized
   versus distributed caches; and flat, Recursive, or Re-encapsulating
   Tunneling.  When deciding on centralized versus distributed caching,
   the following issues SHOULD be considered:

   o  Are the xTRs spread out so that the caches are spread across all
      the memories of each router?  A centralized cache is when an ITR
      keeps a cache for all the EIDs it is encapsulating to.  The packet
      takes a direct path to the destination Locator.  A distributed
      cache is when an ITR needs help from other Re-Encapsulating Tunnel
      Routers (RTRs) because it does not store all the cache entries for
      the EIDs it is encapsulating to.  So, the packet takes a path
      through RTRs that have a different set of cache entries.

   o  Should management "touch points" be minimized by only choosing a
      few xTRs, just enough for redundancy?



Farinacci, et al.         Expires July 13, 2018                [Page 37]
=0C
Internet-Draft                    LISP                      January 2018


   o  In general, using more ITRs doesn't increase management load,
      since caches are built and stored dynamically.  On the other hand,
      using more ETRs does require more management, since EID-Prefix-to-
      RLOC mappings need to be explicitly configured.

   When deciding on flat, Recursive, or Re-Encapsulating Tunneling, the
   following issues SHOULD be considered:

   o  Flat tunneling implements a single encapsulation path between the
      source site and destination site.  This generally offers better
      paths between sources and destinations with a single encapsulation
      path.

   o  Recursive Tunneling is when encapsulated traffic is again further
      encapsulated in another tunnel, either to implement VPNs or to
      perform Traffic Engineering.  When doing VPN-based tunneling, the
      site has some control, since the site is prepending a new
      encapsulation header.  In the case of TE-based tunneling, the site
      MAY have control if it is prepending a new tunnel header, but if
      the site's ISP is doing the TE, then the site has no control.
      Recursive Tunneling generally will result in suboptimal paths but
      with the benefit of steering traffic to parts of the network that
      have more resources available.

   o  The technique of Re-Encapsulation ensures that packets only
      require one encapsulation header.  So, if a packet needs to be re-
      routed, it is first decapsulated by the RTR and then Re-
      Encapsulated with a new encapsulation header using a new RLOC.

   The next sub-sections will examine where xTRs and RTRs can reside in
   the network.

17.1.  First-Hop/Last-Hop xTRs

   By locating xTRs close to hosts, the EID-Prefix set is at the
   granularity of an IP subnet.  So, at the expense of more EID-Prefix-
   to-RLOC sets for the site, the caches in each xTR can remain
   relatively small.  But caches always depend on the number of non-
   aggregated EID destination flows active through these xTRs.

   With more xTRs doing encapsulation, the increase in control traffic
   grows as well: since the EID granularity is greater, more Map-
   Requests and Map-Replies are traveling between more routers.

   The advantage of placing the caches and databases at these stub
   routers is that the products deployed in this part of the network
   have better price-memory ratios than their core router counterparts.
   Memory is typically less expensive in these devices, and fewer routes



Farinacci, et al.         Expires July 13, 2018                [Page 38]
=0C
Internet-Draft                    LISP                      January 2018


   are stored (only IGP routes).  These devices tend to have excess
   capacity, both for forwarding and routing states.

   LISP functionality can also be deployed in edge switches.  These
   devices generally have layer-2 ports facing hosts and layer-3 ports
   facing the Internet.  Spare capacity is also often available in these
   devices.

17.2.  Border/Edge xTRs

   Using Customer Edge (CE) routers for xTR placement allows the EID
   space associated with a site to be reachable via a small set of RLOCs
   assigned to the CE-based xTRs for that site.

   This offers the opposite benefit of the first-hop/last-hop xTR
   scenario: the number of mapping entries and network management touch
   points is reduced, allowing better scaling.

   One disadvantage is that fewer network resources are used to reach
   host endpoints, thereby centralizing the point-of-failure domain and
   creating network choke points at the CE xTR.

   Note that more than one CE xTR at a site can be configured with the
   same IP address.  In this case, an RLOC is an anycast address.  This
   allows resilience between the CE xTRs.  That is, if a CE xTR fails,
   traffic is automatically routed to the other xTRs using the same
   anycast address.  However, this comes with the disadvantage where the
   site cannot control the entrance point when the anycast route is
   advertised out from all border routers.  Another disadvantage of
   using anycast Locators is the limited advertisement scope of /32 (or
   /128 for IPv6) routes.

17.3.  ISP Provider Edge (PE) xTRs

   The use of ISP PE routers as xTRs is not the typical deployment
   scenario envisioned in this specification.  This section attempts to
   capture some of the reasoning behind this preference for implementing
   LISP on CE routers.

   The use of ISP PE routers for xTR placement gives an ISP, rather than
   a site, control over the location of the ETRs.  That is, the ISP can
   decide whether the xTRs are in the destination site (in either CE
   xTRs or last-hop xTRs within a site) or at other PE edges.  The
   advantage of this case is that two encapsulation headers can be
   avoided.  By having the PE be the first router on the path to
   encapsulate, it can choose a TE path first, and the ETR can
   decapsulate and Re-Encapsulate for a new encapsuluation path to the
   destination end site.



Farinacci, et al.         Expires July 13, 2018                [Page 39]
=0C
Internet-Draft                    LISP                      January 2018


   An obvious disadvantage is that the end site has no control over
   where its packets flow or over the RLOCs used.  Other disadvantages
   include difficulty in synchronizing path liveness updates between CE
   and PE routers.

   As mentioned in earlier sections, a combination of these scenarios is
   possible at the expense of extra packet header overhead; if both site
   and provider want control, then Recursive or Re-Encapsulating Tunnels
   are used.

17.4.  LISP Functionality with Conventional NATs

   LISP routers can be deployed behind Network Address Translator (NAT)
   devices to provide the same set of packet services hosts have today
   when they are addressed out of private address space.

   It is important to note that a locator address in any LISP control
   message MUST be a routable address and therefore [RFC1918] addresses
   SHOULD only be presence when running in a local environment.  When a
   LISP xTR is configured with private RLOC addresses and resides behind
   a NAT device and desires to communicate on the Internet, the private
   addresses MUST be used only in the outer IP header so the NAT device
   can translate properly.  Otherwise, EID addresses MUST be translated
   before encapsulation is performed when LISP VPNs are not in use.
   Both NAT translation and LISP encapsulation functions could be co-
   located in the same device.

17.5.  Packets Egressing a LISP Site

   When a LISP site is using two ITRs for redundancy, the failure of one
   ITR will likely shift outbound traffic to the second.  This second
   ITR's cache MAY not be populated with the same EID-to-RLOC mapping
   entries as the first.  If this second ITR does not have these
   mappings, traffic will be dropped while the mappings are retrieved
   from the mapping system.  The retrieval of these messages may
   increase the load of requests being sent into the mapping system.

18.  Traceroute Considerations
</pre></div></blockquote>[Luigi]<div class=3D"">As stated for =
-07:</div><div class=3D""><br class=3D""></div><div class=3D"">I =
consider traceroute again an OAM issue.</div><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">
   When a source host in a LISP site initiates a traceroute to a
   destination host in another LISP site, it is highly desirable for it
   to see the entire path.  Since packets are encapsulated from the ITR
   to the ETR, the hop across the tunnel could be viewed as a single
   hop.  However, LISP traceroute will provide the entire path so the
   user can see 3 distinct segments of the path from a source LISP host
   to a destination LISP host:





Farinacci, et al.         Expires July 13, 2018                [Page 40]
=0C
Internet-Draft                    LISP                      January 2018


      Segment 1 (in source LISP site based on EIDs):

          source host ---&gt; first hop ... next hop ---&gt; ITR

      Segment 2 (in the core network based on RLOCs):

          ITR ---&gt; next hop ... next hop ---&gt; ETR

      Segment 3 (in the destination LISP site based on EIDs):

          ETR ---&gt; next hop ... last hop ---&gt; destination host

   For segment 1 of the path, ICMP Time Exceeded messages are returned
   in the normal manner as they are today.  The ITR performs a TTL
   decrement and tests for 0 before encapsulating.  Therefore, the ITR's
   hop is seen by the traceroute source as having an EID address (the
   address of the site-facing interface).

   For segment 2 of the path, ICMP Time Exceeded messages are returned
   to the ITR because the TTL decrement to 0 is done on the outer
   header, so the destinations of the ICMP messages are the ITR RLOC
   address and the source RLOC address of the encapsulated traceroute
   packet.  The ITR looks inside of the ICMP payload to inspect the
   traceroute source so it can return the ICMP message to the address of
   the traceroute client and also retain the core router IP address in
   the ICMP message.  This is so the traceroute client can display the
   core router address (the RLOC address) in the traceroute output.  The
   ETR returns its RLOC address and responds to the TTL decrement to 0,
   as the previous core routers did.

   For segment 3, the next-hop router downstream from the ETR will be
   decrementing the TTL for the packet that was encapsulated, sent into
   the core, decapsulated by the ETR, and forwarded because it isn't the
   final destination.  If the TTL is decremented to 0, any router on the
   path to the destination of the traceroute, including the next-hop
   router or destination, will send an ICMP Time Exceeded message to the
   source EID of the traceroute client.  The ICMP message will be
   encapsulated by the local ITR and sent back to the ETR in the
   originated traceroute source site, where the packet will be delivered
   to the host.

18.1.  IPv6 Traceroute

   IPv6 traceroute follows the procedure described above, since the
   entire traceroute data packet is included in the ICMP Time Exceeded
   message payload.  Therefore, only the ITR needs to pay special
   attention to forwarding ICMP messages back to the traceroute source.




Farinacci, et al.         Expires July 13, 2018                [Page 41]
=0C
Internet-Draft                    LISP                      January 2018


18.2.  IPv4 Traceroute

   For IPv4 traceroute, we cannot follow the above procedure, since IPv4
   ICMP Time Exceeded messages only include the invoking IP header and
   8 octets that follow the IP header.  Therefore, when a core router
   sends an IPv4 Time Exceeded message to an ITR, all the ITR has in the
   ICMP payload is the encapsulated header it prepended, followed by a
   UDP header.  The original invoking IP header, and therefore the
   identity of the traceroute source, is lost.

   The solution we propose to solve this problem is to cache traceroute
   IPv4 headers in the ITR and to match them up with corresponding IPv4
   Time Exceeded messages received from core routers and the ETR.  The
   ITR will use a circular buffer for caching the IPv4 and UDP headers
   of traceroute packets.  It will select a 16-bit number as a key to
   find them later when the IPv4 Time Exceeded messages are received.
   When an ITR encapsulates an IPv4 traceroute packet, it will use the
   16-bit number as the UDP source port in the encapsulating header.
   When the ICMP Time Exceeded message is returned to the ITR, the UDP
   header of the encapsulating header is present in the ICMP payload,
   thereby allowing the ITR to find the cached headers for the
   traceroute source.  The ITR puts the cached headers in the payload
   and sends the ICMP Time Exceeded message to the traceroute source
   retaining the source address of the original ICMP Time Exceeded
   message (a core router or the ETR of the site of the traceroute
   destination).

   The signature of a traceroute packet comes in two forms.  The first
   form is encoded as a UDP message where the destination port is
   inspected for a range of values.  The second form is encoded as an
   ICMP message where the IP identification field is inspected for a
   well-known value.

18.3.  Traceroute Using Mixed Locators

   When either an IPv4 traceroute or IPv6 traceroute is originated and
   the ITR encapsulates it in the other address family header, one
   cannot get all 3 segments of the traceroute.  Segment 2 of the
   traceroute cannot be conveyed to the traceroute source, since it is
   expecting addresses from intermediate hops in the same address format
   for the type of traceroute it originated.  Therefore, in this case,
   segment 2 will make the tunnel look like one hop.  All the ITR has to
   do to make this work is to not copy the inner TTL to the outer,
   encapsulating header's TTL when a traceroute packet is encapsulated
   using an RLOC from a different address family.  This will cause no
   TTL decrement to 0 to occur in core routers between the ITR and ETR.





Farinacci, et al.         Expires July 13, 2018                [Page 42]
=0C
Internet-Draft                    LISP                      January 2018


19.  Security Considerations

   Security considerations for LISP are discussed in [RFC7833], in
   addition [I-D.ietf-lisp-sec] provides authentication and integrity to
   LISP mappings.
</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07:</div></div><div class=3D""><br class=3D""></div><div =
class=3D"">lisp-sec is control-plane has to be referenced in =
6833bis.</div><div class=3D""><br class=3D""></div><div =
class=3D"">authentication and integrity of mappings is a control plane =
issue.</div><br class=3D""><blockquote type=3D"cite" class=3D""><div =
class=3D""><pre style=3D"word-wrap: break-word; white-space: pre-wrap;" =
class=3D"">
   A complete LISP threat analysis can be found in [RFC7835], in what
   follows we provide a summary.

   The optional mechanisms of gleaning is offered to directly obtain a
   mapping from the LISP encapsulated packets.  Specifically, an xTR can
   learn the EID-to-RLOC mapping by inspecting the source RLOC and
   source EID of an encapsulated packet, and insert this new mapping
   into its map-cache.  An off-path attacker can spoof the source EID
   address to divert the traffic sent to the victim's spoofed EID.  If
   the attacker spoofs the source RLOC, it can mount a DoS attack by
   redirecting traffic to the spoofed victim;s RLOC, potentially
   overloading it.

   The LISP Data-Plane defines several mechanisms to monitor RLOC data-
   plane reachability, in this context Locator-Status Bits, Nonce-
   Present and Echo-Nonce bits of the LISP encapsulation header can be
   manipulated by an attacker to mount a DoS attack.  An off-path
   attacker able to spoof the RLOC of a victim's xTR can manipulate such
   mechanisms to declare a set of RLOCs unreachable.  This can be used
   also, for instance, to declare only one RLOC reachable with the aim
   of overload it.

   Map-Versioning is a data-plane mechanism used to signal a peering xTR
   that a local EID-to-RLOC mapping has been updated, so that the
   peering xTR uses LISP Control-Plane signaling message to retrieve a
   fresh mapping.  This can be used by an attacker to forge the map-
   versioning field of a LISP encapsulated header and force an excessive
   amount of signaling between xTRs that may overload them.

   Most of the attack vectors can be mitigated with careful deployment
   and configuration, information learned opportunistically (such as LSB
   or gleaning) SHOULD be verified with other reachability mechanisms.
   In addition, systematic rate-limitation and filtering is an effective
   technique to mitigate attacks that aim to overload the control-plane.

20.  Network Management Considerations

   Considerations for network management tools exist so the LISP
   protocol suite can be operationally managed.  These mechanisms can be
   found in [RFC7052] and [RFC6835].





Farinacci, et al.         Expires July 13, 2018                [Page 43]
=0C
Internet-Draft                    LISP                      January 2018


21.  IANA Considerations

   This section provides guidance to the Internet Assigned Numbers
   Authority (IANA) regarding registration of values related to this
   data-plane LISP specification, in accordance with BCP 26 [RFC8126].

21.1.  LISP UDP Port Numbers

   The IANA registry has allocated UDP port numbers 4341 and 4342 for
   lisp-data and lisp-control operation, respectively.  IANA has updated
   the description for UDP ports 4341 and 4342 as follows:

       lisp-data      4341 udp    LISP Data Packets
       lisp-control   4342 udp    LISP Control Packets
</pre></div></blockquote><div class=3D"">[Luigi]<div class=3D"">As =
stated for -07:</div></div><div class=3D""><br class=3D""></div>4342 is =
control-plane and MUST be requested to IANA in the 6833bis =
document.</div><div class=3D""><br class=3D""><blockquote type=3D"cite" =
class=3D""><div class=3D""><pre style=3D"word-wrap: break-word; =
white-space: pre-wrap;" class=3D"">
22.  References

22.1.  Normative References

   [I-D.ietf-lisp-rfc6833bis]
              Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,
              "Locator/ID Separation Protocol (LISP) Control-Plane",
              draft-ietf-lisp-rfc6833bis-07 (work in progress), December
              2017.

   [RFC0768]  Postel, J., "User Datagram Protocol", STD 6, RFC 768,
              DOI 10.17487/RFC0768, August 1980,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc768" =
class=3D"">https://www.rfc-editor.org/info/rfc768</a>&gt;.

   [RFC0791]  Postel, J., "Internet Protocol", STD 5, RFC 791,
              DOI 10.17487/RFC0791, September 1981,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc791" =
class=3D"">https://www.rfc-editor.org/info/rfc791</a>&gt;.

   [RFC1918]  Rekhter, Y., Moskowitz, B., Karrenberg, D., de Groot, G.,
              and E. Lear, "Address Allocation for Private Internets",
              BCP 5, RFC 1918, DOI 10.17487/RFC1918, February 1996,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc1918" =
class=3D"">https://www.rfc-editor.org/info/rfc1918</a>&gt;.

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc2119" =
class=3D"">https://www.rfc-editor.org/info/rfc2119</a>&gt;.

   [RFC2474]  Nichols, K., Blake, S., Baker, F., and D. Black,
              "Definition of the Differentiated Services Field (DS
              Field) in the IPv4 and IPv6 Headers", RFC 2474,
              DOI 10.17487/RFC2474, December 1998,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc2474" =
class=3D"">https://www.rfc-editor.org/info/rfc2474</a>&gt;.



Farinacci, et al.         Expires July 13, 2018                [Page 44]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC3168]  Ramakrishnan, K., Floyd, S., and D. Black, "The Addition
              of Explicit Congestion Notification (ECN) to IP",
              RFC 3168, DOI 10.17487/RFC3168, September 2001,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc3168" =
class=3D"">https://www.rfc-editor.org/info/rfc3168</a>&gt;.

   [RFC4086]  Eastlake 3rd, D., Schiller, J., and S. Crocker,
              "Randomness Requirements for Security", BCP 106, RFC 4086,
              DOI 10.17487/RFC4086, June 2005,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc4086" =
class=3D"">https://www.rfc-editor.org/info/rfc4086</a>&gt;.

   [RFC4632]  Fuller, V. and T. Li, "Classless Inter-domain Routing
              (CIDR): The Internet Address Assignment and Aggregation
              Plan", BCP 122, RFC 4632, DOI 10.17487/RFC4632, August
              2006, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc4632" =
class=3D"">https://www.rfc-editor.org/info/rfc4632</a>&gt;.

   [RFC5944]  Perkins, C., Ed., "IP Mobility Support for IPv4, Revised",
              RFC 5944, DOI 10.17487/RFC5944, November 2010,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc5944" =
class=3D"">https://www.rfc-editor.org/info/rfc5944</a>&gt;.

   [RFC6275]  Perkins, C., Ed., Johnson, D., and J. Arkko, "Mobility
              Support in IPv6", RFC 6275, DOI 10.17487/RFC6275, July
              2011, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc6275" =
class=3D"">https://www.rfc-editor.org/info/rfc6275</a>&gt;.

   [RFC7833]  Howlett, J., Hartman, S., and A. Perez-Mendez, Ed., "A
              RADIUS Attribute, Binding, Profiles, Name Identifier
              Format, and Confirmation Methods for the Security
              Assertion Markup Language (SAML)", RFC 7833,
              DOI 10.17487/RFC7833, May 2016,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc7833" =
class=3D"">https://www.rfc-editor.org/info/rfc7833</a>&gt;.

   [RFC8126]  Cotton, M., Leiba, B., and T. Narten, "Guidelines for
              Writing an IANA Considerations Section in RFCs", BCP 26,
              RFC 8126, DOI 10.17487/RFC8126, June 2017,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc8126" =
class=3D"">https://www.rfc-editor.org/info/rfc8126</a>&gt;.

   [RFC8200]  Deering, S. and R. Hinden, "Internet Protocol, Version 6
              (IPv6) Specification", STD 86, RFC 8200,
              DOI 10.17487/RFC8200, July 2017,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc8200" =
class=3D"">https://www.rfc-editor.org/info/rfc8200</a>&gt;.

22.2.  Informative References

   [AFN]      IANA, "Address Family Numbers", August 2016,
              &lt;<a =
href=3D"http://www.iana.org/assignments/address-family-numbers" =
class=3D"">http://www.iana.org/assignments/address-family-numbers</a>&gt;.=


   [CHIAPPA]  Chiappa, J., "Endpoints and Endpoint names: A Proposed",
              1999,
              &lt;<a =
href=3D"http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt" =
class=3D"">http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt</a>&gt;.



Farinacci, et al.         Expires July 13, 2018                [Page 45]
=0C
Internet-Draft                    LISP                      January 2018


   [I-D.ietf-lisp-eid-mobility]
              Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,
              F., and D. Farinacci, "LISP L2/L3 EID Mobility Using a
              Unified Control Plane", draft-ietf-lisp-eid-mobility-01
              (work in progress), November 2017.

   [I-D.ietf-lisp-introduction]
              Cabellos-Aparicio, A. and D. Saucez, "An Architectural
              Introduction to the Locator/ID Separation Protocol
              (LISP)", draft-ietf-lisp-introduction-13 (work in
              progress), April 2015.

   [I-D.ietf-lisp-mn]
              Farinacci, D., Lewis, D., Meyer, D., and C. White, "LISP
              Mobile Node", draft-ietf-lisp-mn-01 (work in progress),
              October 2017.

   [I-D.ietf-lisp-predictive-rlocs]
              Farinacci, D. and P. Pillay-Esnault, "LISP Predictive
              RLOCs", draft-ietf-lisp-predictive-rlocs-01 (work in
              progress), November 2017.

   [I-D.ietf-lisp-sec]
              Maino, F., Ermagan, V., Cabellos-Aparicio, A., and D.
              Saucez, "LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-14
              (work in progress), October 2017.

   [I-D.ietf-lisp-signal-free-multicast]
              Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",
              draft-ietf-lisp-signal-free-multicast-07 (work in
              progress), November 2017.

   [I-D.ietf-lisp-vpn]
              Moreno, V. and D. Farinacci, "LISP Virtual Private
              Networks (VPNs)", draft-ietf-lisp-vpn-01 (work in
              progress), November 2017.

   [I-D.meyer-loc-id-implications]
              Meyer, D. and D. Lewis, "Architectural Implications of
              Locator/ID Separation", draft-meyer-loc-id-implications-01
              (work in progress), January 2009.

   [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. Coffin,
              "Renumbering: Threat or Menace?", Usenix Tenth System
              Administration Conference (LISA 96), October 1996.






Farinacci, et al.         Expires July 13, 2018                [Page 46]
=0C
Internet-Draft                    LISP                      January 2018


   [OPENLISP]
              Iannone, L., Saucez, D., and O. Bonaventure, "OpenLISP
              Implementation Report", Work in Progress, July 2008.

   [RFC1034]  Mockapetris, P., "Domain names - concepts and facilities",
              STD 13, RFC 1034, DOI 10.17487/RFC1034, November 1987,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc1034" =
class=3D"">https://www.rfc-editor.org/info/rfc1034</a>&gt;.

   [RFC2784]  Farinacci, D., Li, T., Hanks, S., Meyer, D., and P.
              Traina, "Generic Routing Encapsulation (GRE)", RFC 2784,
              DOI 10.17487/RFC2784, March 2000,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc2784" =
class=3D"">https://www.rfc-editor.org/info/rfc2784</a>&gt;.

   [RFC3056]  Carpenter, B. and K. Moore, "Connection of IPv6 Domains
              via IPv4 Clouds", RFC 3056, DOI 10.17487/RFC3056, February
              2001, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc3056" =
class=3D"">https://www.rfc-editor.org/info/rfc3056</a>&gt;.

   [RFC3232]  Reynolds, J., Ed., "Assigned Numbers: RFC 1700 is Replaced
              by an On-line Database", RFC 3232, DOI 10.17487/RFC3232,
              January 2002, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc3232" =
class=3D"">https://www.rfc-editor.org/info/rfc3232</a>&gt;.

   [RFC3261]  Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston,
              A., Peterson, J., Sparks, R., Handley, M., and E.
              Schooler, "SIP: Session Initiation Protocol", RFC 3261,
              DOI 10.17487/RFC3261, June 2002,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc3261" =
class=3D"">https://www.rfc-editor.org/info/rfc3261</a>&gt;.

   [RFC4192]  Baker, F., Lear, E., and R. Droms, "Procedures for
              Renumbering an IPv6 Network without a Flag Day", RFC 4192,
              DOI 10.17487/RFC4192, September 2005,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc4192" =
class=3D"">https://www.rfc-editor.org/info/rfc4192</a>&gt;.

   [RFC4866]  Arkko, J., Vogt, C., and W. Haddad, "Enhanced Route
              Optimization for Mobile IPv6", RFC 4866,
              DOI 10.17487/RFC4866, May 2007,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc4866" =
class=3D"">https://www.rfc-editor.org/info/rfc4866</a>&gt;.

   [RFC4984]  Meyer, D., Ed., Zhang, L., Ed., and K. Fall, Ed., "Report
              from the IAB Workshop on Routing and Addressing",
              RFC 4984, DOI 10.17487/RFC4984, September 2007,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc4984" =
class=3D"">https://www.rfc-editor.org/info/rfc4984</a>&gt;.

   [RFC6831]  Farinacci, D., Meyer, D., Zwiebel, J., and S. Venaas, "The
              Locator/ID Separation Protocol (LISP) for Multicast
              Environments", RFC 6831, DOI 10.17487/RFC6831, January
              2013, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc6831" =
class=3D"">https://www.rfc-editor.org/info/rfc6831</a>&gt;.





Farinacci, et al.         Expires July 13, 2018                [Page 47]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC6832]  Lewis, D., Meyer, D., Farinacci, D., and V. Fuller,
              "Interworking between Locator/ID Separation Protocol
              (LISP) and Non-LISP Sites", RFC 6832,
              DOI 10.17487/RFC6832, January 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc6832" =
class=3D"">https://www.rfc-editor.org/info/rfc6832</a>&gt;.

   [RFC6834]  Iannone, L., Saucez, D., and O. Bonaventure, "Locator/ID
              Separation Protocol (LISP) Map-Versioning", RFC 6834,
              DOI 10.17487/RFC6834, January 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc6834" =
class=3D"">https://www.rfc-editor.org/info/rfc6834</a>&gt;.

   [RFC6835]  Farinacci, D. and D. Meyer, "The Locator/ID Separation
              Protocol Internet Groper (LIG)", RFC 6835,
              DOI 10.17487/RFC6835, January 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc6835" =
class=3D"">https://www.rfc-editor.org/info/rfc6835</a>&gt;.

   [RFC6935]  Eubanks, M., Chimento, P., and M. Westerlund, "IPv6 and
              UDP Checksums for Tunneled Packets", RFC 6935,
              DOI 10.17487/RFC6935, April 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc6935" =
class=3D"">https://www.rfc-editor.org/info/rfc6935</a>&gt;.

   [RFC6936]  Fairhurst, G. and M. Westerlund, "Applicability Statement
              for the Use of IPv6 UDP Datagrams with Zero Checksums",
              RFC 6936, DOI 10.17487/RFC6936, April 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc6936" =
class=3D"">https://www.rfc-editor.org/info/rfc6936</a>&gt;.

   [RFC7052]  Schudel, G., Jain, A., and V. Moreno, "Locator/ID
              Separation Protocol (LISP) MIB", RFC 7052,
              DOI 10.17487/RFC7052, October 2013,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc7052" =
class=3D"">https://www.rfc-editor.org/info/rfc7052</a>&gt;.

   [RFC7215]  Jakab, L., Cabellos-Aparicio, A., Coras, F., Domingo-
              Pascual, J., and D. Lewis, "Locator/Identifier Separation
              Protocol (LISP) Network Element Deployment
              Considerations", RFC 7215, DOI 10.17487/RFC7215, April
              2014, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc7215" =
class=3D"">https://www.rfc-editor.org/info/rfc7215</a>&gt;.

   [RFC7835]  Saucez, D., Iannone, L., and O. Bonaventure, "Locator/ID
              Separation Protocol (LISP) Threat Analysis", RFC 7835,
              DOI 10.17487/RFC7835, April 2016,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc7835" =
class=3D"">https://www.rfc-editor.org/info/rfc7835</a>&gt;.

   [RFC8060]  Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical
              Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,
              February 2017, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc8060" =
class=3D"">https://www.rfc-editor.org/info/rfc8060</a>&gt;.






Farinacci, et al.         Expires July 13, 2018                [Page 48]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC8061]  Farinacci, D. and B. Weis, "Locator/ID Separation Protocol
              (LISP) Data-Plane Confidentiality", RFC 8061,
              DOI 10.17487/RFC8061, February 2017,
              &lt;<a href=3D"https://www.rfc-editor.org/info/rfc8061" =
class=3D"">https://www.rfc-editor.org/info/rfc8061</a>&gt;.

   [RFC8111]  Fuller, V., Lewis, D., Ermagan, V., Jain, A., and A.
              Smirnov, "Locator/ID Separation Protocol Delegated
              Database Tree (LISP-DDT)", RFC 8111, DOI 10.17487/RFC8111,
              May 2017, &lt;<a =
href=3D"https://www.rfc-editor.org/info/rfc8111" =
class=3D"">https://www.rfc-editor.org/info/rfc8111</a>&gt;.










































Farinacci, et al.         Expires July 13, 2018                [Page 49]
=0C
Internet-Draft                    LISP                      January 2018


Appendix A.  Acknowledgments

   An initial thank you goes to Dave Oran for planting the seeds for the
   initial ideas for LISP.  His consultation continues to provide value
   to the LISP authors.

   A special and appreciative thank you goes to Noel Chiappa for
   providing architectural impetus over the past decades on separation
   of location and identity, as well as detailed reviews of the LISP
   architecture and documents, coupled with enthusiasm for making LISP a
   practical and incremental transition for the Internet.

   The authors would like to gratefully acknowledge many people who have
   contributed discussions and ideas to the making of this proposal.
   They include Scott Brim, Andrew Partan, John Zwiebel, Jason Schiller,
   Lixia Zhang, Dorian Kim, Peter Schoenmaker, Vijay Gill, Geoff Huston,
   David Conrad, Mark Handley, Ron Bonica, Ted Seely, Mark Townsley,
   Chris Morrow, Brian Weis, Dave McGrew, Peter Lothberg, Dave Thaler,
   Eliot Lear, Shane Amante, Ved Kafle, Olivier Bonaventure, Luigi
   Iannone, Robin Whittle, Brian Carpenter, Joel Halpern, Terry
   Manderson, Roger Jorgensen, Ran Atkinson, Stig Venaas, Iljitsch van
   Beijnum, Roland Bless, Dana Blair, Bill Lynch, Marc Woolward, Damien
   Saucez, Damian Lezama, Attilla De Groot, Parantap Lahiri, David
   Black, Roque Gagliano, Isidor Kouvelas, Jesper Skriver, Fred Templin,
   Margaret Wasserman, Sam Hartman, Michael Hofling, Pedro Marques, Jari
   Arkko, Gregg Schudel, Srinivas Subramanian, Amit Jain, Xu Xiaohu,
   Dhirendra Trivedi, Yakov Rekhter, John Scudder, John Drake, Dimitri
   Papadimitriou, Ross Callon, Selina Heimlich, Job Snijders, Vina
   Ermagan, Fabio Maino, Victor Moreno, Chris White, Clarence Filsfils,
   Alia Atlas, Florin Coras and Alberto Rodriguez.

   This work originated in the Routing Research Group (RRG) of the IRTF.
   An individual submission was converted into the IETF LISP working
   group document that became this RFC.

   The LISP working group would like to give a special thanks to Jari
   Arkko, the Internet Area AD at the time that the set of LISP
   documents were being prepared for IESG last call, and for his
   meticulous reviews and detailed commentaries on the 7 working group
   last call documents progressing toward standards-track RFCs.

Appendix B.  Document Change Log

   [RFC Editor: Please delete this section on publication as RFC.]







Farinacci, et al.         Expires July 13, 2018                [Page 50]
=0C
Internet-Draft                    LISP                      January 2018


B.1.  Changes to draft-ietf-lisp-rfc6830bis-08

   o  Posted January 2018.

   o  Remove references to research work for any protocol mechanisms.

   o  Document scanned to make sure it is RFC 2119 compliant.

   o  Made changes to reflect comments from document WG shepherd Luigi
      Iannone.

   o  Ran IDNITs on the document.

B.2.  Changes to draft-ietf-lisp-rfc6830bis-07

   o  Posted November 2017.

   o  Rephrase how Instance-IDs are used and don't refer to [RFC1918]
      addresses.

B.3.  Changes to draft-ietf-lisp-rfc6830bis-06

   o  Posted October 2017.

   o  Put RTR definition before it is used.

   o  Rename references that are now working group drafts.

   o  Remove "EIDs MUST NOT be used as used by a host to refer to other
      hosts.  Note that EID blocks MAY LISP RLOCs".

   o  Indicate what address-family can appear in data packets.

   o  ETRs may, rather than will, be the ones to send Map-Replies.

   o  Recommend, rather than mandate, max encapsulation headers to 2.

   o  Reference VPN draft when introducing Instance-ID.

   o  Indicate that SMRs can be sent when ITR/ETR are in the same node.

   o  Clarify when private addreses can be used.

B.4.  Changes to draft-ietf-lisp-rfc6830bis-05

   o  Posted August 2017.

   o  Make it clear that a Reencapsulating Tunnel Router is an RTR.



Farinacci, et al.         Expires July 13, 2018                [Page 51]
=0C
Internet-Draft                    LISP                      January 2018


B.5.  Changes to draft-ietf-lisp-rfc6830bis-04

   o  Posted July 2017.

   o  Changed reference of IPv6 RFC2460 to RFC8200.

   o  Indicate that the applicability statement for UDP zero checksums
      over IPv6 adheres to RFC6936.

B.6.  Changes to draft-ietf-lisp-rfc6830bis-03

   o  Posted May 2017.

   o  Move the control-plane related codepoints in the IANA
      Considerations section to RFC6833bis.

B.7.  Changes to draft-ietf-lisp-rfc6830bis-02

   o  Posted April 2017.

   o  Reflect some editorial comments from Damien Sausez.

B.8.  Changes to draft-ietf-lisp-rfc6830bis-01

   o  Posted March 2017.

   o  Include references to new RFCs published.

   o  Change references from RFC6833 to RFC6833bis.

   o  Clarified LCAF text in the IANA section.

   o  Remove references to "experimental".

B.9.  Changes to draft-ietf-lisp-rfc6830bis-00

   o  Posted December 2016.

   o  Created working group document from draft-farinacci-lisp
      -rfc6830-00 individual submission.  No other changes made.

Authors' Addresses









Farinacci, et al.         Expires July 13, 2018                [Page 52]
=0C
Internet-Draft                    LISP                      January 2018


   Dino Farinacci
   Cisco Systems
   Tasman Drive
   San Jose, CA  95134
   USA

   <a href=3D"mailto:farinacci@gmail.com" class=3D"">EMail: =
farinacci@gmail.com</a>


   Vince Fuller
   Cisco Systems
   Tasman Drive
   San Jose, CA  95134
   USA

   <a href=3D"mailto:vince.fuller@gmail.com" class=3D"">EMail: =
vince.fuller@gmail.com</a>


   Dave Meyer
   Cisco Systems
   170 Tasman Drive
   San Jose, CA
   USA

   <a href=3D"mailto:dmm@1-4-5.net" class=3D"">EMail: dmm@1-4-5.net</a>


   Darrel Lewis
   Cisco Systems
   170 Tasman Drive
   San Jose, CA
   USA

   <a href=3D"mailto:darlewis@cisco.com" class=3D"">EMail: =
darlewis@cisco.com</a>


   Albert Cabellos
   UPC/BarcelonaTech
   Campus Nord, C. Jordi Girona 1-3
   Barcelona, Catalunya
   Spain

   <a href=3D"mailto:acabello@ac.upc.edu" class=3D"">EMail: =
acabello@ac.upc.edu</a>








Farinacci, et al.         Expires July 13, 2018                [Page =
53]</pre></div></blockquote><div class=3D""><div class=3D""><br =
class=3D""></div></div></div></body></html>=

--Apple-Mail=_51FE3D12-393C-4C91-8721-43E1FAF44168--


From nobody Tue Jan 23 07:12:01 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 68CA3126C23 for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 07:12:00 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id qO1ML9ZlEfE5 for <lisp@ietfa.amsl.com>; Tue, 23 Jan 2018 07:11:58 -0800 (PST)
Received: from mail-qt0-x234.google.com (mail-qt0-x234.google.com [IPv6:2607:f8b0:400d:c0d::234]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 85AE11205D3 for <lisp@ietf.org>; Tue, 23 Jan 2018 07:11:58 -0800 (PST)
Received: by mail-qt0-x234.google.com with SMTP id c2so2042363qtn.9 for <lisp@ietf.org>; Tue, 23 Jan 2018 07:11:58 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=HsJSMc3zpqYP5WoW0/s1KbN/vbCViTrgM42vCUpJXp8=; b=NCIqmsu40nH75ZyvEfGUDrSGy7jx2fAyH7D5PWhmuY/YbmErG+V6gR1UAIS4IslQ3y 7YV9KL2hhDM2CvXqQNx7V6p0qcXdoD+LlEFduUxsa/X7go7RHktmjM9fZofZW9iQYNMW Mw8NI7JmBDbKkSlLAD69+uLnl6GvpASEQlDio6xzFmQWl4GbeYMpe4UCJNwAXDOPJZrB RNyhtadz6uiznTfH9z5OYbhvygHb7irsYxY3pwZEgiX5z3EWfMMf9glalJmwnliPmmIk skOuNUZVLDdPYFfUUup10szuBslfwcS3nxV0WvUkvJd7N88UCC+8mtv9tVNkCu7Xad8f JYuQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=HsJSMc3zpqYP5WoW0/s1KbN/vbCViTrgM42vCUpJXp8=; b=Sqfw11gBGRq5y7zRZkyVjfSGRYwz/O2ZnQiJ5Xr0h8yOE8QQHJERIUM79zgWraMMlL TPTbeqgX7Gusoiulq4TrTEOPc8io6sbqv9LR15Ifv8ODtPIJ7Dkka+bKxC5WICPZT8mB i4vDkHv7fGcUAIagiuctf1rtAHMIivAK+wuIiQufxnN4RyPGp/wnSHP5tVmcTln41phC XgEpMDNUBlvgGnb28vlG2Xg4K4SLDjo6CeSG569OOMd15wcGuucrRVT5Ay+msogYlCVj /2fTOjFv/cT5n59MrUGsl33RymfErI0ZnZ79l5KvcARl8MDeG6ZouFBJmDVunMNH9kRw dgqw==
X-Gm-Message-State: AKwxytcfjbduyWnQTdbYn4jaPPTQ366Py7qMAQex/4i5TFmGgEmJ72an KHcqOaD8xMPXpX1SBudgUCQADe9W
X-Google-Smtp-Source: AH8x226md0CRkbGU9kq46l79l0xIV8WoAaLsBFtaGV9OJul9aB1czlIEZwezczPQxN62K7GbWVG3Rg==
X-Received: by 10.200.15.83 with SMTP id l19mr4217760qtk.45.1516720317644; Tue, 23 Jan 2018 07:11:57 -0800 (PST)
Received: from [10.1.4.8] ([50.235.163.251]) by smtp.gmail.com with ESMTPSA id z140sm11806052qkb.51.2018.01.23.07.11.55 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 23 Jan 2018 07:11:56 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <327012BF-6840-4019-A9FE-39279032459D@gigix.net>
Date: Tue, 23 Jan 2018 07:11:55 -0800
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <679ACE36-D505-4370-BD36-76A6C855FE31@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <327012BF-6840-4019-A9FE-39279032459D@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/V-qDbPWKwc740MntmvkOehNUHME>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 23 Jan 2018 15:12:00 -0000

>> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20
>=20
> For the RLOC I would put modify the definition as follows:
>=20
> Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
>       [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
>       the output of an EID-to-RLOC mapping lookup.  An EID maps to one
>       or more RLOCs.  Typically, RLOCs are numbered from address =
blocks=20
>      assigned to a site at each point to which it attaches to the =
underlay=20
>      network, as such they represent the identifiers of the underlay.
>       Multiple RLOCs can be assigned to the same ETR device or to=20
>       multiple ETR devices at a site.

Adding =E2=80=9Cidentifier of the underlay=E2=80=9D does not improve or =
simplify the definition. It makes it more confusing IMO. People will =
interpret LISP has IDs in the underlay. Note in dozens of conversations =
I've had with people on LISP who are new to the concepts refer to RLOCs =
as =E2=80=9Crouting IDs=E2=80=9D. And then when I ask them to clarify if =
they mean =E2=80=9CEIDs=E2=80=9D or =E2=80=9CRLOCs=E2=80=9D, they say =
=E2=80=9Coh EIDs=E2=80=9D.

The definition above will not help with this confusion.

I would like to keep the definition as is with your edits from your =
lastest commentary review.

Thanks,
Dino


From nobody Wed Jan 24 05:12:44 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 1EE4112D94E for <lisp@ietfa.amsl.com>; Wed, 24 Jan 2018 05:12:43 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.601
X-Spam-Level: 
X-Spam-Status: No, score=-2.601 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_LOW=-0.7, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id pkhy-AJ-Gpul for <lisp@ietfa.amsl.com>; Wed, 24 Jan 2018 05:12:41 -0800 (PST)
Received: from mail-wm0-x229.google.com (mail-wm0-x229.google.com [IPv6:2a00:1450:400c:c09::229]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 0C34212420B for <lisp@ietf.org>; Wed, 24 Jan 2018 05:12:41 -0800 (PST)
Received: by mail-wm0-x229.google.com with SMTP id f3so8552112wmc.1 for <lisp@ietf.org>; Wed, 24 Jan 2018 05:12:40 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=7Ep8C2bJiv5/HsDBEBnqgIZ+aV6FrYgRJcsInbfA9Wg=; b=sZuxlmL6hJ2E31u4ytKguvCwN7y6d2Vs23NQ6PTSIGNaY1CKGbZ56Q1+jECjFFi20a jTxAlsD+/eO0wTKXBpjm8KxoCFGyr07+QgnQ1eAoJwajvY/vc3KWziGdn3WLXIg80GiC IdVn1EP36ckLHknxZBwvTjTyudJysRKeI2wvwdnMC5wdGmpMnYxYlhvcOeGQdcyevdsD C1mYXq47163XRaRat/z+u4wspOwtoA1GwUMaPG5T6hK6Zon6GfVvIvIfb4R81WFLlvt7 dDPnnUn7MdjUVTeb1xUtH7MGdv0GZ4bYRV+fgPJsvb5ml0VAN2LHH5tzyzx4FJfZjotB cSVQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=7Ep8C2bJiv5/HsDBEBnqgIZ+aV6FrYgRJcsInbfA9Wg=; b=QVvDyFKClUfH15cI8JqHnipdg10MoAaBaJGHYAi/CJYV1/BaYL0AqjwYlL/c8z3Y1a 6FGjD39iw2Jsw9AUSxwriNWHq+MyFlXxY8BFujDzf0XdjTsoAfzXuKeVKoS1ZNpxA/Yt EyJB15dV/S+ilPXRTbGRJc/LI3YuCNW67QjCnQXw66/nay8acjgcmvidAj9okcXHlQTo 5kf7tR9lt5t8Ra80z9iHj7aH5KebdtPSMesuQvEdUYYuqXp2yfP3A+N/8NVoT3prw3Ah +pT1d7RKMiG0Zy+rbGfZpj8Nk4uERzxkPiJav5xf4t4yDFtp7DDPKvHKrB5p3c1FrowE ZHmw==
X-Gm-Message-State: AKwxytdGA2gP5Htp1ZmtJImMRhb1mLmatlQEPWi5+ugHDa3GcW/6SpNZ d5bWM9VqEpSsAaysdl/t+VfiCjHlPzE=
X-Google-Smtp-Source: AH8x227pRNaldG4epCDDFI0/A1u91RuWGgMFmg24tT5BVf6x5nCP8Hc3J3xHZkv9W9y1q5Cw3JtIdQ==
X-Received: by 10.80.183.170 with SMTP id h39mr24420200ede.124.1516799559391;  Wed, 24 Jan 2018 05:12:39 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:8094:d68e:bf33:ec7c? ([2001:660:330f:a4:8094:d68e:bf33:ec7c]) by smtp.gmail.com with ESMTPSA id b27sm289588edc.28.2018.01.24.05.12.37 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Wed, 24 Jan 2018 05:12:37 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <679ACE36-D505-4370-BD36-76A6C855FE31@gmail.com>
Date: Wed, 24 Jan 2018 14:12:38 +0100
Cc: Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <A0DE71AC-47A0-479A-B820-9BA5E4A6427B@gigix.net>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <327012BF-6840-4019-A9FE-39279032459D@gigix.net> <679ACE36-D505-4370-BD36-76A6C855FE31@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/xiqXh1vKeaCYX3Q1de2rcXouhdQ>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 24 Jan 2018 13:12:43 -0000

> On 23 Jan 2018, at 16:11, Dino Farinacci <farinacci@gmail.com> wrote:
>=20
>>> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 =
respectively.=20
>>=20
>> For the RLOC I would put modify the definition as follows:
>>=20
>> Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
>>      [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
>>      the output of an EID-to-RLOC mapping lookup.  An EID maps to one
>>      or more RLOCs.  Typically, RLOCs are numbered from address =
blocks=20
>>     assigned to a site at each point to which it attaches to the =
underlay=20
>>     network, as such they represent the identifiers of the underlay.
>>      Multiple RLOCs can be assigned to the same ETR device or to=20
>>      multiple ETR devices at a site.
>=20
> Adding =E2=80=9Cidentifier of the underlay=E2=80=9D does not improve =
or simplify the definition. It makes it more confusing IMO. People will =
interpret LISP has IDs in the underlay. Note in dozens of conversations =
I've had with people on LISP who are new to the concepts refer to RLOCs =
as =E2=80=9Crouting IDs=E2=80=9D. And then when I ask them to clarify if =
they mean =E2=80=9CEIDs=E2=80=9D or =E2=80=9CRLOCs=E2=80=9D, they say =
=E2=80=9Coh EIDs=E2=80=9D.
>=20
> The definition above will not help with this confusion.
>=20
> I would like to keep the definition as is with your edits from your =
lastest commentary review.
>=20
> Thanks,
> Dino
>=20

I don=E2=80=99t have a strong opinion on this point. You can keep the =
original text if you wish.

L.


From nobody Wed Jan 24 12:02:51 2018
Return-Path: <internet-drafts@ietf.org>
X-Original-To: lisp@ietf.org
Delivered-To: lisp@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 6B10F12700F; Wed, 24 Jan 2018 12:02:44 -0800 (PST)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: <i-d-announce@ietf.org>
Cc: lisp@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 6.70.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <151682416438.22613.16116767032737844305@ietfa.amsl.com>
Date: Wed, 24 Jan 2018 12:02:44 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/_QpzqdsBACPcemj1htwSaUGXB38>
Subject: [lisp] I-D Action: draft-ietf-lisp-gpe-00.txt
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 24 Jan 2018 20:02:44 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Locator/ID Separation Protocol WG of the IETF.

        Title           : LISP Generic Protocol Extension
        Authors         : Darrel Lewis
                          John Lemon
                          Puneet Agarwal
                          Larry Kreeger
                          Paul Quinn
                          Michael Smith
                          Navindra Yadav
                          Fabio Maino
	Filename        : draft-ietf-lisp-gpe-00.txt
	Pages           : 8
	Date            : 2018-01-24

Abstract:
   This draft describes extending the Locator/ID Separation Protocol
   (LISP), via changes to the LISP header, to support multi-protocol
   encapsulation.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-lisp-gpe/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-ietf-lisp-gpe-00
https://datatracker.ietf.org/doc/html/draft-ietf-lisp-gpe-00


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/


From nobody Thu Jan 25 06:11:59 2018
Return-Path: <padma.ietf@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 1DCC812421A for <lisp@ietfa.amsl.com>; Thu, 25 Jan 2018 06:11:59 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.018
X-Spam-Level: 
X-Spam-Status: No, score=-2.018 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=unavailable autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id U45lo17PIJmP for <lisp@ietfa.amsl.com>; Thu, 25 Jan 2018 06:11:56 -0800 (PST)
Received: from mail-vk0-f45.google.com (mail-vk0-f45.google.com [209.85.213.45]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 347F61241FC for <lisp@ietf.org>; Thu, 25 Jan 2018 06:11:56 -0800 (PST)
Received: by mail-vk0-f45.google.com with SMTP id m197so4897542vka.3 for <lisp@ietf.org>; Thu, 25 Jan 2018 06:11:56 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=PdbkrbBCjpBaNy0aDiyTpXsGTL3iCatKO3G80aLORq0=; b=Sebwl6+C1bQ8youDG4ZFo5zy3uyt97CdDJCBxMIz8MO+A4tw19wTHaOI3gyuQ8yfSE EopIVAcKRyup0n0bsv77gdbS2ceLbcfTzgggWENKKqphwuV73rg1bPMA/GV5Iti96EX0 MtBDygZoCPJybkbbMmxVuUlcsCLf/bvMgeANgBAzlNRm39ssq8tfREh3nfJZAy7UA18c rPncMT2InaX/rIKb6wUr6CsOZonWocyLC5YJy7u3BRvw57qAUz2UTPi/wm8kYnUHtmMQ eWeuMzRHnsID7Qn1M32j+y9M2ae052f+u4ix8Zd2PyQ4vMp06MFx8XnaB15upGYQ+zI8 5E+A==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=PdbkrbBCjpBaNy0aDiyTpXsGTL3iCatKO3G80aLORq0=; b=TzuQrdpmqQ8pHD0q66k3ToUbl2pdqOl2OQjS8pTRYnXjrNXDWuka1Rdz9WOMpt75Gl T2lQKrRiN5EvyTXkWIXKZylv/nD+3uXMQbT3go8gMvPUk4v8JHdKiZfTycQ4eB4JtkwO rdteh8+dbAM1BZkhIdnt97N2d9pvv5Se3EFdL5dxmOfDkAAXp/DwzY/Ke5G8NNWzvZ6U wRxnDjtlp2zYdtfRjqkhOQe9cLdgvwmuJAZge4/GM+6WOdJJhpvXhvs2UQq8EiFhDE89 S/8cXIy0saMVLatY+OlSoCcPLLF64ZEZxbddRi48lg9UpKMXlZdq/HuPkdYbfsKbHZIa Gx4w==
X-Gm-Message-State: AKwxytcMU4WzuO7285Tb5nXAvDOtml7fZx+DtksT76Hfm0Cr1YF+/xWj PNwYuCiT8M5r9oV1T0HT14BvKFOJ0Xema4yPHTwH4w==
X-Google-Smtp-Source: AH8x224i5GEpwt0poBVh26fUXtjb0wpvnA8QwycIIimHKsFd/EmlFsMQqTpS096tbSIZJYb9M5cp/42QE6zmj27KScs=
X-Received: by 10.31.242.204 with SMTP id q195mr7213727vkh.188.1516889455146;  Thu, 25 Jan 2018 06:10:55 -0800 (PST)
MIME-Version: 1.0
Received: by 10.159.32.66 with HTTP; Thu, 25 Jan 2018 06:10:54 -0800 (PST)
In-Reply-To: <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com>
From: Padma Pillay-Esnault <padma.ietf@gmail.com>
Date: Thu, 25 Jan 2018 15:10:54 +0100
Message-ID: <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com>
To: Dino Farinacci <farinacci@gmail.com>, acabello@ac.upc.edu
Cc: Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org, Padma Pillay-Esnault <padma.ietf@gmail.com>
Content-Type: multipart/alternative; boundary="94eb2c14c2022346a005639a599e"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/ZoYUiecvMjf813PzxIez_bFO_G8>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 25 Jan 2018 14:11:59 -0000

--94eb2c14c2022346a005639a599e
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Dear Dino and Albert

The doc reads well.
Please find thereafter some comments on the version- 09 you posted on the
list

Page 4
*"Client-side:  Client-side is a term used in this document to indicate a
connection initiation attempt by an EID."*

PPE 1: Strictly speaking the EID is just an identifier and does not
initiate anything. Suggest something like this.

*"Client-side:  Client-side is a term used in this document to indicate a
connection initiation attempt by the end system (represented by an EID)"*


Page 6
*The source EID is obtained via existing mechanisms used to set a host's
"local" IP address.  An EID used on the public Internet must have the same
properties as any other IP address used in that manner; this means, among
other things, that it must be globally unique.*

PPE 2: Shouldn't these two be MUST rather than must? Suggestion below
*The source EID is obtained via existing mechanisms used to set a host's
"local" IP address.  An EID used on the public Internet MUST have the same
properties as any other IP address used in that manner; this means, among
other things, that it MUST be globally unique.*

Page 8
*An EID maps to one or more RLOCs.*

PPE 3: Seems to contradict earlier explanation on negative mapping entry
where it is possible that an EID has NO RLOC.

*Page 8 *
*When using multiple mapping database systems, care must be taken to not
create re-encapsulation loops through misconfiguration.*

PPE 4: Suggest to add "re-encapsulation" in the list in Security
Considerations section as this is an exploit possibility.


Page 13
*"gleaned" mapping*

PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the definition sec=
tion.

Page 17
*"The KK-bits are a 2-bit field used when encapsualted packets
are encrypted."*

PPE 6: Nit - Typo "*encapsualted" -> "**encapsulated"*

Page 20
*"When the lookup succeeds, the locator-set  retrieved from the map-cache
is used to send the packet to the EID's topological location."*

PPE 7: Nit - Suggest capitalize L and S of "locator-set" for consistency
with rest of document.

Page 23
"*The server-side sets a Weight of 0..."*

PPE 8: Nit - For consistency in text change to "Weight of zero".
Page 23
"*Control is shared by the server- side determining the list and the client
determining load  distribution." *

PPE 9: Suggest use of "Client-side"

*"Control is shared by the server- side determining the list and the
client-side determining load distribution."*

Page 24
*When a verified Map-Cache entry is stored, data gleaning no longer occurs
for subsequent packets that have a source EID that matches*
*the EID-Prefix of the verified entry.[PE1]   This "gleaning" mechanism is
OPTIONAL.*

PPE 10: In section 16.2 later gleaning is used as a solution.  Changes in
the gleaned info could be an interesting way to update the cache fast
=E2=80=A6however this text make it sound that this is not an option after f=
irst
packet.

Page 25
"Note that trusting ICMP messages may  not be desirable, but neither is
ignoring them completely. Implementations are encouraged to follow current
best practices in treating these conditions."

PPE 11: A reference would be useful if possible.

Page 25

*"An ITR that participates in the global routing system can determine that
an RLOC is down if no BGP Routing Information Base (RIB) route exists that
matches the RLOC IP address."*

PPE 12: Isn't this true for any protocol entry not just a BGP entry? We are
really trying to determine if there is no route whatever the protocol.

Page 38
*"For a more detailed networkd design deployment recommendation, refer to
[RFC7215]."*

PPE 13: Nit typo "netword"-> "network"
Page 40
*"By having the PE be the first router on the path to encapsulate, it can
choose a TE path first, and the ETR can decapsulate and Re-Encapsulate for
a new encapsuluation path to the destination end site."*

PPE 14: Nit Typo "*encapsuluation" -> "encapsulation"*

Page 43
"*If the attacker spoofs the source RLOC, it can mount a DoS attack by
redirecting traffic to the spoofed victim;s RLOC, potentially overloading
it."*

PPE 15: Nit  typo "*victim;s" -> "**victim's"*

Thanks
Padma

On Mon, Jan 15, 2018 at 6:57 PM, Dino Farinacci <farinacci@gmail.com> wrote=
:

> > Should I review 09 or 08?
>
> It would be better to do -09. If I had known comments were coming from yo=
u
> I would have waited to put in Albert=E2=80=99s text. What I did in -09 is=
 simply
> cut-and-paste his text.
>
> > But please once you reply to this mail than you stick to the decision
> until I review the document.
>
> I won=E2=80=99t make any other changes until I see your comments.
>
> Dino
>
> >
> > L.
> >
> >
> >> On 13 Jan 2018, at 19:30, Dino Farinacci <farinacci@gmail.com> wrote:
> >>
> >> Here is a -09 proposal to add your requested change C below. All the
> other points are still open for discussion.
> >>
> >> Dino
> >>
> >> <rfcdiff.html>
> >>
> >> <draft-ietf-lisp-rfc6830bis-09.txt>
> >>
> >>> On Jan 12, 2018, at 8:20 AM, Albert Cabellos <
> albert.cabellos@gmail.com> wrote:
> >>>
> >>> Hi all
> >>>
> >>> As editor of 6830bis I=C2=B4d like to confirm or deny the following c=
hanges
> which I believe have support.
> >>>
> >>> Please note that I have intentionally ignored minor/editorial changes
> to help sync all the participants. I hope that the list below captures th=
e
> most relevant ones.
> >>>
> >>> Also note that I don=C2=B4t necessarily agree with all the changes li=
sted
> below, but that=C2=B4s an opinion with a different hat.
> >>>
> >>> WG: Please CONFIRM or DENY:
> >>>
> >>> -------
> >>>
> >>> A.- Remove definitions of PA and PI
>
>>>
> >>> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the =
overlay=E2=80=99
> and =E2=80=98identifier of the underlay=E2=80=99 respectively.
>
>>>
> >>> C.- In section 5.3, change the description of the encap/decap
> operation concerning how to deal with ECN and DSCP bits to (new text need=
s
> to be validated by experts):
> >>>
> >>> When doing ITR/PITR encapsulation:
> >>>
> >>> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in th=
e
> case of IPv6) SHOULD be copied from the inner-header 'Time to Live' field=
.
> >>>
> >>> o  The outer-header 'Differentiated Services Code Point' (DSCP) field
> (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from
> the inner-header DSCP field ('Traffic Class' field, in the case of IPv6)
> considering the exception listed below.
> >>>
> >>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 o=
f
> the IPv6 'Traffic Class' field) requires special treatment in order to
> avoid discarding indications of congestion [RFC3168]. ITR encapsulation
> MUST copy the 2-bit 'ECN' field from the inner header to the outer header=
.
> Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer
> header to the new outer header.
> >>>
> >>> When doing ETR/PETR decapsulation:
> >>>
> >>> o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in th=
e
> case of IPv6) SHOULD be copied from the outer-header 'Time to Live' field=
,
> when the Time to Live value of the outer header is less than the Time to
> Live value of the inner header.  Failing to perform this check can cause
> the Time to Live of the inner header to increment across
> encapsulation/decapsulation cycles.  This check is also performed when
> doing initial encapsulation, when a packet comes to an ITR or PITR destin=
ed
> for a LISP site.
> >>>
> >>> o  The inner-header 'Differentiated Services Code Point' (DSCP) field
> (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from
> the outer-header DSCP field ('Traffic Class' field, in the case of IPv6)
> considering the exception listed below.
> >>>
> >>> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 o=
f
> the IPv6 'Traffic Class' field) requires special treatment in order to
> avoid discarding indications of congestion [RFC3168]. If the 'ECN' field
> contains a congestion indication codepoint (the value is '11', the
> Congestion Experienced (CE) codepoint), then ETR decapsulation MUST copy
> the 2-bit 'ECN' field from the stripped outer header to the surviving inn=
er
> header that is used to forward the packet beyond the ETR.  These
> requirements preserve CE indications when a packet that uses ECN traverse=
s
> a LISP tunnel and becomes marked with a CE indication due to congestion
> between the tunnel endpoints.
> >>>
> >>> Note that if an ETR/PETR is also an ITR/PITR and chooses to
> re-encapsulate after decapsulating, the net effect of this is that the ne=
w
> outer header will carry the same Time to Live as the old outer header min=
us
> 1.
> >>>
> >>> Copying the Time to Live (TTL) serves two purposes: first, it
> preserves the distance the host intended the packet to travel; second, an=
d
> more importantly, it provides for suppression of looping packets in the
> event there is a loop of concatenated tunnels due to misconfiguration.  S=
ee
> Section 18.3 for TTL exception handling for traceroute packets.
> >>>
> >>> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stati=
ng that the
> data-plane MUST follow what=C2=B4s stored in the map-cache (priorities an=
d
> weights), the remaining text should go to an OAM document.
> >>>
> >>> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D co=
nsidering the
> following changes:
> >>>
> >>> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet)
> and Echo-Nonce
> >>> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3
> (hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a
> response) and RLOC probing
> >>>
> >>>
> >>> F.- Move Solicit-Map-Request to 6833bis
> >>>
> >>> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
> Considerations), 18 (Traceroute Consideration) to a new OAM document
> >>>
> >>>
> >>
> >
>
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
>

--94eb2c14c2022346a005639a599e
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Dear Dino and Albert=C2=A0<div><br></div><div>The doc read=
s well.</div><div>Please find thereafter some comments on the version- 09 y=
ou posted on the list=C2=A0</div><div><br></div><div>Page 4</div><div><i st=
yle=3D"font-family:arial,helvetica,sans-serif">&quot;Client-side:=C2=A0
Client-side is a term used in this document to indicate=C2=A0a
connection initiation <a>attempt by an EID.&quot;</a></i></div><div><p clas=
s=3D"gmail-m_4760700412917671555gmail-MsoPlainText"><font face=3D"arial, he=
lvetica, sans-serif">PPE 1:=C2=A0</font>Strictly
speaking the EID is just an identifier and does not initiate anything. Sugg=
est something like this.</p><div><div><div id=3D"gmail-m_476070041291767155=
5gmail-_com_1" class=3D"gmail-m_4760700412917671555gmail-msocomtxt"><p clas=
s=3D"gmail-m_4760700412917671555gmail-MsoCommentText"><i><span style=3D"fon=
t-family:arial,helvetica,sans-serif">&quot;Client-side:=C2=A0 Client-side i=
s a term used in this document to indicate=C2=A0a connection initiation=C2=
=A0<a>attempt </a></span>by the end system (represented by an EID)&quot;</i=
></p><p class=3D"gmail-m_4760700412917671555gmail-MsoCommentText"><br>Page =
6<br><i>The source EID is obtained via existing mechanisms used to set a ho=
st&#39;s &quot;local&quot; IP address.=C2=A0 An EID used on the public Inte=
rnet must have the same properties as any other IP address used in that man=
ner; this means, among other things, that it must be globally unique.</i></=
p><p class=3D"gmail-m_4760700412917671555gmail-MsoCommentText">PPE 2: Shoul=
dn&#39;t these two be MUST rather than must? Suggestion below</p><div><i>Th=
e source EID is obtained via existing mechanisms used to set a host&#39;s &=
quot;local&quot; IP address.=C2=A0 An EID used on the public Internet MUST =
have the same properties as any other IP address used in that manner; this =
means, among other things, that it MUST be globally<span style=3D"font-fami=
ly:Cambria">=C2=A0unique.</span></i><br></div><div><i><span style=3D"font-f=
amily:Cambria"><br></span></i></div>

</div>

</div>

</div>

</div><div class=3D"gmail_extra">Page 8</div><div class=3D"gmail_extra"><i>=
An EID maps=C2=A0to one=C2=A0<span style=3D"font-family:Cambria">or
more RLOCs.</span></i><br></div><div class=3D"gmail_extra"><div>

<div><div id=3D"gmail-m_4760700412917671555gmail-_com_1" class=3D"gmail-m_4=
760700412917671555gmail-msocomtxt"><p class=3D"gmail-m_4760700412917671555g=
mail-MsoCommentText">PPE 3: Seems to contradict earlier explanation on nega=
tive mapping entry where it is possible that an EID has NO RLOC.</p></div><=
/div></div></div><div class=3D"gmail_extra"><i><br></i></div><div class=3D"=
gmail_extra"><i>Page 8=C2=A0</i></div><div class=3D"gmail_extra"><i>When us=
ing multiple mapping database systems, care must be taken to not create re-=
encapsulation loops through misconfiguration.</i><br></div><div class=3D"gm=
ail_extra"><br></div><div class=3D"gmail_extra">PPE 4: Suggest to add &quot=
;re-encapsulation&quot; in the list in Security Considerations section as t=
his is an exploit possibility.<br></div><div class=3D"gmail_extra"><div><di=
v><div id=3D"gmail-m_4760700412917671555gmail-_com_1" class=3D"gmail-m_4760=
700412917671555gmail-msocomtxt"><p class=3D"gmail-m_4760700412917671555gmai=
l-MsoCommentText"><span></span></p>

</div>

</div>

</div>

</div><div class=3D"gmail_extra"><br></div><div class=3D"gmail_extra">Page =
13</div><div class=3D"gmail_extra"><i>&quot;gleaned&quot; mapping</i><br></=
div><div class=3D"gmail_extra"><div class=3D"gmail_extra"><span class=3D"gm=
ail-m_4760700412917671555gmail-MsoCommentReference"><br></span></div><div c=
lass=3D"gmail_extra">PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D =
in the definition section.</div><div class=3D"gmail_extra"><br></div><div c=
lass=3D"gmail_extra">Page 17<br></div></div><div class=3D"gmail_extra"><i>&=
quot;The KK-bits are a 2-bit field used when encapsualted
packets are=C2=A0encrypted.&quot;</i><br></div><div><br></div>PPE 6: Nit - =
Typo &quot;<i>encapsualted&quot; -&gt; &quot;</i><i>encapsulated&quot;</i><=
div class=3D"gmail_extra"><br></div><div class=3D"gmail_extra"><div class=
=3D"gmail_extra">Page 20<br></div><div class=3D"gmail_extra"><i>&quot;When =
the lookup succeeds, the locator-set =C2=A0retrieved from the map-cache is =
used to send the packet to the EID&#39;s topological location.&quot;</i><br=
></div><i><br></i>PPE 7: Nit - Suggest capitalize L and S of &quot;locator-=
set&quot; for consistency with rest of document.</div><div class=3D"gmail_e=
xtra"><br></div><div class=3D"gmail_extra">Page 23</div><div class=3D"gmail=
_extra">&quot;<i>The server-side sets a Weight of 0...&quot;</i><br></div><=
div class=3D"gmail_extra"><div>

<div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><p class=3D"gmail-M=
soCommentText">PPE 8: Nit - For consistency in text change to &quot;Weight =
of zero&quot;.<span></span></p>

</div>

</div>

</div>

</div>Page 23 <br>&quot;<i>Control is shared by the server- side determinin=
g the list and the client determining load =C2=A0distribution.&quot;=C2=A0<=
/i><br><br><div>PPE 9: Suggest use of &quot;Client-side&quot;<div><br></div=
><i>&quot;Control is shared by the server- side determining the list and th=
e client-side determining load distribution.&quot;</i><div><br></div><div>P=
age 24</div><div><i>When a verified Map-Cache entry is stored, data gleanin=
g no longer occurs for subsequent packets that have a source EID that match=
es</i><br></div><i>the EID-Prefix of the verified entry.[PE1] =C2=A0 This &=
quot;gleaning&quot; mechanism is OPTIONAL.</i><br><br>PPE 10: In section 16=
.2 later gleaning is used as a solution.=C2=A0 Changes in the gleaned info =
could be an interesting way to update the cache fast =E2=80=A6however this =
text make it sound that this is not an option after first packet.</div><div=
>=C2=A0=C2=A0</div><div>Page 25</div><div>&quot;Note that trusting ICMP mes=
sages may=C2=A0=C2=A0not be desirable, but neither is ignoring them complet=
ely.=C2=A0Implementations are encouraged to follow current best practices=
=C2=A0in treating these conditions.&quot;<br></div><div><br></div><div>PPE =
11: A reference would be useful if possible.</div><div><br></div><div>Page =
25</div><div><i>&quot;An ITR that participates in the global routing system=
 can=C2=A0determine that an RLOC is down if no BGP Routing Information Base=
=C2=A0(RIB) route exists that matches the RLOC IP address.&quot;<br></i></d=
iv><br><div>PPE 12: Isn&#39;t this true for any protocol entry not just a B=
GP entry? We are really trying to determine if there is no route whatever t=
he protocol.</div><div><br></div><div>Page 38</div><div><i>&quot;For a more=
 detailed networkd=C2=A0design deployment recommendation, refer to [RFC7215=
].&quot;</i></div><div><p class=3D"gmail-MsoPlainText"><i><span></span></i>=
</p>

<div>

<div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><p class=3D"gmail-M=
soCommentText">PPE 13: Nit typo &quot;netword&quot;-&gt; &quot;network&quot=
;<span></span></p>Page 40<br><i>&quot;By having the PE be the first router =
on the path to encapsulate, it can choose a TE path first, and the ETR can =
decapsulate and Re-Encapsulate for a new encapsuluation path to the destina=
tion end site.&quot;</i><div><div id=3D"gmail-_com_1" class=3D"gmail-msocom=
txt"><br></div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt">PPE 14: N=
it Typo &quot;<i>encapsuluation&quot; -&gt; &quot;encapsulation&quot;</i></=
div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><i><br></i></div><di=
v id=3D"gmail-_com_1" class=3D"gmail-msocomtxt">Page 43</div><div id=3D"gma=
il-_com_1" class=3D"gmail-msocomtxt">&quot;<i>If the attacker
spoofs the source RLOC, it can mount a DoS attack by redirecting
traffic to the spoofed victim;s=C2=A0RLOC, potentially overloading it.&quot=
;</i><br></div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><p class=
=3D"gmail-MsoPlainText"><i><span></span></i></p>

<div>

<div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><p class=3D"gmail-M=
soCommentText"><span class=3D"gmail-MsoCommentReference">PPE 15: Nit=C2=A0<=
span style=3D"font-size:9pt">=C2=A0</span></span>typo &quot;<span></span><i=
>victim;s&quot; -&gt; &quot;</i><i>victim&#39;s&quot;</i></p><div id=3D"gma=
il-_com_1" class=3D"gmail-msocomtxt"><br></div>Thanks<br>Padma</div></div><=
/div><div id=3D"gmail-_com_1" class=3D"gmail-msocomtxt"><br></div></div></d=
iv></div></div></div><div><div class=3D"gmail_extra"><div class=3D"gmail_qu=
ote">On Mon, Jan 15, 2018 at 6:57 PM, Dino Farinacci <span dir=3D"ltr">&lt;=
<a href=3D"mailto:farinacci@gmail.com" target=3D"_blank">farinacci@gmail.co=
m</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"margi=
n:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;border-le=
ft-color:rgb(204,204,204);padding-left:1ex"><span class=3D"gmail-m_47607004=
12917671555gmail-">&gt; Should I review 09 or 08?<br>
<br>
</span>It would be better to do -09. If I had known comments were coming fr=
om you I would have waited to put in Albert=E2=80=99s text. What I did in -=
09 is simply cut-and-paste his text.<br>
<span class=3D"gmail-m_4760700412917671555gmail-"><br>
&gt; But please once you reply to this mail than you stick to the decision =
until I review the document.<br>
<br>
</span>I won=E2=80=99t make any other changes until I see your comments.<br=
>
<span class=3D"gmail-m_4760700412917671555gmail-HOEnZb"><font color=3D"#888=
888"><br>
Dino<br>
</font></span><div class=3D"gmail-m_4760700412917671555gmail-HOEnZb"><div c=
lass=3D"gmail-m_4760700412917671555gmail-h5"><br>
&gt;<br>
&gt; L.<br>
&gt;<br>
&gt;<br>
&gt;&gt; On 13 Jan 2018, at 19:30, Dino Farinacci &lt;<a href=3D"mailto:far=
inacci@gmail.com" target=3D"_blank">farinacci@gmail.com</a>&gt; wrote:<br>
&gt;&gt;<br>
&gt;&gt; Here is a -09 proposal to add your requested change C below. All t=
he other points are still open for discussion.<br>
&gt;&gt;<br>
&gt;&gt; Dino<br>
&gt;&gt;<br>
&gt;&gt; &lt;rfcdiff.html&gt;<br>
&gt;&gt;<br>
&gt;&gt; &lt;draft-ietf-lisp-rfc6830bis-09<wbr>.txt&gt;<br>
&gt;&gt;<br>
&gt;&gt;&gt; On Jan 12, 2018, at 8:20 AM, Albert Cabellos &lt;<a href=3D"ma=
ilto:albert.cabellos@gmail.com" target=3D"_blank">albert.cabellos@gmail.com=
</a>&gt; wrote:<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; Hi all<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; As editor of 6830bis I=C2=B4d like to confirm or deny the foll=
owing changes which I believe have support.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; Please note that I have intentionally ignored minor/editorial =
changes to help sync all the participants. I hope that the list below captu=
res the most relevant ones.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; Also note that I don=C2=B4t necessarily agree with all the cha=
nges listed below, but that=C2=B4s an opinion with a different hat.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; WG: Please CONFIRM or DENY:<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; -------<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; A.- Remove definitions of PA and PI</div></div></blockquote><b=
lockquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-le=
ft-width:1px;border-left-style:solid;border-left-color:rgb(204,204,204);pad=
ding-left:1ex"><div class=3D"gmail-m_4760700412917671555gmail-HOEnZb"><div =
class=3D"gmail-m_4760700412917671555gmail-h5">
&gt;&gt;&gt;<br>
&gt;&gt;&gt; B.- Change definitions of EID and RLOC as =E2=80=98identifier =
of the overlay=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 re=
spectively.</div></div></blockquote><blockquote class=3D"gmail_quote" style=
=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;=
border-left-color:rgb(204,204,204);padding-left:1ex"><div class=3D"gmail-m_=
4760700412917671555gmail-HOEnZb"><div class=3D"gmail-m_4760700412917671555g=
mail-h5">
&gt;&gt;&gt;<br>
&gt;&gt;&gt; C.- In section 5.3, change the description of the encap/decap =
operation concerning how to deal with ECN and DSCP bits to (new text needs =
to be validated by experts):<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; When doing ITR/PITR encapsulation:<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The outer-header &#39;Time to Live&#39; field (or &#39=
;Hop Limit&#39; field, in the case of IPv6) SHOULD be copied from the inner=
-header &#39;Time to Live&#39; field.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The outer-header &#39;Differentiated Services Code Poi=
nt&#39; (DSCP) field (or the &#39;Traffic Class&#39; field, in the case of =
IPv6) SHOULD be copied from the inner-header DSCP field (&#39;Traffic Class=
&#39; field, in the case of IPv6) considering the exception listed below.<b=
r>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The &#39;Explicit Congestion Notification&#39; (ECN) f=
ield (bits 6 and 7 of the IPv6 &#39;Traffic Class&#39; field) requires spec=
ial treatment in order to avoid discarding indications of congestion [RFC31=
68]. ITR encapsulation MUST copy the 2-bit &#39;ECN&#39; field from the inn=
er header to the outer header. Re-encapsulation MUST copy the 2-bit &#39;EC=
N&#39; field from the stripped outer header to the new outer header.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; When doing ETR/PETR decapsulation:<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The inner-header &#39;Time to Live&#39; field (or &#39=
;Hop Limit&#39; field, in the case of IPv6) SHOULD be copied from the outer=
-header &#39;Time to Live&#39; field, when the Time to Live value of the ou=
ter header is less than the Time to Live value of the inner header.=C2=A0 F=
ailing to perform this check can cause the Time to Live of the inner header=
 to increment across encapsulation/decapsulation cycles.=C2=A0 This check i=
s also performed when doing initial encapsulation, when a packet comes to a=
n ITR or PITR destined for a LISP site.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The inner-header &#39;Differentiated Services Code Poi=
nt&#39; (DSCP) field (or the &#39;Traffic Class&#39; field, in the case of =
IPv6) SHOULD be copied from the outer-header DSCP field (&#39;Traffic Class=
&#39; field, in the case of IPv6) considering the exception listed below.<b=
r>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; o=C2=A0 The &#39;Explicit Congestion Notification&#39; (ECN) f=
ield (bits 6 and 7 of the IPv6 &#39;Traffic Class&#39; field) requires spec=
ial treatment in order to avoid discarding indications of congestion [RFC31=
68]. If the &#39;ECN&#39; field contains a congestion indication codepoint =
(the value is &#39;11&#39;, the Congestion Experienced (CE) codepoint), the=
n ETR decapsulation MUST copy the 2-bit &#39;ECN&#39; field from the stripp=
ed outer header to the surviving inner header that is used to forward the p=
acket beyond the ETR.=C2=A0 These requirements preserve CE indications when=
 a packet that uses ECN traverses a LISP tunnel and becomes marked with a C=
E indication due to congestion between the tunnel endpoints.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; Note that if an ETR/PETR is also an ITR/PITR and chooses to re=
-encapsulate after decapsulating, the net effect of this is that the new ou=
ter header will carry the same Time to Live as the old outer header minus 1=
.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; Copying the Time to Live (TTL) serves two purposes: first, it =
preserves the distance the host intended the packet to travel; second, and =
more importantly, it provides for suppression of looping packets in the eve=
nt there is a loop of concatenated tunnels due to misconfiguration.=C2=A0 S=
ee Section 18.3 for TTL exception handling for traceroute packets.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; D.- Simplify section =E2=80=98Router Locator Selection=E2=80=
=99 stating that the data-plane MUST follow what=C2=B4s stored in the map-c=
ache (priorities and weights), the remaining text should go to an OAM docum=
ent.<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=
=80=9D considering the following changes:<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; *=C2=A0 =C2=A0 Keep bullet point 1 (examine LSB), 6 (receiving=
 a data-packet) and Echo-Nonce<br>
&gt;&gt;&gt; *=C2=A0 =C2=A0 Move to 6833bis bullet point 2 (ICMP Network/Ho=
st Unreachable),3 (hints from BGP),4 (ICMP Port Unreachable),5 (receive a M=
ap-Reply as a response) and RLOC probing<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; F.- Move Solicit-Map-Request to 6833bis<br>
&gt;&gt;&gt;<br>
&gt;&gt;&gt; G.- Move sections 16 (Mobility Considerations), 17 (xTR Placem=
ent Considerations), 18 (Traceroute Consideration) to a new OAM document<br=
>
&gt;&gt;&gt;<br>
&gt;&gt;&gt;<br>
&gt;&gt;<br>
&gt;<br>
<br>
______________________________<wbr>_________________<br>
lisp mailing list<br>
<a href=3D"mailto:lisp@ietf.org" target=3D"_blank">lisp@ietf.org</a><br>
<a href=3D"https://www.ietf.org/mailman/listinfo/lisp" rel=3D"noreferrer" t=
arget=3D"_blank">https://www.ietf.org/mailman/l<wbr>istinfo/lisp</a><br>
</div></div></blockquote></div><br></div></div></div></div>

--94eb2c14c2022346a005639a599e--


From nobody Thu Jan 25 06:21:37 2018
Return-Path: <padma.ietf@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 5DEC612DA27 for <lisp@ietfa.amsl.com>; Thu, 25 Jan 2018 06:21:36 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.018
X-Spam-Level: 
X-Spam-Status: No, score=-2.018 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=unavailable autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id AgcJAR4G3O6N for <lisp@ietfa.amsl.com>; Thu, 25 Jan 2018 06:21:34 -0800 (PST)
Received: from mail-vk0-f41.google.com (mail-vk0-f41.google.com [209.85.213.41]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id DC4FB120726 for <lisp@ietf.org>; Thu, 25 Jan 2018 06:21:33 -0800 (PST)
Received: by mail-vk0-f41.google.com with SMTP id t4so4910793vkb.9 for <lisp@ietf.org>; Thu, 25 Jan 2018 06:21:33 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=vOykepyJwWsC3mWAxEYA7jpc5ZhTEF+U0LX1KtZhhmE=; b=Tr2F5k/XMmSgo8NMHC7oaJbY6vPSKHkc7Og3wKsw5+M16FSx9V6kNaRP0gbikCvM/4 XlTg70rLxPi+bij2XTELuGOOXi8KGgC/euPQpgoPgkurTwkzkWfp8S+jWhyJD71QgI2i 7cjGInzlHHIADAz1xL1cncSCalmwoJJf7t7AvflpZ7807fxzDlo7Bi9xhkziDk4yPvYd oZnHnFwfCWh8zGG/oIG+aHzxECHym3XOM0HlcCQn/x2CqBvksICuuW0Yf04zn186NLd9 l8M5P3RprlXP/GXzVf5mZ8ZQ3TT6AbpMcsK/imnwaw1ZJjC3OrRx+sPbkaipI+YFdlXd L7GA==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=vOykepyJwWsC3mWAxEYA7jpc5ZhTEF+U0LX1KtZhhmE=; b=qNpPeZh/rl1RTvieRMuRhrkdIlIzLp4qxvIwDtmoBLcw7TnY0JBhQBaElR/SDBjJHj WlmfOqJYjP22nhLMvGiuDw/3yG/bwKeFGXwm26ncRhSLBjuyQolXNnXy7LzQRoG1bMQh 9iWS67No3bUIadDfda/Mrm0XWtECK47rPc1AZ5Vv2Qrl3BkQypJ2SRsL7mKG2Kc21dI1 doo/lgq+gN+b0hL0S7jcROPq4H+vR7xaPyPwSSCV89cvG/kdINlCvoqwcWko6+wWwgJ1 WatRFgVu8lvQENoGWpASk1F11rKhBVvcULuxQKYCZpJPZiUC3maKc2tXrRW5MpDleiml 4W9Q==
X-Gm-Message-State: AKwxyteiubXDJj6CQXPKl4e9dHKpbJEUBhNQvVIRHP61eR4xD+v1CqFI LM3MnROdzA0gvQYXS29sh6A+woE5Ocybd7baqsg=
X-Google-Smtp-Source: AH8x227x4Ja6lLS+j5jqu14EA7Wu6xdG2c0Gtc5lDwHbzu2XFRWxcod1rZz8QVOAlEgWUYDL7FRf2F5dafx0LD9gyS4=
X-Received: by 10.31.106.197 with SMTP id f188mr7359058vkc.135.1516890032974;  Thu, 25 Jan 2018 06:20:32 -0800 (PST)
MIME-Version: 1.0
Received: by 10.176.4.231 with HTTP; Thu, 25 Jan 2018 06:20:32 -0800 (PST)
In-Reply-To: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com>
From: Padma Pillay-Esnault <padma.ietf@gmail.com>
Date: Thu, 25 Jan 2018 15:20:32 +0100
Message-ID: <CAG-CQxomuEuF7ocrV+UGETUCCBVvnEe0ZmxN2KCDP_7ijNP9_w@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Type: multipart/alternative; boundary="94eb2c09305094303a05639a7b02"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/GkkopxFpBQEmk4sTB3e6CIKsl-U>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 25 Jan 2018 14:21:36 -0000

--94eb2c09305094303a05639a7b02
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi Albert

Please find below my comments PPE

On Fri, Jan 12, 2018 at 5:20 PM, Albert Cabellos <albert.cabellos@gmail.com=
>
wrote:

> Hi all
>
> As editor of 6830bis I=C2=B4d like to confirm or deny the following chang=
es
> which I believe have support.
>
> Please note that I have intentionally ignored minor/editorial changes to
> help sync all the participants. I hope that the list below captures the
> most relevant ones.
>
> Also note that I don=C2=B4t necessarily agree with all the changes listed
> below, but that=C2=B4s an opinion with a different hat.
>
> WG: Please CONFIRM or DENY:
>
> -------
>
> A.- Remove definitions of PA and PI
>

<PPE> Confirm

>
> B.- Change definitions of EID and RLOC as =E2=80=98identifier of the over=
lay=E2=80=99 and
> =E2=80=98identifier of the underlay=E2=80=99 respectively.
>

<PPE> Deny - Agree with some others on the list that this does not add much
for clarification.


>
> C.- In section 5.3, change the description of the encap/decap operation
> concerning how to deal with ECN and DSCP bits to (new text needs to be
> validated by experts):
>
> When doing ITR/PITR encapsulation:
>
> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the
> case of IPv6) SHOULD be copied from the inner-header 'Time to Live' field=
.
>
> o  The outer-header 'Differentiated Services Code Point' (DSCP) field (or
> the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
> inner-header DSCP field ('Traffic Class' field, in the case of IPv6)
> considering the exception listed below.
>
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of th=
e
> IPv6 'Traffic Class' field) requires special treatment in order to avoid
> discarding indications of congestion [RFC3168]. ITR encapsulation MUST co=
py
> the 2-bit 'ECN' field from the inner header to the outer header.
> Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer
> header to the new outer header.
>
> When doing ETR/PETR decapsulation:
>
>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in the
> case of IPv6) SHOULD be copied from the outer-header 'Time to Live' field=
,
> when the Time to Live value of the outer header is less than the Time to
> Live value of the inner header.  Failing to perform this check can cause
> the Time to Live of the inner header to increment across
> encapsulation/decapsulation cycles.  This check is also performed when
> doing initial encapsulation, when a packet comes to an ITR or PITR destin=
ed
> for a LISP site.
>
> o  The inner-header 'Differentiated Services Code Point' (DSCP) field (or
> the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
> outer-header DSCP field ('Traffic Class' field, in the case of IPv6)
> considering the exception listed below.
>
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of th=
e
> IPv6 'Traffic Class' field) requires special treatment in order to avoid
> discarding indications of congestion [RFC3168]. If the 'ECN' field contai=
ns
> a congestion indication codepoint (the value is '11', the Congestion
> Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit
> 'ECN' field from the stripped outer header to the surviving inner header
> that is used to forward the packet beyond the ETR.  These requirements
> preserve CE indications when a packet that uses ECN traverses a LISP tunn=
el
> and becomes marked with a CE indication due to congestion between the
> tunnel endpoints.
>
> Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulat=
e
> after decapsulating, the net effect of this is that the new outer header
> will carry the same Time to Live as the old outer header minus 1.
>
> Copying the Time to Live (TTL) serves two purposes: first, it preserves
> the distance the host intended the packet to travel; second, and more
> importantly, it provides for suppression of looping packets in the event
> there is a loop of concatenated tunnels due to misconfiguration.  See
> Section 18.3 for TTL exception handling for traceroute packets.
>
>
> <PPE>  Abstain for now


> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stating t=
hat the
> data-plane MUST follow what=C2=B4s stored in the map-cache (priorities an=
d
> weights), the remaining text should go to an OAM document.
>
> <PPE> Confirm


> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D consid=
ering the
> following changes:
>
> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) and
> Echo-Nonce
> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3
> (hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a
> response) and RLOC probing
>
>
> <PPE> Confirm see some of my comments on this on the thread.


> F.- Move Solicit-Map-Request to 6833bis
>
> <PPE> Confirm


> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
> Considerations), 18 (Traceroute Consideration) to a new OAM document
>
>
>
<PPE> Confirm


Thanks
Padma

>
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
>
>

--94eb2c09305094303a05639a7b02
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi Albert=C2=A0<div><br></div><div>Please find below my co=
mments PPE</div><div class=3D"gmail_extra"><br><div class=3D"gmail_quote">O=
n Fri, Jan 12, 2018 at 5:20 PM, Albert Cabellos <span dir=3D"ltr">&lt;<a hr=
ef=3D"mailto:albert.cabellos@gmail.com" target=3D"_blank">albert.cabellos@g=
mail.com</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote" style=
=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;=
border-left-color:rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr">Hi al=
l<br><br>As editor of 6830bis I=C2=B4d like to confirm or deny the followin=
g changes which I believe have support. <br><br>Please note that I have int=
entionally ignored minor/editorial changes to help sync all the participant=
s. I hope that the list below captures the most relevant ones.<div><br></di=
v><div>Also note that I don=C2=B4t necessarily agree with all the changes l=
isted below, but that=C2=B4s an opinion with a different hat.<br><br>WG: Pl=
ease CONFIRM or DENY:<div><br></div><div>-------<br><br>A.- Remove definiti=
ons of PA and PI<br></div></div></div></blockquote><div><br></div><div>&lt;=
PPE&gt; Confirm=C2=A0</div><blockquote class=3D"gmail_quote" style=3D"margi=
n:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;border-le=
ft-color:rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr"><div><div><br>=
B.- Change definitions of EID and RLOC as =E2=80=98identifier of the overla=
y=E2=80=99 and =E2=80=98identifier of the underlay=E2=80=99 respectively.=
=C2=A0<br></div></div></div></blockquote><div><br></div><div>&lt;PPE&gt; De=
ny - Agree with some others on the list that this does not add much for cla=
rification.</div><div>=C2=A0</div><blockquote class=3D"gmail_quote" style=
=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;=
border-left-color:rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr"><div>=
<div><br>C.- In section 5.3, change the description of the encap/decap oper=
ation concerning how to deal with ECN and DSCP bits to (new text needs to b=
e validated by experts):<br><br><blockquote style=3D"margin:0px 0px 0px 40p=
x;border:none;padding:0px">When doing ITR/PITR encapsulation:<br><br>o =C2=
=A0The outer-header &#39;Time to Live&#39; field (or &#39;Hop Limit&#39; fi=
eld, in the case of IPv6) SHOULD be copied from the inner-header &#39;Time =
to Live&#39; field.<br><br>o =C2=A0The outer-header &#39;Differentiated Ser=
vices Code Point&#39; (DSCP) field (or the &#39;Traffic Class&#39; field, i=
n the case of IPv6) SHOULD be copied from the inner-header DSCP field (&#39=
;Traffic Class&#39; field, in the case of IPv6) considering the exception l=
isted below.<br><br>o =C2=A0The &#39;Explicit Congestion Notification&#39; =
(ECN) field (bits 6 and 7 of the IPv6 &#39;Traffic Class&#39; field) requir=
es special treatment in order to avoid discarding indications of congestion=
 [RFC3168]. ITR encapsulation MUST copy the 2-bit &#39;ECN&#39; field from =
the inner header to the outer header. Re-encapsulation MUST copy the 2-bit =
&#39;ECN&#39; field from the stripped outer header to the new outer header.=
<br><br>When doing ETR/PETR decapsulation:<br><br>=C2=A0o =C2=A0The inner-h=
eader &#39;Time to Live&#39; field (or &#39;Hop Limit&#39; field, in the ca=
se of IPv6) SHOULD be copied from the outer-header &#39;Time to Live&#39; f=
ield, when the Time to Live value of the outer header is less than the Time=
 to Live value of the inner header.=C2=A0 Failing to perform this check can=
 cause the Time to Live of the inner header to increment across encapsulati=
on/decapsulation cycles.=C2=A0 This check is also performed when doing init=
ial encapsulation, when a packet comes to an ITR or PITR destined for a LIS=
P site.<br><br>o =C2=A0The inner-header &#39;Differentiated Services Code P=
oint&#39; (DSCP) field (or the &#39;Traffic Class&#39; field, in the case o=
f IPv6) SHOULD be copied from the outer-header DSCP field (&#39;Traffic Cla=
ss&#39; field, in the case of IPv6) considering the exception listed below.=
<br><br>o =C2=A0The &#39;Explicit Congestion Notification&#39; (ECN) field =
(bits 6 and 7 of the IPv6 &#39;Traffic Class&#39; field) requires special t=
reatment in order to avoid discarding indications of congestion [RFC3168]. =
If the &#39;ECN&#39; field contains a congestion indication codepoint (the =
value is &#39;11&#39;, the Congestion Experienced (CE) codepoint), then ETR=
 decapsulation MUST copy the 2-bit &#39;ECN&#39; field from the stripped ou=
ter header to the surviving inner header that is used to forward the packet=
 beyond the ETR.=C2=A0 These requirements preserve CE indications when a pa=
cket that uses ECN traverses a LISP tunnel and becomes marked with a CE ind=
ication due to congestion between the tunnel endpoints.<br><br>Note that if=
 an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate after decaps=
ulating, the net effect of this is that the new outer header will carry the=
 same Time to Live as the old outer header minus 1.<br><br>Copying the Time=
 to Live (TTL) serves two purposes: first, it preserves the distance the ho=
st intended the packet to travel; second, and more importantly, it provides=
 for suppression of looping packets in the event there is a loop of concate=
nated tunnels due to misconfiguration.=C2=A0 See Section 18.3 for TTL excep=
tion handling for traceroute packets.</blockquote><br></div></div></div></b=
lockquote><div>&lt;PPE&gt; =C2=A0Abstain for now</div><div>=C2=A0</div><blo=
ckquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left=
-width:1px;border-left-style:solid;border-left-color:rgb(204,204,204);paddi=
ng-left:1ex"><div dir=3D"ltr"><div><div>D.- Simplify section =E2=80=98Route=
r Locator Selection=E2=80=99 stating that the data-plane MUST follow what=
=C2=B4s stored in the map-cache (priorities and weights), the remaining tex=
t should go to an OAM document.<br><br></div></div></div></blockquote><div>=
&lt;PPE&gt; Confirm</div><div>=C2=A0</div><blockquote class=3D"gmail_quote"=
 style=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-style:=
solid;border-left-color:rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr"=
>E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D conside=
ring the following changes:<br><br><blockquote style=3D"margin:0px 0px 0px =
40px;border:none;padding:0px">*=C2=A0 =C2=A0 Keep bullet point 1 (examine L=
SB), 6 (receiving a data-packet) and Echo-Nonce<br>*=C2=A0 =C2=A0 Move to 6=
833bis bullet point 2 (ICMP Network/Host Unreachable),3 (hints from BGP),4 =
(ICMP Port Unreachable),5 (receive a Map-Reply as a response) and RLOC prob=
ing</blockquote><br></div></blockquote><div>&lt;PPE&gt;=C2=A0Confirm see so=
me of my comments on this on the thread. =C2=A0</div><div>=C2=A0</div><bloc=
kquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left-=
width:1px;border-left-style:solid;border-left-color:rgb(204,204,204);paddin=
g-left:1ex"><div dir=3D"ltr"><div><div>F.- Move Solicit-Map-Request to 6833=
bis<br><br></div></div></div></blockquote><div>&lt;PPE&gt;=C2=A0Confirm<br>=
</div><div>=C2=A0</div><blockquote class=3D"gmail_quote" style=3D"margin:0p=
x 0px 0px 0.8ex;border-left-width:1px;border-left-style:solid;border-left-c=
olor:rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr"><div><div>G.- Move=
 sections 16 (Mobility Considerations), 17 (xTR Placement Considerations), =
18 (Traceroute Consideration) to a new OAM document<br><br>=C2=A0</div></di=
v></div></blockquote><div>&lt;PPE&gt;=C2=A0Confirm<br></div><div><br></div>=
<div><br></div><div>Thanks</div><div>Padma=C2=A0</div><blockquote class=3D"=
gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;border=
-left-style:solid;border-left-color:rgb(204,204,204);padding-left:1ex">
<br>______________________________<wbr>_________________<br>
lisp mailing list<br>
<a href=3D"mailto:lisp@ietf.org">lisp@ietf.org</a><br>
<a href=3D"https://www.ietf.org/mailman/listinfo/lisp" rel=3D"noreferrer" t=
arget=3D"_blank">https://www.ietf.org/mailman/<wbr>listinfo/lisp</a><br>
<br></blockquote></div><br></div></div>

--94eb2c09305094303a05639a7b02--


From nobody Fri Jan 26 10:31:11 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 491EB124D68 for <lisp@ietfa.amsl.com>; Fri, 26 Jan 2018 10:31:10 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id JTL17aXyzcoi for <lisp@ietfa.amsl.com>; Fri, 26 Jan 2018 10:31:08 -0800 (PST)
Received: from mail-pf0-x232.google.com (mail-pf0-x232.google.com [IPv6:2607:f8b0:400e:c00::232]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 1F0371205F0 for <lisp@ietf.org>; Fri, 26 Jan 2018 10:31:08 -0800 (PST)
Received: by mail-pf0-x232.google.com with SMTP id i66so799065pfd.7 for <lisp@ietf.org>; Fri, 26 Jan 2018 10:31:08 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=95a3jnoNit6/KXE3RTRdO2G5sfpFmo7rp4q9DqkJvDw=; b=ECZBiFFespnnUdNHN8mWGOwYsNuJUF8FxBfBSgRFdMA1Y/KY7lyVWXZsVSHC+tc3nD y0+eW6INGjffk96Y5Cxsw/71PEZWr9v+W7ZsU/p4dwBhHFfooR19JawyOUKQBT9kE6Rc lmfADHuTYZmspF1fUdcgh9V63RmtafMkCsngGCjVPd/5t7OwqLT6iFxA+JEJeuOy2ZFy nNNR0L5Sk+F30uU2qEbEEwS1lsTMSmHBeAyaQB8MKyaIHpuukKcYFL1OZc9lznG2iQLK FXkoMsGwblmluEFnSeFAjn/ZlTlsdWZ2dUD8XqFY12NpkFSnO9BkkPe/O3q56vIzAIqd nqLg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=95a3jnoNit6/KXE3RTRdO2G5sfpFmo7rp4q9DqkJvDw=; b=XVvZyD2LfUZlMhtMWGfLDGnuVd/BiWAbZxAwXEnfN0FheTX3Aafjkh3iiTODTOrn96 N90KGynEBCk4S9pX5cYW1/BfhgFBjHOcuc2Asl0VBXh2tFpo/FHTuozomAyU5m8vlAqL Y8wUHUgQczA9jpR8MWoEI/xWXPkgx8P42j56Zm1HZaflmMV3gHUUr7PW643NywCryJG9 hIT3W/zMPmWr9U1OOvg7JVMgtRD/3IjoYHYd3giH2nKBc6hpXImqmxqf8ogSfai/YAle 6Z8BM8s94V47dIx66VKKdGEMXXntWbsGDHyhoNH22NJT8Sr6klQyNEk/U75WLd7qrrnG 0/8w==
X-Gm-Message-State: AKwxyteLaxyaJ2f44pgdgKii9dI1tMN2Fe9/e8d2bZ9wFtJOaS89xAqv ez3m2otk0XtkCt+wy39z888=
X-Google-Smtp-Source: AH8x22582yKQrPA0KZqZyYZ5dOp15c5imOuuZQN/Tg33m8I+39ElDyeXQBUiJqP+CS/w3qOWbnO0ZQ==
X-Received: by 2002:a17:902:534f:: with SMTP id b73-v6mr8023000pli.139.1516991467594;  Fri, 26 Jan 2018 10:31:07 -0800 (PST)
Received: from [10.31.79.147] ([96.72.181.209]) by smtp.gmail.com with ESMTPSA id t8sm8770048pgr.21.2018.01.26.10.31.06 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 26 Jan 2018 10:31:06 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Dino Farinacci <farinacci@gmail.com>
In-Reply-To: <B46B68D9-21F9-4A34-9B41-6C30B7CDD053@gigix.net>
Date: Fri, 26 Jan 2018 10:31:06 -0800
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <56E6CB70-E784-42A8-9166-5564796D40C2@gmail.com>
References: <B46B68D9-21F9-4A34-9B41-6C30B7CDD053@gigix.net>
To: Luigi Iannone <ggx@gigix.net>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/HRlSzLKkhqH2UgYMN1bRe-gLY9o>
Subject: Re: [lisp] Review 6830bis -08/-09
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 26 Jan 2018 18:31:10 -0000

I=E2=80=99ll send a new -09 update to the list in my reply to Padma=E2=80=99=
s email.

>>=20
>>    Client-side:  Client-side is a term used in this document to =
indicate
>>       a connection initiation attempt by an EID. =20
>>=20
> [Luigi]
> As stated for -07.
> Following sentence not needed here. (it is specified in the operation =
part of the document)
>> The ITR(s) at the LISP
>>       site are the first to get involved in forwarding a packet from =
the
>>       source EID.

I have changed the text to reflect Padma=E2=80=99s suggestion.

>>=20
>>=20
>>    Re-Encapsulating Tunneling Router (RTR):   An RTR acts like an ETR =
to
>>       remove a LISP header, then acts as an ITR to prepend a new LISP
>>       header.  This is known as Re-encapsulating Tunneling.  Doing =
this
>>       allows a packet to be re-routed by the RTR without adding the
>>       overhead of additional tunnel headers. =20
>>=20
> [Luigi]
> As stated for -07.
> Following sentence not needed here. (it is specified in the operation =
part of the document)
> Delete from here:
>> Any references to tunnels
>>       in this specification refer to dynamic encapsulating tunnels; =
they
>>       are never statically configured.=20

Removed.


>>    Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
>>       [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
>>       the output of an EID-to-RLOC mapping lookup.  An EID maps to =
one
>>       or more RLOCs.  Typically, RLOCs are numbered from aggregatable
>>       blocks=20
>>=20
> remove =E2=80=9CAgregatable=E2=80=9D

Removed.

>=20
> [Luigi]
> As stated for -07 and discussed later: merge the three bullets above =
so to simplify the flow.
> Here is the proposed single-bullet text:
>=20
> o    End-systems only send to addresses that are EIDs.  EIDs are =
typically=20
>       IP addresses assigned to hosts (other types of EID are supported =
by LISP,=20
>       see [RFC8060] for further information). End-systems don't know
>       that addresses are EIDs versus RLOCs but assume that packets get
>       to their intended destinations.  In a system where LISP is
>       deployed, LISP routers intercept EID-addressed packets and =
assist
>       in delivering them across the network core where EIDs cannot be
>       routed.  The procedure a host uses to send IP packets does not
>       change.

Replaced with your merged text.

>>=20
>>    o  EID-Prefixes are likely to be hierarchically assigned in a =
manner
>>       that is optimized for administrative convenience and to =
facilitate
>>       scaling of the EID-to-RLOC mapping database.
>>=20
> [Luigi]
> As stated for -07 the above bullet (even if modified compare to -07) =
is about scalability and should be removed.

Removed. A shame but removed.

>>    o  EIDs MAY also be structured (subnetted) in a manner suitable =
for
>>       local routing within an Autonomous System (AS).
>>=20
>>=20
>>=20
>>    LISP Nonce:  The LISP 'Nonce' field is a 24-bit value that is
>>       randomly generated by an ITR when the N-bit is set to 1.  Nonce
>>       generation algorithms are an implementation matter but are
>>       required to generate different nonces when sending to different
>>       destinations. =20
>>=20
> [Luigi]
> As stated for -07: What is a destination? Should be different RLOCs, =
for clarity.

Changed to " when encapsulating to the same ETR=E2=80=9D.

>> [Luigi]
> The following part is the ECN part and as afar as I cans is the only =
change proposed in -09
> (09 includes the text proposed by Albert)

It is all Albert=E2=80=99s text.

>=20
>=20
>>    When doing ITR/PITR encapsulation:
>>=20
>>=20
>> Farinacci, et al.         Expires July 13, 2018                [Page =
22]
>> Internet-Draft                    LISP                      January =
2018
>>=20
>>=20
>> 9.  Routing Locator Selection=20
>>=20
> [Luigi]
> As stated for -07:
>=20
> Large part of this section is about control plane issues and as such =
should be put in 6833bis.
>=20
> What this section should state is that priority and weight are used to =
select the RLOC to use.
> Only exception is gleaning where we have one single RLOC and we do not =
know neither priority nor weight.
>=20
> All the other operational discussion goes elsewhere, but not in this =
document.

Not changing this to we get more concensus from the working group.

>>=20
>> 10.  Routing Locator Reachability
>>=20
>>    Several mechanisms for determining RLOC reachability are currently
>>    defined:
>>=20
> [Luigi]
> As stated for -07:
>=20
> There exists data-plane based reachability mechanisms and control =
plane reachability mechanisms.
> We have to keep here only the data plane based mechanism and move the =
other in 6833bis.

All the reachability mechanisms are used for the data-plane.

>=20
> We need to keep: 1, 6, Echo-Nonce,=20
>=20
> We need to move: 2, 3, 4, 5,  RLOC-Probing

Not changing this to we get more concensus from the working group.

>=20
>=20
>> =20
>>=20
>>    When ITRs at the site are not deployed in CE routers, the IGP can
>>    still be used to determine the reachability of Locators, provided
>>    they are injected into the IGP.  This is typically done when a /32
>>    address is configured on a loopback interface.
>>=20
>>=20
> [Luigi]
> As stated for -07: The above paragraph has to move to 6833bis.

For all your comments like this. I am not changing until there is more =
concensus from the working group.

>=20
> The fact that (P)ITRs use this mechanism does make it a data-plane =
mechanism. is the LISP control plane running on (P)ITRs that does it, =
using control plane messages.
>>    RLOC-Probing is a method that an ITR or PITR can use to determine =
the
>>    reachability status of one or more Locators that it has cached in =
a
>>    Map-Cache entry.  The probe-bit of the Map-Request and Map-Reply
>>    messages is used for RLOC-Probing.

No one said PITRs are special or different than ITRs in this regard. For =
both, they use the control plane messages to determine reachabiltity for =
RLOCs that THE DATA-PLANE encapsulates to. The data-plane operation =
decides based on packet counter, RTT, TTL and other mechanisms if the =
RLOC is of quality for use.

Any other entity that doesn=E2=80=99t do packet forwarding that does =
mapping system lookups doesn=E2=80=99t consider these things. Hence, why =
this issue of the control-plane needs to be described in the document =
related to packet forwarding.

>> 19.  Security Considerations
>>=20
>>    Security considerations for LISP are discussed in [RFC7833], in
>>    addition [I-D.ietf-lisp-sec] provides authentication and integrity =
to
>>    LISP mappings.
>>=20
> [Luigi]
> As stated for -07:
>=20
> lisp-sec is control-plane has to be referenced in 6833bis.
>=20
> authentication and integrity of mappings is a control plane issue.

Removed.

>=20
>>    A complete LISP threat analysis can be found in [RFC7835], in what
>>    follows we provide a summary.
>>=20
>> =20
>>=20
>>        lisp-data      4341 udp    LISP Data Packets
>>        lisp-control   4342 udp    LISP Control Packets
>>=20
> [Luigi]
> As stated for -07:
>=20
> 4342 is control-plane and MUST be requested to IANA in the 6833bis =
document.

Removed and will be moved to RFC6833.

Dino



From nobody Fri Jan 26 11:20:50 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 54C13127337 for <lisp@ietfa.amsl.com>; Fri, 26 Jan 2018 11:20:49 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 4.402
X-Spam-Level: ****
X-Spam-Status: No, score=4.402 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, GB_SUMOF=5, HTML_COMMENT_SAVED_URL=1.391, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, T_HTML_ATTACH=0.01] autolearn=no autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id veb7pnrsGIga for <lisp@ietfa.amsl.com>; Fri, 26 Jan 2018 11:20:32 -0800 (PST)
Received: from mail-pf0-x22b.google.com (mail-pf0-x22b.google.com [IPv6:2607:f8b0:400e:c00::22b]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id C1BD4124BE8 for <lisp@ietf.org>; Fri, 26 Jan 2018 11:20:31 -0800 (PST)
Received: by mail-pf0-x22b.google.com with SMTP id c6so883253pfi.8 for <lisp@ietf.org>; Fri, 26 Jan 2018 11:20:31 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=from:message-id:mime-version:subject:date:in-reply-to:cc:to :references; bh=FWRmycoXYQVpFBi/awOmSG1LN8eiiAqKMymVZz8oKm8=; b=oYmqojxieT9iKqGM1B+vUdibD4R7FMmHgSDSAi8YwCnd5eov27VZc8RjhkHikUusb1 4S7nyQb4KBuUOPO+myC8SwJthBgmENrsS7xutntJm0BdMewvp1lKpAMYuOaznmem2jbv wTGO2kfQfGHUhE5bLpbJeuie1rKNhpzH3yMw9UCKkaHvFiKrg2alMHo/INq5unGimY8B rDCGUO5JqeyiJ59Oq1uBqfxwoITsEFmGEmrVJ/fkUiV2ZNaP3fAwpNH24kB6TXlBIzlH vZLwvfuagEDnzBxH7E0rArY9xLuIlGPGk1oY//5J5NsysRTXsMmDjK7Kha6bQfLC1T8m aJ1g==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:message-id:mime-version:subject:date :in-reply-to:cc:to:references; bh=FWRmycoXYQVpFBi/awOmSG1LN8eiiAqKMymVZz8oKm8=; b=Pgm1SIAwtZg1Fpmsp2TM5KPw6W56zme3wh2KagEEu8ymFP85WrIiG3hoVYriqV/A1z jjl4q18deJVBYi+ADAgL0E9Z1/om5wJ4AMGexyTN3Hxrul1Rg9wD0pNeta+wtNw3rsEU Usns9AAkoVML3z247Crn1PbstROGFGzedZ/Qri+qBbHohRADWpa1EUdAb5sK78MpoQRF Wqyo9Vsyqlg83mZjWFaf8d0DENHix1xI/esaMH+A3ImTd22MZYX41rSiI2B1W3GzDFKX f+Uci0i4rly8J7tPtD/b0+1HtzDjNtTGoRU4CUuJUAi8KURYjniy8OC1rbGgc5V4p4KX pVxg==
X-Gm-Message-State: AKwxytdfMhOZMGap9ACxp52JpT/ndaK6UdqrvgllFWdAjQCuGeSwvxUh xpncWvE/4UmTruqv3YSF1H8=
X-Google-Smtp-Source: AH8x227mOA4oD0LE+btnow398HUyoQbLWVPk6dW6SSCHAY6AUpNi0UIxKBJ8RM+bjthbXoEKRrn9jg==
X-Received: by 2002:a17:902:14d:: with SMTP id 71-v6mr15260158plb.42.1516994429961;  Fri, 26 Jan 2018 11:20:29 -0800 (PST)
Received: from [10.31.79.147] ([96.72.181.209]) by smtp.gmail.com with ESMTPSA id l10sm22347850pfj.6.2018.01.26.11.20.27 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Fri, 26 Jan 2018 11:20:28 -0800 (PST)
From: Dino Farinacci <farinacci@gmail.com>
Message-Id: <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com>
Content-Type: multipart/mixed; boundary="Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56"
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
Date: Fri, 26 Jan 2018 11:20:27 -0800
In-Reply-To: <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com>
Cc: Albert Cabellos <acabello@ac.upc.edu>, Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
To: Padma Pillay-Esnault <padma.ietf@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/G2LZw_NuY9bolBMyaRnUT3Xmyek>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 26 Jan 2018 19:20:49 -0000

--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Thanks for the detail review Padma. A new update to -09 is enclosed with =
a diff file. I will wait until next week to post.

I have reflected all of your comments and most of Luigi=E2=80=99s =
comments. The only issues open are:

(1) Section movement from RFC6830 to RFC6833.

(2) If an OAM document is needed.

Waiting for more working group concensus on this.

> Dear Dino and Albert=20
>=20
> The doc reads well.
> Please find thereafter some comments on the version- 09 you posted on =
the list=20
>=20
> Page 4
> "Client-side:  Client-side is a term used in this document to indicate =
a connection initiation attempt by an EID."
> PPE 1: Strictly speaking the EID is just an identifier and does not =
initiate anything. Suggest something like this.
>=20
> "Client-side:  Client-side is a term used in this document to indicate =
a connection initiation attempt by the end system (represented by an =
EID)=E2=80=9D

Fixed. Put in your suggestion.

> Page 6
> The source EID is obtained via existing mechanisms used to set a =
host's "local" IP address.  An EID used on the public Internet must have =
the same properties as any other IP address used in that manner; this =
means, among other things, that it must be globally unique.
>=20
> PPE 2: Shouldn't these two be MUST rather than must? Suggestion below
>=20
> The source EID is obtained via existing mechanisms used to set a =
host's "local" IP address.  An EID used on the public Internet MUST have =
the same properties as any other IP address used in that manner; this =
means, among other things, that it MUST be globally unique.

Changed.

> Page 8
> An EID maps to one or more RLOCs.
> PPE 3: Seems to contradict earlier explanation on negative mapping =
entry where it is possible that an EID has NO RLOC.

I changed to =E2=80=9Czero or more RLOCs.=E2=80=9D.

> Page 8=20
> When using multiple mapping database systems, care must be taken to =
not create re-encapsulation loops through misconfiguration.
>=20
> PPE 4: Suggest to add "re-encapsulation" in the list in Security =
Considerations section as this is an exploit possibility.

I have removed the sentence. Because it actually is not true. If you use =
different mapping systems and circuitious forwarding occurs. The packet =
travels only until its TTL reaches 0. Using the rules for copy inner to =
outer and outer to inner during RTR re-encapsulation applies.

> Page 13
> "gleaned" mapping
>=20
> PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the =
definition section.

Changed.

> Page 17
> "The KK-bits are a 2-bit field used when encapsualted packets are =
encrypted."
>=20
> PPE 6: Nit - Typo "encapsualted" -> =E2=80=9Cencapsulated"

Fixed.

>=20
> Page 20
> "When the lookup succeeds, the locator-set  retrieved from the =
map-cache is used to send the packet to the EID's topological location."
>=20
> PPE 7: Nit - Suggest capitalize L and S of "locator-set" for =
consistency with rest of document.

Thanks. Done.

>=20
> Page 23
> "The server-side sets a Weight of 0..."
> PPE 8: Nit - For consistency in text change to "Weight of zero=E2=80=9D.=


Changed.

> Page 23=20
> "Control is shared by the server- side determining the list and the =
client determining load  distribution."=20
>=20
> PPE 9: Suggest use of "Client-side"
>=20
> "Control is shared by the server- side determining the list and the =
client-side determining load distribution.=E2=80=9D

Done.

> Page 24
> When a verified Map-Cache entry is stored, data gleaning no longer =
occurs for subsequent packets that have a source EID that matches
> the EID-Prefix of the verified entry.[PE1]   This "gleaning" mechanism =
is OPTIONAL.
>=20
> PPE 10: In section 16.2 later gleaning is used as a solution.  Changes =
in the gleaned info could be an interesting way to update the cache fast =
=E2=80=A6however this text make it sound that this is not an option =
after first packet.

It is an option when the ETR has no mapping to return packets. Once a =
mapping is cache, there is no point to glean since the mapping system =
verified the information the same as in the map-cache.

>  =20
> Page 25
> "Note that trusting ICMP messages may  not be desirable, but neither =
is ignoring them completely. Implementations are encouraged to follow =
current best practices in treating these conditions."
>=20
> PPE 11: A reference would be useful if possible.

Added draft-ietf-opsec-icmp-filtering.

> Page 25
> "An ITR that participates in the global routing system can determine =
that an RLOC is down if no BGP Routing Information Base (RIB) route =
exists that matches the RLOC IP address."
>=20
> PPE 12: Isn't this true for any protocol entry not just a BGP entry? =
We are really trying to determine if there is no route whatever the =
protocol.

Yes, we can generalize this. I changed text.

> Page 38
> "For a more detailed networkd design deployment recommendation, refer =
to [RFC7215]."
>=20
> PPE 13: Nit typo "netword"-> =E2=80=9Cnetwork"

Changed.

> Page 40
> "By having the PE be the first router on the path to encapsulate, it =
can choose a TE path first, and the ETR can decapsulate and =
Re-Encapsulate for a new encapsuluation path to the destination end =
site."
>=20
> PPE 14: Nit Typo "encapsuluation" -> =E2=80=9Cencapsulation"

Changed.

> Page 43
> "If the attacker spoofs the source RLOC, it can mount a DoS attack by =
redirecting traffic to the spoofed victim;s RLOC, potentially =
overloading it."
>=20

> PPE 15: Nit  typo "victim;s" -> =E2=80=9Cvictim=E2=80=99s=E2=80=9D

Changed.

Dino


--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56
Content-Disposition: attachment;
	filename=rfcdiff.html
Content-Type: text/html;
	x-unix-mode=0644;
	name="rfcdiff.html"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" =
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- saved from url=3D(0030)https://tools.ietf.org/rfcdiff -->
<html xmlns=3D"http://www.w3.org/1999/xhtml"><head><meta =
http-equiv=3D"Content-Type" content=3D"text/html; charset=3DUTF-8">=20
  =20
  <meta http-equiv=3D"Content-Style-Type" content=3D"text/css">=20
  <title>Diff: draft-ietf-lisp-rfc6830bis-08.txt - =
draft-ietf-lisp-rfc6830bis-09.txt</title>=20
  <style type=3D"text/css">=20
    body    { margin: 0.4ex; margin-right: auto; }=20
    tr      { }=20
    td      { white-space: pre; font-family: monospace; vertical-align: =
top; font-size: 0.86em;}=20
    th      { font-size: 0.86em; }=20
    .small  { font-size: 0.6em; font-style: italic; font-family: =
Verdana, Helvetica, sans-serif; }=20
    .left   { background-color: #EEE; }=20
    .right  { background-color: #FFF; }=20
    .diff   { background-color: #CCF; }=20
    .lblock { background-color: #BFB; }=20
    .rblock { background-color: #FF8; }=20
    .insert { background-color: #8FF; }=20
    .delete { background-color: #ACF; }=20
    .void   { background-color: #FFB; }=20
    .cont   { background-color: #EEE; }=20
    .linebr { background-color: #AAA; }=20
    .lineno { color: red; background-color: #FFF; font-size: 0.7em; =
text-align: right; padding: 0 2px; }=20
    .elipsis{ background-color: #AAA; }=20
    .left .cont { background-color: #DDD; }=20
    .right .cont { background-color: #EEE; }=20
    .lblock .cont { background-color: #9D9; }=20
    .rblock .cont { background-color: #DD6; }=20
    .insert .cont { background-color: #0DD; }=20
    .delete .cont { background-color: #8AD; }=20
    .stats, .stats td, .stats th { background-color: #EEE; padding: 2px =
0; }=20
    span.hide { display: none; color: #aaa;}    a:hover span { display: =
inline; }    tr.change { background-color: gray; }=20
    tr.change a { text-decoration: none; color: black }=20
  </style>=20
     <script>
var chunk_index =3D 0;
var old_chunk =3D null;

function format_chunk(index) {
    var prefix =3D "diff";
    var str =3D index.toString();
    for (x=3D0; x<(4-str.length); ++x) {
        prefix+=3D'0';
    }
    return prefix + str;
}

function find_chunk(n){
    return document.querySelector('tr[id$=3D"' + n + '"]');
}

function change_chunk(offset) {
    var index =3D chunk_index + offset;
    var new_str;
    var new_chunk;

    new_str =3D format_chunk(index);
    new_chunk =3D find_chunk(new_str);
    if (!new_chunk) {
        return;
    }
    if (old_chunk) {
        old_chunk.style.outline =3D "";
    }
    old_chunk =3D new_chunk;
    old_chunk.style.outline =3D "1px solid red";
    window.location.replace("#" + new_str)
    window.scrollBy(0,-100);
    chunk_index =3D index;
}

document.onkeydown =3D function(e) {
    switch (e.keyCode) {
    case 78:
        change_chunk(1);
        break;
    case 80:
        change_chunk(-1);
        break;
    }
};
   </script>=20
</head>=20
<body style=3D"">=20
  <table border=3D"0" cellpadding=3D"0" cellspacing=3D"0">=20
  <tbody><tr id=3D"part-1" bgcolor=3D"orange"><th></th><th><a =
href=3D"https://tools.ietf.org/rfcdiff?url2=3Ddraft-ietf-lisp-rfc6830bis-0=
8.txt" style=3D"color:#008; text-decoration:none;">&lt;</a>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-08.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-08.txt</a>&nbsp;</th><th> =
</th><th>&nbsp;<a =
href=3D"https://tools.ietf.org/html/draft-ietf-lisp-rfc6830bis-09.txt" =
style=3D"color:#008">draft-ietf-lisp-rfc6830bis-09.txt</a>&nbsp;<a =
href=3D"https://tools.ietf.org/rfcdiff?url1=3Ddraft-ietf-lisp-rfc6830bis-0=
9.txt" style=3D"color:#008; =
text-decoration:none;">&gt;</a></th><th></th></tr>=20
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Network Working =
Group                                       D. Farinacci</td><td> =
</td><td class=3D"right">Network Working Group                           =
            D. Farinacci</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Internet-Draft    =
                                             V. Fuller</td><td> </td><td =
class=3D"right">Internet-Draft                                           =
      V. Fuller</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Intended status: =
Standards Track                                D. Meyer</td><td> =
</td><td class=3D"right">Intended status: Standards Track                =
                D. Meyer</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0001"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">Expires: July =
<span class=3D"delete">13</span>, 2018                                   =
       D. Lewis</td><td> </td><td class=3D"rblock">Expires: July <span =
class=3D"insert">30</span>, 2018                                         =
 D. Lewis</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                         Cisco Systems</td><td> </td><td =
class=3D"right">                                                         =
  Cisco Systems</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     A. Cabellos (Ed.)</td><td> </td><td =
class=3D"right">                                                       =
A. Cabellos (Ed.)</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">                  =
                                     UPC/BarcelonaTech</td><td> </td><td =
class=3D"right">                                                       =
UPC/BarcelonaTech</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0002"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                        <span class=3D"delete"> January =
9</span>, 2018</td><td> </td><td class=3D"rblock">                       =
                                 <span class=3D"insert">January =
26</span>, 2018</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">               =
The Locator/ID Separation Protocol (LISP)</td><td> </td><td =
class=3D"right">               The Locator/ID Separation Protocol =
(LISP)</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0003"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
     draft-ietf-lisp-rfc6830bis-0<span class=3D"delete">8</span></td><td> =
</td><td class=3D"rblock">                     =
draft-ietf-lisp-rfc6830bis-0<span class=3D"insert">9</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Abstract</td><td> =
</td><td class=3D"right">Abstract</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the data-plane protocol for the Locator/ID</td><td> </td><td =
class=3D"right">   This document describes the data-plane protocol for =
the Locator/ID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Separation =
Protocol (LISP).  LISP defines two namespaces, End-point</td><td> =
</td><td class=3D"right">   Separation Protocol (LISP).  LISP defines =
two namespaces, End-point</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Identifiers =
(EIDs) that identify end-hosts and Routing Locators</td><td> </td><td =
class=3D"right">   Identifiers (EIDs) that identify end-hosts and =
Routing Locators</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (RLOCs) that =
identify network attachment points.  With this, LISP</td><td> </td><td =
class=3D"right">   (RLOCs) that identify network attachment points.  =
With this, LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   effectively =
separates control from data, and allows routers to create</td><td> =
</td><td class=3D"right">   effectively separates control from data, and =
allows routers to create</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   overlay =
networks.  LISP-capable routers exchange encapsulated packets</td><td> =
</td><td class=3D"right">   overlay networks.  LISP-capable routers =
exchange encapsulated packets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   according to =
EID-to-RLOC mappings stored in a local map-cache.</td><td> </td><td =
class=3D"right">   according to EID-to-RLOC mappings stored in a local =
map-cache.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-2" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> =
page 1, line 44<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-2"><em> page 1, line 44<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are working documents of the Internet =
Engineering</td><td> </td><td class=3D"right">   Internet-Drafts are =
working documents of the Internet Engineering</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Task Force =
(IETF).  Note that other groups may also distribute</td><td> </td><td =
class=3D"right">   Task Force (IETF).  Note that other groups may also =
distribute</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   working =
documents as Internet-Drafts.  The list of current Internet-</td><td> =
</td><td class=3D"right">   working documents as Internet-Drafts.  The =
list of current Internet-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td> </td><td =
class=3D"right">   Drafts is at =
https://datatracker.ietf.org/drafts/current/.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Internet-Drafts are draft documents valid for a maximum of six =
months</td><td> </td><td class=3D"right">   Internet-Drafts are draft =
documents valid for a maximum of six months</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and may be =
updated, replaced, or obsoleted by other documents at any</td><td> =
</td><td class=3D"right">   and may be updated, replaced, or obsoleted =
by other documents at any</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   time.  It is =
inappropriate to use Internet-Drafts as reference</td><td> </td><td =
class=3D"right">   time.  It is inappropriate to use Internet-Drafts as =
reference</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   material or to =
cite them other than as "work in progress."</td><td> </td><td =
class=3D"right">   material or to cite them other than as "work in =
progress."</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0004"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   This =
Internet-Draft will expire on July <span class=3D"delete">13</span>, =
2018.</td><td> </td><td class=3D"rblock">   This Internet-Draft will =
expire on July <span class=3D"insert">30</span>, 2018.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Copyright =
Notice</td><td> </td><td class=3D"right">Copyright Notice</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copyright (c) =
2018 IETF Trust and the persons identified as the</td><td> </td><td =
class=3D"right">   Copyright (c) 2018 IETF Trust and the persons =
identified as the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   document =
authors.  All rights reserved.</td><td> </td><td class=3D"right">   =
document authors.  All rights reserved.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
is subject to BCP 78 and the IETF Trust's Legal</td><td> </td><td =
class=3D"right">   This document is subject to BCP 78 and the IETF =
Trust's Legal</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Provisions =
Relating to IETF Documents</td><td> </td><td class=3D"right">   =
Provisions Relating to IETF Documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
(https://trustee.ietf.org/license-info) in effect on the date =
of</td><td> </td><td class=3D"right">   =
(https://trustee.ietf.org/license-info) in effect on the date of</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   publication of =
this document.  Please review these documents</td><td> </td><td =
class=3D"right">   publication of this document.  Please review these =
documents</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-3" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> =
page 2, line 25<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-3"><em> page 2, line 25<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to this =
document.  Code Components extracted from this document must</td><td> =
</td><td class=3D"right">   to this document.  Code Components extracted =
from this document must</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   include =
Simplified BSD License text as described in Section 4.e of</td><td> =
</td><td class=3D"right">   include Simplified BSD License text as =
described in Section 4.e of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the Trust =
Legal Provisions and are provided without warranty as</td><td> </td><td =
class=3D"right">   the Trust Legal Provisions and are provided without =
warranty as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   described in =
the Simplified BSD License.</td><td> </td><td class=3D"right">   =
described in the Simplified BSD License.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Table of =
Contents</td><td> </td><td class=3D"right">Table of Contents</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   1.  =
Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   =
3</td><td> </td><td class=3D"right">   1.  Introduction  . . . . . . . . =
. . . . . . . . . . . . . . . .   3</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  =
Requirements Notation . . . . . . . . . . . . . . . . . . . .   =
4</td><td> </td><td class=3D"right">   2.  Requirements Notation . . . . =
. . . . . . . . . . . . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   3.  Definition =
of Terms . . . . . . . . . . . . . . . . . . . . .   4</td><td> </td><td =
class=3D"right">   3.  Definition of Terms . . . . . . . . . . . . . . . =
. . . . . .   4</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0005"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   4.  Basic =
Overview  . . . . . . . . . . . . . . . . . . . . . . .   <span =
class=3D"delete">9</span></td><td> </td><td class=3D"rblock">   4.  =
Basic Overview  . . . . . . . . . . . . . . . . . . . . . . .   <span =
class=3D"insert">8</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     4.1.  =
Packet Flow Sequence  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">11</span></td><td> </td><td class=3D"rblock">     4.1.  =
Packet Flow Sequence  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">10</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   5.  LISP =
Encapsulation Details  . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">13</span></td><td> </td><td class=3D"rblock">   5.  =
LISP Encapsulation Details  . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">12</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.1.  LISP =
IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  13</td><td> =
</td><td class=3D"right">     5.1.  LISP IPv4-in-IPv4 Header Format . . =
. . . . . . . . . . .  13</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.2.  LISP =
IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  14</td><td> =
</td><td class=3D"right">     5.2.  LISP IPv6-in-IPv6 Header Format . . =
. . . . . . . . . . .  14</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     5.3.  Tunnel =
Header Field Descriptions  . . . . . . . . . . . .  15</td><td> </td><td =
class=3D"right">     5.3.  Tunnel Header Field Descriptions  . . . . . . =
. . . . . .  15</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   6.  LISP =
EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  19</td><td> =
</td><td class=3D"right">   6.  LISP EID-to-RLOC Map-Cache  . . . . . . =
. . . . . . . . . . .  19</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   7.  Dealing =
with Large Encapsulated Packets . . . . . . . . . . .  20</td><td> =
</td><td class=3D"right">   7.  Dealing with Large Encapsulated Packets =
. . . . . . . . . . .  20</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     7.1.  A =
Stateless Solution to MTU Handling  . . . . . . . . . .  20</td><td> =
</td><td class=3D"right">     7.1.  A Stateless Solution to MTU Handling =
 . . . . . . . . . .  20</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     7.2.  A =
Stateful Solution to MTU Handling . . . . . . . . . . .  21</td><td> =
</td><td class=3D"right">     7.2.  A Stateful Solution to MTU Handling =
. . . . . . . . . . .  21</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   8.  Using =
Virtualization and Segmentation with LISP . . . . . . .  22</td><td> =
</td><td class=3D"right">   8.  Using Virtualization and Segmentation =
with LISP . . . . . . .  22</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0006"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   9.  Routing =
Locator Selection . . . . . . . . . . . . . . . . . .  2<span =
class=3D"delete">3</span></td><td> </td><td class=3D"rblock">   9.  =
Routing Locator Selection . . . . . . . . . . . . . . . . . .  2<span =
class=3D"insert">2</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   10. Routing =
Locator Reachability  . . . . . . . . . . . . . . . .  24</td><td> =
</td><td class=3D"right">   10. Routing Locator Reachability  . . . . . =
. . . . . . . . . . .  24</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0007"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     10.1.  =
Echo Nonce Algorithm . . . . . . . . . . . . . . . . . .  2<span =
class=3D"delete">7</span></td><td> </td><td class=3D"rblock">     10.1.  =
Echo Nonce Algorithm . . . . . . . . . . . . . . . . . .  2<span =
class=3D"insert">6</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     10.2.  =
RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28</td><td> =
</td><td class=3D"right">     10.2.  RLOC-Probing Algorithm . . . . . . =
. . . . . . . . . . .  28</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0008"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   11. EID =
Reachability within a LISP Site . . . . . . . . . . . . .  2<span =
class=3D"delete">9</span></td><td> </td><td class=3D"rblock">   11. EID =
Reachability within a LISP Site . . . . . . . . . . . . .  2<span =
class=3D"insert">8</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   12. Routing =
Locator Hashing . . . . . . . . . . . . . . . . . . .  29</td><td> =
</td><td class=3D"right">   12. Routing Locator Hashing . . . . . . . . =
. . . . . . . . . . .  29</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   13. Changing =
the Contents of EID-to-RLOC Mappings . . . . . . . .  30</td><td> =
</td><td class=3D"right">   13. Changing the Contents of EID-to-RLOC =
Mappings . . . . . . . .  30</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     13.1.  Clock =
Sweep  . . . . . . . . . . . . . . . . . . . . . .  31</td><td> </td><td =
class=3D"right">     13.1.  Clock Sweep  . . . . . . . . . . . . . . . . =
. . . . . .  31</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0009"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     13.2.  =
Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  3<span =
class=3D"delete">2</span></td><td> </td><td class=3D"rblock">     13.2.  =
Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  3<span =
class=3D"insert">1</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     13.3.  =
Database Map-Versioning  . . . . . . . . . . . . . . . .  33</td><td> =
</td><td class=3D"right">     13.3.  Database Map-Versioning  . . . . . =
. . . . . . . . . . .  33</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   14. Multicast =
Considerations  . . . . . . . . . . . . . . . . . .  34</td><td> =
</td><td class=3D"right">   14. Multicast Considerations  . . . . . . . =
. . . . . . . . . . .  34</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0010"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   15. Router =
Performance Considerations . . . . . . . . . . . . . .  3<span =
class=3D"delete">5</span></td><td> </td><td class=3D"rblock">   15. =
Router Performance Considerations . . . . . . . . . . . . . .  3<span =
class=3D"insert">4</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   16. Mobility =
Considerations . . . . . . . . . . . . . . . . . . .  35</td><td> =
</td><td class=3D"right">   16. Mobility Considerations . . . . . . . . =
. . . . . . . . . . .  35</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0011"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     16.1.  =
Slow Mobility  . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">36</span></td><td> </td><td class=3D"rblock">     16.1. =
 Slow Mobility  . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">35</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     16.2.  =
Fast Mobility  . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">36</span></td><td> </td><td class=3D"rblock">     16.2. =
 Fast Mobility  . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">35</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     16.3.  =
LISP Mobile Node Mobility  . . . . . . . . . . . . . . .  <span =
class=3D"delete">37</span></td><td> </td><td class=3D"rblock">     16.3. =
 LISP Mobile Node Mobility  . . . . . . . . . . . . . . .  <span =
class=3D"insert">36</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   17. LISP xTR =
Placement and Encapsulation Methods  . . . . . . . .  37</td><td> =
</td><td class=3D"right">   17. LISP xTR Placement and Encapsulation =
Methods  . . . . . . . .  37</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.1.  =
First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  38</td><td> =
</td><td class=3D"right">     17.1.  First-Hop/Last-Hop xTRs  . . . . . =
. . . . . . . . . . .  38</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0012"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.2.  =
Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"delete">9</span></td><td> </td><td class=3D"rblock">     17.2.  =
Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  3<span =
class=3D"insert">8</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.3.  ISP =
Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  39</td><td> =
</td><td class=3D"right">     17.3.  ISP Provider Edge (PE) xTRs  . . . =
. . . . . . . . . . .  39</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0013"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     17.4.  =
LISP Functionality with Conventional NATs  . . . . . . .  <span =
class=3D"delete">40</span></td><td> </td><td class=3D"rblock">     17.4. =
 LISP Functionality with Conventional NATs  . . . . . . .  <span =
class=3D"insert">39</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     17.5.  =
Packets Egressing a LISP Site  . . . . . . . . . . . . .  40</td><td> =
</td><td class=3D"right">     17.5.  Packets Egressing a LISP Site  . . =
. . . . . . . . . . .  40</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   18. Traceroute =
Considerations . . . . . . . . . . . . . . . . . .  40</td><td> </td><td =
class=3D"right">   18. Traceroute Considerations . . . . . . . . . . . . =
. . . . . .  40</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     18.1.  IPv6 =
Traceroute  . . . . . . . . . . . . . . . . . . . .  41</td><td> =
</td><td class=3D"right">     18.1.  IPv6 Traceroute  . . . . . . . . . =
. . . . . . . . . . .  41</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0014"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     18.2.  =
IPv4 Traceroute  . . . . . . . . . . . . . . . . . . . .  4<span =
class=3D"delete">2</span></td><td> </td><td class=3D"rblock">     18.2.  =
IPv4 Traceroute  . . . . . . . . . . . . . . . . . . . .  4<span =
class=3D"insert">1</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     18.3.  =
Traceroute Using Mixed Locators  . . . . . . . . . . . .  42</td><td> =
</td><td class=3D"right">     18.3.  Traceroute Using Mixed Locators  . =
. . . . . . . . . . .  42</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0015"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   19. Security =
Considerations . . . . . . . . . . . . . . . . . . .  4<span =
class=3D"delete">3</span></td><td> </td><td class=3D"rblock">   19. =
Security Considerations . . . . . . . . . . . . . . . . . . .  4<span =
class=3D"insert">2</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   20. Network =
Management Considerations . . . . . . . . . . . . . .  43</td><td> =
</td><td class=3D"right">   20. Network Management Considerations . . . =
. . . . . . . . . . .  43</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0016"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   21. IANA =
Considerations . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">44</span></td><td> </td><td class=3D"rblock">   21. =
IANA Considerations . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">43</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     21.1.  =
LISP UDP Port Numbers  . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">44</span></td><td> </td><td class=3D"rblock">     21.1. =
 LISP UDP Port Numbers  . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">43</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   22. =
References  . . . . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">44</span></td><td> </td><td class=3D"rblock">   22. =
References  . . . . . . . . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">43</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     22.1.  =
Normative References . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">44</span></td><td> </td><td class=3D"rblock">     22.1. =
 Normative References . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">43</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     22.2.  =
Informative References . . . . . . . . . . . . . . . . .  45</td><td> =
</td><td class=3D"right">     22.2.  Informative References . . . . . . =
. . . . . . . . . . .  45</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0017"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix A.  =
Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"delete">50</span></td><td> </td><td class=3D"rblock">   =
Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  <span =
class=3D"insert">49</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Appendix B.  =
Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"delete">50</span></td><td> </td><td class=3D"rblock">   =
Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  <span =
class=3D"insert">49</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.1.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-08</span>  =
. . . . . . . .  <span class=3D"delete">51</span></td><td> </td><td =
class=3D"rblock">     B.1.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-09</span>  . . . . . . . .  =
<span class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.2.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-07</span>  =
. . . . . . . .  <span class=3D"delete">51</span></td><td> </td><td =
class=3D"rblock">     B.2.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-08</span>  . . . . . . . .  =
<span class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.3.  =
Changes to <span class=3D"delete">draft-ietf-lisp-rfc6830bis-06</span>  =
. . . . . . . .  <span class=3D"delete">51</span></td><td> </td><td =
class=3D"rblock">     B.3.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-07</span>  . . . . . . . .  =
<span class=3D"insert">50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     B.4.  =
Changes to draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  51</td><td> =
</td><td class=3D"rblock">     B.4.  Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-06  . . . . . . . .  =
50</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">     <span =
class=3D"delete">B.5.</span>  Changes to draft-ietf-lisp-rfc6830bis-04  =
. . . . . . . .  <span class=3D"delete">52</span></td><td> </td><td =
class=3D"rblock"><span class=3D"insert">     B.5.  Changes to</span> =
draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  51</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.6.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-03  . . . . . . . .  <span =
class=3D"delete">52</span></td><td> </td><td class=3D"rblock">     <span =
class=3D"insert">B.6.</span>  Changes to draft-ietf-lisp-rfc6830bis-04  =
. . . . . . . .  <span class=3D"insert">51</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"delete">52</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.7.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-03  . . . . . . . .  <span =
class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"delete">52</span></td><td> </td><td class=3D"rblock"><span =
class=3D"insert">     B.8.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  <span =
class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">     B.9.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">     B.9.</span>  Changes to =
draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  <span =
class=3D"insert">51</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">     B.10.</span> =
Changes to draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Authors' =
Addresses  . . . . . . . . . . . . . . . . . . . . . . .  52</td><td> =
</td><td class=3D"right">   Authors' Addresses  . . . . . . . . . . . . =
. . . . . . . . . . .  52</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">1.  =
Introduction</td><td> </td><td class=3D"right">1.  Introduction</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
describes the Locator/Identifier Separation Protocol</td><td> </td><td =
class=3D"right">   This document describes the Locator/Identifier =
Separation Protocol</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   (LISP).  LISP =
is an encapsulation protocol built around the</td><td> </td><td =
class=3D"right">   (LISP).  LISP is an encapsulation protocol built =
around the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fundamental =
idea of separating the topological location of a network</td><td> =
</td><td class=3D"right">   fundamental idea of separating the =
topological location of a network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attachment =
point from the node's identity [CHIAPPA].  As a result</td><td> </td><td =
class=3D"right">   attachment point from the node's identity [CHIAPPA].  =
As a result</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP creates =
two namespaces: Endpoint Identifiers (EIDs), that are</td><td> </td><td =
class=3D"right">   LISP creates two namespaces: Endpoint Identifiers =
(EIDs), that are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   used to =
identify end-hosts (e.g., nodes or Virtual Machines) and</td><td> =
</td><td class=3D"right">   used to identify end-hosts (e.g., nodes or =
Virtual Machines) and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-4" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> =
page 4, line 16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-4"><em> page 4, line 17<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is populated =
using the LISP Control-Plane protocol</td><td> </td><td class=3D"right"> =
  is populated using the LISP Control-Plane protocol</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis].</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP does not =
require changes to either host protocol stack or to</td><td> </td><td =
class=3D"right">   LISP does not require changes to either host protocol =
stack or to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   underlay =
routers.  By separating the EID from the RLOC space, LISP</td><td> =
</td><td class=3D"right">   underlay routers.  By separating the EID =
from the RLOC space, LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   offers native =
Traffic Engineering, multihoming and mobility, among</td><td> </td><td =
class=3D"right">   offers native Traffic Engineering, multihoming and =
mobility, among</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   other =
features.</td><td> </td><td class=3D"right">   other features.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Creation of =
LISP was initially motivated by discussions during the</td><td> </td><td =
class=3D"right">   Creation of LISP was initially motivated by =
discussions during the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   IAB-sponsored =
Routing and Addressing Workshop held in Amsterdam in</td><td> </td><td =
class=3D"right">   IAB-sponsored Routing and Addressing Workshop held in =
Amsterdam in</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0018"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   October 2006 =
(see [RFC4984])</td><td> </td><td class=3D"rblock">   October 2006 (see =
[RFC4984])<span class=3D"insert">.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This document =
specifies the LISP data-plane encapsulation and other</td><td> </td><td =
class=3D"right">   This document specifies the LISP data-plane =
encapsulation and other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP =
forwarding node functionality while [I-D.ietf-lisp-rfc6833bis]</td><td> =
</td><td class=3D"right">   LISP forwarding node functionality while =
[I-D.ietf-lisp-rfc6833bis]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   specifies the =
LISP control plane.  LISP deployment guidelines can be</td><td> </td><td =
class=3D"right">   specifies the LISP control plane.  LISP deployment =
guidelines can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   found in =
[RFC7215] and [RFC6835] describes considerations for network</td><td> =
</td><td class=3D"right">   found in [RFC7215] and [RFC6835] describes =
considerations for network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   operational =
management.  Finally, [I-D.ietf-lisp-introduction]</td><td> </td><td =
class=3D"right">   operational management.  Finally, =
[I-D.ietf-lisp-introduction]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   describes the =
LISP architecture.</td><td> </td><td class=3D"right">   describes the =
LISP architecture.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">2.  Requirements =
Notation</td><td> </td><td class=3D"right">2.  Requirements =
Notation</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-5" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> =
page 4, line 46<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-5"><em> page 4, line 47<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      value of 0 =
used in this specification indicates an unspecified</td><td> </td><td =
class=3D"right">      value of 0 used in this specification indicates an =
unspecified</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      encoded =
address where the length of the address is 0 octets</td><td> </td><td =
class=3D"right">      encoded address where the length of the address is =
0 octets</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      following =
the 16-bit AFI value of 0.</td><td> </td><td class=3D"right">      =
following the 16-bit AFI value of 0.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Anycast =
Address:  Anycast Address is a term used in this document to</td><td> =
</td><td class=3D"right">   Anycast Address:  Anycast Address is a term =
used in this document to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      refer to =
the same IPv4 or IPv6 address configured and used on</td><td> </td><td =
class=3D"right">      refer to the same IPv4 or IPv6 address configured =
and used on</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      multiple =
systems at the same time.  An EID or RLOC can be an</td><td> </td><td =
class=3D"right">      multiple systems at the same time.  An EID or RLOC =
can be an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      anycast =
address in each of their own address spaces.</td><td> </td><td =
class=3D"right">      anycast address in each of their own address =
spaces.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Client-side:  =
Client-side is a term used in this document to indicate</td><td> =
</td><td class=3D"right">   Client-side:  Client-side is a term used in =
this document to indicate</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0019"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      a =
connection initiation attempt by an <span class=3D"delete">EID.  The =
ITR(s) at the LISP</span></td><td> </td><td class=3D"rblock">      a =
connection initiation attempt by an <span class=3D"insert">end-system =
represented by an</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      site are the first to get involved in forwarding =
a packet from the</span></td><td> </td><td class=3D"rblock">      =
EID.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      source</span> EID.</td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Data-Probe:   =
A Data-Probe is a LISP-encapsulated data packet where</td><td> </td><td =
class=3D"right">   Data-Probe:   A Data-Probe is a LISP-encapsulated =
data packet where</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the =
inner-header destination address equals the outer-header</td><td> =
</td><td class=3D"right">      the inner-header destination address =
equals the outer-header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
address used to trigger a Map-Reply by a decapsulating</td><td> </td><td =
class=3D"right">      destination address used to trigger a Map-Reply by =
a decapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      ETR.  In =
addition, the original packet is decapsulated and</td><td> </td><td =
class=3D"right">      ETR.  In addition, the original packet is =
decapsulated and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      delivered =
to the destination host if the destination EID is in the</td><td> =
</td><td class=3D"right">      delivered to the destination host if the =
destination EID is in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      EID-Prefix =
range configured on the ETR.  Otherwise, the packet is</td><td> </td><td =
class=3D"right">      EID-Prefix range configured on the ETR.  =
Otherwise, the packet is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      discarded.  =
A Data-Probe is used in some of the mapping database</td><td> </td><td =
class=3D"right">      discarded.  A Data-Probe is used in some of the =
mapping database</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      designs to =
"probe" or request a Map-Reply from an ETR; in other</td><td> </td><td =
class=3D"right">      designs to "probe" or request a Map-Reply from an =
ETR; in other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      cases, =
Map-Requests are used.  See each mapping database design</td><td> =
</td><td class=3D"right">      cases, Map-Requests are used.  See each =
mapping database design</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-6" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> =
page 6, line 16<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-6"><em> page 6, line 16<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      device, or =
any network appliance.</td><td> </td><td class=3D"right">      device, =
or any network appliance.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Endpoint ID =
(EID):   An EID is a 32-bit (for IPv4) or 128-bit (for</td><td> </td><td =
class=3D"right">   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or =
128-bit (for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      IPv6) value =
used in the source and destination address fields of</td><td> </td><td =
class=3D"right">      IPv6) value used in the source and destination =
address fields of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the first =
(most inner) LISP header of a packet.  The host obtains</td><td> =
</td><td class=3D"right">      the first (most inner) LISP header of a =
packet.  The host obtains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a =
destination EID the same way it obtains a destination address</td><td> =
</td><td class=3D"right">      a destination EID the same way it obtains =
a destination address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      today, for =
example, through a Domain Name System (DNS) [RFC1034]</td><td> </td><td =
class=3D"right">      today, for example, through a Domain Name System =
(DNS) [RFC1034]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      lookup or =
Session Initiation Protocol (SIP) [RFC3261] exchange.</td><td> </td><td =
class=3D"right">      lookup or Session Initiation Protocol (SIP) =
[RFC3261] exchange.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      The source =
EID is obtained via existing mechanisms used to set a</td><td> </td><td =
class=3D"right">      The source EID is obtained via existing mechanisms =
used to set a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      host's =
"local" IP address.  An EID used on the public Internet</td><td> =
</td><td class=3D"right">      host's "local" IP address.  An EID used =
on the public Internet</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0020"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">must</span> have the same properties as any other IP =
address used in that</td><td> </td><td class=3D"rblock">      <span =
class=3D"insert">MUST</span> have the same properties as any other IP =
address used in that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      manner; =
this means, among other things, that it <span class=3D"delete">must</span>=
 be globally</td><td> </td><td class=3D"rblock">      manner; this =
means, among other things, that it <span class=3D"insert">MUST</span> be =
globally</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      unique.  An =
EID is allocated to a host from an EID-Prefix block</td><td> </td><td =
class=3D"right">      unique.  An EID is allocated to a host from an =
EID-Prefix block</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      associated =
with the site where the host is located.  An EID can be</td><td> =
</td><td class=3D"right">      associated with the site where the host =
is located.  An EID can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      used by a =
host to refer to other hosts.  Note that EID blocks MAY</td><td> =
</td><td class=3D"right">      used by a host to refer to other hosts.  =
Note that EID blocks MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      be assigned =
in a hierarchical manner, independent of the network</td><td> </td><td =
class=3D"right">      be assigned in a hierarchical manner, independent =
of the network</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      topology, =
to facilitate scaling of the mapping database.  In</td><td> </td><td =
class=3D"right">      topology, to facilitate scaling of the mapping =
database.  In</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      addition, =
an EID block assigned to a site MAY have site-local</td><td> </td><td =
class=3D"right">      addition, an EID block assigned to a site MAY have =
site-local</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      structure =
(subnetting) for routing within the site; this structure</td><td> =
</td><td class=3D"right">      structure (subnetting) for routing within =
the site; this structure</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is not =
visible to the global routing system.  In theory, the bit</td><td> =
</td><td class=3D"right">      is not visible to the global routing =
system.  In theory, the bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      string that =
represents an EID for one device can represent an RLOC</td><td> </td><td =
class=3D"right">      string that represents an EID for one device can =
represent an RLOC</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      for a =
different device.  When used in discussions with other</td><td> </td><td =
class=3D"right">      for a different device.  When used in discussions =
with other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-7" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> =
page 7, line 35<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-7"><em> page 7, line 35<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Negative =
Mapping Entry:   A negative mapping entry, also known as a</td><td> =
</td><td class=3D"right">   Negative Mapping Entry:   A negative mapping =
entry, also known as a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      negative =
cache entry, is an EID-to-RLOC entry where an EID-Prefix</td><td> =
</td><td class=3D"right">      negative cache entry, is an EID-to-RLOC =
entry where an EID-Prefix</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is =
advertised or stored with no RLOCs.  That is, the Locator-Set</td><td> =
</td><td class=3D"right">      is advertised or stored with no RLOCs.  =
That is, the Locator-Set</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      for the =
EID-to-RLOC entry is empty or has an encoded Locator count</td><td> =
</td><td class=3D"right">      for the EID-to-RLOC entry is empty or has =
an encoded Locator count</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      of 0.  This =
type of entry could be used to describe a prefix from</td><td> </td><td =
class=3D"right">      of 0.  This type of entry could be used to =
describe a prefix from</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a non-LISP =
site, which is explicitly not in the mapping database.</td><td> </td><td =
class=3D"right">      a non-LISP site, which is explicitly not in the =
mapping database.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      There are a =
set of well-defined actions that are encoded in a</td><td> </td><td =
class=3D"right">      There are a set of well-defined actions that are =
encoded in a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Negative =
Map-Reply.</td><td> </td><td class=3D"right">      Negative =
Map-Reply.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0021"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">Provider-Assigned (PA) Addresses:   PA addresses are an =
address block</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      assigned to a site by each service provider to =
which a site</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      connects.  Typically, each block is a sub-block =
of a service</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      provider Classless Inter-Domain Routing (CIDR) =
[RFC4632] block and</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      is aggregated into the larger block before being =
advertised into</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      the underlay network.  Traditionally, IP =
multihoming has been</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      implemented by each multihomed site acquiring its =
own globally</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      visible prefix.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   Provider-Independent (PI) Addresses:   PI addresses =
are an address</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      block assigned from a pool where blocks are not =
associated with</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      any particular location in the network (e.g., =
from a particular</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      service provider) and are therefore not =
topologically aggregatable</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      in the routing system.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Proxy-ETR =
(PETR):   A PETR is defined and described in [RFC6832].  A</td><td> =
</td><td class=3D"right">   Proxy-ETR (PETR):   A PETR is defined and =
described in [RFC6832].  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      PETR acts =
like an ETR but does so on behalf of LISP sites that</td><td> </td><td =
class=3D"right">      PETR acts like an ETR but does so on behalf of =
LISP sites that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      send =
packets to destinations at non-LISP sites.</td><td> </td><td =
class=3D"right">      send packets to destinations at non-LISP =
sites.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Proxy-ITR =
(PITR):   A PITR is defined and described in [RFC6832].  A</td><td> =
</td><td class=3D"right">   Proxy-ITR (PITR):   A PITR is defined and =
described in [RFC6832].  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      PITR acts =
like an ITR but does so on behalf of non-LISP sites that</td><td> =
</td><td class=3D"right">      PITR acts like an ITR but does so on =
behalf of non-LISP sites that</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      send =
packets to destinations at LISP sites.</td><td> </td><td class=3D"right"> =
     send packets to destinations at LISP sites.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Recursive =
Tunneling:   Recursive Tunneling occurs when a packet has</td><td> =
</td><td class=3D"right">   Recursive Tunneling:   Recursive Tunneling =
occurs when a packet has</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      more than =
one LISP IP header.  Additional layers of tunneling MAY</td><td> =
</td><td class=3D"right">      more than one LISP IP header.  Additional =
layers of tunneling MAY</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      be employed =
to implement Traffic Engineering or other re-routing</td><td> </td><td =
class=3D"right">      be employed to implement Traffic Engineering or =
other re-routing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      as needed.  =
When this is done, an additional "outer" LISP header</td><td> </td><td =
class=3D"right">      as needed.  When this is done, an additional =
"outer" LISP header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is added, =
and the original RLOCs are preserved in the "inner"</td><td> </td><td =
class=3D"right">      is added, and the original RLOCs are preserved in =
the "inner"</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
header.</td><td> </td><td class=3D"right">      header.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Re-Encapsulating Tunneling Router (RTR):   An RTR acts like an ETR =
to</td><td> </td><td class=3D"right">   Re-Encapsulating Tunneling =
Router (RTR):   An RTR acts like an ETR to</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      remove a =
LISP header, then acts as an ITR to prepend a new LISP</td><td> </td><td =
class=3D"right">      remove a LISP header, then acts as an ITR to =
prepend a new LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      header.  =
This is known as Re-encapsulating Tunneling.  Doing this</td><td> =
</td><td class=3D"right">      header.  This is known as =
Re-encapsulating Tunneling.  Doing this</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      allows a =
packet to be re-routed by the RTR without adding the</td><td> </td><td =
class=3D"right">      allows a packet to be re-routed by the RTR without =
adding the</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0022"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      overhead =
of additional tunnel headers.  <span class=3D"delete">Any references to =
tunnels</span></td><td> </td><td class=3D"rblock">      overhead of =
additional tunnel headers.  When using multiple</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      in this specification refer to dynamic =
encapsulating tunnels; they</span></td><td> </td><td class=3D"rblock">   =
   mapping database systems, care must be taken to not create =
re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      are never statically configured.</span>  When =
using multiple mapping</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      database =
systems, care must be taken to not create re-</td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulation loops through misconfiguration.</td><td> </td><td =
class=3D"right">      encapsulation loops through =
misconfiguration.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
Route-Returnability:  Route-returnability is an assumption that =
the</td><td> </td><td class=3D"right">   Route-Returnability:  =
Route-returnability is an assumption that the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      underlying =
routing system will deliver packets to the destination.</td><td> =
</td><td class=3D"right">      underlying routing system will deliver =
packets to the destination.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      When =
combined with a nonce that is provided by a sender and</td><td> </td><td =
class=3D"right">      When combined with a nonce that is provided by a =
sender and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned by =
a receiver, this limits off-path data insertion.  A</td><td> </td><td =
class=3D"right">      returned by a receiver, this limits off-path data =
insertion.  A</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
route-returnability check is verified when a message is sent =
with</td><td> </td><td class=3D"right">      route-returnability check =
is verified when a message is sent with</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a nonce, =
another message is returned with the same nonce, and the</td><td> =
</td><td class=3D"right">      a nonce, another message is returned with =
the same nonce, and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
of the original message appears as the source of the</td><td> </td><td =
class=3D"right">      destination of the original message appears as the =
source of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      returned =
message.</td><td> </td><td class=3D"right">      returned =
message.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Routing =
Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6</td><td> </td><td =
class=3D"right">   Routing Locator (RLOC):   An RLOC is an IPv4 =
[RFC0791] or IPv6</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      [RFC8200] =
address of an Egress Tunnel Router (ETR).  An RLOC is</td><td> </td><td =
class=3D"right">      [RFC8200] address of an Egress Tunnel Router =
(ETR).  An RLOC is</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0023"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the =
output of an EID-to-RLOC mapping lookup.  An EID maps to <span =
class=3D"delete">one</span></td><td> </td><td class=3D"rblock">      the =
output of an EID-to-RLOC mapping lookup.  An EID maps to <span =
class=3D"insert">zero</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      or more =
RLOCs.  Typically, RLOCs are numbered from <span =
class=3D"delete">aggregatable</span></td><td> </td><td class=3D"rblock"> =
     or more RLOCs.  Typically, RLOCs are numbered from blocks that =
are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      blocks =
that are assigned to a site at each point to which it</td><td> </td><td =
class=3D"rblock">      assigned to a site at each point to which it =
attaches to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      attaches =
to the underlay network; where the topology is defined by</td><td> =
</td><td class=3D"rblock">      underlay network; where the topology is =
defined by the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      the =
connectivity of provider networks.  Multiple RLOCs can be</td><td> =
</td><td class=3D"rblock">      connectivity of provider networks.  =
Multiple RLOCs can be assigned</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      assigned =
to the same ETR device or to multiple ETR devices at a</td><td> </td><td =
class=3D"rblock">      to the same ETR device or to multiple ETR devices =
at a site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
site.</td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Server-side:  =
Server-side is a term used in this document to indicate</td><td> =
</td><td class=3D"right">   Server-side:  Server-side is a term used in =
this document to indicate</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that a =
connection initiation attempt is being accepted for a</td><td> </td><td =
class=3D"right">      that a connection initiation attempt is being =
accepted for a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
EID.</td><td> </td><td class=3D"right">      destination EID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   TE-ETR:   A =
TE-ETR is an ETR that is deployed in a service provider</td><td> =
</td><td class=3D"right">   TE-ETR:   A TE-ETR is an ETR that is =
deployed in a service provider</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      network =
that strips an outer LISP header for Traffic Engineering</td><td> =
</td><td class=3D"right">      network that strips an outer LISP header =
for Traffic Engineering</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
purposes.</td><td> </td><td class=3D"right">      purposes.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   TE-ITR:   A =
TE-ITR is an ITR that is deployed in a service provider</td><td> =
</td><td class=3D"right">   TE-ITR:   A TE-ITR is an ITR that is =
deployed in a service provider</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-8" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> =
page 9, line 44<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-8"><em> page 9, line 28<span =
class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   prepends LISP =
headers on host-originated packets and strips them</td><td> </td><td =
class=3D"right">   prepends LISP headers on host-originated packets and =
strips them</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   prior to final =
delivery to their destination.  The IP addresses in</td><td> </td><td =
class=3D"right">   prior to final delivery to their destination.  The IP =
addresses in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   this "outer =
header" are RLOCs.  During end-to-end packet exchange</td><td> </td><td =
class=3D"right">   this "outer header" are RLOCs.  During end-to-end =
packet exchange</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   between two =
Internet hosts, an ITR prepends a new LISP header to each</td><td> =
</td><td class=3D"right">   between two Internet hosts, an ITR prepends =
a new LISP header to each</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packet, and an =
ETR strips the new header.  The ITR performs EID-to-</td><td> </td><td =
class=3D"right">   packet, and an ETR strips the new header.  The ITR =
performs EID-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC lookups =
to determine the routing path to the ETR, which has the</td><td> =
</td><td class=3D"right">   RLOC lookups to determine the routing path =
to the ETR, which has the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC as one of =
its IP addresses.</td><td> </td><td class=3D"right">   RLOC as one of =
its IP addresses.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Some basic =
rules governing LISP are:</td><td> </td><td class=3D"right">   Some =
basic rules governing LISP are:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0024"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  =
End-systems only send to addresses that are EIDs.  <span =
class=3D"delete">They</span> don't know</td><td> </td><td =
class=3D"rblock">   o  End-systems only send to addresses that are EIDs. =
 <span class=3D"insert">EIDs are</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      that =
addresses are EIDs versus RLOCs but assume that packets get</td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      typically IP =
addresses assigned to hosts (other types of EID are</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      to their =
intended destinations.  In a system where LISP is</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">      supported by LISP, see =
[RFC8060] for further information).  End-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      deployed, =
LISP routers intercept EID-addressed packets and assist</td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      systems</span> =
don't know that addresses are EIDs versus RLOCs but assume</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      in =
delivering them across the network core where EIDs cannot be</td><td> =
</td><td class=3D"rblock">      that packets get to their intended =
destinations.  In a system</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      routed.  =
The procedure a host uses to send IP packets does not</td><td> </td><td =
class=3D"rblock">      where LISP is deployed, LISP routers intercept =
EID-addressed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      =
change.</td><td> </td><td class=3D"rblock">      packets and assist in =
delivering them across the network core</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock">      where EIDs cannot be routed.  The =
procedure a host uses to send IP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">o  EIDs are typically IP addresses assigned to =
hosts.</span></td><td> </td><td class=3D"rblock">      packets does not =
change.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete"></span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   o  Other types of EID are supported by LISP, see =
[RFC8060] for</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      further information.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  LISP =
routers mostly deal with Routing Locator addresses.  See</td><td> =
</td><td class=3D"right">   o  LISP routers mostly deal with Routing =
Locator addresses.  See</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      details in =
Section 4.1 to clarify what is meant by "mostly".</td><td> </td><td =
class=3D"right">      details in Section 4.1 to clarify what is meant by =
"mostly".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  RLOCs are =
always IP addresses assigned to routers, preferably</td><td> </td><td =
class=3D"right">   o  RLOCs are always IP addresses assigned to routers, =
preferably</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
topologically oriented addresses from provider CIDR (Classless</td><td> =
</td><td class=3D"right">      topologically oriented addresses from =
provider CIDR (Classless</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Inter-Domain Routing) blocks.</td><td> </td><td class=3D"right">      =
Inter-Domain Routing) blocks.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  When a =
router originates packets, it MAY use as a source address</td><td> =
</td><td class=3D"right">   o  When a router originates packets, it MAY =
use as a source address</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      either an =
EID or RLOC.  When acting as a host (e.g., when</td><td> </td><td =
class=3D"right">      either an EID or RLOC.  When acting as a host =
(e.g., when</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-9" class=3D"change"><td></td><th><small>skipping to =
change at</small><a href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> =
page 10, line 32<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-9"><em> page 10, line =
13<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
configuration might demonstrate this "hybrid" EID/RLOC usage =
where</td><td> </td><td class=3D"right">      configuration might =
demonstrate this "hybrid" EID/RLOC usage where</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a router =
could use its "host-like" EID to terminate iBGP sessions</td><td> =
</td><td class=3D"right">      a router could use its "host-like" EID to =
terminate iBGP sessions</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to other =
routers in a site while at the same time using RLOCs to</td><td> =
</td><td class=3D"right">      to other routers in a site while at the =
same time using RLOCs to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      terminate =
eBGP sessions to routers outside the site.</td><td> </td><td =
class=3D"right">      terminate eBGP sessions to routers outside the =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Packets =
with EIDs in them are not expected to be delivered end-to-</td><td> =
</td><td class=3D"right">   o  Packets with EIDs in them are not =
expected to be delivered end-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      end in the =
absence of an EID-to-RLOC mapping operation.  They are</td><td> </td><td =
class=3D"right">      end in the absence of an EID-to-RLOC mapping =
operation.  They are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      expected to =
be used locally for intra-site communication or to be</td><td> </td><td =
class=3D"right">      expected to be used locally for intra-site =
communication or to be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
encapsulated for inter-site communication.</td><td> </td><td =
class=3D"right">      encapsulated for inter-site communication.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0025"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">o  EID-Prefixes are likely to be hierarchically =
assigned in a manner</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      that is optimized for administrative convenience =
and to facilitate</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">      scaling of the EID-to-RLOC mapping =
database.</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">                =
                                                         </td><td> =
</td><td class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  EIDs MAY =
also be structured (subnetted) in a manner suitable for</td><td> =
</td><td class=3D"right">   o  EIDs MAY also be structured (subnetted) =
in a manner suitable for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      local =
routing within an Autonomous System (AS).</td><td> </td><td =
class=3D"right">      local routing within an Autonomous System =
(AS).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An additional =
LISP header MAY be prepended to packets by a TE-ITR</td><td> </td><td =
class=3D"right">   An additional LISP header MAY be prepended to packets =
by a TE-ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   when =
re-routing of the path for a packet is desired.  A potential</td><td> =
</td><td class=3D"right">   when re-routing of the path for a packet is =
desired.  A potential</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   use-case for =
this would be an ISP router that needs to perform</td><td> </td><td =
class=3D"right">   use-case for this would be an ISP router that needs =
to perform</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Traffic =
Engineering for packets flowing through its network.  In such</td><td> =
</td><td class=3D"right">   Traffic Engineering for packets flowing =
through its network.  In such</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   a situation, =
termed "Recursive Tunneling", an ISP transit acts as an</td><td> =
</td><td class=3D"right">   a situation, termed "Recursive Tunneling", =
an ISP transit acts as an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   additional =
ITR, and the RLOC it uses for the new prepended header</td><td> </td><td =
class=3D"right">   additional ITR, and the RLOC it uses for the new =
prepended header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   would be =
either a TE-ETR within the ISP (along an intra-ISP traffic</td><td> =
</td><td class=3D"right">   would be either a TE-ETR within the ISP =
(along an intra-ISP traffic</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-10" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 13, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-10"><em> page 12, line =
32<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   8.  The ETR =
receives these packets directly (since the destination</td><td> </td><td =
class=3D"right">   8.  The ETR receives these packets directly (since =
the destination</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       address is =
one of its assigned IP addresses), checks the validity</td><td> </td><td =
class=3D"right">       address is one of its assigned IP addresses), =
checks the validity</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       of the =
addresses, strips the LISP header, and forwards packets to</td><td> =
</td><td class=3D"right">       of the addresses, strips the LISP =
header, and forwards packets to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the =
attached destination host.</td><td> </td><td class=3D"right">       the =
attached destination host.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   9.  In order =
to defer the need for a mapping lookup in the reverse</td><td> </td><td =
class=3D"right">   9.  In order to defer the need for a mapping lookup =
in the reverse</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       direction, =
an ETR can OPTIONALLY create a cache entry that maps</td><td> </td><td =
class=3D"right">       direction, an ETR can OPTIONALLY create a cache =
entry that maps</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       the source =
EID (inner-header source IP address) to the source</td><td> </td><td =
class=3D"right">       the source EID (inner-header source IP address) =
to the source</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       RLOC =
(outer-header source IP address) in a received LISP packet.</td><td> =
</td><td class=3D"right">       RLOC (outer-header source IP address) in =
a received LISP packet.</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0026"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       Such a =
cache entry is termed a <span class=3D"delete">"gleaned" mapping</span> =
and only</td><td> </td><td class=3D"rblock">       Such a cache entry is =
termed a <span class=3D"insert">"glean mapping"</span> and only =
contains</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       contains =
a single RLOC for the EID in question.  More complete</td><td> </td><td =
class=3D"rblock">       a single RLOC for the EID in question.  More =
complete information</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       =
information about additional RLOCs SHOULD be verified by =
sending</td><td> </td><td class=3D"rblock">       about additional RLOCs =
SHOULD be verified by sending a LISP <span =
class=3D"insert">Map-</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       a LISP =
<span class=3D"delete">Map-Request</span> for that EID.  Both the ITR =
and the ETR MAY</td><td> </td><td class=3D"rblock"><span class=3D"insert">=
       Request</span> for that EID.  Both the ITR and the ETR MAY =
also</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       also =
influence the decision the other makes in selecting an RLOC.</td><td> =
</td><td class=3D"rblock">       influence the decision the other makes =
in selecting an RLOC.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">5.  LISP =
Encapsulation Details</td><td> </td><td class=3D"right">5.  LISP =
Encapsulation Details</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Since =
additional tunnel headers are prepended, the packet becomes</td><td> =
</td><td class=3D"right">   Since additional tunnel headers are =
prepended, the packet becomes</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   larger and can =
exceed the MTU of any link traversed from the ITR to</td><td> </td><td =
class=3D"right">   larger and can exceed the MTU of any link traversed =
from the ITR to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the ETR.  It =
is RECOMMENDED in IPv4 that packets do not get</td><td> </td><td =
class=3D"right">   the ETR.  It is RECOMMENDED in IPv4 that packets do =
not get</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   fragmented as =
they are encapsulated by the ITR.  Instead, the packet</td><td> </td><td =
class=3D"right">   fragmented as they are encapsulated by the ITR.  =
Instead, the packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   is dropped and =
an ICMP Unreachable/Fragmentation-Needed message is</td><td> </td><td =
class=3D"right">   is dropped and an ICMP =
Unreachable/Fragmentation-Needed message is</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   returned to =
the source.</td><td> </td><td class=3D"right">   returned to the =
source.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-11" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 17, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-11"><em> page 17, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">     x x x x 1 x =
x x</td><td> </td><td class=3D"right">     x x x x 1 x x x</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    =
|N|L|E|V|I|R|K|K|            Nonce/Map-Version                  =
|</td><td> </td><td class=3D"right">    |N|L|E|V|I|R|K|K|            =
Nonce/Map-Version                  |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    |             =
    Instance ID                   |     LSBs      |</td><td> </td><td =
class=3D"right">    |                 Instance ID                   |    =
 LSBs      |</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td>=
 </td><td class=3D"right">    =
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   R: The R-bit =
is a Reserved bit for future use.  It MUST be set to 0</td><td> </td><td =
class=3D"right">   R: The R-bit is a Reserved bit for future use.  It =
MUST be set to 0</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      on transmit =
and MUST be ignored on receipt.</td><td> </td><td class=3D"right">      =
on transmit and MUST be ignored on receipt.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0027"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   KK:  The =
KK-bits are a 2-bit field used when encapsu<span =
class=3D"delete">al</span>ted packets are</td><td> </td><td =
class=3D"rblock">   KK:  The KK-bits are a 2-bit field used when =
encapsu<span class=3D"insert">la</span>ted packets are</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      encrypted.  =
The field is set to 00 when the packet is not</td><td> </td><td =
class=3D"right">      encrypted.  The field is set to 00 when the packet =
is not</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      encrypted.  =
See [RFC8061] for further information.</td><td> </td><td class=3D"right"> =
     encrypted.  See [RFC8061] for further information.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP Nonce:  =
The LISP 'Nonce' field is a 24-bit value that is</td><td> </td><td =
class=3D"right">   LISP Nonce:  The LISP 'Nonce' field is a 24-bit value =
that is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      randomly =
generated by an ITR when the N-bit is set to 1.  Nonce</td><td> </td><td =
class=3D"right">      randomly generated by an ITR when the N-bit is set =
to 1.  Nonce</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      generation =
algorithms are an implementation matter but are</td><td> </td><td =
class=3D"right">      generation algorithms are an implementation matter =
but are</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      required to =
generate different nonces when sending to different</td><td> </td><td =
class=3D"right">      required to generate different nonces when sending =
to different</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
destinations.  However, the same nonce can be used for a period =
of</td><td> </td><td class=3D"right">      destinations.  However, the =
same nonce can be used for a period of</td><td class=3D"lineno"></td></tr>=

      <tr id=3D"diff0028"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      time to =
the same <span class=3D"delete">destination.</span>  The nonce is also =
used when the</td><td> </td><td class=3D"rblock">      time <span =
class=3D"insert">when encapsulating</span> to the same <span =
class=3D"insert">ETR.</span>  The nonce is also used</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      E-bit is =
set to request the nonce value to be echoed by the other</td><td> =
</td><td class=3D"rblock">      when the E-bit is set to request the =
nonce value to be echoed by</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      side when =
packets are returned.  When the E-bit is clear but the</td><td> </td><td =
class=3D"rblock">      the other side when packets are returned.  When =
the E-bit is clear</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      N-bit is =
set, a remote ITR is either echoing a previously</td><td> </td><td =
class=3D"rblock">      but the N-bit is set, a remote ITR is either =
echoing a previously</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      requested =
echo-nonce or providing a random nonce.  See</td><td> </td><td =
class=3D"right">      requested echo-nonce or providing a random nonce.  =
See</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Section =
10.1 for more details.</td><td> </td><td class=3D"right">      Section =
10.1 for more details.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP =
Locator-Status-Bits (LSBs):  When the L-bit is also set, the</td><td> =
</td><td class=3D"right">   LISP Locator-Status-Bits (LSBs):  When the =
L-bit is also set, the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
'Locator-Status-Bits' field in the LISP header is set by an ITR =
to</td><td> </td><td class=3D"right">      'Locator-Status-Bits' field =
in the LISP header is set by an ITR to</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">      indicate to =
an ETR the up/down status of the Locators in the</td><td> </td><td =
class=3D"right">      indicate to an ETR the up/down status of the =
Locators in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      source =
site.  Each RLOC in a Map-Reply is assigned an ordinal</td><td> </td><td =
class=3D"right">      source site.  Each RLOC in a Map-Reply is assigned =
an ordinal</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      value from =
0 to n-1 (when there are n RLOCs in a mapping entry).</td><td> </td><td =
class=3D"right">      value from 0 to n-1 (when there are n RLOCs in a =
mapping entry).</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      The =
Locator-Status-Bits are numbered from 0 to n-1 from the least</td><td> =
</td><td class=3D"right">      The Locator-Status-Bits are numbered from =
0 to n-1 from the least</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      significant =
bit of the field.  The field is 32 bits when the I-bit</td><td> </td><td =
class=3D"right">      significant bit of the field.  The field is 32 =
bits when the I-bit</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-12" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 18, line =
42<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-12"><em> page 18, line =
9<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      that the =
inner-header source EID address matches.  If the LSB for</td><td> =
</td><td class=3D"right">      that the inner-header source EID address =
matches.  If the LSB for</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      an anycast =
Locator is set to 1, then there is at least one RLOC</td><td> </td><td =
class=3D"right">      an anycast Locator is set to 1, then there is at =
least one RLOC</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      with that =
address, and the ETR is considered 'up'.</td><td> </td><td =
class=3D"right">      with that address, and the ETR is considered =
'up'.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When doing =
ITR/PITR encapsulation:</td><td> </td><td class=3D"right">   When doing =
ITR/PITR encapsulation:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
outer-header 'Time to Live' field (or 'Hop Limit' field, in</td><td> =
</td><td class=3D"right">   o  The outer-header 'Time to Live' field (or =
'Hop Limit' field, in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the case of =
IPv6) SHOULD be copied from the inner-header 'Time to</td><td> </td><td =
class=3D"right">      the case of IPv6) SHOULD be copied from the =
inner-header 'Time to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Live' =
field.</td><td> </td><td class=3D"right">      Live' field.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0029"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  The =
outer-header <span class=3D"delete">'Type of Service'</span> field (or =
the 'Traffic Class'</td><td> </td><td class=3D"rblock">   o  The =
outer-header <span class=3D"insert">'Differentiated Services Code Point' =
(DSCP)</span> field</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      field, in =
the case of IPv6) SHOULD be copied from the inner-header</td><td> =
</td><td class=3D"rblock">      (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">'Type</span> of <span class=3D"delete">Service'</span> =
field <span class=3D"delete">(with one exception; see =
below).</span></td><td> </td><td class=3D"rblock">      copied from the =
inner-header <span class=3D"insert">DSCP field ('Traffic Class' field, =
in</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the case</span> =
of <span class=3D"insert">IPv6) considering the exception listed =
below.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  The 'Explicit =
Congestion Notification' (ECN)</span> field <span class=3D"insert">(bits =
6 and 7</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of the IPv6 =
'Traffic Class' field) requires special treatment in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      order to avoid =
discarding indications of congestion [RFC3168].</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      ITR encapsulation =
MUST copy the 2-bit 'ECN' field from the inner</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      header to the =
outer header.  Re-encapsulation MUST copy the 2-bit</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      'ECN' field from =
the stripped outer header to the new outer</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      =
header.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When doing =
ETR/PETR decapsulation:</td><td> </td><td class=3D"right">   When doing =
ETR/PETR decapsulation:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  The =
inner-header 'Time to Live' field (or 'Hop Limit' field, in</td><td> =
</td><td class=3D"right">   o  The inner-header 'Time to Live' field (or =
'Hop Limit' field, in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the case of =
IPv6) SHOULD be copied from the outer-header 'Time to</td><td> </td><td =
class=3D"right">      the case of IPv6) SHOULD be copied from the =
outer-header 'Time to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      Live' =
field, when the Time to Live value of the outer header is</td><td> =
</td><td class=3D"right">      Live' field, when the Time to Live value =
of the outer header is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      less than =
the Time to Live value of the inner header.  Failing to</td><td> =
</td><td class=3D"right">      less than the Time to Live value of the =
inner header.  Failing to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      perform =
this check can cause the Time to Live of the inner header</td><td> =
</td><td class=3D"right">      perform this check can cause the Time to =
Live of the inner header</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      to =
increment across encapsulation/decapsulation cycles.  This</td><td> =
</td><td class=3D"right">      to increment across =
encapsulation/decapsulation cycles.  This</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      check is =
also performed when doing initial encapsulation, when a</td><td> =
</td><td class=3D"right">      check is also performed when doing =
initial encapsulation, when a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      packet =
comes to an ITR or PITR destined for a LISP site.</td><td> </td><td =
class=3D"right">      packet comes to an ITR or PITR destined for a LISP =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0030"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  The =
inner-header <span class=3D"delete">'Type of Service'</span> field (or =
the 'Traffic Class'</td><td> </td><td class=3D"rblock">   o  The =
inner-header <span class=3D"insert">'Differentiated Services Code Point' =
(DSCP)</span> field</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      field, in =
the case of IPv6) SHOULD be copied from the outer-header</td><td> =
</td><td class=3D"rblock">      (or the 'Traffic Class' field, in the =
case of IPv6) SHOULD be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      <span =
class=3D"delete">'Type</span> of <span class=3D"delete">Service'</span> =
field <span class=3D"delete">(with one exception; see =
below).</span></td><td> </td><td class=3D"rblock">      copied from the =
outer-header <span class=3D"insert">DSCP field ('Traffic Class' field, =
in</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the case of IPv6) =
considering the exception listed below.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  The 'Explicit =
Congestion Notification' (ECN) field (bits 6 and 7</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      of the IPv6 =
'Traffic Class' field) requires special treatment in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      order to avoid =
discarding indications</span> of <span class=3D"insert">congestion =
[RFC3168].  If</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the 'ECN' field =
contains a congestion indication codepoint (the</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      value is '11', =
the Congestion Experienced (CE) codepoint), then</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      ETR decapsulation =
MUST copy the 2-bit 'ECN'</span> field <span class=3D"insert">from =
the</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      stripped outer =
header to the surviving inner header that is used</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      to forward the =
packet beyond the ETR.  These requirements preserve</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      CE indications =
when a packet that uses ECN traverses a LISP tunnel</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      and becomes =
marked with a CE indication due to congestion between</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      the tunnel =
endpoints.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Note that if =
an ETR/PETR is also an ITR/PITR and chooses to re-</td><td> </td><td =
class=3D"right">   Note that if an ETR/PETR is also an ITR/PITR and =
chooses to re-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   encapsulate =
after decapsulating, the net effect of this is that the</td><td> =
</td><td class=3D"right">   encapsulate after decapsulating, the net =
effect of this is that the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   new outer =
header will carry the same Time to Live as the old outer</td><td> =
</td><td class=3D"right">   new outer header will carry the same Time to =
Live as the old outer</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   header minus =
1.</td><td> </td><td class=3D"right">   header minus 1.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Copying the =
Time to Live (TTL) serves two purposes: first, it</td><td> </td><td =
class=3D"right">   Copying the Time to Live (TTL) serves two purposes: =
first, it</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   preserves the =
distance the host intended the packet to travel;</td><td> </td><td =
class=3D"right">   preserves the distance the host intended the packet =
to travel;</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   second, and =
more importantly, it provides for suppression of looping</td><td> =
</td><td class=3D"right">   second, and more importantly, it provides =
for suppression of looping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets in the =
event there is a loop of concatenated tunnels due to</td><td> </td><td =
class=3D"right">   packets in the event there is a loop of concatenated =
tunnels due to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-13" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 20, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-13"><em> page 19, line =
41<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   ITRs and PITRs =
maintain an on-demand cache, referred as LISP EID-to-</td><td> </td><td =
class=3D"right">   ITRs and PITRs maintain an on-demand cache, referred =
as LISP EID-to-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC =
Map-Cache, that contains mappings from EID-prefixes to locator</td><td> =
</td><td class=3D"right">   RLOC Map-Cache, that contains mappings from =
EID-prefixes to locator</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   sets.  The =
cache is used to encapsulate packets from the EID space to</td><td> =
</td><td class=3D"right">   sets.  The cache is used to encapsulate =
packets from the EID space to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the =
corresponding RLOC network attachment point.</td><td> </td><td =
class=3D"right">   the corresponding RLOC network attachment =
point.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   When an =
ITR/PITR receives a packet from inside of the LISP site to</td><td> =
</td><td class=3D"right">   When an ITR/PITR receives a packet from =
inside of the LISP site to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destinations =
outside of the site a longest-prefix match lookup of the</td><td> =
</td><td class=3D"right">   destinations outside of the site a =
longest-prefix match lookup of the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EID is done to =
the map-cache.</td><td> </td><td class=3D"right">   EID is done to the =
map-cache.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0031"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   When the =
lookup succeeds, the <span class=3D"delete">locator-s</span>et retrieved =
from the map-</td><td> </td><td class=3D"rblock">   When the lookup =
succeeds, the <span class=3D"insert">Locator-S</span>et retrieved from =
the map-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   cache is used =
to send the packet to the EID's topological location.</td><td> </td><td =
class=3D"right">   cache is used to send the packet to the EID's =
topological location.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   If the lookup =
fails, the ITR/PITR needs to retrieve the mapping using</td><td> =
</td><td class=3D"right">   If the lookup fails, the ITR/PITR needs to =
retrieve the mapping using</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the LISP =
control-plane protocol [I-D.ietf-lisp-rfc6833bis].  The</td><td> =
</td><td class=3D"right">   the LISP control-plane protocol =
[I-D.ietf-lisp-rfc6833bis].  The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping is =
then stored in the local map-cache to forward subsequent</td><td> =
</td><td class=3D"right">   mapping is then stored in the local =
map-cache to forward subsequent</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   packets =
addressed to the same EID-prefix.</td><td> </td><td class=3D"right">   =
packets addressed to the same EID-prefix.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The map-cache =
is a local cache of mappings, entries are expired based</td><td> =
</td><td class=3D"right">   The map-cache is a local cache of mappings, =
entries are expired based</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   on the =
associated Time to live.  In addition, entries can be updated</td><td> =
</td><td class=3D"right">   on the associated Time to live.  In =
addition, entries can be updated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   with more =
current information, see Section 13 for further information</td><td> =
</td><td class=3D"right">   with more current information, see Section =
13 for further information</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-14" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 23, line =
32<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-14"><em> page 23, line =
17<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      list =
according to the weighting assigned by the server-side.  In</td><td> =
</td><td class=3D"right">      list according to the weighting assigned =
by the server-side.  In</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      this case, =
the server-side controls both the subset list and load-</td><td> =
</td><td class=3D"right">      this case, the server-side controls both =
the subset list and load-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      splitting =
across its members.  The client-side can use RLOCs</td><td> </td><td =
class=3D"right">      splitting across its members.  The client-side can =
use RLOCs</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      outside of =
the subset list if it determines that the subset list</td><td> </td><td =
class=3D"right">      outside of the subset list if it determines that =
the subset list</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      is =
unreachable (unless RLOCs are set to a Priority of 255).  Some</td><td> =
</td><td class=3D"right">      is unreachable (unless RLOCs are set to a =
Priority of 255).  Some</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      sharing of =
control exists: the server-side determines the</td><td> </td><td =
class=3D"right">      sharing of control exists: the server-side =
determines the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      destination =
RLOC list and load distribution while the client-side</td><td> </td><td =
class=3D"right">      destination RLOC list and load distribution while =
the client-side</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      has the =
option of using alternatives to this list if RLOCs in the</td><td> =
</td><td class=3D"right">      has the option of using alternatives to =
this list if RLOCs in the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      list are =
unreachable.</td><td> </td><td class=3D"right">      list are =
unreachable.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0032"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   o  The =
server-side sets a Weight of <span class=3D"delete">0</span> for the =
RLOC subset list.  In</td><td> </td><td class=3D"rblock">   o  The =
server-side sets a Weight of <span class=3D"insert">zero</span> for the =
RLOC subset list.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      this =
case, the client-side can choose how the traffic load is</td><td> =
</td><td class=3D"rblock">      In this case, the client-side can choose =
how the traffic load is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      spread =
across the subset list.  Control is shared by the server-</td><td> =
</td><td class=3D"right">      spread across the subset list.  Control =
is shared by the server-</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0033"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">      side =
determining the list and the client determining load</td><td> </td><td =
class=3D"rblock">      side determining the list and the client<span =
class=3D"insert">-side</span> determining load</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
distribution.  Again, the client can use alternative RLOCs if =
the</td><td> </td><td class=3D"right">      distribution.  Again, the =
client can use alternative RLOCs if the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
server-provided list of RLOCs is unreachable.</td><td> </td><td =
class=3D"right">      server-provided list of RLOCs is =
unreachable.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Either side =
(more likely the server-side ETR) decides not to send</td><td> </td><td =
class=3D"right">   o  Either side (more likely the server-side ETR) =
decides not to send</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      a =
Map-Request.  For example, if the server-side ETR does not send</td><td> =
</td><td class=3D"right">      a Map-Request.  For example, if the =
server-side ETR does not send</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Map-Requests, it gleans RLOCs from the client-side ITR, giving =
the</td><td> </td><td class=3D"right">      Map-Requests, it gleans =
RLOCs from the client-side ITR, giving the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      client-side =
ITR responsibility for bidirectional RLOC reachability</td><td> </td><td =
class=3D"right">      client-side ITR responsibility for bidirectional =
RLOC reachability</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      and =
preferability.  Server-side ETR gleaning of the client-side</td><td> =
</td><td class=3D"right">      and preferability.  Server-side ETR =
gleaning of the client-side</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      ITR RLOC is =
done by caching the inner-header source EID and the</td><td> </td><td =
class=3D"right">      ITR RLOC is done by caching the inner-header =
source EID and the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
outer-header source RLOC of received packets.  The client-side =
ITR</td><td> </td><td class=3D"right">      outer-header source RLOC of =
received packets.  The client-side ITR</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-15" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 24, line =
45<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-15"><em> page 24, line =
30<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       an =
encapsulated data packet received from an ITR.  If the ETR is</td><td> =
</td><td class=3D"right">       an encapsulated data packet received =
from an ITR.  If the ETR is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       also =
acting as an ITR and has traffic to return to the original</td><td> =
</td><td class=3D"right">       also acting as an ITR and has traffic to =
return to the original</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       ITR site, =
it can use this status information to help select an</td><td> </td><td =
class=3D"right">       ITR site, it can use this status information to =
help select an</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
RLOC.</td><td> </td><td class=3D"right">       RLOC.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   2.  An ITR MAY =
receive an ICMP Network Unreachable or Host</td><td> </td><td =
class=3D"right">   2.  An ITR MAY receive an ICMP Network Unreachable or =
Host</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Unreachable message for an RLOC it is using.  This indicates =
that</td><td> </td><td class=3D"right">       Unreachable message for an =
RLOC it is using.  This indicates that</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left">       the RLOC =
is likely down.  Note that trusting ICMP messages may</td><td> </td><td =
class=3D"right">       the RLOC is likely down.  Note that trusting ICMP =
messages may</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       not be =
desirable, but neither is ignoring them completely.</td><td> </td><td =
class=3D"right">       not be desirable, but neither is ignoring them =
completely.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
Implementations are encouraged to follow current best practices</td><td> =
</td><td class=3D"right">       Implementations are encouraged to follow =
current best practices</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0034"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       in =
treating these conditions.</td><td> </td><td class=3D"rblock">       in =
treating these conditions<span class=3D"insert"> =
[I-D.ietf-opsec-icmp-filtering]</span>.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0035"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   3.  <span =
class=3D"delete">An</span> ITR <span class=3D"delete">that</span> =
participates in the <span class=3D"delete">global</span> routing <span =
class=3D"delete">system</span> can</td><td> </td><td class=3D"rblock">   =
3.  <span class=3D"insert">When an</span> ITR participates in the =
routing <span class=3D"insert">protocol that operates in</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       =
determine that an RLOC is down <span class=3D"delete">if</span> no <span =
class=3D"delete">BGP</span> Routing Information Base</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">       the underlay routing =
system, it</span> can determine that an RLOC is</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">       (RIB) =
<span class=3D"delete">route</span> exists that matches the RLOC IP =
address.</td><td> </td><td class=3D"rblock">       down <span =
class=3D"insert">when</span> no Routing Information Base (RIB) <span =
class=3D"insert">entry</span> exists that</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">       matches the RLOC IP address.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   4.  An ITR MAY =
receive an ICMP Port Unreachable message from a</td><td> </td><td =
class=3D"right">   4.  An ITR MAY receive an ICMP Port Unreachable =
message from a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
destination host.  This occurs if an ITR attempts to use</td><td> =
</td><td class=3D"right">       destination host.  This occurs if an ITR =
attempts to use</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
interworking [RFC6832] and LISP-encapsulated data is sent to a</td><td> =
</td><td class=3D"right">       interworking [RFC6832] and =
LISP-encapsulated data is sent to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
non-LISP-capable site.</td><td> </td><td class=3D"right">       =
non-LISP-capable site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   5.  An ITR MAY =
receive a Map-Reply from an ETR in response to a</td><td> </td><td =
class=3D"right">   5.  An ITR MAY receive a Map-Reply from an ETR in =
response to a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       previously =
sent Map-Request.  The RLOC source of the Map-Reply is</td><td> </td><td =
class=3D"right">       previously sent Map-Request.  The RLOC source of =
the Map-Reply is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       likely up, =
since the ETR was able to send the Map-Reply to the</td><td> </td><td =
class=3D"right">       likely up, since the ETR was able to send the =
Map-Reply to the</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       =
ITR.</td><td> </td><td class=3D"right">       ITR.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-16" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 37, line =
34<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-16"><em> page 37, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in LISP =
Map-Servers and Map-Resolvers) and are provided on demand to</td><td> =
</td><td class=3D"right">   in LISP Map-Servers and Map-Resolvers) and =
are provided on demand to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   only the =
correspondents of the LISP mobile node.</td><td> </td><td class=3D"right">=
   only the correspondents of the LISP mobile node.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Refer to =
[I-D.ietf-lisp-mn] for more details for when the EID and</td><td> =
</td><td class=3D"right">   Refer to [I-D.ietf-lisp-mn] for more details =
for when the EID and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   RLOC are =
co-located in the roaming node.</td><td> </td><td class=3D"right">   =
RLOC are co-located in the roaming node.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">17.  LISP xTR =
Placement and Encapsulation Methods</td><td> </td><td class=3D"right">17. =
 LISP xTR Placement and Encapsulation Methods</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
will explore how and where ITRs and ETRs can be placed</td><td> </td><td =
class=3D"right">   This section will explore how and where ITRs and ETRs =
can be placed</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   in the network =
and will discuss the pros and cons of each scenario.</td><td> </td><td =
class=3D"right">   in the network and will discuss the pros and cons of =
each scenario.</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0036"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   For a more =
detailed network<span class=3D"delete">d</span> design deployment =
recommendation, refer</td><td> </td><td class=3D"rblock">   For a more =
detailed network design deployment recommendation, refer</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   to =
[RFC7215].</td><td> </td><td class=3D"right">   to [RFC7215].</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   There are two =
basic deployment tradeoffs to consider: centralized</td><td> </td><td =
class=3D"right">   There are two basic deployment tradeoffs to consider: =
centralized</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   versus =
distributed caches; and flat, Recursive, or Re-encapsulating</td><td> =
</td><td class=3D"right">   versus distributed caches; and flat, =
Recursive, or Re-encapsulating</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tunneling.  =
When deciding on centralized versus distributed caching,</td><td> =
</td><td class=3D"right">   Tunneling.  When deciding on centralized =
versus distributed caching,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the following =
issues SHOULD be considered:</td><td> </td><td class=3D"right">   the =
following issues SHOULD be considered:</td><td class=3D"lineno"></td></tr>=

      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Are the =
xTRs spread out so that the caches are spread across all</td><td> =
</td><td class=3D"right">   o  Are the xTRs spread out so that the =
caches are spread across all</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      the =
memories of each router?  A centralized cache is when an ITR</td><td> =
</td><td class=3D"right">      the memories of each router?  A =
centralized cache is when an ITR</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      keeps a =
cache for all the EIDs it is encapsulating to.  The packet</td><td> =
</td><td class=3D"right">      keeps a cache for all the EIDs it is =
encapsulating to.  The packet</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-17" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 39, line =
50<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-17"><em> page 39, line =
33<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   capture some =
of the reasoning behind this preference for implementing</td><td> =
</td><td class=3D"right">   capture some of the reasoning behind this =
preference for implementing</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   LISP on CE =
routers.</td><td> </td><td class=3D"right">   LISP on CE =
routers.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The use of ISP =
PE routers for xTR placement gives an ISP, rather than</td><td> </td><td =
class=3D"right">   The use of ISP PE routers for xTR placement gives an =
ISP, rather than</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   a site, =
control over the location of the ETRs.  That is, the ISP can</td><td> =
</td><td class=3D"right">   a site, control over the location of the =
ETRs.  That is, the ISP can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   decide whether =
the xTRs are in the destination site (in either CE</td><td> </td><td =
class=3D"right">   decide whether the xTRs are in the destination site =
(in either CE</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   xTRs or =
last-hop xTRs within a site) or at other PE edges.  The</td><td> =
</td><td class=3D"right">   xTRs or last-hop xTRs within a site) or at =
other PE edges.  The</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   advantage of =
this case is that two encapsulation headers can be</td><td> </td><td =
class=3D"right">   advantage of this case is that two encapsulation =
headers can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   avoided.  By =
having the PE be the first router on the path to</td><td> </td><td =
class=3D"right">   avoided.  By having the PE be the first router on the =
path to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   encapsulate, =
it can choose a TE path first, and the ETR can</td><td> </td><td =
class=3D"right">   encapsulate, it can choose a TE path first, and the =
ETR can</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0037"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   decapsulate =
and Re-Encapsulate for a new encapsul<span class=3D"delete">u</span>ation =
path to the</td><td> </td><td class=3D"rblock">   decapsulate and =
Re-Encapsulate for a new encapsulation path to the</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   destination =
end site.</td><td> </td><td class=3D"right">   destination end =
site.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   An obvious =
disadvantage is that the end site has no control over</td><td> </td><td =
class=3D"right">   An obvious disadvantage is that the end site has no =
control over</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   where its =
packets flow or over the RLOCs used.  Other disadvantages</td><td> =
</td><td class=3D"right">   where its packets flow or over the RLOCs =
used.  Other disadvantages</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   include =
difficulty in synchronizing path liveness updates between CE</td><td> =
</td><td class=3D"right">   include difficulty in synchronizing path =
liveness updates between CE</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and PE =
routers.</td><td> </td><td class=3D"right">   and PE routers.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   As mentioned =
in earlier sections, a combination of these scenarios is</td><td> =
</td><td class=3D"right">   As mentioned in earlier sections, a =
combination of these scenarios is</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   possible at =
the expense of extra packet header overhead; if both site</td><td> =
</td><td class=3D"right">   possible at the expense of extra packet =
header overhead; if both site</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   and provider =
want control, then Recursive or Re-Encapsulating Tunnels</td><td> =
</td><td class=3D"right">   and provider want control, then Recursive or =
Re-Encapsulating Tunnels</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-18" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 43, line =
7<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-18"><em> page 42, line =
36<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   expecting =
addresses from intermediate hops in the same address format</td><td> =
</td><td class=3D"right">   expecting addresses from intermediate hops =
in the same address format</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   for the type =
of traceroute it originated.  Therefore, in this case,</td><td> </td><td =
class=3D"right">   for the type of traceroute it originated.  Therefore, =
in this case,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   segment 2 will =
make the tunnel look like one hop.  All the ITR has to</td><td> </td><td =
class=3D"right">   segment 2 will make the tunnel look like one hop.  =
All the ITR has to</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   do to make =
this work is to not copy the inner TTL to the outer,</td><td> </td><td =
class=3D"right">   do to make this work is to not copy the inner TTL to =
the outer,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   encapsulating =
header's TTL when a traceroute packet is encapsulated</td><td> </td><td =
class=3D"right">   encapsulating header's TTL when a traceroute packet =
is encapsulated</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   using an RLOC =
from a different address family.  This will cause no</td><td> </td><td =
class=3D"right">   using an RLOC from a different address family.  This =
will cause no</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   TTL decrement =
to 0 to occur in core routers between the ITR and ETR.</td><td> </td><td =
class=3D"right">   TTL decrement to 0 to occur in core routers between =
the ITR and ETR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">19.  Security =
Considerations</td><td> </td><td class=3D"right">19.  Security =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0038"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   Security =
considerations for LISP are discussed in <span class=3D"delete">[RFC7833],=
 in</span></td><td> </td><td class=3D"rblock">   Security considerations =
for LISP are discussed in <span class=3D"insert">[RFC7833].</span></td><td=
 class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   addition [I-D.ietf-lisp-sec] provides authentication =
and integrity to</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">   LISP mappings.</span></td><td> </td><td =
class=3D"rblock"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   A complete =
LISP threat analysis can be found in [RFC7835], in what</td><td> =
</td><td class=3D"right">   A complete LISP threat analysis can be found =
in [RFC7835], in what</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   follows we =
provide a summary.</td><td> </td><td class=3D"right">   follows we =
provide a summary.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The optional =
mechanisms of gleaning is offered to directly obtain a</td><td> </td><td =
class=3D"right">   The optional mechanisms of gleaning is offered to =
directly obtain a</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mapping from =
the LISP encapsulated packets.  Specifically, an xTR can</td><td> =
</td><td class=3D"right">   mapping from the LISP encapsulated packets.  =
Specifically, an xTR can</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   learn the =
EID-to-RLOC mapping by inspecting the source RLOC and</td><td> </td><td =
class=3D"right">   learn the EID-to-RLOC mapping by inspecting the =
source RLOC and</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   source EID of =
an encapsulated packet, and insert this new mapping</td><td> </td><td =
class=3D"right">   source EID of an encapsulated packet, and insert this =
new mapping</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   into its =
map-cache.  An off-path attacker can spoof the source EID</td><td> =
</td><td class=3D"right">   into its map-cache.  An off-path attacker =
can spoof the source EID</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   address to =
divert the traffic sent to the victim's spoofed EID.  If</td><td> =
</td><td class=3D"right">   address to divert the traffic sent to the =
victim's spoofed EID.  If</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   the attacker =
spoofs the source RLOC, it can mount a DoS attack by</td><td> </td><td =
class=3D"right">   the attacker spoofs the source RLOC, it can mount a =
DoS attack by</td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0039"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   redirecting =
traffic to the spoofed victim<span class=3D"delete">;</span>s RLOC, =
potentially</td><td> </td><td class=3D"rblock">   redirecting traffic to =
the spoofed victim<span class=3D"insert">'</span>s RLOC, =
potentially</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   overloading =
it.</td><td> </td><td class=3D"right">   overloading it.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The LISP =
Data-Plane defines several mechanisms to monitor RLOC data-</td><td> =
</td><td class=3D"right">   The LISP Data-Plane defines several =
mechanisms to monitor RLOC data-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   plane =
reachability, in this context Locator-Status Bits, Nonce-</td><td> =
</td><td class=3D"right">   plane reachability, in this context =
Locator-Status Bits, Nonce-</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Present and =
Echo-Nonce bits of the LISP encapsulation header can be</td><td> =
</td><td class=3D"right">   Present and Echo-Nonce bits of the LISP =
encapsulation header can be</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   manipulated by =
an attacker to mount a DoS attack.  An off-path</td><td> </td><td =
class=3D"right">   manipulated by an attacker to mount a DoS attack.  An =
off-path</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   attacker able =
to spoof the RLOC of a victim's xTR can manipulate such</td><td> =
</td><td class=3D"right">   attacker able to spoof the RLOC of a =
victim's xTR can manipulate such</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   mechanisms to =
declare a set of RLOCs unreachable.  This can be used</td><td> </td><td =
class=3D"right">   mechanisms to declare a set of RLOCs unreachable.  =
This can be used</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   also, for =
instance, to declare only one RLOC reachable with the aim</td><td> =
</td><td class=3D"right">   also, for instance, to declare only one RLOC =
reachable with the aim</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   of overload =
it.</td><td> </td><td class=3D"right">   of overload it.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-19" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 44, line =
13<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-19"><em> page 43, line =
38<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   found in =
[RFC7052] and [RFC6835].</td><td> </td><td class=3D"right">   found in =
[RFC7052] and [RFC6835].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.  IANA =
Considerations</td><td> </td><td class=3D"right">21.  IANA =
Considerations</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   This section =
provides guidance to the Internet Assigned Numbers</td><td> </td><td =
class=3D"right">   This section provides guidance to the Internet =
Assigned Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Authority =
(IANA) regarding registration of values related to this</td><td> =
</td><td class=3D"right">   Authority (IANA) regarding registration of =
values related to this</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   data-plane =
LISP specification, in accordance with BCP 26 [RFC8126].</td><td> =
</td><td class=3D"right">   data-plane LISP specification, in accordance =
with BCP 26 [RFC8126].</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">21.1.  LISP UDP =
Port Numbers</td><td> </td><td class=3D"right">21.1.  LISP UDP Port =
Numbers</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0040"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   The IANA =
registry has allocated UDP port <span class=3D"delete">numbers</span> =
4341 <span class=3D"delete">and 4342</span> for</td><td> </td><td =
class=3D"rblock">   The IANA registry has allocated UDP port <span =
class=3D"insert">number</span> 4341 for <span class=3D"insert">the =
LISP</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   <span =
class=3D"delete">lisp-data and lisp-control operation, =
respectively.</span>  IANA has updated</td><td> </td><td =
class=3D"rblock"><span class=3D"insert">   data-plane.</span>  IANA has =
updated the description for UDP <span class=3D"insert">port</span> 4341 =
as</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">   the =
description for UDP <span class=3D"delete">ports</span> 4341 <span =
class=3D"delete">and 4342</span> as follows:</td><td> </td><td =
class=3D"rblock">   follows:</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">       lisp-data  =
    4341 udp    LISP Data Packets</td><td> </td><td class=3D"right">     =
  lisp-data      4341 udp    LISP Data Packets</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0041"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"><span =
class=3D"delete">       lisp-control   4342 udp    LISP Control =
Packets</span></td><td> </td><td class=3D"rblock"></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.  =
References</td><td> </td><td class=3D"right">22.  References</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">22.1.  Normative =
References</td><td> </td><td class=3D"right">22.1.  Normative =
References</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-rfc6833bis]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-rfc6833bis]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,</td><td> </td><td =
class=3D"right">              Fuller, V., Farinacci, D., and A. =
Cabellos-Aparicio,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Locator/ID Separation Protocol (LISP) Control-Plane",</td><td> </td><td =
class=3D"right">              "Locator/ID Separation Protocol (LISP) =
Control-Plane",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
draft-ietf-lisp-rfc6833bis-07 (work in progress), December</td><td> =
</td><td class=3D"right">              draft-ietf-lisp-rfc6833bis-07 =
(work in progress), December</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
2017.</td><td> </td><td class=3D"right">              2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-20" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 46, line =
42<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-20"><em> page 46, line =
25<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-signal-free-multicast]</td><td> </td><td class=3D"right"> =
  [I-D.ietf-lisp-signal-free-multicast]</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",</td><td> =
</td><td class=3D"right">              Moreno, V. and D. Farinacci, =
"Signal-Free LISP Multicast",</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
draft-ietf-lisp-signal-free-multicast-07 (work in</td><td> </td><td =
class=3D"right">              draft-ietf-lisp-signal-free-multicast-07 =
(work in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
progress), November 2017.</td><td> </td><td class=3D"right">             =
 progress), November 2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.ietf-lisp-vpn]</td><td> </td><td class=3D"right">   =
[I-D.ietf-lisp-vpn]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Moreno, V. and D. Farinacci, "LISP Virtual Private</td><td> </td><td =
class=3D"right">              Moreno, V. and D. Farinacci, "LISP Virtual =
Private</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Networks (VPNs)", draft-ietf-lisp-vpn-01 (work in</td><td> </td><td =
class=3D"right">              Networks (VPNs)", draft-ietf-lisp-vpn-01 =
(work in</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
progress), November 2017.</td><td> </td><td class=3D"right">             =
 progress), November 2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0042"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">   <span =
class=3D"insert">[I-D.ietf-opsec-icmp-filtering]</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              Gont, F., =
Gont, G., and C. Pignataro, "Recommendations for</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              filtering =
ICMP messages", draft-ietf-opsec-icmp-</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">              =
filtering-04 (work in progress), July 2013.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock">                                               =
                          </td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[I-D.meyer-loc-id-implications]</td><td> </td><td class=3D"right">   =
[I-D.meyer-loc-id-implications]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Meyer, D. and D. Lewis, "Architectural Implications of</td><td> </td><td =
class=3D"right">              Meyer, D. and D. Lewis, "Architectural =
Implications of</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Locator/ID Separation", draft-meyer-loc-id-implications-01</td><td> =
</td><td class=3D"right">              Locator/ID Separation", =
draft-meyer-loc-id-implications-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
(work in progress), January 2009.</td><td> </td><td class=3D"right">     =
         (work in progress), January 2009.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [LISA96]   =
Lear, E., Tharp, D., Katinsky, J., and J. Coffin,</td><td> </td><td =
class=3D"right">   [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. =
Coffin,</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
"Renumbering: Threat or Menace?", Usenix Tenth System</td><td> </td><td =
class=3D"right">              "Renumbering: Threat or Menace?", Usenix =
Tenth System</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">              =
Administration Conference (LISA 96), October 1996.</td><td> </td><td =
class=3D"right">              Administration Conference (LISA 96), =
October 1996.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   =
[OPENLISP]</td><td> </td><td class=3D"right">   [OPENLISP]</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-21" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 51, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-21"><em> page 50, line =
5<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   The LISP =
working group would like to give a special thanks to Jari</td><td> =
</td><td class=3D"right">   The LISP working group would like to give a =
special thanks to Jari</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Arkko, the =
Internet Area AD at the time that the set of LISP</td><td> </td><td =
class=3D"right">   Arkko, the Internet Area AD at the time that the set =
of LISP</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   documents were =
being prepared for IESG last call, and for his</td><td> </td><td =
class=3D"right">   documents were being prepared for IESG last call, and =
for his</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   meticulous =
reviews and detailed commentaries on the 7 working group</td><td> =
</td><td class=3D"right">   meticulous reviews and detailed commentaries =
on the 7 working group</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   last call =
documents progressing toward standards-track RFCs.</td><td> </td><td =
class=3D"right">   last call documents progressing toward =
standards-track RFCs.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Appendix B.  =
Document Change Log</td><td> </td><td class=3D"right">Appendix B.  =
Document Change Log</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   [RFC Editor: =
Please delete this section on publication as RFC.]</td><td> </td><td =
class=3D"right">   [RFC Editor: Please delete this section on =
publication as RFC.]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0043"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.1.  Changes =
to draft-ietf-lisp-rfc6830bis-08</td><td> </td><td class=3D"rblock">B.1. =
 Changes to <span =
class=3D"insert">draft-ietf-lisp-rfc6830bis-09</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Posted January =
2018.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Add more details =
in section 5.3 about DSCP processing during</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      encapsulation and =
decapsulation.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Added clarity to =
definitions in the Definition of Terms section</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">      from various =
commenters.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Removed PA and PI =
definitions from Definition of Terms section.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  More editorial =
changes.</span></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">   o  Removed 4342 from =
IANA section and move to RFC6833 IANA section.</span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert"></span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">B.2.  Changes to</span> =
draft-ietf-lisp-rfc6830bis-08</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
January 2018.</td><td> </td><td class=3D"right">   o  Posted January =
2018.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to research work for any protocol mechanisms.</td><td> =
</td><td class=3D"right">   o  Remove references to research work for =
any protocol mechanisms.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Document =
scanned to make sure it is RFC 2119 compliant.</td><td> </td><td =
class=3D"right">   o  Document scanned to make sure it is RFC 2119 =
compliant.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Made =
changes to reflect comments from document WG shepherd Luigi</td><td> =
</td><td class=3D"right">   o  Made changes to reflect comments from =
document WG shepherd Luigi</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Iannone.</td><td> </td><td class=3D"right">      Iannone.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Ran IDNITs =
on the document.</td><td> </td><td class=3D"right">   o  Ran IDNITs on =
the document.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0044"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">2</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-07</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-07</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
November 2017.</td><td> </td><td class=3D"right">   o  Posted November =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rephrase =
how Instance-IDs are used and don't refer to [RFC1918]</td><td> </td><td =
class=3D"right">   o  Rephrase how Instance-IDs are used and don't refer =
to [RFC1918]</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
addresses.</td><td> </td><td class=3D"right">      addresses.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0045"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">3</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-06</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
October 2017.</td><td> </td><td class=3D"right">   o  Posted October =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Put RTR =
definition before it is used.</td><td> </td><td class=3D"right">   o  =
Put RTR definition before it is used.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Rename =
references that are now working group drafts.</td><td> </td><td =
class=3D"right">   o  Rename references that are now working group =
drafts.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
"EIDs MUST NOT be used as used by a host to refer to other</td><td> =
</td><td class=3D"right">   o  Remove "EIDs MUST NOT be used as used by =
a host to refer to other</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      hosts.  =
Note that EID blocks MAY LISP RLOCs".</td><td> </td><td class=3D"right"> =
     hosts.  Note that EID blocks MAY LISP RLOCs".</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"part-22" class=3D"change"><td></td><th><small>skipping =
to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 51, line =
48<span class=3D"hide"> =C2=B6</span></em></a></th><th> =
</th><th><small>skipping to change at</small><a =
href=3D"https://tools.ietf.org/rfcdiff#part-22"><em> page 51, line =
15<span class=3D"hide"> =C2=B6</span></em></a></th><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  ETRs may, =
rather than will, be the ones to send Map-Replies.</td><td> </td><td =
class=3D"right">   o  ETRs may, rather than will, be the ones to send =
Map-Replies.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Recommend, =
rather than mandate, max encapsulation headers to 2.</td><td> </td><td =
class=3D"right">   o  Recommend, rather than mandate, max encapsulation =
headers to 2.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reference =
VPN draft when introducing Instance-ID.</td><td> </td><td class=3D"right">=
   o  Reference VPN draft when introducing Instance-ID.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that SMRs can be sent when ITR/ETR are in the same node.</td><td> =
</td><td class=3D"right">   o  Indicate that SMRs can be sent when =
ITR/ETR are in the same node.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarify =
when private addreses can be used.</td><td> </td><td class=3D"right">   =
o  Clarify when private addreses can be used.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0046"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">4</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-05</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
August 2017.</td><td> </td><td class=3D"right">   o  Posted August =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Make it =
clear that a Reencapsulating Tunnel Router is an RTR.</td><td> </td><td =
class=3D"right">   o  Make it clear that a Reencapsulating Tunnel Router =
is an RTR.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0047"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">5</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-04</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted July =
2017.</td><td> </td><td class=3D"right">   o  Posted July 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Changed =
reference of IPv6 RFC2460 to RFC8200.</td><td> </td><td class=3D"right"> =
  o  Changed reference of IPv6 RFC2460 to RFC8200.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Indicate =
that the applicability statement for UDP zero checksums</td><td> =
</td><td class=3D"right">   o  Indicate that the applicability statement =
for UDP zero checksums</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      over IPv6 =
adheres to RFC6936.</td><td> </td><td class=3D"right">      over IPv6 =
adheres to RFC6936.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0048"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">6</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-03</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted May =
2017.</td><td> </td><td class=3D"right">   o  Posted May 2017.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Move the =
control-plane related codepoints in the IANA</td><td> </td><td =
class=3D"right">   o  Move the control-plane related codepoints in the =
IANA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      =
Considerations section to RFC6833bis.</td><td> </td><td class=3D"right"> =
     Considerations section to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0049"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">7</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-02</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
April 2017.</td><td> </td><td class=3D"right">   o  Posted April =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Reflect =
some editorial comments from Damien Sausez.</td><td> </td><td =
class=3D"right">   o  Reflect some editorial comments from Damien =
Sausez.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0050"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">8</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-01</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
March 2017.</td><td> </td><td class=3D"right">   o  Posted March =
2017.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Include =
references to new RFCs published.</td><td> </td><td class=3D"right">   o =
 Include references to new RFCs published.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Change =
references from RFC6833 to RFC6833bis.</td><td> </td><td class=3D"right"> =
  o  Change references from RFC6833 to RFC6833bis.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Clarified =
LCAF text in the IANA section.</td><td> </td><td class=3D"right">   o  =
Clarified LCAF text in the IANA section.</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Remove =
references to "experimental".</td><td> </td><td class=3D"right">   o  =
Remove references to "experimental".</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr id=3D"diff0051"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock">B.<span =
class=3D"delete">9</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td> </td><td class=3D"rblock">B.<span =
class=3D"insert">10</span>.  Changes to =
draft-ietf-lisp-rfc6830bis-00</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Posted =
December 2016.</td><td> </td><td class=3D"right">   o  Posted December =
2016.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   o  Created =
working group document from draft-farinacci-lisp</td><td> </td><td =
class=3D"right">   o  Created working group document from =
draft-farinacci-lisp</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">      -rfc6830-00 =
individual submission.  No other changes made.</td><td> </td><td =
class=3D"right">      -rfc6830-00 individual submission.  No other =
changes made.</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">Authors' =
Addresses</td><td> </td><td class=3D"right">Authors' Addresses</td><td =
class=3D"lineno"></td></tr>
      <tr id=3D"diff0052"><td></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"lblock"></td><td> =
</td><td class=3D"rblock"><span class=3D"insert">                        =
                                                 </span></td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Dino =
Farinacci</td><td> </td><td class=3D"right">   Dino Farinacci</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Tasman =
Drive</td><td> </td><td class=3D"right">   Tasman Drive</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   San Jose, CA  =
95134</td><td> </td><td class=3D"right">   San Jose, CA  95134</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   USA</td><td> =
</td><td class=3D"right">   USA</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   EMail: =
farinacci@gmail.com</td><td> </td><td class=3D"right">   EMail: =
farinacci@gmail.com</td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left"></td><td> =
</td><td class=3D"right"></td><td class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Vince =
Fuller</td><td> </td><td class=3D"right">   Vince Fuller</td><td =
class=3D"lineno"></td></tr>
      <tr><td class=3D"lineno"></td><td class=3D"left">   Cisco =
Systems</td><td> </td><td class=3D"right">   Cisco Systems</td><td =
class=3D"lineno"></td></tr>

     <tr><td></td><td class=3D"left"></td><td> </td><td =
class=3D"right"></td><td></td></tr>
     <tr id=3D"end" bgcolor=3D"gray"><th colspan=3D"5" =
align=3D"center">&nbsp;End of changes. 52 change blocks.&nbsp;</th></tr>
     <tr class=3D"stats"><td></td><th><i>125 lines changed or =
deleted</i></th><th><i> </i></th><th><i>142 lines changed or =
added</i></th><td></td></tr>
     <tr><td colspan=3D"5" align=3D"center" class=3D"small"><br>This =
html diff was produced by rfcdiff 1.46. The latest version is available =
from <a =
href=3D"http://www.tools.ietf.org/tools/rfcdiff/">http://tools.ietf.org/to=
ols/rfcdiff/</a> </td></tr>
   </tbody></table>
  =20
  =20
</body></html>=

--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56
Content-Transfer-Encoding: 7bit
Content-Type: text/plain;
	charset=us-ascii

    
--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56
Content-Disposition: attachment;
	filename=draft-ietf-lisp-rfc6830bis-09.txt
Content-Type: text/plain;
	x-unix-mode=0644;
	name="draft-ietf-lisp-rfc6830bis-09.txt"
Content-Transfer-Encoding: quoted-printable





Network Working Group                                       D. Farinacci
Internet-Draft                                                 V. Fuller
Intended status: Standards Track                                D. Meyer
Expires: July 30, 2018                                          D. Lewis
                                                           Cisco Systems
                                                       A. Cabellos (Ed.)
                                                       UPC/BarcelonaTech
                                                        January 26, 2018


               The Locator/ID Separation Protocol (LISP)
                     draft-ietf-lisp-rfc6830bis-09

Abstract

   This document describes the data-plane protocol for the Locator/ID
   Separation Protocol (LISP).  LISP defines two namespaces, End-point
   Identifiers (EIDs) that identify end-hosts and Routing Locators
   (RLOCs) that 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.

   LISP requires no change to either host protocol stacks or to underlay
   routers and offers Traffic Engineering, multihoming and mobility,
   among other features.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on July 30, 2018.








Farinacci, et al.         Expires July 30, 2018                 [Page 1]
=0C
Internet-Draft                    LISP                      January 2018


Copyright Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Requirements Notation . . . . . . . . . . . . . . . . . . . .   4
   3.  Definition of Terms . . . . . . . . . . . . . . . . . . . . .   4
   4.  Basic Overview  . . . . . . . . . . . . . . . . . . . . . . .   8
     4.1.  Packet Flow Sequence  . . . . . . . . . . . . . . . . . .  10
   5.  LISP Encapsulation Details  . . . . . . . . . . . . . . . . .  12
     5.1.  LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . .  13
     5.2.  LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . .  14
     5.3.  Tunnel Header Field Descriptions  . . . . . . . . . . . .  15
   6.  LISP EID-to-RLOC Map-Cache  . . . . . . . . . . . . . . . . .  19
   7.  Dealing with Large Encapsulated Packets . . . . . . . . . . .  20
     7.1.  A Stateless Solution to MTU Handling  . . . . . . . . . .  20
     7.2.  A Stateful Solution to MTU Handling . . . . . . . . . . .  21
   8.  Using Virtualization and Segmentation with LISP . . . . . . .  22
   9.  Routing Locator Selection . . . . . . . . . . . . . . . . . .  22
   10. Routing Locator Reachability  . . . . . . . . . . . . . . . .  24
     10.1.  Echo Nonce Algorithm . . . . . . . . . . . . . . . . . .  26
     10.2.  RLOC-Probing Algorithm . . . . . . . . . . . . . . . . .  28
   11. EID Reachability within a LISP Site . . . . . . . . . . . . .  28
   12. Routing Locator Hashing . . . . . . . . . . . . . . . . . . .  29
   13. Changing the Contents of EID-to-RLOC Mappings . . . . . . . .  30
     13.1.  Clock Sweep  . . . . . . . . . . . . . . . . . . . . . .  31
     13.2.  Solicit-Map-Request (SMR)  . . . . . . . . . . . . . . .  31
     13.3.  Database Map-Versioning  . . . . . . . . . . . . . . . .  33
   14. Multicast Considerations  . . . . . . . . . . . . . . . . . .  34
   15. Router Performance Considerations . . . . . . . . . . . . . .  34
   16. Mobility Considerations . . . . . . . . . . . . . . . . . . .  35
     16.1.  Slow Mobility  . . . . . . . . . . . . . . . . . . . . .  35
     16.2.  Fast Mobility  . . . . . . . . . . . . . . . . . . . . .  35
     16.3.  LISP Mobile Node Mobility  . . . . . . . . . . . . . . .  36
   17. LISP xTR Placement and Encapsulation Methods  . . . . . . . .  37



Farinacci, et al.         Expires July 30, 2018                 [Page 2]
=0C
Internet-Draft                    LISP                      January 2018


     17.1.  First-Hop/Last-Hop xTRs  . . . . . . . . . . . . . . . .  38
     17.2.  Border/Edge xTRs . . . . . . . . . . . . . . . . . . . .  38
     17.3.  ISP Provider Edge (PE) xTRs  . . . . . . . . . . . . . .  39
     17.4.  LISP Functionality with Conventional NATs  . . . . . . .  39
     17.5.  Packets Egressing a LISP Site  . . . . . . . . . . . . .  40
   18. Traceroute Considerations . . . . . . . . . . . . . . . . . .  40
     18.1.  IPv6 Traceroute  . . . . . . . . . . . . . . . . . . . .  41
     18.2.  IPv4 Traceroute  . . . . . . . . . . . . . . . . . . . .  41
     18.3.  Traceroute Using Mixed Locators  . . . . . . . . . . . .  42
   19. Security Considerations . . . . . . . . . . . . . . . . . . .  42
   20. Network Management Considerations . . . . . . . . . . . . . .  43
   21. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  43
     21.1.  LISP UDP Port Numbers  . . . . . . . . . . . . . . . . .  43
   22. References  . . . . . . . . . . . . . . . . . . . . . . . . .  43
     22.1.  Normative References . . . . . . . . . . . . . . . . . .  43
     22.2.  Informative References . . . . . . . . . . . . . . . . .  45
   Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  49
   Appendix B.  Document Change Log  . . . . . . . . . . . . . . . .  49
     B.1.  Changes to draft-ietf-lisp-rfc6830bis-09  . . . . . . . .  50
     B.2.  Changes to draft-ietf-lisp-rfc6830bis-08  . . . . . . . .  50
     B.3.  Changes to draft-ietf-lisp-rfc6830bis-07  . . . . . . . .  50
     B.4.  Changes to draft-ietf-lisp-rfc6830bis-06  . . . . . . . .  50
     B.5.  Changes to draft-ietf-lisp-rfc6830bis-05  . . . . . . . .  51
     B.6.  Changes to draft-ietf-lisp-rfc6830bis-04  . . . . . . . .  51
     B.7.  Changes to draft-ietf-lisp-rfc6830bis-03  . . . . . . . .  51
     B.8.  Changes to draft-ietf-lisp-rfc6830bis-02  . . . . . . . .  51
     B.9.  Changes to draft-ietf-lisp-rfc6830bis-01  . . . . . . . .  51
     B.10. Changes to draft-ietf-lisp-rfc6830bis-00  . . . . . . . .  52
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  52

1.  Introduction

   This document describes the Locator/Identifier Separation Protocol
   (LISP).  LISP is an encapsulation protocol built around the
   fundamental idea of separating the topological location of a network
   attachment point from the node's identity [CHIAPPA].  As a result
   LISP creates two namespaces: Endpoint Identifiers (EIDs), that are
   used to identify end-hosts (e.g., nodes or Virtual Machines) and
   routable Routing Locators (RLOCs), used to identify network
   attachment points.  LISP then defines functions for mapping between
   the two namespaces and for encapsulating traffic originated by
   devices using non-routable EIDs for transport across a network
   infrastructure that routes and forwards using RLOCs.  LISP
   encapsulation uses a dynamic form of tunneling where no static
   provisioning is required or necessary.

   LISP is an overlay protocol that separates control from data-plane,
   this document specifies the data-plane, how LISP-capable routers



Farinacci, et al.         Expires July 30, 2018                 [Page 3]
=0C
Internet-Draft                    LISP                      January 2018


   (Tunnel Routers) exchange packets by encapsulating them to the
   appropriate location.  Tunnel routers are equipped with a cache,
   called map-cache, that contains EID-to-RLOC mappings.  The map-cache
   is populated using the LISP Control-Plane protocol
   [I-D.ietf-lisp-rfc6833bis].

   LISP does not require changes to either host protocol stack or to
   underlay routers.  By separating the EID from the RLOC space, LISP
   offers native Traffic Engineering, multihoming and mobility, among
   other features.

   Creation of LISP was initially motivated by discussions during the
   IAB-sponsored Routing and Addressing Workshop held in Amsterdam in
   October 2006 (see [RFC4984]).

   This document specifies the LISP data-plane encapsulation and other
   LISP forwarding node functionality while [I-D.ietf-lisp-rfc6833bis]
   specifies the LISP control plane.  LISP deployment guidelines can be
   found in [RFC7215] and [RFC6835] describes considerations for network
   operational management.  Finally, [I-D.ietf-lisp-introduction]
   describes the LISP architecture.

2.  Requirements Notation

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in [RFC2119].

3.  Definition of Terms

   Address Family Identifier (AFI):   AFI is a term used to describe an
      address encoding in a packet.  An address family that pertains to
      the data-plane.  See [AFN] and [RFC3232] for details.  An AFI
      value of 0 used in this specification indicates an unspecified
      encoded address where the length of the address is 0 octets
      following the 16-bit AFI value of 0.

   Anycast Address:  Anycast Address is a term used in this document to
      refer to the same IPv4 or IPv6 address configured and used on
      multiple systems at the same time.  An EID or RLOC can be an
      anycast address in each of their own address spaces.

   Client-side:  Client-side is a term used in this document to indicate
      a connection initiation attempt by an end-system represented by an
      EID.

   Data-Probe:   A Data-Probe is a LISP-encapsulated data packet where
      the inner-header destination address equals the outer-header



Farinacci, et al.         Expires July 30, 2018                 [Page 4]
=0C
Internet-Draft                    LISP                      January 2018


      destination address used to trigger a Map-Reply by a decapsulating
      ETR.  In addition, the original packet is decapsulated and
      delivered to the destination host if the destination EID is in the
      EID-Prefix range configured on the ETR.  Otherwise, the packet is
      discarded.  A Data-Probe is used in some of the mapping database
      designs to "probe" or request a Map-Reply from an ETR; in other
      cases, Map-Requests are used.  See each mapping database design
      for details.  When using Data-Probes, by sending Map-Requests on
      the underlying routing system, EID-Prefixes must be advertised.

   Egress Tunnel Router (ETR):   An ETR is a router that accepts an IP
      packet where the destination address in the "outer" IP header is
      one of its own RLOCs.  The router strips the "outer" header and
      forwards the packet based on the next IP header found.  In
      general, an ETR receives LISP-encapsulated IP packets from the
      Internet on one side and sends decapsulated IP packets to site
      end-systems on the other side.  ETR functionality does not have to
      be limited to a router device.  A server host can be the endpoint
      of a LISP tunnel as well.

   EID-to-RLOC Database:   The EID-to-RLOC Database is a global
      distributed database that contains all known EID-Prefix-to-RLOC
      mappings.  Each potential ETR typically contains a small piece of
      the database: the EID-to-RLOC mappings for the EID-Prefixes
      "behind" the router.  These map to one of the router's own
      globally visible IP addresses.  Note that there MAY be transient
      conditions when the EID-Prefix for the site and Locator-Set for
      each EID-Prefix may not be the same on all ETRs.  This has no
      negative implications, since a partial set of Locators can be
      used.

   EID-to-RLOC Map-Cache:   The EID-to-RLOC map-cache is generally
      short-lived, on-demand table in an ITR that stores, tracks, and is
      responsible for timing out and otherwise validating EID-to-RLOC
      mappings.  This cache is distinct from the full "database" of EID-
      to-RLOC mappings; it is dynamic, local to the ITR(s), and
      relatively small, while the database is distributed, relatively
      static, and much more global in scope.

   EID-Prefix:   An EID-Prefix is a power-of-two block of EIDs that are
      allocated to a site by an address allocation authority.  EID-
      Prefixes are associated with a set of RLOC addresses.  EID-Prefix
      allocations can be broken up into smaller blocks when an RLOC set
      is to be associated with the larger EID-Prefix block.

   End-System:   An end-system is an IPv4 or IPv6 device that originates
      packets with a single IPv4 or IPv6 header.  The end-system
      supplies an EID value for the destination address field of the IP



Farinacci, et al.         Expires July 30, 2018                 [Page 5]
=0C
Internet-Draft                    LISP                      January 2018


      header when communicating globally (i.e., outside of its routing
      domain).  An end-system can be a host computer, a switch or router
      device, or any network appliance.

   Endpoint ID (EID):   An EID is a 32-bit (for IPv4) or 128-bit (for
      IPv6) value used in the source and destination address fields of
      the first (most inner) LISP header of a packet.  The host obtains
      a destination EID the same way it obtains a destination address
      today, for example, through a Domain Name System (DNS) [RFC1034]
      lookup or Session Initiation Protocol (SIP) [RFC3261] exchange.
      The source EID is obtained via existing mechanisms used to set a
      host's "local" IP address.  An EID used on the public Internet
      MUST have the same properties as any other IP address used in that
      manner; this means, among other things, that it MUST be globally
      unique.  An EID is allocated to a host from an EID-Prefix block
      associated with the site where the host is located.  An EID can be
      used by a host to refer to other hosts.  Note that EID blocks MAY
      be assigned in a hierarchical manner, independent of the network
      topology, to facilitate scaling of the mapping database.  In
      addition, an EID block assigned to a site MAY have site-local
      structure (subnetting) for routing within the site; this structure
      is not visible to the global routing system.  In theory, the bit
      string that represents an EID for one device can represent an RLOC
      for a different device.  When used in discussions with other
      Locator/ID separation proposals, a LISP EID will be called an
      "LEID".  Throughout this document, any references to "EID" refer
      to an LEID.

   Ingress Tunnel Router (ITR):   An ITR is a router that resides in a
      LISP site.  Packets sent by sources inside of the LISP site to
      destinations outside of the site are candidates for encapsulation
      by the ITR.  The ITR treats the IP destination address as an EID
      and performs an EID-to-RLOC mapping lookup.  The router then
      prepends an "outer" IP header with one of its routable RLOCs (in
      the RLOC space) in the source address field and the result of the
      mapping lookup in the destination address field.  Note that this
      destination RLOC MAY be an intermediate, proxy device that has
      better knowledge of the EID-to-RLOC mapping closer to the
      destination EID.  In general, an ITR receives IP packets from site
      end-systems on one side and sends LISP-encapsulated IP packets
      toward the Internet on the other side.

      Specifically, when a service provider prepends a LISP header for
      Traffic Engineering purposes, the router that does this is also
      regarded as an ITR.  The outer RLOC the ISP ITR uses can be based
      on the outer destination address (the originating ITR's supplied
      RLOC) or the inner destination address (the originating host's
      supplied EID).



Farinacci, et al.         Expires July 30, 2018                 [Page 6]
=0C
Internet-Draft                    LISP                      January 2018


   LISP Header:   LISP header is a term used in this document to refer
      to the outer IPv4 or IPv6 header, a UDP header, and a LISP-
      specific 8-octet header that follow the UDP header and that an ITR
      prepends or an ETR strips.

   LISP Router:   A LISP router is a router that performs the functions
      of any or all of the following: ITR, ETR, RTR, Proxy-ITR (PITR),
      or Proxy-ETR (PETR).

   LISP Site:  LISP site is a set of routers in an edge network that are
      under a single technical administration.  LISP routers that reside
      in the edge network are the demarcation points to separate the
      edge network from the core network.

   Locator-Status-Bits (LSBs):  Locator-Status-Bits are present in the
      LISP header.  They are used by ITRs to inform ETRs about the up/
      down status of all ETRs at the local site.  These bits are used as
      a hint to convey up/down router status and not path reachability
      status.  The LSBs can be verified by use of one of the Locator
      reachability algorithms described in Section 10.

   Negative Mapping Entry:   A negative mapping entry, also known as a
      negative cache entry, is an EID-to-RLOC entry where an EID-Prefix
      is advertised or stored with no RLOCs.  That is, the Locator-Set
      for the EID-to-RLOC entry is empty or has an encoded Locator count
      of 0.  This type of entry could be used to describe a prefix from
      a non-LISP site, which is explicitly not in the mapping database.
      There are a set of well-defined actions that are encoded in a
      Negative Map-Reply.

   Proxy-ETR (PETR):   A PETR is defined and described in [RFC6832].  A
      PETR acts like an ETR but does so on behalf of LISP sites that
      send packets to destinations at non-LISP sites.

   Proxy-ITR (PITR):   A PITR is defined and described in [RFC6832].  A
      PITR acts like an ITR but does so on behalf of non-LISP sites that
      send packets to destinations at LISP sites.

   Recursive Tunneling:   Recursive Tunneling occurs when a packet has
      more than one LISP IP header.  Additional layers of tunneling MAY
      be employed to implement Traffic Engineering or other re-routing
      as needed.  When this is done, an additional "outer" LISP header
      is added, and the original RLOCs are preserved in the "inner"
      header.

   Re-Encapsulating Tunneling Router (RTR):   An RTR acts like an ETR to
      remove a LISP header, then acts as an ITR to prepend a new LISP
      header.  This is known as Re-encapsulating Tunneling.  Doing this



Farinacci, et al.         Expires July 30, 2018                 [Page 7]
=0C
Internet-Draft                    LISP                      January 2018


      allows a packet to be re-routed by the RTR without adding the
      overhead of additional tunnel headers.  When using multiple
      mapping database systems, care must be taken to not create re-
      encapsulation loops through misconfiguration.

   Route-Returnability:  Route-returnability is an assumption that the
      underlying routing system will deliver packets to the destination.
      When combined with a nonce that is provided by a sender and
      returned by a receiver, this limits off-path data insertion.  A
      route-returnability check is verified when a message is sent with
      a nonce, another message is returned with the same nonce, and the
      destination of the original message appears as the source of the
      returned message.

   Routing Locator (RLOC):   An RLOC is an IPv4 [RFC0791] or IPv6
      [RFC8200] address of an Egress Tunnel Router (ETR).  An RLOC is
      the output of an EID-to-RLOC mapping lookup.  An EID maps to zero
      or more RLOCs.  Typically, RLOCs are numbered from blocks that are
      assigned to a site at each point to which it attaches to the
      underlay network; where the topology is defined by the
      connectivity of provider networks.  Multiple RLOCs can be assigned
      to the same ETR device or to multiple ETR devices at a site.

   Server-side:  Server-side is a term used in this document to indicate
      that a connection initiation attempt is being accepted for a
      destination EID.

   TE-ETR:   A TE-ETR is an ETR that is deployed in a service provider
      network that strips an outer LISP header for Traffic Engineering
      purposes.

   TE-ITR:   A TE-ITR is an ITR that is deployed in a service provider
      network that prepends an additional LISP header for Traffic
      Engineering purposes.

   xTR:   An xTR is a reference to an ITR or ETR when direction of data
      flow is not part of the context description.  "xTR" refers to the
      router that is the tunnel endpoint and is used synonymously with
      the term "Tunnel Router".  For example, "An xTR can be located at
      the Customer Edge (CE) router" indicates both ITR and ETR
      functionality at the CE router.

4.  Basic Overview

   One key concept of LISP is that end-systems operate the same way they
   do today.  The IP addresses that hosts use for tracking sockets and
   connections, and for sending and receiving packets, do not change.




Farinacci, et al.         Expires July 30, 2018                 [Page 8]
=0C
Internet-Draft                    LISP                      January 2018


   In LISP terminology, these IP addresses are called Endpoint
   Identifiers (EIDs).

   Routers continue to forward packets based on IP destination
   addresses.  When a packet is LISP encapsulated, these addresses are
   referred to as Routing Locators (RLOCs).  Most routers along a path
   between two hosts will not change; they continue to perform routing/
   forwarding lookups on the destination addresses.  For routers between
   the source host and the ITR as well as routers from the ETR to the
   destination host, the destination address is an EID.  For the routers
   between the ITR and the ETR, the destination address is an RLOC.

   Another key LISP concept is the "Tunnel Router".  A Tunnel Router
   prepends LISP headers on host-originated packets and strips them
   prior to final delivery to their destination.  The IP addresses in
   this "outer header" are RLOCs.  During end-to-end packet exchange
   between two Internet hosts, an ITR prepends a new LISP header to each
   packet, and an ETR strips the new header.  The ITR performs EID-to-
   RLOC lookups to determine the routing path to the ETR, which has the
   RLOC as one of its IP addresses.

   Some basic rules governing LISP are:

   o  End-systems only send to addresses that are EIDs.  EIDs are
      typically IP addresses assigned to hosts (other types of EID are
      supported by LISP, see [RFC8060] for further information).  End-
      systems don't know that addresses are EIDs versus RLOCs but assume
      that packets get to their intended destinations.  In a system
      where LISP is deployed, LISP routers intercept EID-addressed
      packets and assist in delivering them across the network core
      where EIDs cannot be routed.  The procedure a host uses to send IP
      packets does not change.

   o  LISP routers mostly deal with Routing Locator addresses.  See
      details in Section 4.1 to clarify what is meant by "mostly".

   o  RLOCs are always IP addresses assigned to routers, preferably
      topologically oriented addresses from provider CIDR (Classless
      Inter-Domain Routing) blocks.

   o  When a router originates packets, it MAY use as a source address
      either an EID or RLOC.  When acting as a host (e.g., when
      terminating a transport session such as Secure SHell (SSH),
      TELNET, or the Simple Network Management Protocol (SNMP)), it MAY
      use an EID that is explicitly assigned for that purpose.  An EID
      that identifies the router as a host MUST NOT be used as an RLOC;
      an EID is only routable within the scope of a site.  A typical BGP
      configuration might demonstrate this "hybrid" EID/RLOC usage where



Farinacci, et al.         Expires July 30, 2018                 [Page 9]
=0C
Internet-Draft                    LISP                      January 2018


      a router could use its "host-like" EID to terminate iBGP sessions
      to other routers in a site while at the same time using RLOCs to
      terminate eBGP sessions to routers outside the site.

   o  Packets with EIDs in them are not expected to be delivered end-to-
      end in the absence of an EID-to-RLOC mapping operation.  They are
      expected to be used locally for intra-site communication or to be
      encapsulated for inter-site communication.

   o  EIDs MAY also be structured (subnetted) in a manner suitable for
      local routing within an Autonomous System (AS).

   An additional LISP header MAY be prepended to packets by a TE-ITR
   when re-routing of the path for a packet is desired.  A potential
   use-case for this would be an ISP router that needs to perform
   Traffic Engineering for packets flowing through its network.  In such
   a situation, termed "Recursive Tunneling", an ISP transit acts as an
   additional ITR, and the RLOC it uses for the new prepended header
   would be either a TE-ETR within the ISP (along an intra-ISP traffic
   engineered path) or a TE-ETR within another ISP (an inter-ISP traffic
   engineered path, where an agreement to build such a path exists).

   In order to avoid excessive packet overhead as well as possible
   encapsulation loops, this document recommends that a maximum of two
   LISP headers can be prepended to a packet.  For initial LISP
   deployments, it is assumed that two headers is sufficient, where the
   first prepended header is used at a site for Location/Identity
   separation and the second prepended header is used inside a service
   provider for Traffic Engineering purposes.

   Tunnel Routers can be placed fairly flexibly in a multi-AS topology.
   For example, the ITR for a particular end-to-end packet exchange
   might be the first-hop or default router within a site for the source
   host.  Similarly, the ETR might be the last-hop router directly
   connected to the destination host.  Another example, perhaps for a
   VPN service outsourced to an ISP by a site, the ITR could be the
   site's border router at the service provider attachment point.
   Mixing and matching of site-operated, ISP-operated, and other Tunnel
   Routers is allowed for maximum flexibility.

4.1.  Packet Flow Sequence

   This section provides an example of the unicast packet flow,
   including also control-plane information as specified in
   [I-D.ietf-lisp-rfc6833bis].  The example also assumes the following
   conditions:





Farinacci, et al.         Expires July 30, 2018                [Page 10]
=0C
Internet-Draft                    LISP                      January 2018


   o  Source host "host1.abc.example.com" is sending a packet to
      "host2.xyz.example.com", exactly what host1 would do if the site
      was not using LISP.

   o  Each site is multihomed, so each Tunnel Router has an address
      (RLOC) assigned from the service provider address block for each
      provider to which that particular Tunnel Router is attached.

   o  The ITR(s) and ETR(s) are directly connected to the source and
      destination, respectively, but the source and destination can be
      located anywhere in the LISP site.

   o  A Map-Request is sent for an external destination when the
      destination is not found in the forwarding table or matches a
      default route.  Map-Requests are sent to the mapping database
      system by using the LISP control-plane protocol documented in
      [I-D.ietf-lisp-rfc6833bis].

   o  Map-Replies are sent on the underlying routing system topology
      using the [I-D.ietf-lisp-rfc6833bis] control-plane protocol.

   Client host1.abc.example.com wants to communicate with server
   host2.xyz.example.com:

   1.  host1.abc.example.com wants to open a TCP connection to
       host2.xyz.example.com.  It does a DNS lookup on
       host2.xyz.example.com.  An A/AAAA record is returned.  This
       address is the destination EID.  The locally assigned address of
       host1.abc.example.com is used as the source EID.  An IPv4 or IPv6
       packet is built and forwarded through the LISP site as a normal
       IP packet until it reaches a LISP ITR.

   2.  The LISP ITR must be able to map the destination EID to an RLOC
       of one of the ETRs at the destination site.  The specific method
       used to do this is not described in this example.  See
       [I-D.ietf-lisp-rfc6833bis] for further information.

   3.  The ITR sends a LISP Map-Request as specified in
       [I-D.ietf-lisp-rfc6833bis].  Map-Requests SHOULD be rate-limited.

   4.  The mapping system helps forwarding the Map-Request to the
       corresponding ETR.  When the Map-Request arrives at one of the
       ETRs at the destination site, it will process the packet as a
       control message.

   5.  The ETR looks at the destination EID of the Map-Request and
       matches it against the prefixes in the ETR's configured EID-to-
       RLOC mapping database.  This is the list of EID-Prefixes the ETR



Farinacci, et al.         Expires July 30, 2018                [Page 11]
=0C
Internet-Draft                    LISP                      January 2018


       is supporting for the site it resides in.  If there is no match,
       the Map-Request is dropped.  Otherwise, a LISP Map-Reply is
       returned to the ITR.

   6.  The ITR receives the Map-Reply message, parses the message (to
       check for format validity), and stores the mapping information
       from the packet.  This information is stored in the ITR's EID-to-
       RLOC map-cache.  Note that the map-cache is an on-demand cache.
       An ITR will manage its map-cache in such a way that optimizes for
       its resource constraints.

   7.  Subsequent packets from host1.abc.example.com to
       host2.xyz.example.com will have a LISP header prepended by the
       ITR using the appropriate RLOC as the LISP header destination
       address learned from the ETR.  Note that the packet MAY be sent
       to a different ETR than the one that returned the Map-Reply due
       to the source site's hashing policy or the destination site's
       Locator-Set policy.

   8.  The ETR receives these packets directly (since the destination
       address is one of its assigned IP addresses), checks the validity
       of the addresses, strips the LISP header, and forwards packets to
       the attached destination host.

   9.  In order to defer the need for a mapping lookup in the reverse
       direction, an ETR can OPTIONALLY create a cache entry that maps
       the source EID (inner-header source IP address) to the source
       RLOC (outer-header source IP address) in a received LISP packet.
       Such a cache entry is termed a "glean mapping" and only contains
       a single RLOC for the EID in question.  More complete information
       about additional RLOCs SHOULD be verified by sending a LISP Map-
       Request for that EID.  Both the ITR and the ETR MAY also
       influence the decision the other makes in selecting an RLOC.

5.  LISP Encapsulation Details

   Since additional tunnel headers are prepended, the packet becomes
   larger and can exceed the MTU of any link traversed from the ITR to
   the ETR.  It is RECOMMENDED in IPv4 that packets do not get
   fragmented as they are encapsulated by the ITR.  Instead, the packet
   is dropped and an ICMP Unreachable/Fragmentation-Needed message is
   returned to the source.

   In the case when fragmentation is needed, this specification
   RECOMMENDS that implementations provide support for one of the
   proposed fragmentation and reassembly schemes.  Two existing schemes
   are detailed in Section 7.




Farinacci, et al.         Expires July 30, 2018                [Page 12]
=0C
Internet-Draft                    LISP                      January 2018


   Since IPv4 or IPv6 addresses can be either EIDs or RLOCs, the LISP
   architecture supports IPv4 EIDs with IPv6 RLOCs (where the inner
   header is in IPv4 packet format and the outer header is in IPv6
   packet format) or IPv6 EIDs with IPv4 RLOCs (where the inner header
   is in IPv6 packet format and the outer header is in IPv4 packet
   format).  The next sub-sections illustrate packet formats for the
   homogeneous case (IPv4-in-IPv4 and IPv6-in-IPv6), but all 4
   combinations MUST be supported.  Additional types of EIDs are defined
   in [RFC8060].

5.1.  LISP IPv4-in-IPv4 Header Format

        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
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|  IHL  |    DSCP   |ECN|          Total Length         |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Identification        |Flags|      Fragment Offset    |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   OH  |  Time to Live | Protocol =3D 17 |         Header Checksum       =
|
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |                    Source Routing Locator                     |
    \  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |                 Destination Routing Locator                   |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |       Source Port =3D xxxx      |       Dest Port =3D 4341      =
  |
   UDP +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |           UDP Length          |        UDP Checksum           |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
   I \ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   S / |                 Instance ID/Locator-Status-Bits               |
   P   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|  IHL  |    DSCP   |ECN|          Total Length         |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Identification        |Flags|      Fragment Offset    |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   IH  |  Time to Live |    Protocol   |         Header Checksum       |
   |   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |                           Source EID                          |
    \  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |                         Destination EID                       |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

       IHL =3D IP-Header-Length






Farinacci, et al.         Expires July 30, 2018                [Page 13]
=0C
Internet-Draft                    LISP                      January 2018


5.2.  LISP IPv6-in-IPv6 Header Format

        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
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|    DSCP   |ECN|           Flow Label                  |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   |         Payload Length        | Next Header=3D17|   Hop Limit   =
|
   v   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
       |                                                               |
   O   +                                                               +
   u   |                                                               |
   t   +                     Source Routing Locator                    +
   e   |                                                               |
   r   +                                                               +
       |                                                               |
   H   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   d   |                                                               |
   r   +                                                               +
       |                                                               |
   ^   +                  Destination Routing Locator                  +
   |   |                                                               |
    \  +                                                               +
     \ |                                                               |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |       Source Port =3D xxxx      |       Dest Port =3D 4341      =
  |
   UDP +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     \ |           UDP Length          |        UDP Checksum           |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   L   |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
   I \ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   S / |                 Instance ID/Locator-Status-Bits               |
   P   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
     / |Version|    DSCP   |ECN|           Flow Label                  |
    /  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   /   |         Payload Length        |  Next Header  |   Hop Limit   |
   v   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
       |                                                               |
   I   +                                                               +
   n   |                                                               |
   n   +                          Source EID                           +
   e   |                                                               |
   r   +                                                               +
       |                                                               |
   H   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   d   |                                                               |
   r   +                                                               +
       |                                                               |



Farinacci, et al.         Expires July 30, 2018                [Page 14]
=0C
Internet-Draft                    LISP                      January 2018


   ^   +                        Destination EID                        +
   \   |                                                               |
    \  +                                                               +
     \ |                                                               |
       +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

5.3.  Tunnel Header Field Descriptions

   Inner Header           (IH):  The inner header is the header on the
      datagram received from the originating host [RFC0791] [RFC8200]
      [RFC2474].  The source and destination IP addresses are EIDs.

   Outer Header: (OH)  The outer header is a new header prepended by an
      ITR.  The address fields contain RLOCs obtained from the ingress
      router's EID-to-RLOC Cache.  The IP protocol number is "UDP (17)"
      from [RFC0768].  The setting of the Don't Fragment (DF) bit
      'Flags' field is according to rules listed in Sections 7.1 and
      7.2.

   UDP Header:  The UDP header contains an ITR selected source port when
      encapsulating a packet.  See Section 12 for details on the hash
      algorithm used to select a source port based on the 5-tuple of the
      inner header.  The destination port MUST be set to the well-known
      IANA-assigned port value 4341.

   UDP Checksum:  The 'UDP Checksum' field SHOULD be transmitted as zero
      by an ITR for either IPv4 [RFC0768] and IPv6 encapsulation
      [RFC6935] [RFC6936].  When a packet with a zero UDP checksum is
      received by an ETR, the ETR MUST accept the packet for
      decapsulation.  When an ITR transmits a non-zero value for the UDP
      checksum, it MUST send a correctly computed value in this field.
      When an ETR receives a packet with a non-zero UDP checksum, it MAY
      choose to verify the checksum value.  If it chooses to perform
      such verification, and the verification fails, the packet MUST be
      silently dropped.  If the ETR chooses not to perform the
      verification, or performs the verification successfully, the
      packet MUST be accepted for decapsulation.  The handling of UDP
      zero checksums over IPv6 for all tunneling protocols, including
      LISP, is subject to the applicability statement in [RFC6936].

   UDP Length:  The 'UDP Length' field is set for an IPv4-encapsulated
      packet to be the sum of the inner-header IPv4 Total Length plus
      the UDP and LISP header lengths.  For an IPv6-encapsulated packet,
      the 'UDP Length' field is the sum of the inner-header IPv6 Payload
      Length, the size of the IPv6 header (40 octets), and the size of
      the UDP and LISP headers.





Farinacci, et al.         Expires July 30, 2018                [Page 15]
=0C
Internet-Draft                    LISP                      January 2018


   N: The N-bit is the nonce-present bit.  When this bit is set to 1,
      the low-order 24 bits of the first 32 bits of the LISP header
      contain a Nonce.  See Section 10.1 for details.  Both N- and
      V-bits MUST NOT be set in the same packet.  If they are, a
      decapsulating ETR MUST treat the 'Nonce/Map-Version' field as
      having a Nonce value present.

   L: The L-bit is the 'Locator-Status-Bits' field enabled bit.  When
      this bit is set to 1, the Locator-Status-Bits in the second
      32 bits of the LISP header are in use.

     x 1 x x 0 x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                      Locator-Status-Bits                      |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   E: The E-bit is the echo-nonce-request bit.  This bit MUST be ignored
      and has no meaning when the N-bit is set to 0.  When the N-bit is
      set to 1 and this bit is set to 1, an ITR is requesting that the
      nonce value in the 'Nonce' field be echoed back in LISP-
      encapsulated packets when the ITR is also an ETR.  See
      Section 10.1 for details.

   V: The V-bit is the Map-Version present bit.  When this bit is set to
      1, the N-bit MUST be 0.  Refer to Section 13.3 for more details.
      This bit indicates that the LISP header is encoded in this
      case as:

     0 x 0 1 x x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|  Source Map-Version   |   Dest Map-Version    |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                 Instance ID/Locator-Status-Bits               |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   I: The I-bit is the Instance ID bit.  See Section 8 for more details.
      When this bit is set to 1, the 'Locator-Status-Bits' field is
      reduced to 8 bits and the high-order 24 bits are used as an
      Instance ID.  If the L-bit is set to 0, then the low-order 8 bits
      are transmitted as zero and ignored on receipt.  The format of the
      LISP header would look like this:








Farinacci, et al.         Expires July 30, 2018                [Page 16]
=0C
Internet-Draft                    LISP                      January 2018


     x x x x 1 x x x
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |N|L|E|V|I|R|K|K|            Nonce/Map-Version                  |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                 Instance ID                   |     LSBs      |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

   R: The R-bit is a Reserved bit for future use.  It MUST be set to 0
      on transmit and MUST be ignored on receipt.

   KK:  The KK-bits are a 2-bit field used when encapsulated packets are
      encrypted.  The field is set to 00 when the packet is not
      encrypted.  See [RFC8061] for further information.

   LISP Nonce:  The LISP 'Nonce' field is a 24-bit value that is
      randomly generated by an ITR when the N-bit is set to 1.  Nonce
      generation algorithms are an implementation matter but are
      required to generate different nonces when sending to different
      destinations.  However, the same nonce can be used for a period of
      time when encapsulating to the same ETR.  The nonce is also used
      when the E-bit is set to request the nonce value to be echoed by
      the other side when packets are returned.  When the E-bit is clear
      but the N-bit is set, a remote ITR is either echoing a previously
      requested echo-nonce or providing a random nonce.  See
      Section 10.1 for more details.

   LISP Locator-Status-Bits (LSBs):  When the L-bit is also set, the
      'Locator-Status-Bits' field in the LISP header is set by an ITR to
      indicate to an ETR the up/down status of the Locators in the
      source site.  Each RLOC in a Map-Reply is assigned an ordinal
      value from 0 to n-1 (when there are n RLOCs in a mapping entry).
      The Locator-Status-Bits are numbered from 0 to n-1 from the least
      significant bit of the field.  The field is 32 bits when the I-bit
      is set to 0 and is 8 bits when the I-bit is set to 1.  When a
      Locator-Status-Bit is set to 1, the ITR is indicating to the ETR
      that the RLOC associated with the bit ordinal has up status.  See
      Section 10 for details on how an ITR can determine the status of
      the ETRs at the same site.  When a site has multiple EID-Prefixes
      that result in multiple mappings (where each could have a
      different Locator-Set), the Locator-Status-Bits setting in an
      encapsulated packet MUST reflect the mapping for the EID-Prefix
      that the inner-header source EID address matches.  If the LSB for
      an anycast Locator is set to 1, then there is at least one RLOC
      with that address, and the ETR is considered 'up'.

   When doing ITR/PITR encapsulation:





Farinacci, et al.         Expires July 30, 2018                [Page 17]
=0C
Internet-Draft                    LISP                      January 2018


   o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in
      the case of IPv6) SHOULD be copied from the inner-header 'Time to
      Live' field.

   o  The outer-header 'Differentiated Services Code Point' (DSCP) field
      (or the 'Traffic Class' field, in the case of IPv6) SHOULD be
      copied from the inner-header DSCP field ('Traffic Class' field, in
      the case of IPv6) considering the exception listed below.

   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7
      of the IPv6 'Traffic Class' field) requires special treatment in
      order to avoid discarding indications of congestion [RFC3168].
      ITR encapsulation MUST copy the 2-bit 'ECN' field from the inner
      header to the outer header.  Re-encapsulation MUST copy the 2-bit
      'ECN' field from the stripped outer header to the new outer
      header.

   When doing ETR/PETR decapsulation:

   o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in
      the case of IPv6) SHOULD be copied from the outer-header 'Time to
      Live' field, when the Time to Live value of the outer header is
      less than the Time to Live value of the inner header.  Failing to
      perform this check can cause the Time to Live of the inner header
      to increment across encapsulation/decapsulation cycles.  This
      check is also performed when doing initial encapsulation, when a
      packet comes to an ITR or PITR destined for a LISP site.

   o  The inner-header 'Differentiated Services Code Point' (DSCP) field
      (or the 'Traffic Class' field, in the case of IPv6) SHOULD be
      copied from the outer-header DSCP field ('Traffic Class' field, in
      the case of IPv6) considering the exception listed below.

   o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7
      of the IPv6 'Traffic Class' field) requires special treatment in
      order to avoid discarding indications of congestion [RFC3168].  If
      the 'ECN' field contains a congestion indication codepoint (the
      value is '11', the Congestion Experienced (CE) codepoint), then
      ETR decapsulation MUST copy the 2-bit 'ECN' field from the
      stripped outer header to the surviving inner header that is used
      to forward the packet beyond the ETR.  These requirements preserve
      CE indications when a packet that uses ECN traverses a LISP tunnel
      and becomes marked with a CE indication due to congestion between
      the tunnel endpoints.

   Note that if an ETR/PETR is also an ITR/PITR and chooses to re-
   encapsulate after decapsulating, the net effect of this is that the




Farinacci, et al.         Expires July 30, 2018                [Page 18]
=0C
Internet-Draft                    LISP                      January 2018


   new outer header will carry the same Time to Live as the old outer
   header minus 1.

   Copying the Time to Live (TTL) serves two purposes: first, it
   preserves the distance the host intended the packet to travel;
   second, and more importantly, it provides for suppression of looping
   packets in the event there is a loop of concatenated tunnels due to
   misconfiguration.  See Section 18.3 for TTL exception handling for
   traceroute packets.

   The Explicit Congestion Notification ('ECN') field occupies bits 6
   and 7 of both the IPv4 'Type of Service' field and the IPv6 'Traffic
   Class' field [RFC3168].  The 'ECN' field requires special treatment
   in order to avoid discarding indications of congestion [RFC3168].  An
   ITR/PITR encapsulation MUST copy the 2-bit 'ECN' field from the inner
   header to the outer header.  Re-encapsulation MUST copy the 2-bit
   'ECN' field from the stripped outer header to the new outer header.
   If the 'ECN' field contains a congestion indication codepoint (the
   value is '11', the Congestion Experienced (CE) codepoint), then ETR/
   PETR decapsulation MUST copy the 2-bit 'ECN' field from the stripped
   outer header to the surviving inner header that is used to forward
   the packet beyond the ETR.  These requirements preserve CE
   indications when a packet that uses ECN traverses a LISP tunnel and
   becomes marked with a CE indication due to congestion between the
   tunnel endpoints.

6.  LISP EID-to-RLOC Map-Cache

   ITRs and PITRs maintain an on-demand cache, referred as LISP EID-to-
   RLOC Map-Cache, that contains mappings from EID-prefixes to locator
   sets.  The cache is used to encapsulate packets from the EID space to
   the corresponding RLOC network attachment point.

   When an ITR/PITR receives a packet from inside of the LISP site to
   destinations outside of the site a longest-prefix match lookup of the
   EID is done to the map-cache.

   When the lookup succeeds, the Locator-Set retrieved from the map-
   cache is used to send the packet to the EID's topological location.

   If the lookup fails, the ITR/PITR needs to retrieve the mapping using
   the LISP control-plane protocol [I-D.ietf-lisp-rfc6833bis].  The
   mapping is then stored in the local map-cache to forward subsequent
   packets addressed to the same EID-prefix.

   The map-cache is a local cache of mappings, entries are expired based
   on the associated Time to live.  In addition, entries can be updated
   with more current information, see Section 13 for further information



Farinacci, et al.         Expires July 30, 2018                [Page 19]
=0C
Internet-Draft                    LISP                      January 2018


   on this.  Finally, the map-cache also contains reachability
   information about EIDs and RLOCs, and uses LISP reachability
   information mechanisms to determine the reachability of RLOCs, see
   Section 10 for the specific mechanisms.

7.  Dealing with Large Encapsulated Packets

   This section proposes two mechanisms to deal with packets that exceed
   the path MTU between the ITR and ETR.

   It is left to the implementor to decide if the stateless or stateful
   mechanism SHOULD be implemented.  Both or neither can be used, since
   it is a local decision in the ITR regarding how to deal with MTU
   issues, and sites can interoperate with differing mechanisms.

   Both stateless and stateful mechanisms also apply to Re-encapsulating
   and Recursive Tunneling, so any actions below referring to an ITR
   also apply to a TE-ITR.

7.1.  A Stateless Solution to MTU Handling

   An ITR stateless solution to handle MTU issues is described as
   follows:

   1.  Define H to be the size, in octets, of the outer header an ITR
       prepends to a packet.  This includes the UDP and LISP header
       lengths.

   2.  Define L to be the size, in octets, of the maximum-sized packet
       an ITR can send to an ETR without the need for the ITR or any
       intermediate routers to fragment the packet.

   3.  Define an architectural constant S for the maximum size of a
       packet, in octets, an ITR MUST receive from the source so the
       effective MTU can be met.  That is, L =3D S + H.

   When an ITR receives a packet from a site-facing interface and adds H
   octets worth of encapsulation to yield a packet size greater than L
   octets (meaning the received packet size was greater than S octets
   from the source), it resolves the MTU issue by first splitting the
   original packet into 2 equal-sized fragments.  A LISP header is then
   prepended to each fragment.  The size of the encapsulated fragments
   is then (S/2 + H), which is less than the ITR's estimate of the path
   MTU between the ITR and its correspondent ETR.

   When an ETR receives encapsulated fragments, it treats them as two
   individually encapsulated packets.  It strips the LISP headers and
   then forwards each fragment to the destination host of the



Farinacci, et al.         Expires July 30, 2018                [Page 20]
=0C
Internet-Draft                    LISP                      January 2018


   destination site.  The two fragments are reassembled at the
   destination host into the single IP datagram that was originated by
   the source host.  Note that reassembly can happen at the ETR if the
   encapsulated packet was fragmented at or after the ITR.

   This behavior is performed by the ITR when the source host originates
   a packet with the 'DF' field of the IP header set to 0.  When the
   'DF' field of the IP header is set to 1, or the packet is an IPv6
   packet originated by the source host, the ITR will drop the packet
   when the size is greater than L and send an ICMP Unreachable/
   Fragmentation-Needed message to the source with a value of S, where S
   is (L - H).

   When the outer-header encapsulation uses an IPv4 header, an
   implementation SHOULD set the DF bit to 1 so ETR fragment reassembly
   can be avoided.  An implementation MAY set the DF bit in such headers
   to 0 if it has good reason to believe there are unresolvable path MTU
   issues between the sending ITR and the receiving ETR.

   This specification RECOMMENDS that L be defined as 1500.

7.2.  A Stateful Solution to MTU Handling

   An ITR stateful solution to handle MTU issues is described as follows
   and was first introduced in [OPENLISP]:

   1.  The ITR will keep state of the effective MTU for each Locator per
       Map-Cache entry.  The effective MTU is what the core network can
       deliver along the path between the ITR and ETR.

   2.  When an IPv6-encapsulated packet, or an IPv4-encapsulated packet
       with the DF bit set to 1, exceeds what the core network can
       deliver, one of the intermediate routers on the path will send an
       ICMP Unreachable/Fragmentation-Needed message to the ITR.  The
       ITR will parse the ICMP message to determine which Locator is
       affected by the effective MTU change and then record the new
       effective MTU value in the Map-Cache entry.

   3.  When a packet is received by the ITR from a source inside of the
       site and the size of the packet is greater than the effective MTU
       stored with the Map-Cache entry associated with the destination
       EID the packet is for, the ITR will send an ICMP Unreachable/
       Fragmentation-Needed message back to the source.  The packet size
       advertised by the ITR in the ICMP Unreachable/Fragmentation-
       Needed message is the effective MTU minus the LISP encapsulation
       length.





Farinacci, et al.         Expires July 30, 2018                [Page 21]
=0C
Internet-Draft                    LISP                      January 2018


   Even though this mechanism is stateful, it has advantages over the
   stateless IP fragmentation mechanism, by not involving the
   destination host with reassembly of ITR fragmented packets.

8.  Using Virtualization and Segmentation with LISP

   There are several cases where segregation is needed at the EID level.
   For instance, this is the case for deployments containing overlapping
   addresses, traffic isolation policies or multi-tenant virtualization.
   For these and other scenarios where segregation is needed, Instance
   IDs are used.

   An Instance ID can be carried in a LISP-encapsulated packet.  An ITR
   that prepends a LISP header will copy a 24-bit value used by the LISP
   router to uniquely identify the address space.  The value is copied
   to the 'Instance ID' field of the LISP header, and the I-bit is set
   to 1.

   When an ETR decapsulates a packet, the Instance ID from the LISP
   header is used as a table identifier to locate the forwarding table
   to use for the inner destination EID lookup.

   For example, an 802.1Q VLAN tag or VPN identifier could be used as a
   24-bit Instance ID.  See [I-D.ietf-lisp-vpn] for LISP VPN use-case
   details.

   The Instance ID that is stored in the mapping database when LISP-DDT
   [RFC8111] is used is 32 bits in length.  That means the control-plane
   can store more instances than a given data-plane can use.  Multiple
   data-planes can use the same 32-bit space as long as the low-order 24
   bits don't overlap among xTRs.

9.  Routing Locator Selection

   Both the client-side and server-side MAY need control over the
   selection of RLOCs for conversations between them.  This control is
   achieved by manipulating the 'Priority' and 'Weight' fields in EID-
   to-RLOC Map-Reply messages.  Alternatively, RLOC information MAY be
   gleaned from received tunneled packets or EID-to-RLOC Map-Request
   messages.

   The following are different scenarios for choosing RLOCs and the
   controls that are available:

   o  The server-side returns one RLOC.  The client-side can only use
      one RLOC.  The server-side has complete control of the selection.





Farinacci, et al.         Expires July 30, 2018                [Page 22]
=0C
Internet-Draft                    LISP                      January 2018


   o  The server-side returns a list of RLOCs where a subset of the list
      has the same best Priority.  The client can only use the subset
      list according to the weighting assigned by the server-side.  In
      this case, the server-side controls both the subset list and load-
      splitting across its members.  The client-side can use RLOCs
      outside of the subset list if it determines that the subset list
      is unreachable (unless RLOCs are set to a Priority of 255).  Some
      sharing of control exists: the server-side determines the
      destination RLOC list and load distribution while the client-side
      has the option of using alternatives to this list if RLOCs in the
      list are unreachable.

   o  The server-side sets a Weight of zero for the RLOC subset list.
      In this case, the client-side can choose how the traffic load is
      spread across the subset list.  Control is shared by the server-
      side determining the list and the client-side determining load
      distribution.  Again, the client can use alternative RLOCs if the
      server-provided list of RLOCs is unreachable.

   o  Either side (more likely the server-side ETR) decides not to send
      a Map-Request.  For example, if the server-side ETR does not send
      Map-Requests, it gleans RLOCs from the client-side ITR, giving the
      client-side ITR responsibility for bidirectional RLOC reachability
      and preferability.  Server-side ETR gleaning of the client-side
      ITR RLOC is done by caching the inner-header source EID and the
      outer-header source RLOC of received packets.  The client-side ITR
      controls how traffic is returned and can alternate using an outer-
      header source RLOC, which then can be added to the list the
      server-side ETR uses to return traffic.  Since no Priority or
      Weights are provided using this method, the server-side ETR MUST
      assume that each client-side ITR RLOC uses the same best Priority
      with a Weight of zero.  In addition, since EID-Prefix encoding
      cannot be conveyed in data packets, the EID-to-RLOC Cache on
      Tunnel Routers can grow to be very large.

   o  A "gleaned" Map-Cache entry, one learned from the source RLOC of a
      received encapsulated packet, is only stored and used for a few
      seconds, pending verification.  Verification is performed by
      sending a Map-Request to the source EID (the inner-header IP
      source address) of the received encapsulated packet.  A reply to
      this "verifying Map-Request" is used to fully populate the Map-
      Cache entry for the "gleaned" EID and is stored and used for the
      time indicated from the 'TTL' field of a received Map-Reply.  When
      a verified Map-Cache entry is stored, data gleaning no longer
      occurs for subsequent packets that have a source EID that matches
      the EID-Prefix of the verified entry.  This "gleaning" mechanism
      is OPTIONAL.




Farinacci, et al.         Expires July 30, 2018                [Page 23]
=0C
Internet-Draft                    LISP                      January 2018


   RLOCs that appear in EID-to-RLOC Map-Reply messages are assumed to be
   reachable when the R-bit for the Locator record is set to 1.  When
   the R-bit is set to 0, an ITR or PITR MUST NOT encapsulate to the
   RLOC.  Neither the information contained in a Map-Reply nor that
   stored in the mapping database system provides reachability
   information for RLOCs.  Note that reachability is not part of the
   mapping system and is determined using one or more of the Routing
   Locator reachability algorithms described in the next section.

10.  Routing Locator Reachability

   Several mechanisms for determining RLOC reachability are currently
   defined:

   1.  An ETR MAY examine the Locator-Status-Bits in the LISP header of
       an encapsulated data packet received from an ITR.  If the ETR is
       also acting as an ITR and has traffic to return to the original
       ITR site, it can use this status information to help select an
       RLOC.

   2.  An ITR MAY receive an ICMP Network Unreachable or Host
       Unreachable message for an RLOC it is using.  This indicates that
       the RLOC is likely down.  Note that trusting ICMP messages may
       not be desirable, but neither is ignoring them completely.
       Implementations are encouraged to follow current best practices
       in treating these conditions [I-D.ietf-opsec-icmp-filtering].

   3.  When an ITR participates in the routing protocol that operates in
       the underlay routing system, it can determine that an RLOC is
       down when no Routing Information Base (RIB) entry exists that
       matches the RLOC IP address.

   4.  An ITR MAY receive an ICMP Port Unreachable message from a
       destination host.  This occurs if an ITR attempts to use
       interworking [RFC6832] and LISP-encapsulated data is sent to a
       non-LISP-capable site.

   5.  An ITR MAY receive a Map-Reply from an ETR in response to a
       previously sent Map-Request.  The RLOC source of the Map-Reply is
       likely up, since the ETR was able to send the Map-Reply to the
       ITR.

   6.  When an ETR receives an encapsulated packet from an ITR, the
       source RLOC from the outer header of the packet is likely up.

   7.  An ITR/ETR pair can use the Locator reachability algorithms
       described in this section, namely Echo-Noncing or RLOC-Probing.




Farinacci, et al.         Expires July 30, 2018                [Page 24]
=0C
Internet-Draft                    LISP                      January 2018


   When determining Locator up/down reachability by examining the
   Locator-Status-Bits from the LISP-encapsulated data packet, an ETR
   will receive up-to-date status from an encapsulating ITR about
   reachability for all ETRs at the site.  CE-based ITRs at the source
   site can determine reachability relative to each other using the site
   IGP as follows:

   o  Under normal circumstances, each ITR will advertise a default
      route into the site IGP.

   o  If an ITR fails or if the upstream link to its PE fails, its
      default route will either time out or be withdrawn.

   Each ITR can thus observe the presence or lack of a default route
   originated by the others to determine the Locator-Status-Bits it sets
   for them.

   RLOCs listed in a Map-Reply are numbered with ordinals 0 to n-1.  The
   Locator-Status-Bits in a LISP-encapsulated packet are numbered from 0
   to n-1 starting with the least significant bit.  For example, if an
   RLOC listed in the 3rd position of the Map-Reply goes down (ordinal
   value 2), then all ITRs at the site will clear the 3rd least
   significant bit (xxxx x0xx) of the 'Locator-Status-Bits' field for
   the packets they encapsulate.

   When an ETR decapsulates a packet, it will check for any change in
   the 'Locator-Status-Bits' field.  When a bit goes from 1 to 0, the
   ETR, if acting also as an ITR, will refrain from encapsulating
   packets to an RLOC that is indicated as down.  It will only resume
   using that RLOC if the corresponding Locator-Status-Bit returns to a
   value of 1.  Locator-Status-Bits are associated with a Locator-Set
   per EID-Prefix.  Therefore, when a Locator becomes unreachable, the
   Locator-Status-Bit that corresponds to that Locator's position in the
   list returned by the last Map-Reply will be set to zero for that
   particular EID-Prefix.  Refer to Section 19 for security related
   issues regarding Locator-Status-Bits.

   When ITRs at the site are not deployed in CE routers, the IGP can
   still be used to determine the reachability of Locators, provided
   they are injected into the IGP.  This is typically done when a /32
   address is configured on a loopback interface.

   When ITRs receive ICMP Network Unreachable or Host Unreachable
   messages as a method to determine unreachability, they will refrain
   from using Locators that are described in Locator lists of Map-
   Replies.  However, using this approach is unreliable because many
   network operators turn off generation of ICMP Destination Unreachable
   messages.



Farinacci, et al.         Expires July 30, 2018                [Page 25]
=0C
Internet-Draft                    LISP                      January 2018


   If an ITR does receive an ICMP Network Unreachable or Host
   Unreachable message, it MAY originate its own ICMP Destination
   Unreachable message destined for the host that originated the data
   packet the ITR encapsulated.

   Also, BGP-enabled ITRs can unilaterally examine the RIB to see if a
   locator address from a Locator-Set in a mapping entry matches a
   prefix.  If it does not find one and BGP is running in the Default-
   Free Zone (DFZ), it can decide to not use the Locator even though the
   Locator-Status-Bits indicate that the Locator is up.  In this case,
   the path from the ITR to the ETR that is assigned the Locator is not
   available.  More details are in [I-D.meyer-loc-id-implications].

   Optionally, an ITR can send a Map-Request to a Locator, and if a Map-
   Reply is returned, reachability of the Locator has been determined.
   Obviously, sending such probes increases the number of control
   messages originated by Tunnel Routers for active flows, so Locators
   are assumed to be reachable when they are advertised.

   This assumption does create a dependency: Locator unreachability is
   detected by the receipt of ICMP Host Unreachable messages.  When a
   Locator has been determined to be unreachable, it is not used for
   active traffic; this is the same as if it were listed in a Map-Reply
   with Priority 255.

   The ITR can test the reachability of the unreachable Locator by
   sending periodic Requests.  Both Requests and Replies MUST be rate-
   limited.  Locator reachability testing is never done with data
   packets, since that increases the risk of packet loss for end-to-end
   sessions.

   When an ETR decapsulates a packet, it knows that it is reachable from
   the encapsulating ITR because that is how the packet arrived.  In
   most cases, the ETR can also reach the ITR but cannot assume this to
   be true, due to the possibility of path asymmetry.  In the presence
   of unidirectional traffic flow from an ITR to an ETR, the ITR SHOULD
   NOT use the lack of return traffic as an indication that the ETR is
   unreachable.  Instead, it MUST use an alternate mechanism to
   determine reachability.

10.1.  Echo Nonce Algorithm

   When data flows bidirectionally between Locators from different
   sites, a data-plane mechanism called "nonce echoing" can be used to
   determine reachability between an ITR and ETR.  When an ITR wants to
   solicit a nonce echo, it sets the N- and E-bits and places a 24-bit
   nonce [RFC4086] in the LISP header of the next encapsulated data
   packet.



Farinacci, et al.         Expires July 30, 2018                [Page 26]
=0C
Internet-Draft                    LISP                      January 2018


   When this packet is received by the ETR, the encapsulated packet is
   forwarded as normal.  When the ETR next sends a data packet to the
   ITR, it includes the nonce received earlier with the N-bit set and
   E-bit cleared.  The ITR sees this "echoed nonce" and knows that the
   path to and from the ETR is up.

   The ITR will set the E-bit and N-bit for every packet it sends while
   in the echo-nonce-request state.  The time the ITR waits to process
   the echoed nonce before it determines the path is unreachable is
   variable and is a choice left for the implementation.

   If the ITR is receiving packets from the ETR but does not see the
   nonce echoed while being in the echo-nonce-request state, then the
   path to the ETR is unreachable.  This decision MAY be overridden by
   other Locator reachability algorithms.  Once the ITR determines that
   the path to the ETR is down, it can switch to another Locator for
   that EID-Prefix.

   Note that "ITR" and "ETR" are relative terms here.  Both devices MUST
   be implementing both ITR and ETR functionality for the echo nonce
   mechanism to operate.

   The ITR and ETR MAY both go into the echo-nonce-request state at the
   same time.  The number of packets sent or the time during which echo
   nonce requests are sent is an implementation-specific setting.
   However, when an ITR is in the echo-nonce-request state, it can echo
   the ETR's nonce in the next set of packets that it encapsulates and
   subsequently continue sending echo-nonce-request packets.

   This mechanism does not completely solve the forward path
   reachability problem, as traffic may be unidirectional.  That is, the
   ETR receiving traffic at a site MAY not be the same device as an ITR
   that transmits traffic from that site, or the site-to-site traffic is
   unidirectional so there is no ITR returning traffic.

   The echo-nonce algorithm is bilateral.  That is, if one side sets the
   E-bit and the other side is not enabled for echo-noncing, then the
   echoing of the nonce does not occur and the requesting side may
   erroneously consider the Locator unreachable.  An ITR SHOULD only set
   the E-bit in an encapsulated data packet when it knows the ETR is
   enabled for echo-noncing.  This is conveyed by the E-bit in the RLOC-
   probe Map-Reply message.

   Note other Locator Reachability mechanisms can be used to compliment
   or even override the echo nonce algorithm.  See the next section for
   an example of control-plane probing.





Farinacci, et al.         Expires July 30, 2018                [Page 27]
=0C
Internet-Draft                    LISP                      January 2018


10.2.  RLOC-Probing Algorithm

   RLOC-Probing is a method that an ITR or PITR can use to determine the
   reachability status of one or more Locators that it has cached in a
   Map-Cache entry.  The probe-bit of the Map-Request and Map-Reply
   messages is used for RLOC-Probing.

   RLOC-Probing is done in the control plane on a timer basis, where an
   ITR or PITR will originate a Map-Request destined to a locator
   address from one of its own locator addresses.  A Map-Request used as
   an RLOC-probe is NOT encapsulated and NOT sent to a Map-Server or to
   the mapping database system as one would when soliciting mapping
   data.  The EID record encoded in the Map-Request is the EID-Prefix of
   the Map-Cache entry cached by the ITR or PITR.  The ITR MAY include a
   mapping data record for its own database mapping information that
   contains the local EID-Prefixes and RLOCs for its site.  RLOC-probes
   are sent periodically using a jittered timer interval.

   When an ETR receives a Map-Request message with the probe-bit set, it
   returns a Map-Reply with the probe-bit set.  The source address of
   the Map-Reply is set according to the procedure described in
   [I-D.ietf-lisp-rfc6833bis].  The Map-Reply SHOULD contain mapping
   data for the EID-Prefix contained in the Map-Request.  This provides
   the opportunity for the ITR or PITR that sent the RLOC-probe to get
   mapping updates if there were changes to the ETR's database mapping
   entries.

   There are advantages and disadvantages of RLOC-Probing.  The greatest
   benefit of RLOC-Probing is that it can handle many failure scenarios
   allowing the ITR to determine when the path to a specific Locator is
   reachable or has become unreachable, thus providing a robust
   mechanism for switching to using another Locator from the cached
   Locator.  RLOC-Probing can also provide rough Round-Trip Time (RTT)
   estimates between a pair of Locators, which can be useful for network
   management purposes as well as for selecting low delay paths.  The
   major disadvantage of RLOC-Probing is in the number of control
   messages required and the amount of bandwidth used to obtain those
   benefits, especially if the requirement for failure detection times
   is very small.

11.  EID Reachability within a LISP Site

   A site MAY be multihomed using two or more ETRs.  The hosts and
   infrastructure within a site will be addressed using one or more EID-
   Prefixes that are mapped to the RLOCs of the relevant ETRs in the
   mapping system.  One possible failure mode is for an ETR to lose
   reachability to one or more of the EID-Prefixes within its own site.
   When this occurs when the ETR sends Map-Replies, it can clear the



Farinacci, et al.         Expires July 30, 2018                [Page 28]
=0C
Internet-Draft                    LISP                      January 2018


   R-bit associated with its own Locator.  And when the ETR is also an
   ITR, it can clear its Locator-Status-Bit in the encapsulation data
   header.

   It is recognized that there are no simple solutions to the site
   partitioning problem because it is hard to know which part of the
   EID-Prefix range is partitioned and which Locators can reach any sub-
   ranges of the EID-Prefixes.  Note that this is not a new problem
   introduced by the LISP architecture.  The problem exists today when a
   multihomed site uses BGP to advertise its reachability upstream.

12.  Routing Locator Hashing

   When an ETR provides an EID-to-RLOC mapping in a Map-Reply message
   that is stored in the map-cache of a requesting ITR, the Locator-Set
   for the EID-Prefix MAY contain different Priority and Weight values
   for each locator address.  When more than one best Priority Locator
   exists, the ITR can decide how to load-share traffic against the
   corresponding Locators.

   The following hash algorithm MAY be used by an ITR to select a
   Locator for a packet destined to an EID for the EID-to-RLOC mapping:

   1.  Either a source and destination address hash or the traditional
       5-tuple hash can be used.  The traditional 5-tuple hash includes
       the source and destination addresses; source and destination TCP,
       UDP, or Stream Control Transmission Protocol (SCTP) port numbers;
       and the IP protocol number field or IPv6 next-protocol fields of
       a packet that a host originates from within a LISP site.  When a
       packet is not a TCP, UDP, or SCTP packet, the source and
       destination addresses only from the header are used to compute
       the hash.

   2.  Take the hash value and divide it by the number of Locators
       stored in the Locator-Set for the EID-to-RLOC mapping.

   3.  The remainder will yield a value of 0 to "number of Locators
       minus 1".  Use the remainder to select the Locator in the
       Locator-Set.

   Note that when a packet is LISP encapsulated, the source port number
   in the outer UDP header needs to be set.  Selecting a hashed value
   allows core routers that are attached to Link Aggregation Groups
   (LAGs) to load-split the encapsulated packets across member links of
   such LAGs.  Otherwise, core routers would see a single flow, since
   packets have a source address of the ITR, for packets that are
   originated by different EIDs at the source site.  A suggested setting




Farinacci, et al.         Expires July 30, 2018                [Page 29]
=0C
Internet-Draft                    LISP                      January 2018


   for the source port number computed by an ITR is a 5-tuple hash
   function on the inner header, as described above.

   Many core router implementations use a 5-tuple hash to decide how to
   balance packet load across members of a LAG.  The 5-tuple hash
   includes the source and destination addresses of the packet and the
   source and destination ports when the protocol number in the packet
   is TCP or UDP.  For this reason, UDP encoding is used for LISP
   encapsulation.

13.  Changing the Contents of EID-to-RLOC Mappings

   Since the LISP architecture uses a caching scheme to retrieve and
   store EID-to-RLOC mappings, the only way an ITR can get a more up-to-
   date mapping is to re-request the mapping.  However, the ITRs do not
   know when the mappings change, and the ETRs do not keep track of
   which ITRs requested its mappings.  For scalability reasons, it is
   desirable to maintain this approach but need to provide a way for
   ETRs to change their mappings and inform the sites that are currently
   communicating with the ETR site using such mappings.

   When adding a new Locator record in lexicographic order to the end of
   a Locator-Set, it is easy to update mappings.  We assume that new
   mappings will maintain the same Locator ordering as the old mapping
   but will just have new Locators appended to the end of the list.  So,
   some ITRs can have a new mapping while other ITRs have only an old
   mapping that is used until they time out.  When an ITR has only an
   old mapping but detects bits set in the Locator-Status-Bits that
   correspond to Locators beyond the list it has cached, it simply
   ignores them.  However, this can only happen for locator addresses
   that are lexicographically greater than the locator addresses in the
   existing Locator-Set.

   When a Locator record is inserted in the middle of a Locator-Set, to
   maintain lexicographic order, the SMR procedure in Section 13.2 is
   used to inform ITRs and PITRs of the new Locator-Status-Bit mappings.

   When a Locator record is removed from a Locator-Set, ITRs that have
   the mapping cached will not use the removed Locator because the xTRs
   will set the Locator-Status-Bit to 0.  So, even if the Locator is in
   the list, it will not be used.  For new mapping requests, the xTRs
   can set the Locator AFI to 0 (indicating an unspecified address), as
   well as setting the corresponding Locator-Status-Bit to 0.  This
   forces ITRs with old or new mappings to avoid using the removed
   Locator.

   If many changes occur to a mapping over a long period of time, one
   will find empty record slots in the middle of the Locator-Set and new



Farinacci, et al.         Expires July 30, 2018                [Page 30]
=0C
Internet-Draft                    LISP                      January 2018


   records appended to the Locator-Set. At some point, it would be
   useful to compact the Locator-Set so the Locator-Status-Bit settings
   can be efficiently packed.

   We propose here three approaches for Locator-Set compaction: one
   operational mechanism and two protocol mechanisms.  The operational
   approach uses a clock sweep method.  The protocol approaches use the
   concept of Solicit-Map-Requests and Map-Versioning.

13.1.  Clock Sweep

   The clock sweep approach uses planning in advance and the use of
   count-down TTLs to time out mappings that have already been cached.
   The default setting for an EID-to-RLOC mapping TTL is 24 hours.  So,
   there is a 24-hour window to time out old mappings.  The following
   clock sweep procedure is used:

   1.  24 hours before a mapping change is to take effect, a network
       administrator configures the ETRs at a site to start the clock
       sweep window.

   2.  During the clock sweep window, ETRs continue to send Map-Reply
       messages with the current (unchanged) mapping records.  The TTL
       for these mappings is set to 1 hour.

   3.  24 hours later, all previous cache entries will have timed out,
       and any active cache entries will time out within 1 hour.  During
       this 1-hour window, the ETRs continue to send Map-Reply messages
       with the current (unchanged) mapping records with the TTL set to
       1 minute.

   4.  At the end of the 1-hour window, the ETRs will send Map-Reply
       messages with the new (changed) mapping records.  So, any active
       caches can get the new mapping contents right away if not cached,
       or in 1 minute if they had the mapping cached.  The new mappings
       are cached with a TTL equal to the TTL in the Map-Reply.

13.2.  Solicit-Map-Request (SMR)

   Soliciting a Map-Request is a selective way for ETRs, at the site
   where mappings change, to control the rate they receive requests for
   Map-Reply messages.  SMRs are also used to tell remote ITRs to update
   the mappings they have cached.

   Since the ETRs don't keep track of remote ITRs that have cached their
   mappings, they do not know which ITRs need to have their mappings
   updated.  As a result, an ETR will solicit Map-Requests (called an
   SMR message) from those sites to which it has been sending



Farinacci, et al.         Expires July 30, 2018                [Page 31]
=0C
Internet-Draft                    LISP                      January 2018


   encapsulated data for the last minute.  In particular, an ETR will
   send an SMR to an ITR to which it has recently sent encapsulated
   data.  This can only occur when both ITR and ETR functionality reside
   in the same router.

   An SMR message is simply a bit set in a Map-Request message.  An ITR
   or PITR will send a Map-Request when they receive an SMR message.
   Both the SMR sender and the Map-Request responder MUST rate-limit
   these messages.  Rate-limiting can be implemented as a global rate-
   limiter or one rate-limiter per SMR destination.

   The following procedure shows how an SMR exchange occurs when a site
   is doing Locator-Set compaction for an EID-to-RLOC mapping:

   1.  When the database mappings in an ETR change, the ETRs at the site
       begin to send Map-Requests with the SMR bit set for each Locator
       in each Map-Cache entry the ETR caches.

   2.  A remote ITR that receives the SMR message will schedule sending
       a Map-Request message to the source locator address of the SMR
       message or to the mapping database system.  A newly allocated
       random nonce is selected, and the EID-Prefix used is the one
       copied from the SMR message.  If the source Locator is the only
       Locator in the cached Locator-Set, the remote ITR SHOULD send a
       Map-Request to the database mapping system just in case the
       single Locator has changed and may no longer be reachable to
       accept the Map-Request.

   3.  The remote ITR MUST rate-limit the Map-Request until it gets a
       Map-Reply while continuing to use the cached mapping.  When
       Map-Versioning as described in Section 13.3 is used, an SMR
       sender can detect if an ITR is using the most up-to-date database
       mapping.

   4.  The ETRs at the site with the changed mapping will reply to the
       Map-Request with a Map-Reply message that has a nonce from the
       SMR-invoked Map-Request.  The Map-Reply messages SHOULD be rate-
       limited.  This is important to avoid Map-Reply implosion.

   5.  The ETRs at the site with the changed mapping record the fact
       that the site that sent the Map-Request has received the new
       mapping data in the Map-Cache entry for the remote site so the
       Locator-Status-Bits are reflective of the new mapping for packets
       going to the remote site.  The ETR then stops sending SMR
       messages.

   For security reasons, an ITR MUST NOT process unsolicited Map-
   Replies.  To avoid Map-Cache entry corruption by a third party, a



Farinacci, et al.         Expires July 30, 2018                [Page 32]
=0C
Internet-Draft                    LISP                      January 2018


   sender of an SMR-based Map-Request MUST be verified.  If an ITR
   receives an SMR-based Map-Request and the source is not in the
   Locator-Set for the stored Map-Cache entry, then the responding Map-
   Request MUST be sent with an EID destination to the mapping database
   system.  Since the mapping database system is a more secure way to
   reach an authoritative ETR, it will deliver the Map-Request to the
   authoritative source of the mapping data.

   When an ITR receives an SMR-based Map-Request for which it does not
   have a cached mapping for the EID in the SMR message, it may not send
   an SMR-invoked Map-Request.  This scenario can occur when an ETR
   sends SMR messages to all Locators in the Locator-Set it has stored
   in its map-cache but the remote ITRs that receive the SMR may not be
   sending packets to the site.  There is no point in updating the ITRs
   until they need to send, in which case they will send Map-Requests to
   obtain a Map-Cache entry.

13.3.  Database Map-Versioning

   When there is unidirectional packet flow between an ITR and ETR, and
   the EID-to-RLOC mappings change on the ETR, it needs to inform the
   ITR so encapsulation to a removed Locator can stop and can instead be
   started to a new Locator in the Locator-Set.

   An ETR, when it sends Map-Reply messages, conveys its own Map-Version
   Number.  This is known as the Destination Map-Version Number.  ITRs
   include the Destination Map-Version Number in packets they
   encapsulate to the site.  When an ETR decapsulates a packet and
   detects that the Destination Map-Version Number is less than the
   current version for its mapping, the SMR procedure described in
   Section 13.2 occurs.

   An ITR, when it encapsulates packets to ETRs, can convey its own Map-
   Version Number.  This is known as the Source Map-Version Number.
   When an ETR decapsulates a packet and detects that the Source Map-
   Version Number is greater than the last Map-Version Number sent in a
   Map-Reply from the ITR's site, the ETR will send a Map-Request to one
   of the ETRs for the source site.

   A Map-Version Number is used as a sequence number per EID-Prefix, so
   values that are greater are considered to be more recent.  A value of
   0 for the Source Map-Version Number or the Destination Map-Version
   Number conveys no versioning information, and an ITR does no
   comparison with previously received Map-Version Numbers.

   A Map-Version Number can be included in Map-Register messages as
   well.  This is a good way for the Map-Server to assure that all ETRs




Farinacci, et al.         Expires July 30, 2018                [Page 33]
=0C
Internet-Draft                    LISP                      January 2018


   for a site registering to it will be synchronized according to Map-
   Version Number.

   See [RFC6834] for a more detailed analysis and description of
   Database Map-Versioning.

14.  Multicast Considerations

   A multicast group address, as defined in the original Internet
   architecture, is an identifier of a grouping of topologically
   independent receiver host locations.  The address encoding itself
   does not determine the location of the receiver(s).  The multicast
   routing protocol, and the network-based state the protocol creates,
   determine where the receivers are located.

   In the context of LISP, a multicast group address is both an EID and
   a Routing Locator.  Therefore, no specific semantic or action needs
   to be taken for a destination address, as it would appear in an IP
   header.  Therefore, a group address that appears in an inner IP
   header built by a source host will be used as the destination EID.
   The outer IP header (the destination Routing Locator address),
   prepended by a LISP router, can use the same group address as the
   destination Routing Locator, use a multicast or unicast Routing
   Locator obtained from a Mapping System lookup, or use other means to
   determine the group address mapping.

   With respect to the source Routing Locator address, the ITR prepends
   its own IP address as the source address of the outer IP header.
   Just like it would if the destination EID was a unicast address.
   This source Routing Locator address, like any other Routing Locator
   address, MUST be globally routable.

   There are two approaches for LISP-Multicast, one that uses native
   multicast routing in the underlay with no support from the Mapping
   System and the other that uses only unicast routing in the underlay
   with support from the Mapping System.  See [RFC6831] and
   [I-D.ietf-lisp-signal-free-multicast], respectively, for details.
   Details for LISP-Multicast and interworking with non-LISP sites are
   described in [RFC6831] and [RFC6832].

15.  Router Performance Considerations

   LISP is designed to be very "hardware-based forwarding friendly".  A
   few implementation techniques can be used to incrementally implement
   LISP:

   o  When a tunnel-encapsulated packet is received by an ETR, the outer
      destination address may not be the address of the router.  This



Farinacci, et al.         Expires July 30, 2018                [Page 34]
=0C
Internet-Draft                    LISP                      January 2018


      makes it challenging for the control plane to get packets from the
      hardware.  This may be mitigated by creating special Forwarding
      Information Base (FIB) entries for the EID-Prefixes of EIDs served
      by the ETR (those for which the router provides an RLOC
      translation).  These FIB entries are marked with a flag indicating
      that control-plane processing SHOULD be performed.  The forwarding
      logic of testing for particular IP protocol number values is not
      necessary.  There are a few proven cases where no changes to
      existing deployed hardware were needed to support the LISP data-
      plane.

   o  On an ITR, prepending a new IP header consists of adding more
      octets to a MAC rewrite string and prepending the string as part
      of the outgoing encapsulation procedure.  Routers that support
      Generic Routing Encapsulation (GRE) tunneling [RFC2784] or 6to4
      tunneling [RFC3056] may already support this action.

   o  A packet's source address or interface the packet was received on
      can be used to select VRF (Virtual Routing/Forwarding).  The VRF's
      routing table can be used to find EID-to-RLOC mappings.

   For performance issues related to map-cache management, see
   Section 19.

16.  Mobility Considerations

   There are several kinds of mobility, of which only some might be of
   concern to LISP.  Essentially, they are as follows.

16.1.  Slow Mobility

   A site wishes to change its attachment points to the Internet, and
   its LISP Tunnel Routers will have new RLOCs when it changes upstream
   providers.  Changes in EID-to-RLOC mappings for sites are expected to
   be handled by configuration, outside of LISP.

   An individual endpoint wishes to move but is not concerned about
   maintaining session continuity.  Renumbering is involved.  LISP can
   help with the issues surrounding renumbering [RFC4192] [LISA96] by
   decoupling the address space used by a site from the address spaces
   used by its ISPs [RFC4984].

16.2.  Fast Mobility

   Fast endpoint mobility occurs when an endpoint moves relatively
   rapidly, changing its IP-layer network attachment point.  Maintenance
   of session continuity is a goal.  This is where the Mobile IPv4
   [RFC5944] and Mobile IPv6 [RFC6275] [RFC4866] mechanisms are used and



Farinacci, et al.         Expires July 30, 2018                [Page 35]
=0C
Internet-Draft                    LISP                      January 2018


   primarily where interactions with LISP need to be explored, such as
   the mechanisms in [I-D.ietf-lisp-eid-mobility] when the EID moves but
   the RLOC is in the network infrastructure.

   In LISP, one possibility is to "glean" information.  When a packet
   arrives, the ETR could examine the EID-to-RLOC mapping and use that
   mapping for all outgoing traffic to that EID.  It can do this after
   performing a route-returnability check, to ensure that the new
   network location does have an internal route to that endpoint.
   However, this does not cover the case where an ITR (the node assigned
   the RLOC) at the mobile-node location has been compromised.

   Mobile IP packet exchange is designed for an environment in which all
   routing information is disseminated before packets can be forwarded.
   In order to allow the Internet to grow to support expected future
   use, we are moving to an environment where some information may have
   to be obtained after packets are in flight.  Modifications to IP
   mobility should be considered in order to optimize the behavior of
   the overall system.  Anything that decreases the number of new EID-
   to-RLOC mappings needed when a node moves, or maintains the validity
   of an EID-to-RLOC mapping for a longer time, is useful.

   In addition to endpoints, a network can be mobile, possibly changing
   xTRs.  A "network" can be as small as a single router and as large as
   a whole site.  This is different from site mobility in that it is
   fast and possibly short-lived, but different from endpoint mobility
   in that a whole prefix is changing RLOCs.  However, the mechanisms
   are the same, and there is no new overhead in LISP.  A map request
   for any endpoint will return a binding for the entire mobile prefix.

   If mobile networks become a more common occurrence, it may be useful
   to revisit the design of the mapping service and allow for dynamic
   updates of the database.

   The issue of interactions between mobility and LISP needs to be
   explored further.  Specific improvements to the entire system will
   depend on the details of mapping mechanisms.  Mapping mechanisms
   should be evaluated on how well they support session continuity for
   mobile nodes.  See [I-D.ietf-lisp-predictive-rlocs] for more recent
   mechanisms which can provide near-zero packet loss during handoffs.

16.3.  LISP Mobile Node Mobility

   A mobile device can use the LISP infrastructure to achieve mobility
   by implementing the LISP encapsulation and decapsulation functions
   and acting as a simple ITR/ETR.  By doing this, such a "LISP mobile
   node" can use topologically independent EID IP addresses that are not
   advertised into and do not impose a cost on the global routing



Farinacci, et al.         Expires July 30, 2018                [Page 36]
=0C
Internet-Draft                    LISP                      January 2018


   system.  These EIDs are maintained at the edges of the mapping system
   in LISP Map-Servers and Map-Resolvers) and are provided on demand to
   only the correspondents of the LISP mobile node.

   Refer to [I-D.ietf-lisp-mn] for more details for when the EID and
   RLOC are co-located in the roaming node.

17.  LISP xTR Placement and Encapsulation Methods

   This section will explore how and where ITRs and ETRs can be placed
   in the network and will discuss the pros and cons of each scenario.
   For a more detailed network design deployment recommendation, refer
   to [RFC7215].

   There are two basic deployment tradeoffs to consider: centralized
   versus distributed caches; and flat, Recursive, or Re-encapsulating
   Tunneling.  When deciding on centralized versus distributed caching,
   the following issues SHOULD be considered:

   o  Are the xTRs spread out so that the caches are spread across all
      the memories of each router?  A centralized cache is when an ITR
      keeps a cache for all the EIDs it is encapsulating to.  The packet
      takes a direct path to the destination Locator.  A distributed
      cache is when an ITR needs help from other Re-Encapsulating Tunnel
      Routers (RTRs) because it does not store all the cache entries for
      the EIDs it is encapsulating to.  So, the packet takes a path
      through RTRs that have a different set of cache entries.

   o  Should management "touch points" be minimized by only choosing a
      few xTRs, just enough for redundancy?

   o  In general, using more ITRs doesn't increase management load,
      since caches are built and stored dynamically.  On the other hand,
      using more ETRs does require more management, since EID-Prefix-to-
      RLOC mappings need to be explicitly configured.

   When deciding on flat, Recursive, or Re-Encapsulating Tunneling, the
   following issues SHOULD be considered:

   o  Flat tunneling implements a single encapsulation path between the
      source site and destination site.  This generally offers better
      paths between sources and destinations with a single encapsulation
      path.

   o  Recursive Tunneling is when encapsulated traffic is again further
      encapsulated in another tunnel, either to implement VPNs or to
      perform Traffic Engineering.  When doing VPN-based tunneling, the
      site has some control, since the site is prepending a new



Farinacci, et al.         Expires July 30, 2018                [Page 37]
=0C
Internet-Draft                    LISP                      January 2018


      encapsulation header.  In the case of TE-based tunneling, the site
      MAY have control if it is prepending a new tunnel header, but if
      the site's ISP is doing the TE, then the site has no control.
      Recursive Tunneling generally will result in suboptimal paths but
      with the benefit of steering traffic to parts of the network that
      have more resources available.

   o  The technique of Re-Encapsulation ensures that packets only
      require one encapsulation header.  So, if a packet needs to be re-
      routed, it is first decapsulated by the RTR and then Re-
      Encapsulated with a new encapsulation header using a new RLOC.

   The next sub-sections will examine where xTRs and RTRs can reside in
   the network.

17.1.  First-Hop/Last-Hop xTRs

   By locating xTRs close to hosts, the EID-Prefix set is at the
   granularity of an IP subnet.  So, at the expense of more EID-Prefix-
   to-RLOC sets for the site, the caches in each xTR can remain
   relatively small.  But caches always depend on the number of non-
   aggregated EID destination flows active through these xTRs.

   With more xTRs doing encapsulation, the increase in control traffic
   grows as well: since the EID granularity is greater, more Map-
   Requests and Map-Replies are traveling between more routers.

   The advantage of placing the caches and databases at these stub
   routers is that the products deployed in this part of the network
   have better price-memory ratios than their core router counterparts.
   Memory is typically less expensive in these devices, and fewer routes
   are stored (only IGP routes).  These devices tend to have excess
   capacity, both for forwarding and routing states.

   LISP functionality can also be deployed in edge switches.  These
   devices generally have layer-2 ports facing hosts and layer-3 ports
   facing the Internet.  Spare capacity is also often available in these
   devices.

17.2.  Border/Edge xTRs

   Using Customer Edge (CE) routers for xTR placement allows the EID
   space associated with a site to be reachable via a small set of RLOCs
   assigned to the CE-based xTRs for that site.

   This offers the opposite benefit of the first-hop/last-hop xTR
   scenario: the number of mapping entries and network management touch
   points is reduced, allowing better scaling.



Farinacci, et al.         Expires July 30, 2018                [Page 38]
=0C
Internet-Draft                    LISP                      January 2018


   One disadvantage is that fewer network resources are used to reach
   host endpoints, thereby centralizing the point-of-failure domain and
   creating network choke points at the CE xTR.

   Note that more than one CE xTR at a site can be configured with the
   same IP address.  In this case, an RLOC is an anycast address.  This
   allows resilience between the CE xTRs.  That is, if a CE xTR fails,
   traffic is automatically routed to the other xTRs using the same
   anycast address.  However, this comes with the disadvantage where the
   site cannot control the entrance point when the anycast route is
   advertised out from all border routers.  Another disadvantage of
   using anycast Locators is the limited advertisement scope of /32 (or
   /128 for IPv6) routes.

17.3.  ISP Provider Edge (PE) xTRs

   The use of ISP PE routers as xTRs is not the typical deployment
   scenario envisioned in this specification.  This section attempts to
   capture some of the reasoning behind this preference for implementing
   LISP on CE routers.

   The use of ISP PE routers for xTR placement gives an ISP, rather than
   a site, control over the location of the ETRs.  That is, the ISP can
   decide whether the xTRs are in the destination site (in either CE
   xTRs or last-hop xTRs within a site) or at other PE edges.  The
   advantage of this case is that two encapsulation headers can be
   avoided.  By having the PE be the first router on the path to
   encapsulate, it can choose a TE path first, and the ETR can
   decapsulate and Re-Encapsulate for a new encapsulation path to the
   destination end site.

   An obvious disadvantage is that the end site has no control over
   where its packets flow or over the RLOCs used.  Other disadvantages
   include difficulty in synchronizing path liveness updates between CE
   and PE routers.

   As mentioned in earlier sections, a combination of these scenarios is
   possible at the expense of extra packet header overhead; if both site
   and provider want control, then Recursive or Re-Encapsulating Tunnels
   are used.

17.4.  LISP Functionality with Conventional NATs

   LISP routers can be deployed behind Network Address Translator (NAT)
   devices to provide the same set of packet services hosts have today
   when they are addressed out of private address space.





Farinacci, et al.         Expires July 30, 2018                [Page 39]
=0C
Internet-Draft                    LISP                      January 2018


   It is important to note that a locator address in any LISP control
   message MUST be a routable address and therefore [RFC1918] addresses
   SHOULD only be presence when running in a local environment.  When a
   LISP xTR is configured with private RLOC addresses and resides behind
   a NAT device and desires to communicate on the Internet, the private
   addresses MUST be used only in the outer IP header so the NAT device
   can translate properly.  Otherwise, EID addresses MUST be translated
   before encapsulation is performed when LISP VPNs are not in use.
   Both NAT translation and LISP encapsulation functions could be co-
   located in the same device.

17.5.  Packets Egressing a LISP Site

   When a LISP site is using two ITRs for redundancy, the failure of one
   ITR will likely shift outbound traffic to the second.  This second
   ITR's cache MAY not be populated with the same EID-to-RLOC mapping
   entries as the first.  If this second ITR does not have these
   mappings, traffic will be dropped while the mappings are retrieved
   from the mapping system.  The retrieval of these messages may
   increase the load of requests being sent into the mapping system.

18.  Traceroute Considerations

   When a source host in a LISP site initiates a traceroute to a
   destination host in another LISP site, it is highly desirable for it
   to see the entire path.  Since packets are encapsulated from the ITR
   to the ETR, the hop across the tunnel could be viewed as a single
   hop.  However, LISP traceroute will provide the entire path so the
   user can see 3 distinct segments of the path from a source LISP host
   to a destination LISP host:

      Segment 1 (in source LISP site based on EIDs):

          source host ---> first hop ... next hop ---> ITR

      Segment 2 (in the core network based on RLOCs):

          ITR ---> next hop ... next hop ---> ETR

      Segment 3 (in the destination LISP site based on EIDs):

          ETR ---> next hop ... last hop ---> destination host

   For segment 1 of the path, ICMP Time Exceeded messages are returned
   in the normal manner as they are today.  The ITR performs a TTL
   decrement and tests for 0 before encapsulating.  Therefore, the ITR's
   hop is seen by the traceroute source as having an EID address (the
   address of the site-facing interface).



Farinacci, et al.         Expires July 30, 2018                [Page 40]
=0C
Internet-Draft                    LISP                      January 2018


   For segment 2 of the path, ICMP Time Exceeded messages are returned
   to the ITR because the TTL decrement to 0 is done on the outer
   header, so the destinations of the ICMP messages are the ITR RLOC
   address and the source RLOC address of the encapsulated traceroute
   packet.  The ITR looks inside of the ICMP payload to inspect the
   traceroute source so it can return the ICMP message to the address of
   the traceroute client and also retain the core router IP address in
   the ICMP message.  This is so the traceroute client can display the
   core router address (the RLOC address) in the traceroute output.  The
   ETR returns its RLOC address and responds to the TTL decrement to 0,
   as the previous core routers did.

   For segment 3, the next-hop router downstream from the ETR will be
   decrementing the TTL for the packet that was encapsulated, sent into
   the core, decapsulated by the ETR, and forwarded because it isn't the
   final destination.  If the TTL is decremented to 0, any router on the
   path to the destination of the traceroute, including the next-hop
   router or destination, will send an ICMP Time Exceeded message to the
   source EID of the traceroute client.  The ICMP message will be
   encapsulated by the local ITR and sent back to the ETR in the
   originated traceroute source site, where the packet will be delivered
   to the host.

18.1.  IPv6 Traceroute

   IPv6 traceroute follows the procedure described above, since the
   entire traceroute data packet is included in the ICMP Time Exceeded
   message payload.  Therefore, only the ITR needs to pay special
   attention to forwarding ICMP messages back to the traceroute source.

18.2.  IPv4 Traceroute

   For IPv4 traceroute, we cannot follow the above procedure, since IPv4
   ICMP Time Exceeded messages only include the invoking IP header and
   8 octets that follow the IP header.  Therefore, when a core router
   sends an IPv4 Time Exceeded message to an ITR, all the ITR has in the
   ICMP payload is the encapsulated header it prepended, followed by a
   UDP header.  The original invoking IP header, and therefore the
   identity of the traceroute source, is lost.

   The solution we propose to solve this problem is to cache traceroute
   IPv4 headers in the ITR and to match them up with corresponding IPv4
   Time Exceeded messages received from core routers and the ETR.  The
   ITR will use a circular buffer for caching the IPv4 and UDP headers
   of traceroute packets.  It will select a 16-bit number as a key to
   find them later when the IPv4 Time Exceeded messages are received.
   When an ITR encapsulates an IPv4 traceroute packet, it will use the
   16-bit number as the UDP source port in the encapsulating header.



Farinacci, et al.         Expires July 30, 2018                [Page 41]
=0C
Internet-Draft                    LISP                      January 2018


   When the ICMP Time Exceeded message is returned to the ITR, the UDP
   header of the encapsulating header is present in the ICMP payload,
   thereby allowing the ITR to find the cached headers for the
   traceroute source.  The ITR puts the cached headers in the payload
   and sends the ICMP Time Exceeded message to the traceroute source
   retaining the source address of the original ICMP Time Exceeded
   message (a core router or the ETR of the site of the traceroute
   destination).

   The signature of a traceroute packet comes in two forms.  The first
   form is encoded as a UDP message where the destination port is
   inspected for a range of values.  The second form is encoded as an
   ICMP message where the IP identification field is inspected for a
   well-known value.

18.3.  Traceroute Using Mixed Locators

   When either an IPv4 traceroute or IPv6 traceroute is originated and
   the ITR encapsulates it in the other address family header, one
   cannot get all 3 segments of the traceroute.  Segment 2 of the
   traceroute cannot be conveyed to the traceroute source, since it is
   expecting addresses from intermediate hops in the same address format
   for the type of traceroute it originated.  Therefore, in this case,
   segment 2 will make the tunnel look like one hop.  All the ITR has to
   do to make this work is to not copy the inner TTL to the outer,
   encapsulating header's TTL when a traceroute packet is encapsulated
   using an RLOC from a different address family.  This will cause no
   TTL decrement to 0 to occur in core routers between the ITR and ETR.

19.  Security Considerations

   Security considerations for LISP are discussed in [RFC7833].

   A complete LISP threat analysis can be found in [RFC7835], in what
   follows we provide a summary.

   The optional mechanisms of gleaning is offered to directly obtain a
   mapping from the LISP encapsulated packets.  Specifically, an xTR can
   learn the EID-to-RLOC mapping by inspecting the source RLOC and
   source EID of an encapsulated packet, and insert this new mapping
   into its map-cache.  An off-path attacker can spoof the source EID
   address to divert the traffic sent to the victim's spoofed EID.  If
   the attacker spoofs the source RLOC, it can mount a DoS attack by
   redirecting traffic to the spoofed victim's RLOC, potentially
   overloading it.

   The LISP Data-Plane defines several mechanisms to monitor RLOC data-
   plane reachability, in this context Locator-Status Bits, Nonce-



Farinacci, et al.         Expires July 30, 2018                [Page 42]
=0C
Internet-Draft                    LISP                      January 2018


   Present and Echo-Nonce bits of the LISP encapsulation header can be
   manipulated by an attacker to mount a DoS attack.  An off-path
   attacker able to spoof the RLOC of a victim's xTR can manipulate such
   mechanisms to declare a set of RLOCs unreachable.  This can be used
   also, for instance, to declare only one RLOC reachable with the aim
   of overload it.

   Map-Versioning is a data-plane mechanism used to signal a peering xTR
   that a local EID-to-RLOC mapping has been updated, so that the
   peering xTR uses LISP Control-Plane signaling message to retrieve a
   fresh mapping.  This can be used by an attacker to forge the map-
   versioning field of a LISP encapsulated header and force an excessive
   amount of signaling between xTRs that may overload them.

   Most of the attack vectors can be mitigated with careful deployment
   and configuration, information learned opportunistically (such as LSB
   or gleaning) SHOULD be verified with other reachability mechanisms.
   In addition, systematic rate-limitation and filtering is an effective
   technique to mitigate attacks that aim to overload the control-plane.

20.  Network Management Considerations

   Considerations for network management tools exist so the LISP
   protocol suite can be operationally managed.  These mechanisms can be
   found in [RFC7052] and [RFC6835].

21.  IANA Considerations

   This section provides guidance to the Internet Assigned Numbers
   Authority (IANA) regarding registration of values related to this
   data-plane LISP specification, in accordance with BCP 26 [RFC8126].

21.1.  LISP UDP Port Numbers

   The IANA registry has allocated UDP port number 4341 for the LISP
   data-plane.  IANA has updated the description for UDP port 4341 as
   follows:

       lisp-data      4341 udp    LISP Data Packets

22.  References

22.1.  Normative References








Farinacci, et al.         Expires July 30, 2018                [Page 43]
=0C
Internet-Draft                    LISP                      January 2018


   [I-D.ietf-lisp-rfc6833bis]
              Fuller, V., Farinacci, D., and A. Cabellos-Aparicio,
              "Locator/ID Separation Protocol (LISP) Control-Plane",
              draft-ietf-lisp-rfc6833bis-07 (work in progress), December
              2017.

   [RFC0768]  Postel, J., "User Datagram Protocol", STD 6, RFC 768,
              DOI 10.17487/RFC0768, August 1980,
              <https://www.rfc-editor.org/info/rfc768>.

   [RFC0791]  Postel, J., "Internet Protocol", STD 5, RFC 791,
              DOI 10.17487/RFC0791, September 1981,
              <https://www.rfc-editor.org/info/rfc791>.

   [RFC1918]  Rekhter, Y., Moskowitz, B., Karrenberg, D., de Groot, G.,
              and E. Lear, "Address Allocation for Private Internets",
              BCP 5, RFC 1918, DOI 10.17487/RFC1918, February 1996,
              <https://www.rfc-editor.org/info/rfc1918>.

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/info/rfc2119>.

   [RFC2474]  Nichols, K., Blake, S., Baker, F., and D. Black,
              "Definition of the Differentiated Services Field (DS
              Field) in the IPv4 and IPv6 Headers", RFC 2474,
              DOI 10.17487/RFC2474, December 1998,
              <https://www.rfc-editor.org/info/rfc2474>.

   [RFC3168]  Ramakrishnan, K., Floyd, S., and D. Black, "The Addition
              of Explicit Congestion Notification (ECN) to IP",
              RFC 3168, DOI 10.17487/RFC3168, September 2001,
              <https://www.rfc-editor.org/info/rfc3168>.

   [RFC4086]  Eastlake 3rd, D., Schiller, J., and S. Crocker,
              "Randomness Requirements for Security", BCP 106, RFC 4086,
              DOI 10.17487/RFC4086, June 2005,
              <https://www.rfc-editor.org/info/rfc4086>.

   [RFC4632]  Fuller, V. and T. Li, "Classless Inter-domain Routing
              (CIDR): The Internet Address Assignment and Aggregation
              Plan", BCP 122, RFC 4632, DOI 10.17487/RFC4632, August
              2006, <https://www.rfc-editor.org/info/rfc4632>.

   [RFC5944]  Perkins, C., Ed., "IP Mobility Support for IPv4, Revised",
              RFC 5944, DOI 10.17487/RFC5944, November 2010,
              <https://www.rfc-editor.org/info/rfc5944>.



Farinacci, et al.         Expires July 30, 2018                [Page 44]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC6275]  Perkins, C., Ed., Johnson, D., and J. Arkko, "Mobility
              Support in IPv6", RFC 6275, DOI 10.17487/RFC6275, July
              2011, <https://www.rfc-editor.org/info/rfc6275>.

   [RFC7833]  Howlett, J., Hartman, S., and A. Perez-Mendez, Ed., "A
              RADIUS Attribute, Binding, Profiles, Name Identifier
              Format, and Confirmation Methods for the Security
              Assertion Markup Language (SAML)", RFC 7833,
              DOI 10.17487/RFC7833, May 2016,
              <https://www.rfc-editor.org/info/rfc7833>.

   [RFC8126]  Cotton, M., Leiba, B., and T. Narten, "Guidelines for
              Writing an IANA Considerations Section in RFCs", BCP 26,
              RFC 8126, DOI 10.17487/RFC8126, June 2017,
              <https://www.rfc-editor.org/info/rfc8126>.

   [RFC8200]  Deering, S. and R. Hinden, "Internet Protocol, Version 6
              (IPv6) Specification", STD 86, RFC 8200,
              DOI 10.17487/RFC8200, July 2017,
              <https://www.rfc-editor.org/info/rfc8200>.

22.2.  Informative References

   [AFN]      IANA, "Address Family Numbers", August 2016,
              <http://www.iana.org/assignments/address-family-numbers>.

   [CHIAPPA]  Chiappa, J., "Endpoints and Endpoint names: A Proposed",
              1999,
              <http://mercury.lcs.mit.edu/~jnc/tech/endpoints.txt>.

   [I-D.ietf-lisp-eid-mobility]
              Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,
              F., and D. Farinacci, "LISP L2/L3 EID Mobility Using a
              Unified Control Plane", draft-ietf-lisp-eid-mobility-01
              (work in progress), November 2017.

   [I-D.ietf-lisp-introduction]
              Cabellos-Aparicio, A. and D. Saucez, "An Architectural
              Introduction to the Locator/ID Separation Protocol
              (LISP)", draft-ietf-lisp-introduction-13 (work in
              progress), April 2015.

   [I-D.ietf-lisp-mn]
              Farinacci, D., Lewis, D., Meyer, D., and C. White, "LISP
              Mobile Node", draft-ietf-lisp-mn-01 (work in progress),
              October 2017.





Farinacci, et al.         Expires July 30, 2018                [Page 45]
=0C
Internet-Draft                    LISP                      January 2018


   [I-D.ietf-lisp-predictive-rlocs]
              Farinacci, D. and P. Pillay-Esnault, "LISP Predictive
              RLOCs", draft-ietf-lisp-predictive-rlocs-01 (work in
              progress), November 2017.

   [I-D.ietf-lisp-sec]
              Maino, F., Ermagan, V., Cabellos-Aparicio, A., and D.
              Saucez, "LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-14
              (work in progress), October 2017.

   [I-D.ietf-lisp-signal-free-multicast]
              Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",
              draft-ietf-lisp-signal-free-multicast-07 (work in
              progress), November 2017.

   [I-D.ietf-lisp-vpn]
              Moreno, V. and D. Farinacci, "LISP Virtual Private
              Networks (VPNs)", draft-ietf-lisp-vpn-01 (work in
              progress), November 2017.

   [I-D.ietf-opsec-icmp-filtering]
              Gont, F., Gont, G., and C. Pignataro, "Recommendations for
              filtering ICMP messages", draft-ietf-opsec-icmp-
              filtering-04 (work in progress), July 2013.

   [I-D.meyer-loc-id-implications]
              Meyer, D. and D. Lewis, "Architectural Implications of
              Locator/ID Separation", draft-meyer-loc-id-implications-01
              (work in progress), January 2009.

   [LISA96]   Lear, E., Tharp, D., Katinsky, J., and J. Coffin,
              "Renumbering: Threat or Menace?", Usenix Tenth System
              Administration Conference (LISA 96), October 1996.

   [OPENLISP]
              Iannone, L., Saucez, D., and O. Bonaventure, "OpenLISP
              Implementation Report", Work in Progress, July 2008.

   [RFC1034]  Mockapetris, P., "Domain names - concepts and facilities",
              STD 13, RFC 1034, DOI 10.17487/RFC1034, November 1987,
              <https://www.rfc-editor.org/info/rfc1034>.

   [RFC2784]  Farinacci, D., Li, T., Hanks, S., Meyer, D., and P.
              Traina, "Generic Routing Encapsulation (GRE)", RFC 2784,
              DOI 10.17487/RFC2784, March 2000,
              <https://www.rfc-editor.org/info/rfc2784>.





Farinacci, et al.         Expires July 30, 2018                [Page 46]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC3056]  Carpenter, B. and K. Moore, "Connection of IPv6 Domains
              via IPv4 Clouds", RFC 3056, DOI 10.17487/RFC3056, February
              2001, <https://www.rfc-editor.org/info/rfc3056>.

   [RFC3232]  Reynolds, J., Ed., "Assigned Numbers: RFC 1700 is Replaced
              by an On-line Database", RFC 3232, DOI 10.17487/RFC3232,
              January 2002, <https://www.rfc-editor.org/info/rfc3232>.

   [RFC3261]  Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston,
              A., Peterson, J., Sparks, R., Handley, M., and E.
              Schooler, "SIP: Session Initiation Protocol", RFC 3261,
              DOI 10.17487/RFC3261, June 2002,
              <https://www.rfc-editor.org/info/rfc3261>.

   [RFC4192]  Baker, F., Lear, E., and R. Droms, "Procedures for
              Renumbering an IPv6 Network without a Flag Day", RFC 4192,
              DOI 10.17487/RFC4192, September 2005,
              <https://www.rfc-editor.org/info/rfc4192>.

   [RFC4866]  Arkko, J., Vogt, C., and W. Haddad, "Enhanced Route
              Optimization for Mobile IPv6", RFC 4866,
              DOI 10.17487/RFC4866, May 2007,
              <https://www.rfc-editor.org/info/rfc4866>.

   [RFC4984]  Meyer, D., Ed., Zhang, L., Ed., and K. Fall, Ed., "Report
              from the IAB Workshop on Routing and Addressing",
              RFC 4984, DOI 10.17487/RFC4984, September 2007,
              <https://www.rfc-editor.org/info/rfc4984>.

   [RFC6831]  Farinacci, D., Meyer, D., Zwiebel, J., and S. Venaas, "The
              Locator/ID Separation Protocol (LISP) for Multicast
              Environments", RFC 6831, DOI 10.17487/RFC6831, January
              2013, <https://www.rfc-editor.org/info/rfc6831>.

   [RFC6832]  Lewis, D., Meyer, D., Farinacci, D., and V. Fuller,
              "Interworking between Locator/ID Separation Protocol
              (LISP) and Non-LISP Sites", RFC 6832,
              DOI 10.17487/RFC6832, January 2013,
              <https://www.rfc-editor.org/info/rfc6832>.

   [RFC6834]  Iannone, L., Saucez, D., and O. Bonaventure, "Locator/ID
              Separation Protocol (LISP) Map-Versioning", RFC 6834,
              DOI 10.17487/RFC6834, January 2013,
              <https://www.rfc-editor.org/info/rfc6834>.







Farinacci, et al.         Expires July 30, 2018                [Page 47]
=0C
Internet-Draft                    LISP                      January 2018


   [RFC6835]  Farinacci, D. and D. Meyer, "The Locator/ID Separation
              Protocol Internet Groper (LIG)", RFC 6835,
              DOI 10.17487/RFC6835, January 2013,
              <https://www.rfc-editor.org/info/rfc6835>.

   [RFC6935]  Eubanks, M., Chimento, P., and M. Westerlund, "IPv6 and
              UDP Checksums for Tunneled Packets", RFC 6935,
              DOI 10.17487/RFC6935, April 2013,
              <https://www.rfc-editor.org/info/rfc6935>.

   [RFC6936]  Fairhurst, G. and M. Westerlund, "Applicability Statement
              for the Use of IPv6 UDP Datagrams with Zero Checksums",
              RFC 6936, DOI 10.17487/RFC6936, April 2013,
              <https://www.rfc-editor.org/info/rfc6936>.

   [RFC7052]  Schudel, G., Jain, A., and V. Moreno, "Locator/ID
              Separation Protocol (LISP) MIB", RFC 7052,
              DOI 10.17487/RFC7052, October 2013,
              <https://www.rfc-editor.org/info/rfc7052>.

   [RFC7215]  Jakab, L., Cabellos-Aparicio, A., Coras, F., Domingo-
              Pascual, J., and D. Lewis, "Locator/Identifier Separation
              Protocol (LISP) Network Element Deployment
              Considerations", RFC 7215, DOI 10.17487/RFC7215, April
              2014, <https://www.rfc-editor.org/info/rfc7215>.

   [RFC7835]  Saucez, D., Iannone, L., and O. Bonaventure, "Locator/ID
              Separation Protocol (LISP) Threat Analysis", RFC 7835,
              DOI 10.17487/RFC7835, April 2016,
              <https://www.rfc-editor.org/info/rfc7835>.

   [RFC8060]  Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical
              Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,
              February 2017, <https://www.rfc-editor.org/info/rfc8060>.

   [RFC8061]  Farinacci, D. and B. Weis, "Locator/ID Separation Protocol
              (LISP) Data-Plane Confidentiality", RFC 8061,
              DOI 10.17487/RFC8061, February 2017,
              <https://www.rfc-editor.org/info/rfc8061>.

   [RFC8111]  Fuller, V., Lewis, D., Ermagan, V., Jain, A., and A.
              Smirnov, "Locator/ID Separation Protocol Delegated
              Database Tree (LISP-DDT)", RFC 8111, DOI 10.17487/RFC8111,
              May 2017, <https://www.rfc-editor.org/info/rfc8111>.







Farinacci, et al.         Expires July 30, 2018                [Page 48]
=0C
Internet-Draft                    LISP                      January 2018


Appendix A.  Acknowledgments

   An initial thank you goes to Dave Oran for planting the seeds for the
   initial ideas for LISP.  His consultation continues to provide value
   to the LISP authors.

   A special and appreciative thank you goes to Noel Chiappa for
   providing architectural impetus over the past decades on separation
   of location and identity, as well as detailed reviews of the LISP
   architecture and documents, coupled with enthusiasm for making LISP a
   practical and incremental transition for the Internet.

   The authors would like to gratefully acknowledge many people who have
   contributed discussions and ideas to the making of this proposal.
   They include Scott Brim, Andrew Partan, John Zwiebel, Jason Schiller,
   Lixia Zhang, Dorian Kim, Peter Schoenmaker, Vijay Gill, Geoff Huston,
   David Conrad, Mark Handley, Ron Bonica, Ted Seely, Mark Townsley,
   Chris Morrow, Brian Weis, Dave McGrew, Peter Lothberg, Dave Thaler,
   Eliot Lear, Shane Amante, Ved Kafle, Olivier Bonaventure, Luigi
   Iannone, Robin Whittle, Brian Carpenter, Joel Halpern, Terry
   Manderson, Roger Jorgensen, Ran Atkinson, Stig Venaas, Iljitsch van
   Beijnum, Roland Bless, Dana Blair, Bill Lynch, Marc Woolward, Damien
   Saucez, Damian Lezama, Attilla De Groot, Parantap Lahiri, David
   Black, Roque Gagliano, Isidor Kouvelas, Jesper Skriver, Fred Templin,
   Margaret Wasserman, Sam Hartman, Michael Hofling, Pedro Marques, Jari
   Arkko, Gregg Schudel, Srinivas Subramanian, Amit Jain, Xu Xiaohu,
   Dhirendra Trivedi, Yakov Rekhter, John Scudder, John Drake, Dimitri
   Papadimitriou, Ross Callon, Selina Heimlich, Job Snijders, Vina
   Ermagan, Fabio Maino, Victor Moreno, Chris White, Clarence Filsfils,
   Alia Atlas, Florin Coras and Alberto Rodriguez.

   This work originated in the Routing Research Group (RRG) of the IRTF.
   An individual submission was converted into the IETF LISP working
   group document that became this RFC.

   The LISP working group would like to give a special thanks to Jari
   Arkko, the Internet Area AD at the time that the set of LISP
   documents were being prepared for IESG last call, and for his
   meticulous reviews and detailed commentaries on the 7 working group
   last call documents progressing toward standards-track RFCs.

Appendix B.  Document Change Log

   [RFC Editor: Please delete this section on publication as RFC.]







Farinacci, et al.         Expires July 30, 2018                [Page 49]
=0C
Internet-Draft                    LISP                      January 2018


B.1.  Changes to draft-ietf-lisp-rfc6830bis-09

   o  Posted January 2018.

   o  Add more details in section 5.3 about DSCP processing during
      encapsulation and decapsulation.

   o  Added clarity to definitions in the Definition of Terms section
      from various commenters.

   o  Removed PA and PI definitions from Definition of Terms section.

   o  More editorial changes.

   o  Removed 4342 from IANA section and move to RFC6833 IANA section.

B.2.  Changes to draft-ietf-lisp-rfc6830bis-08

   o  Posted January 2018.

   o  Remove references to research work for any protocol mechanisms.

   o  Document scanned to make sure it is RFC 2119 compliant.

   o  Made changes to reflect comments from document WG shepherd Luigi
      Iannone.

   o  Ran IDNITs on the document.

B.3.  Changes to draft-ietf-lisp-rfc6830bis-07

   o  Posted November 2017.

   o  Rephrase how Instance-IDs are used and don't refer to [RFC1918]
      addresses.

B.4.  Changes to draft-ietf-lisp-rfc6830bis-06

   o  Posted October 2017.

   o  Put RTR definition before it is used.

   o  Rename references that are now working group drafts.

   o  Remove "EIDs MUST NOT be used as used by a host to refer to other
      hosts.  Note that EID blocks MAY LISP RLOCs".

   o  Indicate what address-family can appear in data packets.



Farinacci, et al.         Expires July 30, 2018                [Page 50]
=0C
Internet-Draft                    LISP                      January 2018


   o  ETRs may, rather than will, be the ones to send Map-Replies.

   o  Recommend, rather than mandate, max encapsulation headers to 2.

   o  Reference VPN draft when introducing Instance-ID.

   o  Indicate that SMRs can be sent when ITR/ETR are in the same node.

   o  Clarify when private addreses can be used.

B.5.  Changes to draft-ietf-lisp-rfc6830bis-05

   o  Posted August 2017.

   o  Make it clear that a Reencapsulating Tunnel Router is an RTR.

B.6.  Changes to draft-ietf-lisp-rfc6830bis-04

   o  Posted July 2017.

   o  Changed reference of IPv6 RFC2460 to RFC8200.

   o  Indicate that the applicability statement for UDP zero checksums
      over IPv6 adheres to RFC6936.

B.7.  Changes to draft-ietf-lisp-rfc6830bis-03

   o  Posted May 2017.

   o  Move the control-plane related codepoints in the IANA
      Considerations section to RFC6833bis.

B.8.  Changes to draft-ietf-lisp-rfc6830bis-02

   o  Posted April 2017.

   o  Reflect some editorial comments from Damien Sausez.

B.9.  Changes to draft-ietf-lisp-rfc6830bis-01

   o  Posted March 2017.

   o  Include references to new RFCs published.

   o  Change references from RFC6833 to RFC6833bis.

   o  Clarified LCAF text in the IANA section.




Farinacci, et al.         Expires July 30, 2018                [Page 51]
=0C
Internet-Draft                    LISP                      January 2018


   o  Remove references to "experimental".

B.10.  Changes to draft-ietf-lisp-rfc6830bis-00

   o  Posted December 2016.

   o  Created working group document from draft-farinacci-lisp
      -rfc6830-00 individual submission.  No other changes made.

Authors' Addresses

   Dino Farinacci
   Cisco Systems
   Tasman Drive
   San Jose, CA  95134
   USA

   EMail: farinacci@gmail.com


   Vince Fuller
   Cisco Systems
   Tasman Drive
   San Jose, CA  95134
   USA

   EMail: vince.fuller@gmail.com


   Dave Meyer
   Cisco Systems
   170 Tasman Drive
   San Jose, CA
   USA

   EMail: dmm@1-4-5.net


   Darrel Lewis
   Cisco Systems
   170 Tasman Drive
   San Jose, CA
   USA

   EMail: darlewis@cisco.com






Farinacci, et al.         Expires July 30, 2018                [Page 52]
=0C
Internet-Draft                    LISP                      January 2018


   Albert Cabellos
   UPC/BarcelonaTech
   Campus Nord, C. Jordi Girona 1-3
   Barcelona, Catalunya
   Spain

   EMail: acabello@ac.upc.edu












































Farinacci, et al.         Expires July 30, 2018                [Page 53]

--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56
Content-Transfer-Encoding: 7bit
Content-Type: text/plain;
	charset=us-ascii










--Apple-Mail=_C7FC98C2-EDDC-4BAA-A565-E59514828F56--


From nobody Sun Jan 28 17:57:07 2018
Return-Path: <albert.cabellos@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 3BF9C1314DD for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 17:57:06 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.999
X-Spam-Level: 
X-Spam-Status: No, score=-1.999 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id dfj3OIcgLbfK for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 17:57:03 -0800 (PST)
Received: from mail-yb0-x22f.google.com (mail-yb0-x22f.google.com [IPv6:2607:f8b0:4002:c09::22f]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 23D921314B7 for <lisp@ietf.org>; Sun, 28 Jan 2018 17:57:03 -0800 (PST)
Received: by mail-yb0-x22f.google.com with SMTP id 65so2205929ybz.6 for <lisp@ietf.org>; Sun, 28 Jan 2018 17:57:03 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=tfb/AIBdxUPKWztRNUQGzZKRgd4lYIH7hKBcv/2u7hs=; b=NBNXlE1bHlrZ7XVmZ4gQFIzkdTIeBmVFsHjDV3bnxKQCU8rFBhXzeL+CXHA/kWquNS 6tDVHl5rzy1SvIawvQFhk6qsSXy8laBe0UvjkRHe+zl336uVqXVZB/2uAwiJP0+f1tLh /5VDRXCyrM8mIQn9lHGuf3wGfSRKKOPIQ614Ow55saCD/sxbRs1mrPr5xBYK11IUMIaF ZqznyXDYj9CcBDU0O2r0XwWo82/BcaDE0giwalPMIna+WIuv2dxrpIvL1ara4Csl2aQT I5bCa1XnIq5StkYIStVFvO9K1cTzEH0sqw0Y1XqzgiiLrgIG2LPhQf2VoEpHojZrazE/ SODg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=tfb/AIBdxUPKWztRNUQGzZKRgd4lYIH7hKBcv/2u7hs=; b=Guc8DJ4TYwvluryDJyQ+RRESiu2KhPijY7VQtfdgREh088yQHjGeMEnRgNdj9JF0DO gbi/f2o78bI12KIFxqmamXjYj1qXA9R2v1AB1L+04kfUj8tiuyDO+wps/jTaoA84LyZx K92JvHQM3h4TTcjr1i6BM82DjWHWjpn4+s3AXhRdqpsPgFg/iL3YoEqnPmdvZlh+FIzp AdfvmUBdvtCZkPAXCXeddHuQzCOV8QtF6IeMdx9wpNhe7pcVc99UVprybqWVdH1cVQtG IhKJLvkJTq0YX75zqZrUejXma8A7lfrvZ2WIl3nTUC6yt7mwqk9YNzYK8AMLGhCcEufl XjnA==
X-Gm-Message-State: AKwxytftGUAZ9zYIGI8M6gSPlJYs5gbBR9E2FzL/n4IuiwGos9Zq6jyP LYjiglKYsWg+SO0V20HTc3Q4Y8rOf5aBShmNcUk=
X-Google-Smtp-Source: AH8x225ME9K1i05FvfS4gloA8PK0uVr5SLT/5lCIknBDnuF9qmSoAKP4A0QYH+D6CLHci+5jYU4/TVeTds6HRetJqMY=
X-Received: by 10.37.104.72 with SMTP id d69mr8176809ybc.281.1517191022186; Sun, 28 Jan 2018 17:57:02 -0800 (PST)
MIME-Version: 1.0
Received: by 10.37.16.69 with HTTP; Sun, 28 Jan 2018 17:57:01 -0800 (PST)
In-Reply-To: <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com> <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com>
From: Albert Cabellos <albert.cabellos@gmail.com>
Date: Mon, 29 Jan 2018 02:57:01 +0100
Message-ID: <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
Cc: Padma Pillay-Esnault <padma.ietf@gmail.com>, Albert Cabellos <acabello@ac.upc.edu>,  Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Type: multipart/alternative; boundary="f403045c059aef17df0563e08f6b"
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/F-iUJbmbXKe4PLD2A8VpqwrVudY>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 01:57:06 -0000

--f403045c059aef17df0563e08f6b
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi all

Thanks for all the comments, from my understanding of this thread the
following list of items *seem* to have rough consensus (all except B -
change definitions for EID and RLOC).

Joel, Luigi->How should we proceed now?

Albert

---

A.- Remove definitions of PA and PI

C.- In section 5.3, change the description of the encap/decap operation
concerning how to deal with ECN and DSCP bits to (new text needs to be
validated by experts):

When doing ITR/PITR encapsulation:


o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the case
of IPv6) SHOULD be copied from the inner-header 'Time to Live' field.


o  The outer-header 'Differentiated Services Code Point' (DSCP) field (or
the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
inner-header DSCP field ('Traffic Class' field, in the case of IPv6)
considering the exception listed below.


o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the
IPv6 'Traffic Class' field) requires special treatment in order to avoid
discarding indications of congestion [RFC3168]. ITR encapsulation MUST copy
the 2-bit 'ECN' field from the inner header to the outer header.
Re-encapsulation MUST copy the 2-bit 'ECN' field from the stripped outer
header to the new outer header.


When doing ETR/PETR decapsulation:


 o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in the
case of IPv6) SHOULD be copied from the outer-header 'Time to Live' field,
when the Time to Live value of the outer header is less than the Time to
Live value of the inner header.  Failing to perform this check can cause
the Time to Live of the inner header to increment across
encapsulation/decapsulation cycles.  This check is also performed when
doing initial encapsulation, when a packet comes to an ITR or PITR destined
for a LISP site.


o  The inner-header 'Differentiated Services Code Point' (DSCP) field (or
the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the
outer-header DSCP field ('Traffic Class' field, in the case of IPv6)
considering the exception listed below.


o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the
IPv6 'Traffic Class' field) requires special treatment in order to avoid
discarding indications of congestion [RFC3168]. If the 'ECN' field contains
a congestion indication codepoint (the value is '11', the Congestion
Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit
'ECN' field from the stripped outer header to the surviving inner header
that is used to forward the packet beyond the ETR.  These requirements
preserve CE indications when a packet that uses ECN traverses a LISP tunnel
and becomes marked with a CE indication due to congestion between the
tunnel endpoints.


Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate
after decapsulating, the net effect of this is that the new outer header
will carry the same Time to Live as the old outer header minus 1.


Copying the Time to Live (TTL) serves two purposes: first, it preserves the
distance the host intended the packet to travel; second, and more
importantly, it provides for suppression of looping packets in the event
there is a loop of concatenated tunnels due to misconfiguration.  See
Section 18.3 for TTL exception handling for traceroute packets.


D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stating tha=
t the data-plane
MUST follow what=C2=B4s stored in the map-cache (priorities and weights), t=
he
remaining text should go to an OAM document.

E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D consider=
ing the
following changes:

*    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) and
Echo-Nonce
*    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3
(hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a
response) and RLOC probing

F.- Move Solicit-Map-Request to 6833bis

G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
Considerations), 18 (Traceroute Consideration) to a new OAM document


On Fri, Jan 26, 2018 at 8:20 PM, Dino Farinacci <farinacci@gmail.com> wrote=
:

> Thanks for the detail review Padma. A new update to -09 is enclosed with =
a
> diff file. I will wait until next week to post.
>
> I have reflected all of your comments and most of Luigi=E2=80=99s comment=
s. The
> only issues open are:
>
> (1) Section movement from RFC6830 to RFC6833.
>
> (2) If an OAM document is needed.
>
> Waiting for more working group concensus on this.
>
> > Dear Dino and Albert
> >
> > The doc reads well.
> > Please find thereafter some comments on the version- 09 you posted on
> the list
> >
> > Page 4
> > "Client-side:  Client-side is a term used in this document to indicate =
a
> connection initiation attempt by an EID."
> > PPE 1: Strictly speaking the EID is just an identifier and does not
> initiate anything. Suggest something like this.
> >
> > "Client-side:  Client-side is a term used in this document to indicate =
a
> connection initiation attempt by the end system (represented by an EID)=
=E2=80=9D
>
> Fixed. Put in your suggestion.
>
> > Page 6
> > The source EID is obtained via existing mechanisms used to set a host's
> "local" IP address.  An EID used on the public Internet must have the sam=
e
> properties as any other IP address used in that manner; this means, among
> other things, that it must be globally unique.
> >
> > PPE 2: Shouldn't these two be MUST rather than must? Suggestion below
> >
> > The source EID is obtained via existing mechanisms used to set a host's
> "local" IP address.  An EID used on the public Internet MUST have the sam=
e
> properties as any other IP address used in that manner; this means, among
> other things, that it MUST be globally unique.
>
> Changed.
>
> > Page 8
> > An EID maps to one or more RLOCs.
> > PPE 3: Seems to contradict earlier explanation on negative mapping entr=
y
> where it is possible that an EID has NO RLOC.
>
> I changed to =E2=80=9Czero or more RLOCs.=E2=80=9D.
>
> > Page 8
> > When using multiple mapping database systems, care must be taken to not
> create re-encapsulation loops through misconfiguration.
> >
> > PPE 4: Suggest to add "re-encapsulation" in the list in Security
> Considerations section as this is an exploit possibility.
>
> I have removed the sentence. Because it actually is not true. If you use
> different mapping systems and circuitious forwarding occurs. The packet
> travels only until its TTL reaches 0. Using the rules for copy inner to
> outer and outer to inner during RTR re-encapsulation applies.
>
> > Page 13
> > "gleaned" mapping
> >
> > PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the definition=
 section.
>
> Changed.
>
> > Page 17
> > "The KK-bits are a 2-bit field used when encapsualted packets are
> encrypted."
> >
> > PPE 6: Nit - Typo "encapsualted" -> =E2=80=9Cencapsulated"
>
> Fixed.
>
> >
> > Page 20
> > "When the lookup succeeds, the locator-set  retrieved from the map-cach=
e
> is used to send the packet to the EID's topological location."
> >
> > PPE 7: Nit - Suggest capitalize L and S of "locator-set" for consistenc=
y
> with rest of document.
>
> Thanks. Done.
>
> >
> > Page 23
> > "The server-side sets a Weight of 0..."
> > PPE 8: Nit - For consistency in text change to "Weight of zero=E2=80=9D=
.
>
> Changed.
>
> > Page 23
> > "Control is shared by the server- side determining the list and the
> client determining load  distribution."
> >
> > PPE 9: Suggest use of "Client-side"
> >
> > "Control is shared by the server- side determining the list and the
> client-side determining load distribution.=E2=80=9D
>
> Done.
>
> > Page 24
> > When a verified Map-Cache entry is stored, data gleaning no longer
> occurs for subsequent packets that have a source EID that matches
> > the EID-Prefix of the verified entry.[PE1]   This "gleaning" mechanism
> is OPTIONAL.
> >
> > PPE 10: In section 16.2 later gleaning is used as a solution.  Changes
> in the gleaned info could be an interesting way to update the cache fast
> =E2=80=A6however this text make it sound that this is not an option after=
 first
> packet.
>
> It is an option when the ETR has no mapping to return packets. Once a
> mapping is cache, there is no point to glean since the mapping system
> verified the information the same as in the map-cache.
>
> >
> > Page 25
> > "Note that trusting ICMP messages may  not be desirable, but neither is
> ignoring them completely. Implementations are encouraged to follow curren=
t
> best practices in treating these conditions."
> >
> > PPE 11: A reference would be useful if possible.
>
> Added draft-ietf-opsec-icmp-filtering.
>
> > Page 25
> > "An ITR that participates in the global routing system can determine
> that an RLOC is down if no BGP Routing Information Base (RIB) route exist=
s
> that matches the RLOC IP address."
> >
> > PPE 12: Isn't this true for any protocol entry not just a BGP entry? We
> are really trying to determine if there is no route whatever the protocol=
.
>
> Yes, we can generalize this. I changed text.
>
> > Page 38
> > "For a more detailed networkd design deployment recommendation, refer t=
o
> [RFC7215]."
> >
> > PPE 13: Nit typo "netword"-> =E2=80=9Cnetwork"
>
> Changed.
>
> > Page 40
> > "By having the PE be the first router on the path to encapsulate, it ca=
n
> choose a TE path first, and the ETR can decapsulate and Re-Encapsulate fo=
r
> a new encapsuluation path to the destination end site."
> >
> > PPE 14: Nit Typo "encapsuluation" -> =E2=80=9Cencapsulation"
>
> Changed.
>
> > Page 43
> > "If the attacker spoofs the source RLOC, it can mount a DoS attack by
> redirecting traffic to the spoofed victim;s RLOC, potentially overloading
> it."
> >
>
> > PPE 15: Nit  typo "victim;s" -> =E2=80=9Cvictim=E2=80=99s=E2=80=9D
>
> Changed.
>
> Dino
>
>
>
>
>
>
>
>
>
>
>
>
>

--f403045c059aef17df0563e08f6b
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi all<div><br></div><div>Thanks for all the comments, fro=
m my understanding of this thread the following list of items *seem* to hav=
e rough consensus (all except B - change definitions for EID and RLOC).</di=
v><div><br></div><div>Joel, Luigi-&gt;How should we proceed now?</div><div>=
<br></div><div>Albert</div><div><br></div><div>---</div><div><br></div><blo=
ckquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div>A.- Remove=
 definitions of PA and PI</div><div><br></div><div>C.- In section 5.3, chan=
ge the description of the encap/decap operation concerning how to deal with=
 ECN and DSCP bits to (new text needs to be validated by experts):</div><di=
v><br></div><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"=
><div><div>When doing ITR/PITR encapsulation:</div></div></blockquote><bloc=
kquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br></=
div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;p=
adding:0px"><div><div>o=C2=A0 The outer-header &#39;Time to Live&#39; field=
 (or &#39;Hop Limit&#39; field, in the case of IPv6) SHOULD be copied from =
the inner-header &#39;Time to Live&#39; field.</div></div></blockquote><blo=
ckquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br><=
/div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;=
padding:0px"><div><div>o=C2=A0 The outer-header &#39;Differentiated Service=
s Code Point&#39; (DSCP) field (or the &#39;Traffic Class&#39; field, in th=
e case of IPv6) SHOULD be copied from the inner-header DSCP field (&#39;Tra=
ffic Class&#39; field, in the case of IPv6) considering the exception liste=
d below.</div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;bor=
der:none;padding:0px"><div><div><br></div></div></blockquote><blockquote st=
yle=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div>o=C2=A0 The &#3=
9;Explicit Congestion Notification&#39; (ECN) field (bits 6 and 7 of the IP=
v6 &#39;Traffic Class&#39; field) requires special treatment in order to av=
oid discarding indications of congestion [RFC3168]. ITR encapsulation MUST =
copy the 2-bit &#39;ECN&#39; field from the inner header to the outer heade=
r. Re-encapsulation MUST copy the 2-bit &#39;ECN&#39; field from the stripp=
ed outer header to the new outer header.</div></div></blockquote><blockquot=
e style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br></div><=
/div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;paddin=
g:0px"><div><div>When doing ETR/PETR decapsulation:</div></div></blockquote=
><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div>=
<br></div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:=
none;padding:0px"><div><div>=C2=A0o=C2=A0 The inner-header &#39;Time to Liv=
e&#39; field (or &#39;Hop Limit&#39; field, in the case of IPv6) SHOULD be =
copied from the outer-header &#39;Time to Live&#39; field, when the Time to=
 Live value of the outer header is less than the Time to Live value of the =
inner header.=C2=A0 Failing to perform this check can cause the Time to Liv=
e of the inner header to increment across encapsulation/decapsulation cycle=
s.=C2=A0 This check is also performed when doing initial encapsulation, whe=
n a packet comes to an ITR or PITR destined for a LISP site.</div></div></b=
lockquote><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><=
div><div><br></div></div></blockquote><blockquote style=3D"margin:0 0 0 40p=
x;border:none;padding:0px"><div><div>o=C2=A0 The inner-header &#39;Differen=
tiated Services Code Point&#39; (DSCP) field (or the &#39;Traffic Class&#39=
; field, in the case of IPv6) SHOULD be copied from the outer-header DSCP f=
ield (&#39;Traffic Class&#39; field, in the case of IPv6) considering the e=
xception listed below.</div></div></blockquote><blockquote style=3D"margin:=
0 0 0 40px;border:none;padding:0px"><div><div><br></div></div></blockquote>=
<blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div>o=
=C2=A0 The &#39;Explicit Congestion Notification&#39; (ECN) field (bits 6 a=
nd 7 of the IPv6 &#39;Traffic Class&#39; field) requires special treatment =
in order to avoid discarding indications of congestion [RFC3168]. If the &#=
39;ECN&#39; field contains a congestion indication codepoint (the value is =
&#39;11&#39;, the Congestion Experienced (CE) codepoint), then ETR decapsul=
ation MUST copy the 2-bit &#39;ECN&#39; field from the stripped outer heade=
r to the surviving inner header that is used to forward the packet beyond t=
he ETR.=C2=A0 These requirements preserve CE indications when a packet that=
 uses ECN traverses a LISP tunnel and becomes marked with a CE indication d=
ue to congestion between the tunnel endpoints.</div></div></blockquote><blo=
ckquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br><=
/div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;=
padding:0px"><div><div>Note that if an ETR/PETR is also an ITR/PITR and cho=
oses to re-encapsulate after decapsulating, the net effect of this is that =
the new outer header will carry the same Time to Live as the old outer head=
er minus 1.</div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;=
border:none;padding:0px"><div><div><br></div></div></blockquote><blockquote=
 style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div>Copying the =
Time to Live (TTL) serves two purposes: first, it preserves the distance th=
e host intended the packet to travel; second, and more importantly, it prov=
ides for suppression of looping packets in the event there is a loop of con=
catenated tunnels due to misconfiguration.=C2=A0 See Section 18.3 for TTL e=
xception handling for traceroute packets.</div></div></blockquote><div><br>=
</div><div>D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 =
stating that the data-plane MUST follow what=C2=B4s stored in the map-cache=
 (priorities and weights), the remaining text should go to an OAM document.=
</div><div><br></div><div><div>E.- Rewrite Section =E2=80=9CRouting Locator=
 Reachability=E2=80=9D considering the following changes:</div></div><div><=
div><br></div></div><div><div>*=C2=A0 =C2=A0 Keep bullet point 1 (examine L=
SB), 6 (receiving a data-packet) and Echo-Nonce</div></div><div><div>*=C2=
=A0 =C2=A0 Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3=
 (hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a res=
ponse) and RLOC probing</div></div><div><br></div><div>F.- Move Solicit-Map=
-Request to 6833bis</div><div><div><br></div></div><div><div>G.- Move secti=
ons 16 (Mobility Considerations), 17 (xTR Placement Considerations), 18 (Tr=
aceroute Consideration) to a new OAM document</div></div></blockquote></div=
><div class=3D"gmail_extra"><br><div class=3D"gmail_quote">On Fri, Jan 26, =
2018 at 8:20 PM, Dino Farinacci <span dir=3D"ltr">&lt;<a href=3D"mailto:far=
inacci@gmail.com" target=3D"_blank">farinacci@gmail.com</a>&gt;</span> wrot=
e:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-l=
eft:1px #ccc solid;padding-left:1ex">Thanks for the detail review Padma. A =
new update to -09 is enclosed with a diff file. I will wait until next week=
 to post.<br>
<br>
I have reflected all of your comments and most of Luigi=E2=80=99s comments.=
 The only issues open are:<br>
<br>
(1) Section movement from RFC6830 to RFC6833.<br>
<br>
(2) If an OAM document is needed.<br>
<br>
Waiting for more working group concensus on this.<br>
<span class=3D""><br>
&gt; Dear Dino and Albert<br>
&gt;<br>
&gt; The doc reads well.<br>
&gt; Please find thereafter some comments on the version- 09 you posted on =
the list<br>
&gt;<br>
&gt; Page 4<br>
&gt; &quot;Client-side:=C2=A0 Client-side is a term used in this document t=
o indicate a connection initiation attempt by an EID.&quot;<br>
&gt; PPE 1: Strictly speaking the EID is just an identifier and does not in=
itiate anything. Suggest something like this.<br>
&gt;<br>
</span>&gt; &quot;Client-side:=C2=A0 Client-side is a term used in this doc=
ument to indicate a connection initiation attempt by the end system (repres=
ented by an EID)=E2=80=9D<br>
<br>
Fixed. Put in your suggestion.<br>
<span class=3D""><br>
&gt; Page 6<br>
&gt; The source EID is obtained via existing mechanisms used to set a host&=
#39;s &quot;local&quot; IP address.=C2=A0 An EID used on the public Interne=
t must have the same properties as any other IP address used in that manner=
; this means, among other things, that it must be globally unique.<br>
&gt;<br>
&gt; PPE 2: Shouldn&#39;t these two be MUST rather than must? Suggestion be=
low<br>
&gt;<br>
&gt; The source EID is obtained via existing mechanisms used to set a host&=
#39;s &quot;local&quot; IP address.=C2=A0 An EID used on the public Interne=
t MUST have the same properties as any other IP address used in that manner=
; this means, among other things, that it MUST be globally unique.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 8<br>
&gt; An EID maps to one or more RLOCs.<br>
&gt; PPE 3: Seems to contradict earlier explanation on negative mapping ent=
ry where it is possible that an EID has NO RLOC.<br>
<br>
</span>I changed to =E2=80=9Czero or more RLOCs.=E2=80=9D.<br>
<span class=3D""><br>
&gt; Page 8<br>
&gt; When using multiple mapping database systems, care must be taken to no=
t create re-encapsulation loops through misconfiguration.<br>
&gt;<br>
&gt; PPE 4: Suggest to add &quot;re-encapsulation&quot; in the list in Secu=
rity Considerations section as this is an exploit possibility.<br>
<br>
</span>I have removed the sentence. Because it actually is not true. If you=
 use different mapping systems and circuitious forwarding occurs. The packe=
t travels only until its TTL reaches 0. Using the rules for copy inner to o=
uter and outer to inner during RTR re-encapsulation applies.<br>
<span class=3D""><br>
&gt; Page 13<br>
&gt; &quot;gleaned&quot; mapping<br>
&gt;<br>
&gt; PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the definitio=
n section.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 17<br>
&gt; &quot;The KK-bits are a 2-bit field used when encapsualted packets are=
 encrypted.&quot;<br>
&gt;<br>
&gt; PPE 6: Nit - Typo &quot;encapsualted&quot; -&gt; =E2=80=9Cencapsulated=
&quot;<br>
<br>
</span>Fixed.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 20<br>
&gt; &quot;When the lookup succeeds, the locator-set=C2=A0 retrieved from t=
he map-cache is used to send the packet to the EID&#39;s topological locati=
on.&quot;<br>
&gt;<br>
&gt; PPE 7: Nit - Suggest capitalize L and S of &quot;locator-set&quot; for=
 consistency with rest of document.<br>
<br>
</span>Thanks. Done.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 23<br>
&gt; &quot;The server-side sets a Weight of 0...&quot;<br>
&gt; PPE 8: Nit - For consistency in text change to &quot;Weight of zero=E2=
=80=9D.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 23<br>
&gt; &quot;Control is shared by the server- side determining the list and t=
he client determining load=C2=A0 distribution.&quot;<br>
&gt;<br>
&gt; PPE 9: Suggest use of &quot;Client-side&quot;<br>
&gt;<br>
</span>&gt; &quot;Control is shared by the server- side determining the lis=
t and the client-side determining load distribution.=E2=80=9D<br>
<br>
Done.<br>
<span class=3D""><br>
&gt; Page 24<br>
&gt; When a verified Map-Cache entry is stored, data gleaning no longer occ=
urs for subsequent packets that have a source EID that matches<br>
&gt; the EID-Prefix of the verified entry.[PE1]=C2=A0 =C2=A0This &quot;glea=
ning&quot; mechanism is OPTIONAL.<br>
&gt;<br>
&gt; PPE 10: In section 16.2 later gleaning is used as a solution.=C2=A0 Ch=
anges in the gleaned info could be an interesting way to update the cache f=
ast =E2=80=A6however this text make it sound that this is not an option aft=
er first packet.<br>
<br>
</span>It is an option when the ETR has no mapping to return packets. Once =
a mapping is cache, there is no point to glean since the mapping system ver=
ified the information the same as in the map-cache.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 25<br>
&gt; &quot;Note that trusting ICMP messages may=C2=A0 not be desirable, but=
 neither is ignoring them completely. Implementations are encouraged to fol=
low current best practices in treating these conditions.&quot;<br>
&gt;<br>
&gt; PPE 11: A reference would be useful if possible.<br>
<br>
</span>Added draft-ietf-opsec-icmp-<wbr>filtering.<br>
<span class=3D""><br>
&gt; Page 25<br>
&gt; &quot;An ITR that participates in the global routing system can determ=
ine that an RLOC is down if no BGP Routing Information Base (RIB) route exi=
sts that matches the RLOC IP address.&quot;<br>
&gt;<br>
&gt; PPE 12: Isn&#39;t this true for any protocol entry not just a BGP entr=
y? We are really trying to determine if there is no route whatever the prot=
ocol.<br>
<br>
</span>Yes, we can generalize this. I changed text.<br>
<span class=3D""><br>
&gt; Page 38<br>
&gt; &quot;For a more detailed networkd design deployment recommendation, r=
efer to [RFC7215].&quot;<br>
&gt;<br>
&gt; PPE 13: Nit typo &quot;netword&quot;-&gt; =E2=80=9Cnetwork&quot;<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 40<br>
&gt; &quot;By having the PE be the first router on the path to encapsulate,=
 it can choose a TE path first, and the ETR can decapsulate and Re-Encapsul=
ate for a new encapsuluation path to the destination end site.&quot;<br>
&gt;<br>
&gt; PPE 14: Nit Typo &quot;encapsuluation&quot; -&gt; =E2=80=9Cencapsulati=
on&quot;<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 43<br>
&gt; &quot;If the attacker spoofs the source RLOC, it can mount a DoS attac=
k by redirecting traffic to the spoofed victim;s RLOC, potentially overload=
ing it.&quot;<br>
&gt;<br>
<br>
</span>&gt; PPE 15: Nit=C2=A0 typo &quot;victim;s&quot; -&gt; =E2=80=9Cvict=
im=E2=80=99s=E2=80=9D<br>
<br>
Changed.<br>
<span class=3D"HOEnZb"><font color=3D"#888888"><br>
Dino<br>
<br>
</font></span><br>=C2=A0 =C2=A0 <br><br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br></blockquote></div><br></div>

--f403045c059aef17df0563e08f6b--


From nobody Sun Jan 28 19:08:07 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 4C153131550 for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:08:06 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.998
X-Spam-Level: 
X-Spam-Status: No, score=-1.998 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, HTML_MESSAGE=0.001, MIME_QP_LONG_LINE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id Am8TCGPmzDmK for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:08:02 -0800 (PST)
Received: from mail-pf0-x22a.google.com (mail-pf0-x22a.google.com [IPv6:2607:f8b0:400e:c00::22a]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 91A0F131547 for <lisp@ietf.org>; Sun, 28 Jan 2018 19:08:02 -0800 (PST)
Received: by mail-pf0-x22a.google.com with SMTP id 23so3688688pfp.3 for <lisp@ietf.org>; Sun, 28 Jan 2018 19:08:02 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=pbTcc72Jxgy1U3oPdS1Hd5jTF+gdd8Q3hmPwAJUDW8k=; b=HF1LwEIkjKE1n7zOP3HnulBWjFc15BaDVpJ1A7PF5hKPmO2afD4QuTx3IR4M9anGan +4ua384HzT4yjR7RL+7UUPYqOnZE28DEQlhkIhEu3otVrn82dtFhfuE6eo5qYLVKV4Q5 AeKVLYwVGY+IreKJBRJGPr8owKr//dIw60CR4VIQVxoO03QBP0tQIzpYqoAN/arhuthU bGqiufQub8SZj62gX25bLL3URu+hzP6roGsfvjiytfQCGK9SPtSnSFhRoV0yNIF4tHkq QULmyxfckBYj6gqXO0nvlx8DjXkFlzpb8koWilHSbVOcMt8Ghk7KA4xWMr4W2lBReMme WVXQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=pbTcc72Jxgy1U3oPdS1Hd5jTF+gdd8Q3hmPwAJUDW8k=; b=rBRVQr9zHP+39zxYM9Kcexbbj8sGl9Vvoh/OiFZcxTK0mkkAdqNuoZpq0pthtRnlY8 pcA6y/sxf6wKeEqLLOgM2ELHUJsVUzee++Mlk4vO0UGhjt/7CJ1CbkxGLUejs37ZgBjM IlJC+nRjo+0sSeK6NlQMvdgR0iIon3oY10NLRXV5LGDcnN52p0q/ptonsqFL3CR5vuvB Qtp1VgRHTrp3OBzw/lRgpufMFeUNsq6Xa8r7PUK+Nl8TPbMUgVs8w+Pkte+q2F4MskSE wjTLXqumJmjPdqIE3gt7+KtaA9XA5Tprqcx71VsFDgta+j2SC3+9VJ53yIcuW7FVcu4D x8Zg==
X-Gm-Message-State: AKwxytepANa3q1MNXS1niIJ6lTp6Zuncgg0OQpiX6toW67D3FPcim0ch 08GSDX/jTn+vyD1VeQjo7ORaY92v
X-Google-Smtp-Source: AH8x226MffhxysyzCJGwDVuimNFekGzQq2HVGwvUBSrgL+tV3zbfDykgMZilvOP3wmJwroiCycSf5g==
X-Received: by 10.98.200.153 with SMTP id i25mr25114951pfk.241.1517195281963;  Sun, 28 Jan 2018 19:08:01 -0800 (PST)
Received: from ?IPv6:2603:3024:151c:55f0:4564:f5d7:a123:b858? ([2603:3024:151c:55f0:4564:f5d7:a123:b858]) by smtp.gmail.com with ESMTPSA id z9sm15593152pgc.5.2018.01.28.19.08.00 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Sun, 28 Jan 2018 19:08:00 -0800 (PST)
Content-Type: multipart/alternative; boundary=Apple-Mail-F38C400B-FEE3-400C-96FA-169EDF67EE2E
Mime-Version: 1.0 (1.0)
From: Dino Farinacci <farinacci@gmail.com>
X-Mailer: iPhone Mail (15D60)
In-Reply-To: <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com>
Date: Sun, 28 Jan 2018 19:07:59 -0800
Cc: Padma Pillay-Esnault <padma.ietf@gmail.com>, Albert Cabellos <acabello@ac.upc.edu>, Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: 7bit
Message-Id: <784FC076-8BA8-42E4-9891-2685A3DE40F5@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com> <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com> <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/-1Z_kxFFa0MPW4kNOH8xUZZi_7I>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 03:08:06 -0000

--Apple-Mail-F38C400B-FEE3-400C-96FA-169EDF67EE2E
Content-Type: text/plain;
	charset=utf-8
Content-Transfer-Encoding: quoted-printable

Note A and C are addressed in the -09 revision I sent out in Friday.=20

Dino

> On Jan 28, 2018, at 5:57 PM, Albert Cabellos <albert.cabellos@gmail.com> w=
rote:
>=20
> Hi all
>=20
> Thanks for all the comments, from my understanding of this thread the foll=
owing list of items *seem* to have rough consensus (all except B - change de=
finitions for EID and RLOC).
>=20
> Joel, Luigi->How should we proceed now?
>=20
> Albert
>=20
> ---
>=20
> A.- Remove definitions of PA and PI
>=20
> C.- In section 5.3, change the description of the encap/decap operation co=
ncerning how to deal with ECN and DSCP bits to (new text needs to be validat=
ed by experts):
>=20
> When doing ITR/PITR encapsulation:
>=20
> o  The outer-header 'Time to Live' field (or 'Hop Limit' field, in the cas=
e of IPv6) SHOULD be copied from the inner-header 'Time to Live' field.
>=20
> o  The outer-header 'Differentiated Services Code Point' (DSCP) field (or t=
he 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the inn=
er-header DSCP field ('Traffic Class' field, in the case of IPv6) considerin=
g the exception listed below.
>=20
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the=
 IPv6 'Traffic Class' field) requires special treatment in order to avoid di=
scarding indications of congestion [RFC3168]. ITR encapsulation MUST copy th=
e 2-bit 'ECN' field from the inner header to the outer header. Re-encapsulat=
ion MUST copy the 2-bit 'ECN' field from the stripped outer header to the ne=
w outer header.
>=20
> When doing ETR/PETR decapsulation:
>=20
>  o  The inner-header 'Time to Live' field (or 'Hop Limit' field, in the ca=
se of IPv6) SHOULD be copied from the outer-header 'Time to Live' field, whe=
n the Time to Live value of the outer header is less than the Time to Live v=
alue of the inner header.  Failing to perform this check can cause the Time t=
o Live of the inner header to increment across encapsulation/decapsulation c=
ycles.  This check is also performed when doing initial encapsulation, when a=
 packet comes to an ITR or PITR destined for a LISP site.
>=20
> o  The inner-header 'Differentiated Services Code Point' (DSCP) field (or t=
he 'Traffic Class' field, in the case of IPv6) SHOULD be copied from the out=
er-header DSCP field ('Traffic Class' field, in the case of IPv6) considerin=
g the exception listed below.
>=20
> o  The 'Explicit Congestion Notification' (ECN) field (bits 6 and 7 of the=
 IPv6 'Traffic Class' field) requires special treatment in order to avoid di=
scarding indications of congestion [RFC3168]. If the 'ECN' field contains a c=
ongestion indication codepoint (the value is '11', the Congestion Experience=
d (CE) codepoint), then ETR decapsulation MUST copy the 2-bit 'ECN' field fr=
om the stripped outer header to the surviving inner header that is used to f=
orward the packet beyond the ETR.  These requirements preserve CE indication=
s when a packet that uses ECN traverses a LISP tunnel and becomes marked wit=
h a CE indication due to congestion between the tunnel endpoints.
>=20
> Note that if an ETR/PETR is also an ITR/PITR and chooses to re-encapsulate=
 after decapsulating, the net effect of this is that the new outer header wi=
ll carry the same Time to Live as the old outer header minus 1.
>=20
> Copying the Time to Live (TTL) serves two purposes: first, it preserves th=
e distance the host intended the packet to travel; second, and more importan=
tly, it provides for suppression of looping packets in the event there is a l=
oop of concatenated tunnels due to misconfiguration.  See Section 18.3 for T=
TL exception handling for traceroute packets.
>=20
> D.- Simplify section =E2=80=98Router Locator Selection=E2=80=99 stating th=
at the data-plane MUST follow what=C2=B4s stored in the map-cache (prioritie=
s and weights), the remaining text should go to an OAM document.
>=20
> E.- Rewrite Section =E2=80=9CRouting Locator Reachability=E2=80=9D conside=
ring the following changes:
>=20
> *    Keep bullet point 1 (examine LSB), 6 (receiving a data-packet) and Ec=
ho-Nonce
> *    Move to 6833bis bullet point 2 (ICMP Network/Host Unreachable),3 (hin=
ts from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as a response)=
 and RLOC probing
>=20
> F.- Move Solicit-Map-Request to 6833bis
>=20
> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement Consider=
ations), 18 (Traceroute Consideration) to a new OAM document
>=20
>> On Fri, Jan 26, 2018 at 8:20 PM, Dino Farinacci <farinacci@gmail.com> wro=
te:
>> Thanks for the detail review Padma. A new update to -09 is enclosed with a=
 diff file. I will wait until next week to post.
>>=20
>> I have reflected all of your comments and most of Luigi=E2=80=99s comment=
s. The only issues open are:
>>=20
>> (1) Section movement from RFC6830 to RFC6833.
>>=20
>> (2) If an OAM document is needed.
>>=20
>> Waiting for more working group concensus on this.
>>=20
>> > Dear Dino and Albert
>> >
>> > The doc reads well.
>> > Please find thereafter some comments on the version- 09 you posted on t=
he list
>> >
>> > Page 4
>> > "Client-side:  Client-side is a term used in this document to indicate a=
 connection initiation attempt by an EID."
>> > PPE 1: Strictly speaking the EID is just an identifier and does not ini=
tiate anything. Suggest something like this.
>> >
>> > "Client-side:  Client-side is a term used in this document to indicate a=
 connection initiation attempt by the end system (represented by an EID)=E2=80=
=9D
>>=20
>> Fixed. Put in your suggestion.
>>=20
>> > Page 6
>> > The source EID is obtained via existing mechanisms used to set a host's=
 "local" IP address.  An EID used on the public Internet must have the same p=
roperties as any other IP address used in that manner; this means, among oth=
er things, that it must be globally unique.
>> >
>> > PPE 2: Shouldn't these two be MUST rather than must? Suggestion below
>> >
>> > The source EID is obtained via existing mechanisms used to set a host's=
 "local" IP address.  An EID used on the public Internet MUST have the same p=
roperties as any other IP address used in that manner; this means, among oth=
er things, that it MUST be globally unique.
>>=20
>> Changed.
>>=20
>> > Page 8
>> > An EID maps to one or more RLOCs.
>> > PPE 3: Seems to contradict earlier explanation on negative mapping entr=
y where it is possible that an EID has NO RLOC.
>>=20
>> I changed to =E2=80=9Czero or more RLOCs.=E2=80=9D.
>>=20
>> > Page 8
>> > When using multiple mapping database systems, care must be taken to not=
 create re-encapsulation loops through misconfiguration.
>> >
>> > PPE 4: Suggest to add "re-encapsulation" in the list in Security Consid=
erations section as this is an exploit possibility.
>>=20
>> I have removed the sentence. Because it actually is not true. If you use d=
ifferent mapping systems and circuitious forwarding occurs. The packet trave=
ls only until its TTL reaches 0. Using the rules for copy inner to outer and=
 outer to inner during RTR re-encapsulation applies.
>>=20
>> > Page 13
>> > "gleaned" mapping
>> >
>> > PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the definition=
 section.
>>=20
>> Changed.
>>=20
>> > Page 17
>> > "The KK-bits are a 2-bit field used when encapsualted packets are encry=
pted."
>> >
>> > PPE 6: Nit - Typo "encapsualted" -> =E2=80=9Cencapsulated"
>>=20
>> Fixed.
>>=20
>> >
>> > Page 20
>> > "When the lookup succeeds, the locator-set  retrieved from the map-cach=
e is used to send the packet to the EID's topological location."
>> >
>> > PPE 7: Nit - Suggest capitalize L and S of "locator-set" for consistenc=
y with rest of document.
>>=20
>> Thanks. Done.
>>=20
>> >
>> > Page 23
>> > "The server-side sets a Weight of 0..."
>> > PPE 8: Nit - For consistency in text change to "Weight of zero=E2=80=9D=
.
>>=20
>> Changed.
>>=20
>> > Page 23
>> > "Control is shared by the server- side determining the list and the cli=
ent determining load  distribution."
>> >
>> > PPE 9: Suggest use of "Client-side"
>> >
>> > "Control is shared by the server- side determining the list and the cli=
ent-side determining load distribution.=E2=80=9D
>>=20
>> Done.
>>=20
>> > Page 24
>> > When a verified Map-Cache entry is stored, data gleaning no longer occu=
rs for subsequent packets that have a source EID that matches
>> > the EID-Prefix of the verified entry.[PE1]   This "gleaning" mechanism i=
s OPTIONAL.
>> >
>> > PPE 10: In section 16.2 later gleaning is used as a solution.  Changes i=
n the gleaned info could be an interesting way to update the cache fast =E2=80=
=A6however this text make it sound that this is not an option after first pa=
cket.
>>=20
>> It is an option when the ETR has no mapping to return packets. Once a map=
ping is cache, there is no point to glean since the mapping system verified t=
he information the same as in the map-cache.
>>=20
>> >
>> > Page 25
>> > "Note that trusting ICMP messages may  not be desirable, but neither is=
 ignoring them completely. Implementations are encouraged to follow current b=
est practices in treating these conditions."
>> >
>> > PPE 11: A reference would be useful if possible.
>>=20
>> Added draft-ietf-opsec-icmp-filtering.
>>=20
>> > Page 25
>> > "An ITR that participates in the global routing system can determine th=
at an RLOC is down if no BGP Routing Information Base (RIB) route exists tha=
t matches the RLOC IP address."
>> >
>> > PPE 12: Isn't this true for any protocol entry not just a BGP entry? We=
 are really trying to determine if there is no route whatever the protocol.
>>=20
>> Yes, we can generalize this. I changed text.
>>=20
>> > Page 38
>> > "For a more detailed networkd design deployment recommendation, refer t=
o [RFC7215]."
>> >
>> > PPE 13: Nit typo "netword"-> =E2=80=9Cnetwork"
>>=20
>> Changed.
>>=20
>> > Page 40
>> > "By having the PE be the first router on the path to encapsulate, it ca=
n choose a TE path first, and the ETR can decapsulate and Re-Encapsulate for=
 a new encapsuluation path to the destination end site."
>> >
>> > PPE 14: Nit Typo "encapsuluation" -> =E2=80=9Cencapsulation"
>>=20
>> Changed.
>>=20
>> > Page 43
>> > "If the attacker spoofs the source RLOC, it can mount a DoS attack by r=
edirecting traffic to the spoofed victim;s RLOC, potentially overloading it.=
"
>> >
>>=20
>> > PPE 15: Nit  typo "victim;s" -> =E2=80=9Cvictim=E2=80=99s=E2=80=9D
>>=20
>> Changed.
>>=20
>> Dino
>>=20
>>=20
>>    =20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>>=20
>=20

--Apple-Mail-F38C400B-FEE3-400C-96FA-169EDF67EE2E
Content-Type: text/html;
	charset=utf-8
Content-Transfer-Encoding: quoted-printable

<html><head><meta http-equiv=3D"content-type" content=3D"text/html; charset=3D=
utf-8"></head><body dir=3D"auto"><div></div><div>Note A and C are addressed i=
n the -09 revision I sent out in Friday.&nbsp;</div><div><br></div><div>Dino=
</div><div><br>On Jan 28, 2018, at 5:57 PM, Albert Cabellos &lt;<a href=3D"m=
ailto:albert.cabellos@gmail.com">albert.cabellos@gmail.com</a>&gt; wrote:<br=
><br></div><blockquote type=3D"cite"><div><div dir=3D"ltr">Hi all<div><br></=
div><div>Thanks for all the comments, from my understanding of this thread t=
he following list of items *seem* to have rough consensus (all except B - ch=
ange definitions for EID and RLOC).</div><div><br></div><div>Joel, Luigi-&gt=
;How should we proceed now?</div><div><br></div><div>Albert</div><div><br></=
div><div>---</div><div><br></div><blockquote style=3D"margin:0 0 0 40px;bord=
er:none;padding:0px"><div>A.- Remove definitions of PA and PI</div><div><br>=
</div><div>C.- In section 5.3, change the description of the encap/decap ope=
ration concerning how to deal with ECN and DSCP bits to (new text needs to b=
e validated by experts):</div><div><br></div><blockquote style=3D"margin:0 0=
 0 40px;border:none;padding:0px"><div><div>When doing ITR/PITR encapsulation=
:</div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none=
;padding:0px"><div><div><br></div></div></blockquote><blockquote style=3D"ma=
rgin:0 0 0 40px;border:none;padding:0px"><div><div>o&nbsp; The outer-header '=
Time to Live' field (or 'Hop Limit' field, in the case of IPv6) SHOULD be co=
pied from the inner-header 'Time to Live' field.</div></div></blockquote><bl=
ockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br><=
/div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;p=
adding:0px"><div><div>o&nbsp; The outer-header 'Differentiated Services Code=
 Point' (DSCP) field (or the 'Traffic Class' field, in the case of IPv6) SHO=
ULD be copied from the inner-header DSCP field ('Traffic Class' field, in th=
e case of IPv6) considering the exception listed below.</div></div></blockqu=
ote><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><di=
v><br></div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border=
:none;padding:0px"><div><div>o&nbsp; The 'Explicit Congestion Notification' (=
ECN) field (bits 6 and 7 of the IPv6 'Traffic Class' field) requires special=
 treatment in order to avoid discarding indications of congestion [RFC3168].=
 ITR encapsulation MUST copy the 2-bit 'ECN' field from the inner header to t=
he outer header. Re-encapsulation MUST copy the 2-bit 'ECN' field from the s=
tripped outer header to the new outer header.</div></div></blockquote><block=
quote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br></di=
v></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;padd=
ing:0px"><div><div>When doing ETR/PETR decapsulation:</div></div></blockquot=
e><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div>=
<br></div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:n=
one;padding:0px"><div><div>&nbsp;o&nbsp; The inner-header 'Time to Live' fie=
ld (or 'Hop Limit' field, in the case of IPv6) SHOULD be copied from the out=
er-header 'Time to Live' field, when the Time to Live value of the outer hea=
der is less than the Time to Live value of the inner header.&nbsp; Failing t=
o perform this check can cause the Time to Live of the inner header to incre=
ment across encapsulation/decapsulation cycles.&nbsp; This check is also per=
formed when doing initial encapsulation, when a packet comes to an ITR or PI=
TR destined for a LISP site.</div></div></blockquote><blockquote style=3D"ma=
rgin:0 0 0 40px;border:none;padding:0px"><div><div><br></div></div></blockqu=
ote><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><div><di=
v>o&nbsp; The inner-header 'Differentiated Services Code Point' (DSCP) field=
 (or the 'Traffic Class' field, in the case of IPv6) SHOULD be copied from t=
he outer-header DSCP field ('Traffic Class' field, in the case of IPv6) cons=
idering the exception listed below.</div></div></blockquote><blockquote styl=
e=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br></div></div></=
blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px"><=
div><div>o&nbsp; The 'Explicit Congestion Notification' (ECN) field (bits 6 a=
nd 7 of the IPv6 'Traffic Class' field) requires special treatment in order t=
o avoid discarding indications of congestion [RFC3168]. If the 'ECN' field c=
ontains a congestion indication codepoint (the value is '11', the Congestion=
 Experienced (CE) codepoint), then ETR decapsulation MUST copy the 2-bit 'EC=
N' field from the stripped outer header to the surviving inner header that i=
s used to forward the packet beyond the ETR.&nbsp; These requirements preser=
ve CE indications when a packet that uses ECN traverses a LISP tunnel and be=
comes marked with a CE indication due to congestion between the tunnel endpo=
ints.</div></div></blockquote><blockquote style=3D"margin:0 0 0 40px;border:=
none;padding:0px"><div><div><br></div></div></blockquote><blockquote style=3D=
"margin:0 0 0 40px;border:none;padding:0px"><div><div>Note that if an ETR/PE=
TR is also an ITR/PITR and chooses to re-encapsulate after decapsulating, th=
e net effect of this is that the new outer header will carry the same Time t=
o Live as the old outer header minus 1.</div></div></blockquote><blockquote s=
tyle=3D"margin:0 0 0 40px;border:none;padding:0px"><div><div><br></div></div=
></blockquote><blockquote style=3D"margin:0 0 0 40px;border:none;padding:0px=
"><div><div>Copying the Time to Live (TTL) serves two purposes: first, it pr=
eserves the distance the host intended the packet to travel; second, and mor=
e importantly, it provides for suppression of looping packets in the event t=
here is a loop of concatenated tunnels due to misconfiguration.&nbsp; See Se=
ction 18.3 for TTL exception handling for traceroute packets.</div></div></b=
lockquote><div><br></div><div>D.- Simplify section =E2=80=98Router Locator S=
election=E2=80=99 stating that the data-plane MUST follow what=C2=B4s stored=
 in the map-cache (priorities and weights), the remaining text should go to a=
n OAM document.</div><div><br></div><div><div>E.- Rewrite Section =E2=80=9CR=
outing Locator Reachability=E2=80=9D considering the following changes:</div=
></div><div><div><br></div></div><div><div>*&nbsp; &nbsp; Keep bullet point 1=
 (examine LSB), 6 (receiving a data-packet) and Echo-Nonce</div></div><div><=
div>*&nbsp; &nbsp; Move to 6833bis bullet point 2 (ICMP Network/Host Unreach=
able),3 (hints from BGP),4 (ICMP Port Unreachable),5 (receive a Map-Reply as=
 a response) and RLOC probing</div></div><div><br></div><div>F.- Move Solici=
t-Map-Request to 6833bis</div><div><div><br></div></div><div><div>G.- Move s=
ections 16 (Mobility Considerations), 17 (xTR Placement Considerations), 18 (=
Traceroute Consideration) to a new OAM document</div></div></blockquote></di=
v><div class=3D"gmail_extra"><br><div class=3D"gmail_quote">On Fri, Jan 26, 2=
018 at 8:20 PM, Dino Farinacci <span dir=3D"ltr">&lt;<a href=3D"mailto:farin=
acci@gmail.com" target=3D"_blank">farinacci@gmail.com</a>&gt;</span> wrote:<=
br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:=
1px #ccc solid;padding-left:1ex">Thanks for the detail review Padma. A new u=
pdate to -09 is enclosed with a diff file. I will wait until next week to po=
st.<br>
<br>
I have reflected all of your comments and most of Luigi=E2=80=99s comments. T=
he only issues open are:<br>
<br>
(1) Section movement from RFC6830 to RFC6833.<br>
<br>
(2) If an OAM document is needed.<br>
<br>
Waiting for more working group concensus on this.<br>
<span class=3D""><br>
&gt; Dear Dino and Albert<br>
&gt;<br>
&gt; The doc reads well.<br>
&gt; Please find thereafter some comments on the version- 09 you posted on t=
he list<br>
&gt;<br>
&gt; Page 4<br>
&gt; "Client-side:&nbsp; Client-side is a term used in this document to indi=
cate a connection initiation attempt by an EID."<br>
&gt; PPE 1: Strictly speaking the EID is just an identifier and does not ini=
tiate anything. Suggest something like this.<br>
&gt;<br>
</span>&gt; "Client-side:&nbsp; Client-side is a term used in this document t=
o indicate a connection initiation attempt by the end system (represented by=
 an EID)=E2=80=9D<br>
<br>
Fixed. Put in your suggestion.<br>
<span class=3D""><br>
&gt; Page 6<br>
&gt; The source EID is obtained via existing mechanisms used to set a host's=
 "local" IP address.&nbsp; An EID used on the public Internet must have the s=
ame properties as any other IP address used in that manner; this means, amon=
g other things, that it must be globally unique.<br>
&gt;<br>
&gt; PPE 2: Shouldn't these two be MUST rather than must? Suggestion below<b=
r>
&gt;<br>
&gt; The source EID is obtained via existing mechanisms used to set a host's=
 "local" IP address.&nbsp; An EID used on the public Internet MUST have the s=
ame properties as any other IP address used in that manner; this means, amon=
g other things, that it MUST be globally unique.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 8<br>
&gt; An EID maps to one or more RLOCs.<br>
&gt; PPE 3: Seems to contradict earlier explanation on negative mapping entr=
y where it is possible that an EID has NO RLOC.<br>
<br>
</span>I changed to =E2=80=9Czero or more RLOCs.=E2=80=9D.<br>
<span class=3D""><br>
&gt; Page 8<br>
&gt; When using multiple mapping database systems, care must be taken to not=
 create re-encapsulation loops through misconfiguration.<br>
&gt;<br>
&gt; PPE 4: Suggest to add "re-encapsulation" in the list in Security Consid=
erations section as this is an exploit possibility.<br>
<br>
</span>I have removed the sentence. Because it actually is not true. If you u=
se different mapping systems and circuitious forwarding occurs. The packet t=
ravels only until its TTL reaches 0. Using the rules for copy inner to outer=
 and outer to inner during RTR re-encapsulation applies.<br>
<span class=3D""><br>
&gt; Page 13<br>
&gt; "gleaned" mapping<br>
&gt;<br>
&gt; PPE 5: Suggest adding =E2=80=9Cglean mapping=E2=80=9D in the definition=
 section.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 17<br>
&gt; "The KK-bits are a 2-bit field used when encapsualted packets are encry=
pted."<br>
&gt;<br>
&gt; PPE 6: Nit - Typo "encapsualted" -&gt; =E2=80=9Cencapsulated"<br>
<br>
</span>Fixed.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 20<br>
&gt; "When the lookup succeeds, the locator-set&nbsp; retrieved from the map=
-cache is used to send the packet to the EID's topological location."<br>
&gt;<br>
&gt; PPE 7: Nit - Suggest capitalize L and S of "locator-set" for consistenc=
y with rest of document.<br>
<br>
</span>Thanks. Done.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 23<br>
&gt; "The server-side sets a Weight of 0..."<br>
&gt; PPE 8: Nit - For consistency in text change to "Weight of zero=E2=80=9D=
.<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 23<br>
&gt; "Control is shared by the server- side determining the list and the cli=
ent determining load&nbsp; distribution."<br>
&gt;<br>
&gt; PPE 9: Suggest use of "Client-side"<br>
&gt;<br>
</span>&gt; "Control is shared by the server- side determining the list and t=
he client-side determining load distribution.=E2=80=9D<br>
<br>
Done.<br>
<span class=3D""><br>
&gt; Page 24<br>
&gt; When a verified Map-Cache entry is stored, data gleaning no longer occu=
rs for subsequent packets that have a source EID that matches<br>
&gt; the EID-Prefix of the verified entry.[PE1]&nbsp; &nbsp;This "gleaning" m=
echanism is OPTIONAL.<br>
&gt;<br>
&gt; PPE 10: In section 16.2 later gleaning is used as a solution.&nbsp; Cha=
nges in the gleaned info could be an interesting way to update the cache fas=
t =E2=80=A6however this text make it sound that this is not an option after f=
irst packet.<br>
<br>
</span>It is an option when the ETR has no mapping to return packets. Once a=
 mapping is cache, there is no point to glean since the mapping system verif=
ied the information the same as in the map-cache.<br>
<span class=3D""><br>
&gt;<br>
&gt; Page 25<br>
&gt; "Note that trusting ICMP messages may&nbsp; not be desirable, but neith=
er is ignoring them completely. Implementations are encouraged to follow cur=
rent best practices in treating these conditions."<br>
&gt;<br>
&gt; PPE 11: A reference would be useful if possible.<br>
<br>
</span>Added draft-ietf-opsec-icmp-<wbr>filtering.<br>
<span class=3D""><br>
&gt; Page 25<br>
&gt; "An ITR that participates in the global routing system can determine th=
at an RLOC is down if no BGP Routing Information Base (RIB) route exists tha=
t matches the RLOC IP address."<br>
&gt;<br>
&gt; PPE 12: Isn't this true for any protocol entry not just a BGP entry? We=
 are really trying to determine if there is no route whatever the protocol.<=
br>
<br>
</span>Yes, we can generalize this. I changed text.<br>
<span class=3D""><br>
&gt; Page 38<br>
&gt; "For a more detailed networkd design deployment recommendation, refer t=
o [RFC7215]."<br>
&gt;<br>
&gt; PPE 13: Nit typo "netword"-&gt; =E2=80=9Cnetwork"<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 40<br>
&gt; "By having the PE be the first router on the path to encapsulate, it ca=
n choose a TE path first, and the ETR can decapsulate and Re-Encapsulate for=
 a new encapsuluation path to the destination end site."<br>
&gt;<br>
&gt; PPE 14: Nit Typo "encapsuluation" -&gt; =E2=80=9Cencapsulation"<br>
<br>
</span>Changed.<br>
<span class=3D""><br>
&gt; Page 43<br>
&gt; "If the attacker spoofs the source RLOC, it can mount a DoS attack by r=
edirecting traffic to the spoofed victim;s RLOC, potentially overloading it.=
"<br>
&gt;<br>
<br>
</span>&gt; PPE 15: Nit&nbsp; typo "victim;s" -&gt; =E2=80=9Cvictim=E2=80=99=
s=E2=80=9D<br>
<br>
Changed.<br>
<span class=3D"HOEnZb"><font color=3D"#888888"><br>
Dino<br>
<br>
</font></span><br>&nbsp; &nbsp; <br><br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br></blockquote></div><br></div>
</div></blockquote></body></html>=

--Apple-Mail-F38C400B-FEE3-400C-96FA-169EDF67EE2E--


From nobody Sun Jan 28 19:17:24 2018
Return-Path: <jmh@joelhalpern.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 8E95F13155F for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:17:22 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.72
X-Spam-Level: 
X-Spam-Status: No, score=-2.72 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, RCVD_IN_DNSWL_LOW=-0.7, RCVD_IN_MSPIKE_H3=-0.01, RCVD_IN_MSPIKE_WL=-0.01, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (1024-bit key) header.d=joelhalpern.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id PuZzpTMtOc-G for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:17:20 -0800 (PST)
Received: from mailb2.tigertech.net (mailb2.tigertech.net [208.80.4.154]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 4350D13156D for <lisp@ietf.org>; Sun, 28 Jan 2018 19:17:19 -0800 (PST)
Received: from localhost (localhost [127.0.0.1]) by mailb2.tigertech.net (Postfix) with ESMTP id 295B11C0DA8; Sun, 28 Jan 2018 19:17:19 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=joelhalpern.com; s=1.tigertech; t=1517195839; bh=7cZ0mKsRVdBCvzPTc+T5sm9qrVVHxoUFW4UGou8GONg=; h=Subject:To:Cc:References:From:Date:In-Reply-To:From; b=Qkme3ZPpnLdJXpxCWOxxKj0Ke/8uAXDdr5jWt85/OIzJ6hylKyZYezt+jbybVcjgI goAdIzBPmKVxLn6L/wUTewh1ampL90eWqpoGF8DxDUuWF38BrPtjLDtSYeYCKtc45R 2aDHdv8pZpJzD5w/X5uVsctYPD0aFoF1TRpTqWCQ=
X-Virus-Scanned: Debian amavisd-new at b2.tigertech.net
Received: from Joels-MacBook-Pro.local (unknown [111.223.96.180]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by mailb2.tigertech.net (Postfix) with ESMTPSA id 388981C0657; Sun, 28 Jan 2018 19:17:15 -0800 (PST)
To: Dino Farinacci <farinacci@gmail.com>, Albert Cabellos <albert.cabellos@gmail.com>
Cc: lisp-chairs@tools.ietf.org, "lisp@ietf.org list" <lisp@ietf.org>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com> <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com> <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com> <784FC076-8BA8-42E4-9891-2685A3DE40F5@gmail.com>
From: "Joel M. Halpern" <jmh@joelhalpern.com>
Message-ID: <73829a96-aa11-066b-b5a0-2a6d6721c76b@joelhalpern.com>
Date: Sun, 28 Jan 2018 22:17:21 -0500
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
In-Reply-To: <784FC076-8BA8-42E4-9891-2685A3DE40F5@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 8bit
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/SXSf75L0AiOwsAGJcQGpfenLLTY>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 03:17:23 -0000

Assuming Luigi agrees, there should be a version of this dcoument 
submitted that incorporates what Dino did for A and C, and addresses D - G.

Yours,
Joel

On 1/28/18 10:07 PM, Dino Farinacci wrote:
> Note A and C are addressed in the -09 revision I sent out in Friday.
> 
> Dino
> 
> On Jan 28, 2018, at 5:57 PM, Albert Cabellos <albert.cabellos@gmail.com 
> <mailto:albert.cabellos@gmail.com>> wrote:
> 
>> Hi all
>>
>> Thanks for all the comments, from my understanding of this thread the 
>> following list of items *seem* to have rough consensus (all except B - 
>> change definitions for EID and RLOC).
>>
>> Joel, Luigi->How should we proceed now?
>>
>> Albert
>>
>> ---
>>
>>     A.- Remove definitions of PA and PI
>>
>>     C.- In section 5.3, change the description of the encap/decap
>>     operation concerning how to deal with ECN and DSCP bits to (new
>>     text needs to be validated by experts):
>>
>>         When doing ITR/PITR encapsulation:
>>
>>
>>         o  The outer-header 'Time to Live' field (or 'Hop Limit'
>>         field, in the case of IPv6) SHOULD be copied from the
>>         inner-header 'Time to Live' field.
>>
>>
>>         o  The outer-header 'Differentiated Services Code Point'
>>         (DSCP) field (or the 'Traffic Class' field, in the case of
>>         IPv6) SHOULD be copied from the inner-header DSCP field
>>         ('Traffic Class' field, in the case of IPv6) considering the
>>         exception listed below.
>>
>>
>>         o  The 'Explicit Congestion Notification' (ECN) field (bits 6
>>         and 7 of the IPv6 'Traffic Class' field) requires special
>>         treatment in order to avoid discarding indications of
>>         congestion [RFC3168]. ITR encapsulation MUST copy the 2-bit
>>         'ECN' field from the inner header to the outer header.
>>         Re-encapsulation MUST copy the 2-bit 'ECN' field from the
>>         stripped outer header to the new outer header.
>>
>>
>>         When doing ETR/PETR decapsulation:
>>
>>
>>          o  The inner-header 'Time to Live' field (or 'Hop Limit'
>>         field, in the case of IPv6) SHOULD be copied from the
>>         outer-header 'Time to Live' field, when the Time to Live value
>>         of the outer header is less than the Time to Live value of the
>>         inner header.  Failing to perform this check can cause the
>>         Time to Live of the inner header to increment across
>>         encapsulation/decapsulation cycles.  This check is also
>>         performed when doing initial encapsulation, when a packet
>>         comes to an ITR or PITR destined for a LISP site.
>>
>>
>>         o  The inner-header 'Differentiated Services Code Point'
>>         (DSCP) field (or the 'Traffic Class' field, in the case of
>>         IPv6) SHOULD be copied from the outer-header DSCP field
>>         ('Traffic Class' field, in the case of IPv6) considering the
>>         exception listed below.
>>
>>
>>         o  The 'Explicit Congestion Notification' (ECN) field (bits 6
>>         and 7 of the IPv6 'Traffic Class' field) requires special
>>         treatment in order to avoid discarding indications of
>>         congestion [RFC3168]. If the 'ECN' field contains a congestion
>>         indication codepoint (the value is '11', the Congestion
>>         Experienced (CE) codepoint), then ETR decapsulation MUST copy
>>         the 2-bit 'ECN' field from the stripped outer header to the
>>         surviving inner header that is used to forward the packet
>>         beyond the ETR.  These requirements preserve CE indications
>>         when a packet that uses ECN traverses a LISP tunnel and
>>         becomes marked with a CE indication due to congestion between
>>         the tunnel endpoints.
>>
>>
>>         Note that if an ETR/PETR is also an ITR/PITR and chooses to
>>         re-encapsulate after decapsulating, the net effect of this is
>>         that the new outer header will carry the same Time to Live as
>>         the old outer header minus 1.
>>
>>
>>         Copying the Time to Live (TTL) serves two purposes: first, it
>>         preserves the distance the host intended the packet to travel;
>>         second, and more importantly, it provides for suppression of
>>         looping packets in the event there is a loop of concatenated
>>         tunnels due to misconfiguration.  See Section 18.3 for TTL
>>         exception handling for traceroute packets.
>>
>>
>>     D.- Simplify section ‘Router Locator Selection’ stating that the
>>     data-plane MUST follow what´s stored in the map-cache (priorities
>>     and weights), the remaining text should go to an OAM document.
>>
>>     E.- Rewrite Section “Routing Locator Reachability” considering the
>>     following changes:
>>
>>     *    Keep bullet point 1 (examine LSB), 6 (receiving a
>>     data-packet) and Echo-Nonce
>>     *    Move to 6833bis bullet point 2 (ICMP Network/Host
>>     Unreachable),3 (hints from BGP),4 (ICMP Port Unreachable),5
>>     (receive a Map-Reply as a response) and RLOC probing
>>
>>     F.- Move Solicit-Map-Request to 6833bis
>>
>>     G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement
>>     Considerations), 18 (Traceroute Consideration) to a new OAM document
>>
>>
>> On Fri, Jan 26, 2018 at 8:20 PM, Dino Farinacci <farinacci@gmail.com 
>> <mailto:farinacci@gmail.com>> wrote:
>>
>>     Thanks for the detail review Padma. A new update to -09 is
>>     enclosed with a diff file. I will wait until next week to post.
>>
>>     I have reflected all of your comments and most of Luigi’s
>>     comments. The only issues open are:
>>
>>     (1) Section movement from RFC6830 to RFC6833.
>>
>>     (2) If an OAM document is needed.
>>
>>     Waiting for more working group concensus on this.
>>
>>     > Dear Dino and Albert
>>     >
>>     > The doc reads well.
>>     > Please find thereafter some comments on the version- 09 you posted on the list
>>     >
>>     > Page 4
>>     > "Client-side:  Client-side is a term used in this document to indicate a connection initiation attempt by an EID."
>>     > PPE 1: Strictly speaking the EID is just an identifier and does not initiate anything. Suggest something like this.
>>     >
>>     > "Client-side:  Client-side is a term used in this document to
>>     indicate a connection initiation attempt by the end system
>>     (represented by an EID)”
>>
>>     Fixed. Put in your suggestion.
>>
>>     > Page 6
>>     > The source EID is obtained via existing mechanisms used to set a host's "local" IP address.  An EID used on the public Internet must have the same properties as any other IP address used in that manner; this means, among other things, that it must be globally unique.
>>     >
>>     > PPE 2: Shouldn't these two be MUST rather than must? Suggestion below
>>     >
>>     > The source EID is obtained via existing mechanisms used to set a host's "local" IP address.  An EID used on the public Internet MUST have the same properties as any other IP address used in that manner; this means, among other things, that it MUST be globally unique.
>>
>>     Changed.
>>
>>     > Page 8
>>     > An EID maps to one or more RLOCs.
>>     > PPE 3: Seems to contradict earlier explanation on negative mapping entry where it is possible that an EID has NO RLOC.
>>
>>     I changed to “zero or more RLOCs.”.
>>
>>     > Page 8
>>     > When using multiple mapping database systems, care must be taken to not create re-encapsulation loops through misconfiguration.
>>     >
>>     > PPE 4: Suggest to add "re-encapsulation" in the list in Security Considerations section as this is an exploit possibility.
>>
>>     I have removed the sentence. Because it actually is not true. If
>>     you use different mapping systems and circuitious forwarding
>>     occurs. The packet travels only until its TTL reaches 0. Using the
>>     rules for copy inner to outer and outer to inner during RTR
>>     re-encapsulation applies.
>>
>>     > Page 13
>>     > "gleaned" mapping
>>     >
>>     > PPE 5: Suggest adding “glean mapping” in the definition section.
>>
>>     Changed.
>>
>>     > Page 17
>>     > "The KK-bits are a 2-bit field used when encapsualted packets are encrypted."
>>     >
>>     > PPE 6: Nit - Typo "encapsualted" -> “encapsulated"
>>
>>     Fixed.
>>
>>     >
>>     > Page 20
>>     > "When the lookup succeeds, the locator-set  retrieved from the map-cache is used to send the packet to the EID's topological location."
>>     >
>>     > PPE 7: Nit - Suggest capitalize L and S of "locator-set" for consistency with rest of document.
>>
>>     Thanks. Done.
>>
>>     >
>>     > Page 23
>>     > "The server-side sets a Weight of 0..."
>>     > PPE 8: Nit - For consistency in text change to "Weight of zero”.
>>
>>     Changed.
>>
>>     > Page 23
>>     > "Control is shared by the server- side determining the list and the client determining load  distribution."
>>     >
>>     > PPE 9: Suggest use of "Client-side"
>>     >
>>     > "Control is shared by the server- side determining the list and
>>     the client-side determining load distribution.”
>>
>>     Done.
>>
>>     > Page 24
>>     > When a verified Map-Cache entry is stored, data gleaning no longer occurs for subsequent packets that have a source EID that matches
>>     > the EID-Prefix of the verified entry.[PE1]   This "gleaning" mechanism is OPTIONAL.
>>     >
>>     > PPE 10: In section 16.2 later gleaning is used as a solution.  Changes in the gleaned info could be an interesting way to update the cache fast …however this text make it sound that this is not an option after first packet.
>>
>>     It is an option when the ETR has no mapping to return packets.
>>     Once a mapping is cache, there is no point to glean since the
>>     mapping system verified the information the same as in the map-cache.
>>
>>     >
>>     > Page 25
>>     > "Note that trusting ICMP messages may  not be desirable, but neither is ignoring them completely. Implementations are encouraged to follow current best practices in treating these conditions."
>>     >
>>     > PPE 11: A reference would be useful if possible.
>>
>>     Added draft-ietf-opsec-icmp-filtering.
>>
>>     > Page 25
>>     > "An ITR that participates in the global routing system can determine that an RLOC is down if no BGP Routing Information Base (RIB) route exists that matches the RLOC IP address."
>>     >
>>     > PPE 12: Isn't this true for any protocol entry not just a BGP entry? We are really trying to determine if there is no route whatever the protocol.
>>
>>     Yes, we can generalize this. I changed text.
>>
>>     > Page 38
>>     > "For a more detailed networkd design deployment recommendation, refer to [RFC7215]."
>>     >
>>     > PPE 13: Nit typo "netword"-> “network"
>>
>>     Changed.
>>
>>     > Page 40
>>     > "By having the PE be the first router on the path to encapsulate, it can choose a TE path first, and the ETR can decapsulate and Re-Encapsulate for a new encapsuluation path to the destination end site."
>>     >
>>     > PPE 14: Nit Typo "encapsuluation" -> “encapsulation"
>>
>>     Changed.
>>
>>     > Page 43
>>     > "If the attacker spoofs the source RLOC, it can mount a DoS attack by redirecting traffic to the spoofed victim;s RLOC, potentially overloading it."
>>     >
>>
>>     > PPE 15: Nit  typo "victim;s" -> “victim’s”
>>
>>     Changed.
>>
>>     Dino
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
>>
> 
> 
> _______________________________________________
> lisp mailing list
> lisp@ietf.org
> https://www.ietf.org/mailman/listinfo/lisp
> 


From nobody Sun Jan 28 19:17:51 2018
Return-Path: <farinacci@gmail.com>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 1156913156A for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:17:50 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2
X-Spam-Level: 
X-Spam-Status: No, score=-2 tagged_above=-999 required=5 tests=[BAYES_00=-1.9,  DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, FREEMAIL_FROM=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gmail.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id ItVQk7tsJxb3 for <lisp@ietfa.amsl.com>; Sun, 28 Jan 2018 19:17:48 -0800 (PST)
Received: from mail-pf0-x231.google.com (mail-pf0-x231.google.com [IPv6:2607:f8b0:400e:c00::231]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id ACAEE13156C for <lisp@ietf.org>; Sun, 28 Jan 2018 19:17:41 -0800 (PST)
Received: by mail-pf0-x231.google.com with SMTP id k19so3710222pfj.5 for <lisp@ietf.org>; Sun, 28 Jan 2018 19:17:41 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;  h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=Cc5mAwlVCvV6+agPPf2e9v/K9bxtg1+iRuiVJYAAywY=; b=iJOdz8hfng3aX2jDSFatv7Jprxg6716IqeLS9vY/fUYCg1PAnYF5mzf5TthyooM9Ip nORt2L4Bat1D/DNepLMq85j749HALqlBx8habY9U0M7NgtaPEokYqn8wX9kDnuk18q+q VPTBXdTPy5Yqtolj+M6L0nYaj+qLFm8gYSGF1em+1xzYjCTS5o4w1z8VWoNI0rN9NXMC pNELbbVLinN1b6FaAPBtpgmPNbkdla/ZCiTO34jevd9WCe9AfRoLlW687/Z90hGc3sbj O1gElMs9ogEWNGTnfkODlyjc9MUKA+eEXCO0p5TE1/NamX5uEkhWwBqYT03enOIUtVrg Xmjw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=Cc5mAwlVCvV6+agPPf2e9v/K9bxtg1+iRuiVJYAAywY=; b=ZUL9Hu3/G5wdTJK57Ri+ATEgm1iA9Afc5namDT6ahbMy0Nb9l+LlTGwyezunYsSMOi /XrkUTLyUuzOgz6B9xke0c+0xxK2e5qPRyL4hvPegqOjYCss1Rap2zEAX/3aIM43TqEX do5AifU7PATzj4lAy/IPpPr2FsI7VicOkNKyLx2KNENrVWE0ghWmd89tS48FTitcaJum QLO4X9119aXdi4JKfsBpxCgZ8R73XFEPNZD7bI8PnuSPe/jpwqh5C3s4xl0WiImajY4I ASG+mI60Es4xVwy9flc2zo9bUXZSFUX3ybGQgO54YyROQRh/pP0JtgwnlecBzla9RdCw VZFA==
X-Gm-Message-State: AKwxytdH1Z3TAVhub4XJ9dsVRFc7ZgZ+CZXecIpmV1rLk55ZhdiDob6G 1UX3xlj8yQSGTkm7vBSG6eDLevFM
X-Google-Smtp-Source: AH8x227GXAPUl2aX+lPBfJwMAWuScdORzy8b3/YQjQkp3JMqX3YwhN9SRZ/5133KesG6HH9Hyz8htA==
X-Received: by 10.98.228.5 with SMTP id r5mr26151488pfh.193.1517195861174; Sun, 28 Jan 2018 19:17:41 -0800 (PST)
Received: from ?IPv6:2603:3024:151c:55f0:4564:f5d7:a123:b858? ([2603:3024:151c:55f0:4564:f5d7:a123:b858]) by smtp.gmail.com with ESMTPSA id 8sm37329237pfh.170.2018.01.28.19.17.40 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Sun, 28 Jan 2018 19:17:40 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (1.0)
From: Dino Farinacci <farinacci@gmail.com>
X-Mailer: iPhone Mail (15D60)
In-Reply-To: <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com>
Date: Sun, 28 Jan 2018 19:17:40 -0800
Cc: Padma Pillay-Esnault <padma.ietf@gmail.com>, Albert Cabellos <acabello@ac.upc.edu>, Luigi Iannone <ggx@gigix.net>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <F6D13D9B-7B10-4FE3-A1F8-1EDCEACC4C96@gmail.com>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com> <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com> <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com>
To: Albert Cabellos <albert.cabellos@gmail.com>
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/7g55J1DljIM_Qu_U9kzZOLNlR-o>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 03:17:50 -0000

> On Jan 28, 2018, at 5:57 PM, Albert Cabellos <albert.cabellos@gmail.com> w=
rote:
>=20
> G.- Move sections 16 (Mobility Considerations), 17 (xTR Placement Consider=
ations), 18 (Traceroute Consideration) to a new OAM document

For the record I don=E2=80=99t support this. It will slow down the process w=
hile the benefit won=E2=80=99t be worth the cost of an additional document I=
MO.=20

Dino=


From nobody Mon Jan 29 04:21:47 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 8148912EAE3 for <lisp@ietfa.amsl.com>; Mon, 29 Jan 2018 04:21:45 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.9
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id IxR-N5PCcRYB for <lisp@ietfa.amsl.com>; Mon, 29 Jan 2018 04:21:39 -0800 (PST)
Received: from mail-wr0-x22a.google.com (mail-wr0-x22a.google.com [IPv6:2a00:1450:400c:c0c::22a]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id B08E0131825 for <lisp@ietf.org>; Mon, 29 Jan 2018 04:20:51 -0800 (PST)
Received: by mail-wr0-x22a.google.com with SMTP id v31so6960074wrc.11 for <lisp@ietf.org>; Mon, 29 Jan 2018 04:20:51 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=n/lwCj0s4XPgP8wKAGtMZzRyCN7Gp5wDR5HnfiM23UU=; b=lOKEaKvtSRupCYXlz+DXPgc19aPL5oLbMlDs5rLTR2hbY1kERyYTFciM3X+4C2u3CM IbTNiJIheXjKPAj0/GmSzisPJkVsgZQCGbLrZ1ofvuwBfeyUMYt46jtvOCVOpHzK3+K2 5oZ3lio26YW6moykle+SgcL79EZJpHx1JGIZvUzLXOIyrDWqh5IUXgaNP4ef895dLyGA jcOlAeGk0cIZ9Ccp4TG+7rUELbjZ7/qGX0LQcs4DzCb2rVN5ksq9A3QldASVNqkzZZ/g 7U0aoL/i7pQmDue4JJreQd7CF5EwPVZ21IkpVYMfK3vy79cUx9wjd0V8zBjgSO/Z9sZq lMGQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=n/lwCj0s4XPgP8wKAGtMZzRyCN7Gp5wDR5HnfiM23UU=; b=lt1icnv8jiBEfeqfYzWD3tOhc3+S3mHNKYG+t03C80/iIKoIfSTs3Wm+uLQwJcOYCr mRYPNhx1etZ9NhdKy+iMVqZy5xelZUPGYaj2XSl9YGTLnw3rg+zOMzRkpQDeuw72QhTD 7mEpAiApB2EcQ/vfAJG71WGiNhHjwqaHYH+vUM+aTrhtm9iYzMNxHF+04iXaznZGHD3h cUmx8o9gzB2hvZEBOJXB6OMP3Y3Yh30UsjvpY+/zljHq8xLAMhAgTniX/0D4nj9s1M7f dcKeorr3c4J22KST9IPgn+SL+rz/pciyO2Pm1MIFxfTJlsITJulpyGht6BAILeS/BeIS pYPA==
X-Gm-Message-State: AKwxyte0oaAJgbdmsKsbfjdjrI3BmdArLpG3Cgd3+k1IOqdXc7/Ihf8q yFGseWpgzyXqI7DuznySa64FQQ==
X-Google-Smtp-Source: AH8x224tEbjL6CLXR1wuKZLQMeQC+M67G/bRsea5mCIlsorns5TQ2eQfRw68j8dS457ZglzZrTXPIA==
X-Received: by 10.223.144.198 with SMTP id i64mr3997612wri.6.1517228450058; Mon, 29 Jan 2018 04:20:50 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:f979:e58f:32c7:361c? ([2001:660:330f:a4:f979:e58f:32c7:361c]) by smtp.gmail.com with ESMTPSA id i1sm12157905wrh.96.2018.01.29.04.20.48 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 29 Jan 2018 04:20:48 -0800 (PST)
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <73829a96-aa11-066b-b5a0-2a6d6721c76b@joelhalpern.com>
Date: Mon, 29 Jan 2018 13:21:15 +0100
Cc: Dino Farinacci <farinacci@gmail.com>, Albert Cabellos <albert.cabellos@gmail.com>, "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <3E2EFFE2-7F5E-4212-87C9-33AE8D9DAB8F@gigix.net>
References: <CAGE_Qex--1pS5ivDmSZXVXLsFRgO+a9F32YmJL_dO7h4+4QMCA@mail.gmail.com> <EE6A9B4D-5852-40B6-A780-2FF6B574C62B@gmail.com> <E1C72747-5AB4-455A-A478-21771CE29A92@gigix.net> <545E1F14-2386-47CF-9337-E1FF1354CD03@gmail.com> <CAG-CQxp9kBOiOLvS4Wy93ezF5t4GQfqaurCj+aw+f=7Wjvc_uw@mail.gmail.com> <2893FDD0-35A6-4D41-90B6-3E794BEFE421@gmail.com> <CAGE_QexRF4fKwLRsP5n6HQiQgM=HqFauuYn_=eT_mB8E42p2ow@mail.gmail.com> <784FC076-8BA8-42E4-9891-2685A3DE40F5@gmail.com> <73829a96-aa11-066b-b5a0-2a6d6721c76b@joelhalpern.com>
To: "Joel M. Halpern" <jmh@joelhalpern.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/gu6dVIipWIuLzdctIXg0lCradjs>
Subject: Re: [lisp] Confirm/Deny changes on draft 6830bis
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 12:21:45 -0000

> On 29 Jan 2018, at 04:17, Joel M. Halpern <jmh@joelhalpern.com> wrote:
>=20
> Assuming Luigi agrees, there should be a version of this dcoument =
submitted that incorporates what Dino did for A and C, and addresses D - =
G.

Yes, that works for me.

Thanks

Ciao

L.


From nobody Mon Jan 29 04:28:42 2018
Return-Path: <ggx@gigix.net>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 62A1112EAE4 for <lisp@ietfa.amsl.com>; Mon, 29 Jan 2018 04:28:41 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.901
X-Spam-Level: 
X-Spam-Status: No, score=-1.901 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=gigix-net.20150623.gappssmtp.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id iE1X1KdsUXOZ for <lisp@ietfa.amsl.com>; Mon, 29 Jan 2018 04:28:39 -0800 (PST)
Received: from mail-wr0-x232.google.com (mail-wr0-x232.google.com [IPv6:2a00:1450:400c:c0c::232]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 5EB1B12EAAB for <lisp@ietf.org>; Mon, 29 Jan 2018 04:28:39 -0800 (PST)
Received: by mail-wr0-x232.google.com with SMTP id i56so6983047wra.7 for <lisp@ietf.org>; Mon, 29 Jan 2018 04:28:39 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gigix-net.20150623.gappssmtp.com; s=20150623; h=mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=ciiHn3zpWh7RyTcxnV4BMPgDF/8kR6vM4tYJPy6UGIc=; b=W0KH9asWDoV0o711ZyQ1bvLB0DLJ+D9v8utaNqUaULYVIoYOkXQGHQt6+C+x3iIcIe g+ikJDmmv6KCjHQp96VSZ/6oPL7u3cyi9DBtCXWOJiWk1X855tfKTvLvLLX/9vCheoAt 92ENrnR3t/CpNjCqur+ueQ5T9rAF4MaoIRAs9xuBkGMmMzxsBhH3C1o5EkkfKW+v/2hS YjSFOnsei6W+A+Uof1ehut9DPlxW+1cu2T2H2XeWx2jpP1bh42v6LRVLBR/QhYvS0uv4 heDh9AdaxMEIL8DpuNLTWvcbZ9m9UV3fSo61KZBcDNRlD21Bp2QZDlD8uKsU9eTKq8E5 N0Fg==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:subject:from:in-reply-to:date:cc :content-transfer-encoding:message-id:references:to; bh=ciiHn3zpWh7RyTcxnV4BMPgDF/8kR6vM4tYJPy6UGIc=; b=meCs0bG7TUKxY8IjW2vAFtUKr9ug8JGPJqMoxZ0tqLYhf5NvDQsBLFm3FQrcWJjLJc 4aCCgwpkEVE56wfljXD/wEncZWLfwHbM98kjw+1q8TRVX1Dduvy+1IUxm/OLwZSJwkHc UyZsyg6f1XJTwqD+5tf4WxztXnATCJ9pOid33SIxCUmdceQ/9Cu0yEbPalVB37dwJdm9 Fk7j4cqX9HlNKFgyECd7NoELDyB3Wthio2LIrlJlIyzPex8XFe4zrxTjQWHr+Xxk2fNi 41r4Z+Ki5P6gjkvW3XiRkCFLht1HfZE5uLQfMw9wfbQNLeT7Bz3o9yU6WOhZuwClHfuL P3wg==
X-Gm-Message-State: AKwxytc6KrXb+8b3315W4Tg6Wktu9UTNqHutQY3MjoJeVEsTq/GXPS7d 80YBVSNOgvFHdncesRJHsOexOw==
X-Google-Smtp-Source: AH8x224SvKBBezBwX1JamXROEX8Mp5uvkNd8l/wuFgOECHbSD/WhsOweqlxuPiV86AjsGMMVrq+hAA==
X-Received: by 10.223.170.11 with SMTP id p11mr18765972wrd.26.1517228917776; Mon, 29 Jan 2018 04:28:37 -0800 (PST)
Received: from ?IPv6:2001:660:330f:a4:f979:e58f:32c7:361c? ([2001:660:330f:a4:f979:e58f:32c7:361c]) by smtp.gmail.com with ESMTPSA id l92sm19723845wrc.31.2018.01.29.04.28.36 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 29 Jan 2018 04:28:36 -0800 (PST)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 11.2 \(3445.5.20\))
From: Luigi Iannone <ggx@gigix.net>
In-Reply-To: <56E6CB70-E784-42A8-9166-5564796D40C2@gmail.com>
Date: Mon, 29 Jan 2018 13:29:03 +0100
Cc: "lisp@ietf.org list" <lisp@ietf.org>, lisp-chairs@tools.ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <D8D02BF9-80B0-4671-A67F-E74CD3D2D7B2@gigix.net>
References: <B46B68D9-21F9-4A34-9B41-6C30B7CDD053@gigix.net> <56E6CB70-E784-42A8-9166-5564796D40C2@gmail.com>
To: Dino Farinacci <farinacci@gmail.com>
X-Mailer: Apple Mail (2.3445.5.20)
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/hU1bLwVCRNPnqm_oOURoYhYRPxU>
Subject: Re: [lisp] Review 6830bis -08/-09
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 29 Jan 2018 12:28:41 -0000

Hi Dino,


> On 26 Jan 2018, at 19:31, Dino Farinacci <farinacci@gmail.com> wrote:
>>=20
>> The fact that (P)ITRs use this mechanism does make it a data-plane =
mechanism. is the LISP control plane running on (P)ITRs that does it, =
using control plane messages.
>>>   RLOC-Probing is a method that an ITR or PITR can use to determine =
the
>>>   reachability status of one or more Locators that it has cached in =
a
>>>   Map-Cache entry.  The probe-bit of the Map-Request and Map-Reply
>>>   messages is used for RLOC-Probing.
>=20
> No one said PITRs are special or different than ITRs in this regard. =
For both, they use the control plane messages to determine reachabiltity =
for RLOCs that THE DATA-PLANE encapsulates to.

May be I did not express clearly. I did not suggest that PITR and ITR =
are different in RLOC probing.

> The data-plane operation decides based on packet counter, RTT, TTL and =
other mechanisms if the RLOC is of quality for use.
>=20
> Any other entity that doesn=E2=80=99t do packet forwarding that does =
mapping system lookups doesn=E2=80=99t consider these things. Hence, why =
this issue of the control-plane needs to be described in the document =
related to packet forwarding.
>=20

Two quick comments:

1. The first sentence of the second paragraph of the RLOC Probing =
section clearly states that RLOC probing is a control plane mechanism =
based on a time.

2. RLOC Probing can be done by anybody, not only ITRs and PITRs. Any =
other entity can check RLOCs to make sure they are alive. As such better =
put the text in 6833bis.

Ciao

L.
=20
     =20=


From nobody Wed Jan 31 09:23:25 2018
Return-Path: <chi-dung.phung@lip6.fr>
X-Original-To: lisp@ietfa.amsl.com
Delivered-To: lisp@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 0D95612DB70 for <lisp@ietfa.amsl.com>; Wed, 31 Jan 2018 09:23:24 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.909
X-Spam-Level: 
X-Spam-Status: No, score=-1.909 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 00e-yhwqyO6p for <lisp@ietfa.amsl.com>; Wed, 31 Jan 2018 09:23:22 -0800 (PST)
Received: from osiris.lip6.fr (osiris.lip6.fr [132.227.60.30]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id B69FA12DA4A for <lisp@ietf.org>; Wed, 31 Jan 2018 09:23:21 -0800 (PST)
Received: from tibre.lip6.fr (tibre.lip6.fr [132.227.74.2]) by osiris.lip6.fr (8.15.2/lip6) with ESMTP id w0VHNIiK022639 for <lisp@ietf.org>; Wed, 31 Jan 2018 18:23:18 +0100 (CET)
X-pt: osiris.lip6.fr
Received: from portablephung3.wifi.rsr.lip6.fr (portablephung3.wifi [132.227.79.178]) (authenticated bits=0) by tibre.lip6.fr (8.15.1/8.14.7) with ESMTPSA id w0VHNHZr011094 (version=TLSv1.2 cipher=DHE-RSA-AES128-SHA bits=128 verify=NO) for <lisp@ietf.org>; Wed, 31 Jan 2018 18:23:18 +0100 (MET)
To: lisp@ietf.org
From: Chi Dung PHUNG <chi-dung.phung@lip6.fr>
Message-ID: <0583a6e1-46cf-21e4-e729-4d232218363b@lip6.fr>
Date: Wed, 31 Jan 2018 18:23:18 +0100
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.13; rv:52.0) Gecko/20100101 Thunderbird/52.5.2
MIME-Version: 1.0
Content-Type: multipart/alternative; boundary="------------B6964F29BD3C4CB78E2579CF"
Content-Language: en-US
X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-4.4.3 (osiris.lip6.fr [132.227.60.30]); Wed, 31 Jan 2018 18:23:18 +0100 (CET)
X-Scanned-By: MIMEDefang 2.78 on 132.227.60.30
Archived-At: <https://mailarchive.ietf.org/arch/msg/lisp/gmrjXGitg5N9icOsATU0qeYdK0A>
Subject: [lisp] LISP MSX
X-BeenThere: lisp@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: List for the discussion of the Locator/ID Separation Protocol <lisp.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lisp>, <mailto:lisp-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lisp/>
List-Post: <mailto:lisp@ietf.org>
List-Help: <mailto:lisp-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lisp>, <mailto:lisp-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 31 Jan 2018 17:23:24 -0000

This is a multi-part message in MIME format.
--------------B6964F29BD3C4CB78E2579CF
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit

Hello all,

The LISP-Lab consortium (http://www.lisp-lab.org) worked in the last few 
years to a novel solution for the interconnection of multiple 
independent mapping systems. We have posted a video tutorial that 
provides a description of the proposal, with motivations and technical 
demonstration of the major bricks:

http://www.lisp-lab.org/msx

Comments are welcome.

Thanks,
PCD.

--------------B6964F29BD3C4CB78E2579CF
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: 7bit

<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=utf-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    <pre style="background-color: rgb(255, 255, 255); margin: 0em;" class="">Hello all,

</pre>
    <tt style="background-color: rgb(255, 255, 255);" class="">The
      LISP-Lab consortium </tt><tt style="background-color: rgb(255,
      255, 255);" class=""><tt style="background-color: rgb(255, 255,
        255);" class="">(<a class="moz-txt-link-freetext"
          href="http://www.lisp-lab.org">http://www.lisp-lab.org</a>) </tt>worked
      in the last few years to a novel solution for the interconnection
      of multiple independent mapping systems. We have posted a video
      tutorial that provides a description of the proposal, with
      motivations and technical demonstration of the major bricks:<br
        class="">
      <br class="">
      <a class="moz-txt-link-freetext"
        href="http://www.lisp-lab.org/msx">http://www.lisp-lab.org/msx</a><br
        class="">
      <br class="">
    </tt><span style="background-color: rgb(255, 255, 255);" class="">Comments
      are welcome.</span>
    <div class=""><br style="background-color: rgb(255, 255, 255);"
        class="">
      <tt style="background-color: rgb(255, 255, 255);" class="">Thanks,<br
          class="">
        PCD.</tt></div>
  </body>
</html>

--------------B6964F29BD3C4CB78E2579CF--

