Re: [lisp] 6830bis Review

[Dino Farinacci <[e-mail]>]

I will comment here before providing a new update and response to Luigi’s latest email.

> On Dec 26, 2017, at 5:48 PM, Albert Cabellos <[e-mail]> wrote:
> 
> Hi
> 
> Thanks for the review, please find my comments inline.
> 
> I have removed all the comments for which I **agree**:
> 
> >
> >   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 global Internet.  Traditionally, IP multihoming has been
> >      implemented by each multihomed site acquiring its own globally
> >      visible prefix.  LISP uses only topologically assigned and
> >      aggregatable address blocks for RLOCs, eliminating this
> >      demonstrably non-scalable practice.
> >
> > Last sentence to be deleted is a relic of scalability discussion.
> >
> >
> 
> Agreed. I suggest deleting entirely the definitions for both PA and PI, they are not used throughout the document.

Note, we still care about scalability of any underlay, especially the Internet core, so we should leave this in. Note, we ARE still solving the scalability problem.

I don’t know why any of you would think differently.

> 
> [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.

I have planned to remove the sentence.

> 
> [snip]
> >
> >   Re-encapsulating Tunneling in RTRs:   Re-encapsulating Tunneling
> >
> > RTR have never been defined.
> 
> 
> Agree, they are defined in LISP-TE, not sure about the rules here. They are used in section 17.

No, it is used in this document. Others have made a comment that we referneced it but didn’t define it. RTRs were created BEFORE the LISP-TE draft was written.

> 

> 
> >
> > 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.

I had planned to take Luigi’s 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.

> >
> > 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.
> 
> Actually we should merge this section with 'Routing Locator Hashing’

I disagree with you guys. Who do you think punts packets when there is a map-cache miss? The data-plane. Note there are many users of the control-plane, an SDN controller, many data-planes, and lig/rig. How they each use the control-plane is documented in their own documents.

And please do not suggest that lig/rig usage of the control plane move to 6833bis.

> 
> 
> > We need to cite the threats document because of the security issues of LSB.
> 
> What about this:
> 
> 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. *****There are security risks associated to the use of Locator-Status-Bits, we recommend to follow the guidelines described in [THREATS]******

This has been fixed in the last revision.

> 
> >
> > 12.  Routing Locator Hashing
> >
> >   When an ETR provides an EID-to-RLOC mapping in a Map-Reply message to
> >   a requesting ITR, the Locator-Set for the EID-Prefix may contain
> >   different Priority 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 above paragraph should not state where the mapping comes from, from the data plane perspective it comes from the cache.
> >
> > Also where is weight???????
> 
> 
> What about:
> 
> When an ITR encapsulates packets it may found that corresponding map-cache entry contains a Locator-Set with different priorities and weights, 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:

Was the last revision not sufficient Albert?

Dino