LISP Predictive RLOCs
draft-ietf-lisp-predictive-rlocs-07
Network Working Group D. Farinacci
Internet-Draft lispers.net
Intended status: Experimental P. Pillay-Esnault
Expires: May 6, 2021 Independent
November 2, 2020
LISP Predictive RLOCs
draft-ietf-lisp-predictive-rlocs-07
Abstract
This specification describes a method to achieve near-zero packet
loss when an EID is roaming quickly across RLOCs.
Requirements Language
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].
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 May 6, 2021.
Copyright Notice
Copyright (c) 2020 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
Farinacci & Pillay-Esnault Expires May 6, 2021 [Page 1]
Internet-Draft LISP Predictive RLOCs November 2020
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 . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Definition of Terms . . . . . . . . . . . . . . . . . . . . . 3
3. Overview . . . . . . . . . . . . . . . . . . . . . . . . . . 3
4. Design Details . . . . . . . . . . . . . . . . . . . . . . . 5
4.1. RLE Encoding . . . . . . . . . . . . . . . . . . . . . . 6
4.2. Packet Delivery Optimizations . . . . . . . . . . . . . . 7
4.3. Trading Off Replication Cost . . . . . . . . . . . . . . 8
5. Directional Paths with Intersections . . . . . . . . . . . . 9
6. Multicast Considerations . . . . . . . . . . . . . . . . . . 10
7. Multiple Address-Family Considerations . . . . . . . . . . . 11
8. Scaling Considerations . . . . . . . . . . . . . . . . . . . 11
9. Security Considerations . . . . . . . . . . . . . . . . . . . 12
10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 12
11.1. Normative References . . . . . . . . . . . . . . . . . . 12
11.2. Informative References . . . . . . . . . . . . . . . . . 13
Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 14
Appendix B. Document Change Log . . . . . . . . . . . . . . . . 14
B.1. Changes to draft-ietf-lisp-predictive-rlocs-07 . . . . . 14
B.2. Changes to draft-ietf-lisp-predictive-rlocs-06 . . . . . 14
B.3. Changes to draft-ietf-lisp-predictive-rlocs-05 . . . . . 14
B.4. Changes to draft-ietf-lisp-predictive-rlocs-04 . . . . . 14
B.5. Changes to draft-ietf-lisp-predictive-rlocs-03 . . . . . 14
B.6. Changes to draft-ietf-lisp-predictive-rlocs-02 . . . . . 14
B.7. Changes to draft-ietf-lisp-predictive-rlocs-01 . . . . . 15
B.8. Changes to draft-ietf-lisp-predictive-rlocs-00 . . . . . 15
B.9. Changes to draft-farinacci-lisp-predictive-rlocs-02 . . . 15
B.10. Changes to draft-farinacci-lisp-predictive-rlocs-01 . . . 15
B.11. Changes to draft-farinacci-lisp-predictive-rlocs-00 . . . 15
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 15
1. Introduction
The LISP architecture [RFC6830] specifies two namespaces, End-Point
IDs (EIDs) and Routing Locators (RLOCs). An EID identifies a node in
the network and the RLOC indicates the EID's topological location.
When an node roams in the network, its EID remains fixed and
unchanged but the RLOCs associated with it change to reflect its new
topological attachment point. This specification will focus EIDs and
Show full document text