draft-ietf-lisp-predictive-rlocs-01.txt   draft-ietf-lisp-predictive-rlocs-02.txt 
Network Working Group D. Farinacci Network Working Group D. Farinacci
Internet-Draft lispers.net Internet-Draft lispers.net
Intended status: Experimental P. Pillay-Esnault Intended status: Experimental P. Pillay-Esnault
Expires: May 31, 2018 Huawei Technologies Expires: November 29, 2018 Huawei Technologies
November 27, 2017 May 28, 2018
LISP Predictive RLOCs LISP Predictive RLOCs
draft-ietf-lisp-predictive-rlocs-01 draft-ietf-lisp-predictive-rlocs-02
Abstract Abstract
This specification will describe a method to achieve near-zero packet This specification describes a method to achieve near-zero packet
loss when an EID is roaming quickly across RLOCs. loss when an EID is roaming quickly across RLOCs.
Requirements Language Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC2119]. document are to be interpreted as described in [RFC2119].
Status of This Memo Status of This Memo
skipping to change at page 1, line 38 skipping to change at page 1, line 38
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on May 31, 2018. This Internet-Draft will expire on November 29, 2018.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2018 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of (https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
skipping to change at page 2, line 26 skipping to change at page 2, line 26
4.2. Packet Delivery Optimizations . . . . . . . . . . . . . . 6 4.2. Packet Delivery Optimizations . . . . . . . . . . . . . . 6
4.3. Trading Off Replication Cost . . . . . . . . . . . . . . 8 4.3. Trading Off Replication Cost . . . . . . . . . . . . . . 8
5. Directional Paths with Intersections . . . . . . . . . . . . 9 5. Directional Paths with Intersections . . . . . . . . . . . . 9
6. Multicast Considerations . . . . . . . . . . . . . . . . . . 10 6. Multicast Considerations . . . . . . . . . . . . . . . . . . 10
7. Multiple Address-Family Considerations . . . . . . . . . . . 11 7. Multiple Address-Family Considerations . . . . . . . . . . . 11
8. Scaling Considerations . . . . . . . . . . . . . . . . . . . 11 8. Scaling Considerations . . . . . . . . . . . . . . . . . . . 11
9. Security Considerations . . . . . . . . . . . . . . . . . . . 12 9. Security Considerations . . . . . . . . . . . . . . . . . . . 12
10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12 10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 12 11. References . . . . . . . . . . . . . . . . . . . . . . . . . 12
11.1. Normative References . . . . . . . . . . . . . . . . . . 12 11.1. Normative References . . . . . . . . . . . . . . . . . . 12
11.2. Informative References . . . . . . . . . . . . . . . . . 12 11.2. Informative References . . . . . . . . . . . . . . . . . 13
Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 13 Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 13
Appendix B. Document Change Log . . . . . . . . . . . . . . . . 13 Appendix B. Document Change Log . . . . . . . . . . . . . . . . 13
B.1. Changes to draft-ietf-lisp-predictive-rlocs-01.txt . . . 13 B.1. Changes to draft-ietf-lisp-predictive-rlocs-02 . . . . . 13
B.2. Changes to draft-ietf-lisp-predictive-rlocs-00.txt . . . 13 B.2. Changes to draft-ietf-lisp-predictive-rlocs-01 . . . . . 13
B.3. Changes to draft-farinacci-lisp-predictive-rlocs-02.txt . 14 B.3. Changes to draft-ietf-lisp-predictive-rlocs-00 . . . . . 14
B.4. Changes to draft-farinacci-lisp-predictive-rlocs-01.txt . 14 B.4. Changes to draft-farinacci-lisp-predictive-rlocs-02 . . . 14
B.5. Changes to draft-farinacci-lisp-predictive-rlocs-00.txt . 14 B.5. Changes to draft-farinacci-lisp-predictive-rlocs-01 . . . 14
B.6. Changes to draft-farinacci-lisp-predictive-rlocs-00 . . . 14
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 14 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 14
1. Introduction 1. Introduction
The LISP architecture [RFC6830] specifies two namespaces, End-Point The LISP architecture [RFC6830] specifies two namespaces, End-Point
IDs (EIDs) and Routing Locators (RLOCs). An EID identifies a node in IDs (EIDs) and Routing Locators (RLOCs). An EID identifies a node in
the network and the RLOC indicates the EID's topological location. the network and the RLOC indicates the EID's topological location.
When an node roams in the network, its EID remains fixed and When an node roams in the network, its EID remains fixed and
unchanged but the RLOCs associated with it change to reflect its new unchanged but the RLOCs associated with it change to reflect its new
topological attachment point. This specification will focus EIDs and topological attachment point. This specification will focus EIDs and
skipping to change at page 9, line 17 skipping to change at page 9, line 17
In addition, to eliminate unnecessary replication to xTRs further In addition, to eliminate unnecessary replication to xTRs further
down a directional path, GEO-prefixes [I-D.farinacci-lisp-geo] can be down a directional path, GEO-prefixes [I-D.farinacci-lisp-geo] can be
used so only nearby xTRs that the roaming-EID is about to come in used so only nearby xTRs that the roaming-EID is about to come in
contact with are the only ones to receive encapsulated packets. contact with are the only ones to receive encapsulated packets.
Even when replication lists are not large, we can reduce the cost of Even when replication lists are not large, we can reduce the cost of
replication that the entire network bears by moving the replicator replication that the entire network bears by moving the replicator
away from the the source (i.e. the ITR) and closer to the RSUs (i.e. away from the the source (i.e. the ITR) and closer to the RSUs (i.e.
the ETRs). See the use of RTRs for Replication Engineering the ETRs). See the use of RTRs for Replication Engineering
techniques in [I-D.ietf-lisp-signal-free-multicast]. techniques in [RFC8378].
5. Directional Paths with Intersections 5. Directional Paths with Intersections
A roaming-EID could be registered to the mapping system with the A roaming-EID could be registered to the mapping system with the
following nested RLE mapping: following nested RLE mapping:
EID = <roaming-EID>, RLOC-records: EID = <roaming-EID>, RLOC-records:
RLOC = (RLE: xTR-A, xTR-B, xTR-C, (RLE: xTR-X, xTR-Y, xTR-Z), RLOC = (RLE: xTR-A, xTR-B, xTR-C, (RLE: xTR-X, xTR-Y, xTR-Z),
(RLE: xTR-I, xTR-J, xTR-K), xTR-D, xTR-E) (RLE: xTR-I, xTR-J, xTR-K), xTR-D, xTR-E)
skipping to change at page 10, line 42 skipping to change at page 10, line 42
RLEs used for forwarding. So if roaming-EID-1 resides at xTR-A and RLEs used for forwarding. So if roaming-EID-1 resides at xTR-A and
roaming-EID-2 resides at xTR-B and the RLE list is (xTR-A, xTR-B, roaming-EID-2 resides at xTR-B and the RLE list is (xTR-A, xTR-B,
xTR-C), and they are joined to the same multicast group, then xTR-C), and they are joined to the same multicast group, then
replication occurs to all of xTR-A, xTR-B, and xTR-C. Even since replication occurs to all of xTR-A, xTR-B, and xTR-C. Even since
roaming-EID-2 is past xTR-A, packets need to be delivered to xTR-A roaming-EID-2 is past xTR-A, packets need to be delivered to xTR-A
for roaming-EID-1. In addition, packets need to be delivered to for roaming-EID-1. In addition, packets need to be delivered to
xTR-C because roaming-EID-1 and roaming-EID-2 will get to xTR-C (and xTR-C because roaming-EID-1 and roaming-EID-2 will get to xTR-C (and
roaming-EID-1 may get there sooner if it is traveling faster than roaming-EID-1 may get there sooner if it is traveling faster than
roaming-EID-2). roaming-EID-2).
When a roaming-EID is a multicast source, procedures from When a roaming-EID is a multicast source, procedures from [RFC8378]
[I-D.ietf-lisp-signal-free-multicast] are used to deliver packets to are used to deliver packets to multicast group members anywhere in
multicast group members anywhere in the network. The solution the network. The solution requires no signaling to the RSUs. When
requires no signaling to the RSUs. When RSUs receive multicast RSUs receive multicast packets from a roaming-EID, they do a
packets from a roaming-EID, they do a (roaming-EID,G) mapping (roaming-EID,G) mapping database lookup to find the replication list
database lookup to find the replication list of ETRs to encapsulate of ETRs to encapsulate to.
to.
7. Multiple Address-Family Considerations 7. Multiple Address-Family Considerations
Note that roaming-EIDs can be assigned IPv6 EID addresses while the Note that roaming-EIDs can be assigned IPv6 EID addresses while the
RSU xTRs could be using IPv4 RLOC addresses. Any combination of RSU xTRs could be using IPv4 RLOC addresses. Any combination of
address-families can be supported as well as for multicast packet address-families can be supported as well as for multicast packet
forwarding, where (S,G) are IPv6 addresses entries and replication is forwarding, where (S,G) are IPv6 addresses entries and replication is
done with IPv4 RLOCs in the outer header. done with IPv4 RLOCs in the outer header.
8. Scaling Considerations 8. Scaling Considerations
skipping to change at page 12, line 44 skipping to change at page 12, line 44
[RFC8060] Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical [RFC8060] Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical
Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060, Address Format (LCAF)", RFC 8060, DOI 10.17487/RFC8060,
February 2017, <https://www.rfc-editor.org/info/rfc8060>. February 2017, <https://www.rfc-editor.org/info/rfc8060>.
[RFC8061] Farinacci, D. and B. Weis, "Locator/ID Separation Protocol [RFC8061] Farinacci, D. and B. Weis, "Locator/ID Separation Protocol
(LISP) Data-Plane Confidentiality", RFC 8061, (LISP) Data-Plane Confidentiality", RFC 8061,
DOI 10.17487/RFC8061, February 2017, DOI 10.17487/RFC8061, February 2017,
<https://www.rfc-editor.org/info/rfc8061>. <https://www.rfc-editor.org/info/rfc8061>.
[RFC8378] Moreno, V. and D. Farinacci, "Signal-Free Locator/ID
Separation Protocol (LISP) Multicast", RFC 8378,
DOI 10.17487/RFC8378, May 2018,
<https://www.rfc-editor.org/info/rfc8378>.
11.2. Informative References 11.2. Informative References
[I-D.farinacci-lisp-geo] [I-D.farinacci-lisp-geo]
Farinacci, D., "LISP Geo-Coordinate Use-Cases", draft- Farinacci, D., "LISP Geo-Coordinate Use-Cases", draft-
farinacci-lisp-geo-04 (work in progress), October 2017. farinacci-lisp-geo-05 (work in progress), April 2018.
[I-D.ietf-lisp-eid-anonymity] [I-D.ietf-lisp-eid-anonymity]
Farinacci, D., Pillay-Esnault, P., and W. Haddad, "LISP Farinacci, D., Pillay-Esnault, P., and W. Haddad, "LISP
EID Anonymity", draft-ietf-lisp-eid-anonymity-01 (work in EID Anonymity", draft-ietf-lisp-eid-anonymity-02 (work in
progress), October 2017. progress), April 2018.
[I-D.ietf-lisp-eid-mobility] [I-D.ietf-lisp-eid-mobility]
Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino, Portoles-Comeras, M., Ashtaputre, V., Moreno, V., Maino,
F., and D. Farinacci, "LISP L2/L3 EID Mobility Using a F., and D. Farinacci, "LISP L2/L3 EID Mobility Using a
Unified Control Plane", draft-ietf-lisp-eid-mobility-01 Unified Control Plane", draft-ietf-lisp-eid-mobility-02
(work in progress), November 2017. (work in progress), May 2018.
[I-D.ietf-lisp-sec] [I-D.ietf-lisp-sec]
Maino, F., Ermagan, V., Cabellos-Aparicio, A., and D. Maino, F., Ermagan, V., Cabellos-Aparicio, A., and D.
Saucez, "LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-14 Saucez, "LISP-Security (LISP-SEC)", draft-ietf-lisp-sec-15
(work in progress), October 2017. (work in progress), April 2018.
[I-D.ietf-lisp-signal-free-multicast]
Moreno, V. and D. Farinacci, "Signal-Free LISP Multicast",
draft-ietf-lisp-signal-free-multicast-06 (work in
progress), August 2017.
Appendix A. Acknowledgments Appendix A. Acknowledgments
The author would like to thank the LISP WG for their review and The author would like to thank the LISP WG for their review and
acceptance of this draft. acceptance of this draft.
Appendix B. Document Change Log Appendix B. Document Change Log
[RFC Editor: Please delete this section on publication as RFC.] [RFC Editor: Please delete this section on publication as RFC.]
B.1. Changes to draft-ietf-lisp-predictive-rlocs-01.txt B.1. Changes to draft-ietf-lisp-predictive-rlocs-02
o Posted May 2018.
o Update document timer and references.
B.2. Changes to draft-ietf-lisp-predictive-rlocs-01
o Posted November 2017. o Posted November 2017.
o Update document timer and references. o Update document timer and references.
o Reflect comments from Prague meeting presentation. There is no o Reflect comments from Prague meeting presentation. There is no
need for "RLE Usage Types" as suggested. The ITR can treat what need for "RLE Usage Types" as suggested. The ITR can treat what
RLOCs it replicates to as a local matter via implementation RLOCs it replicates to as a local matter via implementation
configuration. RLE Directional is default. Circular rotation, configuration. RLE Directional is default. Circular rotation,
back-n-forth, and random selection of RLOCs is up to the ITR. back-n-forth, and random selection of RLOCs is up to the ITR.
B.2. Changes to draft-ietf-lisp-predictive-rlocs-00.txt B.3. Changes to draft-ietf-lisp-predictive-rlocs-00
o Posted June 2017. o Posted June 2017.
o Make this specification a working group document. It is a copy of o Make this specification a working group document. It is a copy of
draft-farinacci-lisp-predictive-rlocs-02. draft-farinacci-lisp-predictive-rlocs-02.
B.3. Changes to draft-farinacci-lisp-predictive-rlocs-02.txt B.4. Changes to draft-farinacci-lisp-predictive-rlocs-02
o Posted May 2017 to update document timer. o Posted May 2017 to update document timer.
B.4. Changes to draft-farinacci-lisp-predictive-rlocs-01.txt B.5. Changes to draft-farinacci-lisp-predictive-rlocs-01
o Posted November 2016 to update document timer. o Posted November 2016 to update document timer.
B.5. Changes to draft-farinacci-lisp-predictive-rlocs-00.txt B.6. Changes to draft-farinacci-lisp-predictive-rlocs-00
o Initial post April 2016. o Initial post April 2016.
Authors' Addresses Authors' Addresses
Dino Farinacci Dino Farinacci
lispers.net lispers.net
San Jose, CA San Jose, CA
USA USA
 End of changes. 19 change blocks. 
37 lines changed or deleted 43 lines changed or added

This html diff was produced by rfcdiff 1.46. The latest version is available from http://tools.ietf.org/tools/rfcdiff/