The Locator/ID Separation Protocol (LISP)
draft-ietf-lisp-rfc6830bis-03
Network Working Group D. Farinacci
Internet-Draft V. Fuller
Intended status: Standards Track D. Meyer
Expires: November 3, 2017 D. Lewis
Cisco Systems
A. Cabellos (Ed.)
UPC/BarcelonaTech
May 2, 2017
The Locator/ID Separation Protocol (LISP)
draft-ietf-lisp-rfc6830bis-03
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. The
map-cache is populated by the LISP Control-Plane protocol
[I-D.ietf-lisp-rfc6833bis].
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 http://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 November 3, 2017.
Farinacci, et al. Expires November 3, 2017 [Page 1]
Internet-Draft LISP May 2017
Copyright Notice
Copyright (c) 2017 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
(http://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 . . . . . . . . . . . . . . . . . . . . . . . 9
4.1. Packet Flow Sequence . . . . . . . . . . . . . . . . . . 11
5. LISP Encapsulation Details . . . . . . . . . . . . . . . . . 13
5.1. LISP IPv4-in-IPv4 Header Format . . . . . . . . . . . . . 14
5.2. LISP IPv6-in-IPv6 Header Format . . . . . . . . . . . . . 15
5.3. Tunnel Header Field Descriptions . . . . . . . . . . . . 16
6. LISP EID-to-RLOC Map-Cache . . . . . . . . . . . . . . . . . 20
7. Dealing with Large Encapsulated Packets . . . . . . . . . . . 20
7.1. A Stateless Solution to MTU Handling . . . . . . . . . . 21
7.2. A Stateful Solution to MTU Handling . . . . . . . . . . . 22
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 . . . . . . . . . . . . . . . . . . . 30
13. Changing the Contents of EID-to-RLOC Mappings . . . . . . . . 31
13.1. Clock Sweep . . . . . . . . . . . . . . . . . . . . . . 32
13.2. Solicit-Map-Request (SMR) . . . . . . . . . . . . . . . 32
13.3. Database Map-Versioning . . . . . . . . . . . . . . . . 34
14. Multicast Considerations . . . . . . . . . . . . . . . . . . 34
Show full document text